{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:22Z","timestamp":1773377662242,"version":"3.50.1"},"reference-count":23,"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\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1527846,CCF-1618145,CCF-1901004,CIF-2007965,CCF-0939370"],"award-info":[{"award-number":["CNS-1527846,CCF-1618145,CCF-1901004,CIF-2007965,CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004439","name":"William and Flora Hewlett","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004439","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.9517897","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2792-2797","source":"Crossref","is-referenced-by-count":3,"title":["A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs"],"prefix":"10.1109","author":[{"given":"Payam","family":"Delgosha","sequence":"first","affiliation":[{"name":"University of Illinois,CS Department,Urbana-Champaign, Urbana,IL,61801"}]},{"given":"Venkat","family":"Anantharam","sequence":"additional","affiliation":[{"name":"University of California, Berkeley,EECS Department,Berkeley,CA,94720"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2991384"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174300"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437614"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v6-96"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-09444-0_1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v12-463"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/tran\/7543"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOP1187"},{"key":"ref18","article-title":"Consistent nonparametric estimation for heavy-tailed sparse graphs","author":"borgs","year":"2015","journal-title":"ArXiv Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-014-0590-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964813000399"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057132"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852203"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849739"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006796"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref9","article-title":"Universal graph compression: Stochastic block models","author":"bhatt","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref20","author":"billingsley","year":"2013","journal-title":"Convergence of Probability Measures"},{"key":"ref22","article-title":"Graphons, cut norm and distance, couplings and rearrangements","author":"janson","year":"2010","journal-title":"arXiv nrenrint"},{"key":"ref21","volume":"60","author":"lovasz","year":"2012","journal-title":"Large Networks and Graph Limits"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"}],"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\/09517897.pdf?arnumber=9517897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:47Z","timestamp":1773347687000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517897\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517897","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}