{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T18:11:36Z","timestamp":1775844696079,"version":"3.50.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1900507"],"award-info":[{"award-number":["CCF-1900507"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1838124"],"award-info":[{"award-number":["IIS-1838124"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1850743"],"award-info":[{"award-number":["CCF-1850743"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1856424"],"award-info":[{"award-number":["CCF-1856424"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-1651588"],"award-info":[{"award-number":["CCF-1651588"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["CCF-2144593"],"award-info":[{"award-number":["CCF-2144593"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Alfred Sloan Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tit.2022.3169005","type":"journal-article","created":{"date-parts":[[2022,4,20]],"date-time":"2022-04-20T19:36:18Z","timestamp":1650483378000},"page":"5391-5417","source":"Crossref","is-referenced-by-count":47,"title":["Settling the Sharp Reconstruction Thresholds of Random Graph Matching"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9239-7671","authenticated-orcid":false,"given":"Yihong","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Statistics and Data Science, Yale University, New Haven, CT, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6104-4742","authenticated-orcid":false,"given":"Jiaming","family":"Xu","sequence":"additional","affiliation":[{"name":"The Fuqua School of Business, Durham, NC, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4484-7468","authenticated-orcid":false,"given":"Sophie H.","family":"Yu","sequence":"additional","affiliation":[{"name":"The Fuqua School of Business, Durham, NC, USA"}]}],"member":"263","reference":[{"key":"ref1","first-page":"9186","article-title":"(Nearly) efficient algorithms for the graph matching problem on correlated random graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Barak"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"ref3","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"1982"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref5","article-title":"Exact alignment recovery for correlated Erd\u0151s-R\u00e9nyi graphs","author":"Cullina","year":"2017","journal-title":"arXiv:1711.06783"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3366702"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaw017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-020-00997-4"},{"key":"ref9","article-title":"Spectral graph matching and regularized quadratic relaxations I: The Gaussian model","author":"Fan","year":"2019","journal-title":"arXiv:1907.08880"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-022-09575-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2913233"},{"key":"ref12","first-page":"1","article-title":"Sharp threshold for alignment of graph databases with Gaussian weights","volume-title":"Proc. 22nd Annu. Conf. Math. Sci. Mach. Learn.","volume":"145","author":"Ganassali"},{"key":"ref13","first-page":"1633","article-title":"From tree matching to sparse graph alignment","volume-title":"Proc. Conf. Learn. Theory","author":"Ganassali"},{"key":"ref14","first-page":"2080","article-title":"Impossibility of partial recovery in the graph alignment problem","volume-title":"Proc. Conf. Learn. Theory","author":"Ganassali"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844072"},{"key":"ref16","article-title":"Partial recovery in the graph alignment problem","author":"Hall","year":"2020","journal-title":"arXiv:2007.00533"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693335"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2653804"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030457"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v18-2865"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.4171\/msl\/22"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392023"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/22-AAP1786"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9829223\/9760384-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9829223\/09760384.pdf?arnumber=9760384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T20:55:03Z","timestamp":1705956903000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9760384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":26,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3169005","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}