{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:13Z","timestamp":1773376993108,"version":"3.50.1"},"reference-count":34,"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\/501100000038","name":"NSERC","doi-asserted-by":"publisher","award":["RGPIN-2019-05448"],"award-info":[{"award-number":["RGPIN-2019-05448"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002739","name":"Aarhus Universitets Forskningsfond","doi-asserted-by":"publisher","award":["AUFF 39001"],"award-info":[{"award-number":["AUFF 39001"]}],"id":[{"id":"10.13039\/501100002739","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.11195708","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":0,"title":["On the Information-Theoretic Limit of Subgraph Alignment"],"prefix":"10.1109","author":[{"given":"Chun Hei Michael","family":"Shiu","sequence":"first","affiliation":[{"name":"University of British Columbia,Vancouver,Canada"}]},{"given":"Hei Victor","family":"Cheng","sequence":"additional","affiliation":[{"name":"Aarhus University,Aarhus,Denmark"}]},{"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia,Vancouver,Canada"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220624"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1142\/9789812776136_0030"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref7","article-title":"Exact alignment recovery for correlated Erdos Renyi graphs","author":"Cullina","year":"2017","journal-title":"arXiv preprint"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3169005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3341617.3326151"},{"key":"ref10","first-page":"2985","article-title":"Spectral graph matching and regularized quadratic relaxations: Algorithm and theory","volume-title":"International conference on machine learning","author":"Fan","year":"2020"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-020-00997-4"},{"key":"ref12","first-page":"3296","article-title":"Random graph matching with improved noise robustness","volume-title":"Conference on Learning Theory","author":"Mao","year":"2021"},{"key":"ref13","article-title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","author":"Ding","year":"2023","journal-title":"arXiv preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-022-01184-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585156"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20934"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437908"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3403810"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3555187"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3351107"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CISP-BMEI60920.2023.10373342"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45878-6_5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/34.954603"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2274576.2274578"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM49781.2020.9381293"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2875262"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516384"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100214"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392023"}],"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\/11195708.pdf?arnumber=11195708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:51Z","timestamp":1773347391000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195708\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195708","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}