{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:55:45Z","timestamp":1773392145339,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery","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\/501100000038","name":"NSERC Collaborative Research and Development","doi-asserted-by":"publisher","award":["CRDPJ 54367619"],"award-info":[{"award-number":["CRDPJ 54367619"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-2007733"],"award-info":[{"award-number":["CNS-2007733"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1109\/tit.2024.3351107","type":"journal-article","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T19:36:18Z","timestamp":1704742578000},"page":"3622-3639","source":"Crossref","is-referenced-by-count":5,"title":["On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1879-6559","authenticated-orcid":false,"given":"Ziao","family":"Wang","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6808-0156","authenticated-orcid":false,"given":"Weina","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4077-433X","authenticated-orcid":false,"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517967"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref4","article-title":"Exact alignment recovery for correlated Erd\u0151s\u2013R\u00e9nyi graphs","author":"Cullina","year":"2017","journal-title":"arXiv:1711.06783"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3169005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3376930.3376992"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-020-00997-4"},{"key":"ref8","first-page":"2985","article-title":"Spectral graph matching and regularized quadratic relaxations: Algorithm and theory","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","volume":"119","author":"Fan"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-022-01184-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585156"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20934"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2866440"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449886"},{"key":"ref18","article-title":"Matching in networks: Fundamental limits and efficient algorithms","author":"Yu","year":"2023"},{"key":"ref19","article-title":"Testing network correlation efficiently via counting trees","author":"Mao","year":"2021","journal-title":"arXiv:2110.11816"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869137"},{"key":"ref21","article-title":"On the simultaneous preservation of privacy and community structure in anonymized networks","author":"Cullina","year":"2016","journal-title":"arXiv:1603.08028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517967"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"issue":"1","key":"ref25","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","article-title":"Algorithms for the assignment and transportation problems","volume":"5","author":"Munkres","year":"1957","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref27","volume-title":"Information Theory","author":"Ash","year":"1990"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10507193\/10384315-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10507193\/10384315.pdf?arnumber=10384315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T18:35:39Z","timestamp":1714761339000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10384315\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":27,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3351107","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]}}}