{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:52Z","timestamp":1773376672186,"version":"3.50.1"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206932","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2499-2504","source":"Crossref","is-referenced-by-count":9,"title":["Matching Correlated Inhomogeneous Random Graphs using the k-core Estimator"],"prefix":"10.1109","author":[{"given":"Mikl\u00f3s Z.","family":"R\u00e1cz","sequence":"first","affiliation":[{"name":"Northwestern University,Department of Statistics and Data Science Department of Computer Science,Evanston,IL"}]},{"given":"Anirudh","family":"Sridhar","sequence":"additional","affiliation":[{"name":"Princeton University,Department of Electrical and Computer Engineering,Princeton,NJ"}]}],"member":"263","reference":[{"key":"ref13","first-page":"1633","article-title":"From tree matching to sparse graph alignment","author":"ganassali","year":"2020","journal-title":"Proceedings of the Thirty Third Conference on Learning Theory (COLT) volume 125 of Proceedings of Machine Learning Research"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref12","author":"frieze","year":"2016","journal-title":"Introduction to Random Graphs"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3169005"},{"key":"ref15","first-page":"2183","article-title":"Exact community recovery in correlated stochastic block models","author":"gaudio","year":"2022","journal-title":"Proceedings of Thirty Fifth Conference on Learning Theory (COLT) volume 178 of Proceedings of Machine Learning Research"},{"key":"ref14","first-page":"2080","article-title":"Impossibility of Partial Recovery in the Graph Alignment Problem","author":"ganassali","year":"2021","journal-title":"Conference on Learning Theory"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3410220.3460098"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206932"},{"key":"ref11","first-page":"2985","article-title":"Spectral graph matching and regularized quadratic relaxations: Algorithm and theory","author":"fan","year":"2020","journal-title":"Proceedings of the 37th International Conference on Machine Learning (ICML) volume 119 of Proceedings of Machine Learning Research"},{"key":"ref33","first-page":"3441","article-title":"Random graph matching in geometric models: the case of complete graphs","author":"wang","year":"2022","journal-title":"Proceedings of Thirty Fifth Conference on Learning Theory (COLT) volume 178 of Proceedings of Machine Learning Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-020-00997-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056280"},{"key":"ref2","first-page":"9190","article-title":"(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs","author":"barak","year":"2019","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref1","first-page":"6446","article-title":"Community detection and stochastic block models: recent developments","volume":"18","author":"abbe","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref16","article-title":"Partial Recovery in the Graph Alignment Problem","author":"hall","year":"2020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"ref24","article-title":"Random graph matching at Otter’s threshold via counting chandeliers","author":"mao","year":"2022"},{"key":"ref23","first-page":"3296","article-title":"Random Graph Matching with Improved Noise Robustness","author":"mao","year":"2021","journal-title":"Proceedings of the 34th Conference on Learning Theory (COLT)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869137"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.62"},{"key":"ref20","article-title":"Phase transition in noisy high-dimensional random geometric graphs","author":"liu","year":"2021"},{"key":"ref22","article-title":"Exact matching of random graphs with constant correlation","author":"mao","year":"2021"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(91)90162-U","article-title":"Size and connectivity of the k-core of a random graph","volume":"91","author":"?uczak","year":"1991","journal-title":"Discrete Mathematics"},{"key":"ref28","article-title":"Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities","author":"r\u00e1cz","year":"2021","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/21-AAP1703"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3410048.3410106"},{"key":"ref7","article-title":"Exact alignment recovery for correlated Erd?s-Rényi graphs","author":"cullina","year":"2018"},{"key":"ref9","article-title":"Matching recovery threshold for correlated random graphs","author":"ding","year":"2022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2553843"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_17"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/2964791.2901460","article-title":"Improved Achievability and Converse Bounds for Erd?s-Rényi Graph Matching","volume":"44","author":"cullina","year":"2016","journal-title":"ACM SIGMETRICS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206932.pdf?arnumber=10206932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:32Z","timestamp":1773347252000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206932","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}