{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:40Z","timestamp":1773376600710,"version":"3.50.1"},"reference-count":19,"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.10206989","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1556-1561","source":"Crossref","is-referenced-by-count":0,"title":["How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?"],"prefix":"10.1109","author":[{"given":"Hsin-Po","family":"Wang","sequence":"first","affiliation":[{"name":"University of California,Berkeley,CA,USA"}]},{"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[{"name":"University of California,Berkeley,CA,USA"}]}],"member":"263","reference":[{"key":"ref13","first-page":"1","article-title":"Ar?kan meets shannon: Polar codes with near-optimal convergence to channel capacity","author":"guruswami","year":"2022","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3253074"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282451"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3041570"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616117"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3038806"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033724"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2007.4298398"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3016605"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849741"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028536"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2915595"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2228295"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"}],"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\/10206989.pdf?arnumber=10206989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:49Z","timestamp":1773347209000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206989\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206989","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}