I’m going to attend NetSciX 2020 in Tokyo, to present joint work with Mark Newman and George Cantwell. We have developed a method to automatically and efficiently infer the structure of a network from noisy pairwise observations — we will post an accompanying paper at some point in the future. A proceedings in which I appear as a co-author has also been accepted. It is titled “Connected graphs with a given degree sequence: efficient sampling, correlations, community detection and robustness”, and it is joint work with John Ring and Laurent Hébert-Dufresne. Come and see us!