{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:48Z","timestamp":1773377628952,"version":"3.50.1"},"reference-count":27,"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\/501100001809","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1911238"],"award-info":[{"award-number":["CCF-1911238"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"NSERC Discovery","doi-asserted-by":"publisher","award":["RGPIN-2019-05448,CRDPJ 543676\u201319"],"award-info":[{"award-number":["RGPIN-2019-05448,CRDPJ 543676\u201319"]}],"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.9517737","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"3038-3043","source":"Crossref","is-referenced-by-count":4,"title":["Universal Graph Compression: Stochastic Block Models"],"prefix":"10.1109","author":[{"given":"Alankrita","family":"Bhatt","sequence":"first","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA,92093"}]},{"given":"Ziao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia,Vancouver,BC,Canada,V6T1Z4"}]},{"given":"Chi","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research,Redmond,WA,USA,98052"}]},{"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia,Vancouver,BC,Canada,V6T1Z4"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852203"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2991384"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174300"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0590-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2003.815173"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316339831","author":"frieze","year":"2015","journal-title":"Introduction to Random Graphs"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557109"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939782"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref27","first-page":"1564","article-title":"Information-theoretic determination of minimax rates of convergence","author":"yang","year":"1999","journal-title":"Annals of Statistics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.995542"},{"key":"ref8","author":"polyanskiy","year":"2014","journal-title":"Lecture Notes on Information Theory"},{"key":"ref7","author":"bhatt","year":"2020","journal-title":"Universal graph compression Stochastic block models"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556120"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2015.8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057132"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0576-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"}],"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\/09517737.pdf?arnumber=9517737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:39Z","timestamp":1773347679000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517737\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517737","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}