{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:32Z","timestamp":1773377552872,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":["IIS-1838124,CCF-1850743,CCF-1856424,CCF-1900507"],"award-info":[{"award-number":["IIS-1838124,CCF-1850743,CCF-1856424,CCF-1900507"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518266","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2714-2719","source":"Crossref","is-referenced-by-count":9,"title":["Settling the Sharp Reconstruction Thresholds of Random Graph Matching"],"prefix":"10.1109","author":[{"given":"Yihong","family":"Wu","sequence":"first","affiliation":[{"name":"Yale University,Department of Statistics and Data Science,New Haven,CT,USA,06511"}]},{"given":"Jiaming","family":"Xu","sequence":"additional","affiliation":[{"name":"The Fuqua School of Business, Duke University,Durham,NC,USA,27708"}]},{"given":"Sophie H.","family":"Yu","sequence":"additional","affiliation":[{"name":"The Fuqua School of Business, Duke University,Durham,NC,USA,27708"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref11","first-page":"1","article-title":"Efficient random graph matching via degree profiles","author":"ding","year":"2020","journal-title":"Probability Theory and Related Fields"},{"key":"ref12","first-page":"9186","article-title":"(Nearly) efficient algorithms for the graph matching problem on correlated random graphs","author":"barak","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref13","article-title":"Spectral graph matching and regularized quadratic relaxations I: The Gaussian model","author":"fan","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref14","article-title":"Spectral graph matching and regularized quadratic relaxations II: Erd?s-Rényi graphs and universality","author":"fan","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref15","first-page":"1633","article-title":"From tree matching to sparse graph alignment","author":"ganassali","year":"2020","journal-title":"Conference on Learning Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref17","first-page":"2652","article-title":"The all-or-nothing phenomenon in sparse linear regression","author":"reeves","year":"2019","journal-title":"Conference on Learning Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844072"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030457"},{"key":"ref4","volume":"16","author":"pardalos","year":"1993","journal-title":"Quadratic Assignment and Related Problems DIMACS Workshop"},{"key":"ref3","article-title":"Testing correlation of unlabeled random graphs","author":"wu","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3366702","article-title":"Partial recovery of Erd?s-Rényi graph alignment via k-core alignment","volume":"3","author":"cullina","year":"0","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"ref8","article-title":"Sharp threshold for alignment of graph databases with gaussian weights","author":"ganassali","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref7","article-title":"Partial recovery in the graph alignment problem","author":"hall","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref2","article-title":"Exact alignment recovery for correlated Erd?s-Rényi graphs","author":"cullina","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref9","article-title":"Spectral alignment of networks","author":"feizi","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaw017"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518266.pdf?arnumber=9518266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:21Z","timestamp":1773347661000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518266","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}