{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:10Z","timestamp":1773376750258,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206622","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"713-718","source":"Crossref","is-referenced-by-count":2,"title":["Compression with Unlabeled Graph Side Information"],"prefix":"10.1109","author":[{"given":"Hesam","family":"Nikpey","sequence":"first","affiliation":[{"name":"University of Pennsylvania,Department of Computer and Information Science"}]},{"given":"Saswati","family":"Sarkar","sequence":"additional","affiliation":[{"name":"University of Pennsylvania,Department of Electrical and Systems Engineering"}]},{"given":"Shirin Saeedi","family":"Bidokhti","sequence":"additional","affiliation":[{"name":"University of Pennsylvania,Department of Computer and Information Science"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref35","article-title":"On the joint typicality of permutations of sequences of random variables","author":"shirani","year":"2020"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90037-X"},{"key":"ref15","author":"tung","year":"1978","journal-title":"Multiterminal source coding"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.641555"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794371"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006794"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3132290"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1024022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920343"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850110"},{"key":"ref19","article-title":"(nearly) efficient algorithms for the graph matching problem on correlated random graphs","volume":"32","author":"barak","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref18","article-title":"Testing network correlation efficiently via counting trees","author":"mao","year":"2021"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437567"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.09.014"},{"key":"ref26","article-title":"Network alignment: Theory, algorithms, and applications","author":"kazemi","year":"2016","journal-title":"Tech Rep"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"ref20","article-title":"Large (brain) graph matching via fast approximate quadratic programming","author":"vogelstein","year":"2011"},{"key":"ref22","article-title":"Random graph matching at otter’s threshold via counting chandeliers","author":"mao","year":"2022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/34.954602"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437614"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517737"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006661"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-016-1395-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2009.22"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174300"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206622.pdf?arnumber=10206622","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:04Z","timestamp":1773347284000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206622\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206622","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}