{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:55Z","timestamp":1773376735059,"version":"3.50.1"},"reference-count":14,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016311","name":"Arm","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016311","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206695","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1442-1447","source":"Crossref","is-referenced-by-count":1,"title":["Timid\/Bold Coding for Channels with Cost Constraints"],"prefix":"10.1109","author":[{"given":"Adeel","family":"Mahmood","sequence":"first","affiliation":[{"name":"Cornell University,School of Electrical and Computer Engineering,Ithaca,NY,USA,14853"}]},{"given":"Aaron B.","family":"Wagner","sequence":"additional","affiliation":[{"name":"Cornell University,School of Electrical and Computer Engineering,Ithaca,NY,USA,14853"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523652"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00536558"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523364"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053879"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997385"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2643681"},{"key":"ref7","article-title":"Channel coding: Non-asymptotic fundamental limits","author":"polyanskiy","year":"2010","journal-title":"Ph D Dissertation"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409261"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447062"},{"key":"ref3","first-page":"689","article-title":"Asymptotische abschätzungen in Shannon’s informations-theorie","author":"strassen","year":"1962","journal-title":"Proc Trans 3rd Prague Conf Inf Theory"},{"key":"ref6","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2324555"}],"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\/10206695.pdf?arnumber=10206695","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:00Z","timestamp":1773347280000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206695\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206695","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}