{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:12Z","timestamp":1773376932910,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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 1900636"],"award-info":[{"award-number":["CCF 1900636"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195705","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Exact Random Graph Matching with Multiple Graphs"],"prefix":"10.1109","author":[{"given":"Taha","family":"Ameen","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign,Coordinated Science Laboratory,Department of Electrical and Computer Engineering,Urbana,IL,USA,61801"}]},{"given":"Bruce","family":"Hajek","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign,Coordinated Science Laboratory,Department of Electrical and Computer Engineering,Urbana,IL,USA,61801"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195705"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/sp.2009.22"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1101\/gr.4526006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-016-1395-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11585978_12"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220624"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref12","volume-title":"Exact alignment recovery for correlated Erd\u0151s-R\u00e9nyi graphs","year":"2017"},{"key":"ref13","first-page":"2080","article-title":"Impossibility of partial recovery in the graph alignment problem","volume-title":"Conference on Learning Theory","author":"Ganassali"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.2355"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3169005"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/23-AOS2305"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-022-09575-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-020-00997-4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3341617.3326151"},{"key":"ref20","first-page":"3296","article-title":"Random graph matching with improved noise robustness","volume-title":"Conference on Learning Theory","author":"Mao"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-022-01184-3"},{"key":"ref22","article-title":"(Nearly) efficient algorithms for the graph matching problem on correlated random graphs","volume":"32","author":"Barak","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585156"},{"key":"ref24","volume-title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","author":"Ding","year":"2023"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3366702"},{"key":"ref26","first-page":"2183","article-title":"Exact community recovery in correlated stochastic block models","volume-title":"Conference on Learning Theory","author":"Gaudio"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206932"},{"key":"ref28","volume-title":"Robust graph matching when nodes are corrupt","author":"Ameen","year":"2023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF53345.2021.9723092"},{"issue":"22","key":"ref30","first-page":"259","article-title":"Correlated stochastic block models: Exact graph matching with applications to recovering communities","volume":"34","author":"R\u00e1cz","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref31","volume-title":"Harnessing multiple correlated networks for exact community recovery","author":"R\u00e1cz","year":"2024"},{"key":"ref32","volume-title":"The feasibility of multi-graph alignment: a Bayesian approach","author":"Vassaux","year":"2025"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195705.pdf?arnumber=11195705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:25Z","timestamp":1773347365000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195705\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195705","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}