{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:49:20Z","timestamp":1774680560843,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006796","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"1583-1587","source":"Crossref","is-referenced-by-count":19,"title":["Compressing data on graphs with clusters"],"prefix":"10.1109","author":[{"given":"Amir R.","family":"Asadi","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Abbe","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Verdu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1065"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2004.1281504"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90365-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.333891"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref18","author":"abbe","year":"2017","journal-title":"Community detection and the stochastic block model recent developments"},{"key":"ref4","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","author":"k\u00f6rner","year":"1973","journal-title":"6th Prague Conference on Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852203"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90011-Z"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90126-4"},{"key":"ref8","first-page":"679","article-title":"Compact representations of separable graphs","author":"blandford","year":"2003","journal-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symp on Disc Alg"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173710"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2001.917151"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)80047-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006796.pdf?arnumber=8006796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T16:07:43Z","timestamp":1513181263000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006796\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006796","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}