{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:24:15Z","timestamp":1761294255690,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1815821","CNS-1619129"],"award-info":[{"award-number":["CCF-1815821","CNS-1619129"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ND EPSCoR","award":["FAR0033968"],"award-info":[{"award-number":["FAR0033968"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/jsait.2021.3056280","type":"journal-article","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T06:30:36Z","timestamp":1612333836000},"page":"338-351","source":"Crossref","is-referenced-by-count":5,"title":["A Concentration of Measure Approach to Correlated Graph Matching"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1316-3899","authenticated-orcid":false,"given":"Farhad","family":"Shirani","sequence":"first","affiliation":[]},{"given":"Siddharth","family":"Garg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8718-8648","authenticated-orcid":false,"given":"Elza","family":"Erkip","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"journal-title":"Matchability of heterogeneous networks pairs","year":"2017","author":"lyzinski","key":"ref38"},{"key":"ref33","first-page":"3513","article-title":"Seeded graph matching for correlated Erdös-Rényi graphs","volume":"15","author":"lyzinski","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2553843"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.09.014"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.62"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref34","first-page":"127","article-title":"Robust multimodal graph matching: Sparse coding meets graph matching","author":"fiori","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-016-1395-9"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"ref11","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erdos","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392023"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2007.01.002"},{"article-title":"Network alignment: Theory, algorithms, and applications","year":"2016","author":"kazemi","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736720"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660278"},{"key":"ref28","first-page":"12","article-title":"Seeded graph matching for large stochastic block model graphs","volume":"1050","author":"lyzinski","year":"2014","journal-title":"Stat"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"journal-title":"Significance of side information in the graph matching problem","year":"2017","author":"singhal","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242598"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446983"},{"key":"ref29","first-page":"709","article-title":"Optimal de-anonymization in random graphs with community structure","author":"onaran","year":"2016","journal-title":"Proc 50th Asilomar Conf Signals Syst Comput"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2529591"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437567"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.22977"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1304"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102214"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262775"},{"journal-title":"Exact alignment recovery for correlated Erdös-Rényi graphs","year":"2017","author":"cullina","key":"ref20"},{"journal-title":"Advanced Combinatorics The Art of Finite and Infinite Expansions","year":"2012","author":"comtet","key":"ref45"},{"journal-title":"Partial recovery of Erdös-Rényi graph alignment via k-core alignment","year":"2018","author":"cullina","key":"ref22"},{"journal-title":"Information recovery in shuffled graphs via graph matching","year":"2016","author":"lyzinski","key":"ref21"},{"key":"ref42","volume":"100","author":"isaacs","year":"1994","journal-title":"Algebra A Graduate Course"},{"journal-title":"Community Structure in Graphs","year":"2007","author":"fortunato","key":"ref24"},{"journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems","year":"1981","author":"csisz\u00e1r","key":"ref41"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/18.720546"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660324"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851769"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636015"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9380089\/9344632-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9380089\/09344632.pdf?arnumber=9344632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T20:14:47Z","timestamp":1623701687000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9344632\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":46,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3056280","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}