{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:54Z","timestamp":1773378054379,"version":"3.50.1"},"reference-count":17,"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\/501100000038","name":"NSERC","doi-asserted-by":"publisher","award":["RGPIN-2019-05448,CRDPJ 543676-19"],"award-info":[{"award-number":["RGPIN-2019-05448,CRDPJ 543676-19"]}],"id":[{"id":"10.13039\/501100000038","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.9517967","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1829-1834","source":"Crossref","is-referenced-by-count":4,"title":["Attributed Graph Alignment"],"prefix":"10.1109","author":[{"given":"Ning","family":"Zhang","sequence":"first","affiliation":[{"name":"University of British Columbia,Vancouver,BC,Canada"}]},{"given":"Weina","family":"Wang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Pittsburgh,PA,USA"}]},{"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia,Vancouver,BC,Canada"}]}],"member":"263","reference":[{"key":"ref10","first-page":"111","article-title":"Robust de-anonymization of large sparse datasets","author":"narayanan","year":"0","journal-title":"Proc IEEE Symp Security and Privacy"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437908"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849392"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20934"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.09.014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1145\/3341617.3326151","article-title":"Analysis of a canonical labeling algorithm for the alignment of correlated erdos-rényi graphs","volume":"3","author":"dai","year":"2019","journal-title":"Proc ACM Meas Anal Comput Syst"},{"key":"ref17","author":"zhang","year":"2021","journal-title":"Attributed graph alignment"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220624"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"ref8","author":"cullina","year":"2017","journal-title":"Exact alignment recovery for correlated Erdös-Rényi graphs"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/2964791.2901460","article-title":"Improved achievability and converse bounds for Erd?s-Rényi graph matching","volume":"44","author":"cullina","year":"2016","journal-title":"ACM SIGMETRICS Perform Evaluation Rev"},{"key":"ref2","first-page":"398","article-title":"Progressive graph matching: Making a move of graphs via probabilistic voting","author":"cho","year":"0","journal-title":"Proc IEEE Comput Vision and Pattern Recognit"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"}],"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\/09517967.pdf?arnumber=9517967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:04Z","timestamp":1773347764000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517967","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}