{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:45Z","timestamp":1773377565392,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174464","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1504-1509","source":"Crossref","is-referenced-by-count":3,"title":["Broadcasting on trees near criticality"],"prefix":"10.1109","author":[{"given":"Yuzhou","family":"Gu","sequence":"first","affiliation":[{"name":"MIT,Department of EECS and Laboratory of Decision and Information Sciences (LIDS)"}]},{"given":"Hajir","family":"Roozbehani","sequence":"additional","affiliation":[{"name":"MIT,Department of EECS and Laboratory of Decision and Information Sciences (LIDS)"}]},{"given":"Yury","family":"Polyanskiy","sequence":"additional","affiliation":[{"name":"MIT,Department of EECS and Laboratory of Decision and Information Sciences (LIDS)"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2839743"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-1-4939-7005-6_7","article-title":"Strong data-processing inequalities for channels and bayesian networks","author":"polyanskiy","year":"2017","journal-title":"Convexity and Concentration"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/009117904000000153"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536493"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-006-9162-3"},{"key":"ref3","article-title":"Broadcasting on random directed acyclic graphs","author":"makur","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref6","first-page":"356","article-title":"Belief propagation, robust reconstruction and optimal recovery of block models","author":"mossel","year":"2014","journal-title":"Conference on Learning Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/090755862"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366827"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1089\/106652703322539015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1019487349"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02179399"},{"key":"ref9","article-title":"Low density majority codes and the problem of graceful degradation","author":"roozbehani","year":"2019"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174464.pdf?arnumber=9174464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:24Z","timestamp":1773347664000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174464\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174464","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}