{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:38Z","timestamp":1773378038937,"version":"3.50.1"},"reference-count":31,"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\/100005714","name":"EPSCoR","doi-asserted-by":"publisher","award":["FAR0033968"],"award-info":[{"award-number":["FAR0033968"]}],"id":[{"id":"10.13039\/100005714","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006732","name":"NYU WIRELESS Industrial Affiliates","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006732","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1815821"],"award-info":[{"award-number":["CCF-1815821"]}],"id":[{"id":"10.13039\/100000001","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.9518130","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2726-2731","source":"Crossref","is-referenced-by-count":1,"title":["On Graph Matching Using Generalized Seed Side-Information"],"prefix":"10.1109","author":[{"given":"Mahshad","family":"Shariatnasab","sequence":"first","affiliation":[{"name":"North Dakota State University"}]},{"given":"Farhad","family":"Shirani","sequence":"additional","affiliation":[{"name":"North Dakota State University"}]},{"given":"Siddharth","family":"Garg","sequence":"additional","affiliation":[{"name":"New York University"}]},{"given":"Elza","family":"Erkip","sequence":"additional","affiliation":[{"name":"New York University"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.21"},{"key":"ref30","author":"lubars","year":"2018","journal-title":"Improving the output of algorithms for large-scale approximate graph matching"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref11","author":"kazemi","year":"2016","journal-title":"Network alignment Theory algorithms and applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736720"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660278"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2808999"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3366702","article-title":"Partial recovery of Erdðs-Rényi graph alignment via k-core alignment","volume":"3","author":"cullina","year":"0","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},{"key":"ref16","article-title":"Significance of side information in the graph matching problem","author":"singhal","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1142\/9789813272880_0183"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"1","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":"0","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems"},{"key":"ref28","author":"csisz\u00e1r","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437567"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDAR.2011.29"},{"key":"ref6","first-page":"12","article-title":"Seeded graph matching for large stochastic block model graphs","volume":"1050","author":"lyzinski","year":"2014","journal-title":"Stat"},{"key":"ref29","article-title":"On graph matching using generalized seed side-information","author":"shariatnasab","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0209047"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2007.01.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"ref22","first-page":"127","article-title":"Robust multimodal graph matching: Sparse coding meets graph matching","author":"fiori","year":"0","journal-title":"Advances in neural information processing systems"},{"key":"ref21","first-page":"3513","article-title":"Seeded graph matching for correlated Erdös-Rényi graphs","volume":"15","author":"lyzinski","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437739"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056280"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262775"}],"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\/09518130.pdf?arnumber=9518130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:00Z","timestamp":1773347760000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518130\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518130","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}