{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:40:23Z","timestamp":1773376823957,"version":"3.50.1"},"reference-count":16,"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.10206476","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1360-1365","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Learning Rate of Sending One Bit Over Arbitrary Acyclic BISO-Channel Networks"],"prefix":"10.1109","author":[{"given":"Chih-Chun","family":"Wang","sequence":"first","affiliation":[{"name":"Purdue ECE"}]},{"given":"David J.","family":"Love","sequence":"additional","affiliation":[{"name":"Purdue ECE"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279392"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887085"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849611"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3107733"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849298"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262772"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3030842"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040859"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2619717"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557214"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050932"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)90052-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2010.5454140"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595479"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706940"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165816"}],"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\/10206476.pdf?arnumber=10206476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:31Z","timestamp":1773347311000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206476\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206476","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}