{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T16:11:05Z","timestamp":1782835865139,"version":"3.54.5"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/tit.2018.2808999","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T19:42:20Z","timestamp":1519414940000},"page":"3254-3273","source":"Crossref","is-referenced-by-count":20,"title":["Information Recovery in Shuffled Graphs via Graph Matching"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5594-8956","authenticated-orcid":false,"given":"Vince","family":"Lyzinski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","author":"onaran","year":"2016","journal-title":"Optimal de-anonymization in random graphs with community structure"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1173"},{"key":"ref32","author":"wolfe","year":"2013","journal-title":"Nonparametric graphon estimation"},{"key":"ref31","first-page":"692","article-title":"Stochastic blockmodel approximation of a Graphon: Theory and consistent estimation","volume":"26","author":"airoldi","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1987.10478385"},{"key":"ref37","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":"ref36","first-page":"127","article-title":"Robust multimodal graph matching: Sparse coding meets graph matching","author":"fiori","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","author":"fishkind","year":"2017","journal-title":"Seeded graph matching"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref60","volume":"55","author":"abramowitz","year":"1964","journal-title":"Handbook of Mathematical Functions with Formulas Graphs and Mathematical Tables"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.03.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2012.726889"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811395"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nrn2575"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2426714"},{"key":"ref21","first-page":"121002e","article-title":"Fast approximate quadratic programming for graph matching","volume":"10","author":"vogelstein","year":"2014","journal-title":"PLoS ONE"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217304"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2015.1105807"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2015.1105807"},{"key":"ref25","author":"passos","year":"2014","journal-title":"Lexicon infused phrase embeddings for named entity resolution"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/120875600"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1214\/14-EJS978"},{"key":"ref59","volume":"2","author":"feller","year":"2008","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref58","author":"alon","year":"2015","journal-title":"The Probabilistic Method"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10054"},{"key":"ref56","author":"lyzinski","year":"2014","journal-title":"Seeded graph matching via joint optimization of fidelity and commensurability"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1001066"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.2307\/2284239"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2012.09.018"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s003579900058"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.04.005"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11203-011-9058-y"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3150\/15-BEJ789"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2011.5967746"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2243445"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2294594"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-015-9170-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1098\/rstb.1986.0056"},{"key":"ref17","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2016.1193505"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68020-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2010.05.081"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MPUL.2011.2181023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/12-BJPS188"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1162\/0899766042321814"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2012.699795"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.03.025"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77004-6_11"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"1878","DOI":"10.1214\/11-AOS887","article-title":"Spectral clustering and the high-dimensional stochastic blockmodel","volume":"39","author":"rohe","year":"2011","journal-title":"Ann Stat"},{"key":"ref47","first-page":"3120","article-title":"Regularized spectral clustering under the degree-corrected stochastic blockmodel","author":"qin","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2017.132"},{"key":"ref41","first-page":"102","article-title":"Geometric network comparisons","author":"asta","year":"2015","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2017.1321551"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1080\/21624054.2016.1142041"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8341943\/08301562.pdf?arnumber=8301562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T08:27:14Z","timestamp":1643185634000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8301562\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":60,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2808999","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}