{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:55Z","timestamp":1773377455955,"version":"3.50.1"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849512","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2863-2867","source":"Crossref","is-referenced-by-count":1,"title":["Shannon Capacity is Achievable for a Large Class of Interactive Markovian Protocols"],"prefix":"10.1109","author":[{"given":"Assaf","family":"Ben-Yishai","sequence":"first","affiliation":[{"name":"Department of EE-Systems, Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[{"name":"Department of EE-Systems, Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Young-Han","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, San Diego, CA, 92093, USA"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488699"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"ref6","article-title":"Shannon capacity is achievable for binary interactive first-order markovian protocols","author":"ben-yishai","year":"2017"},{"key":"ref5","first-page":"2123","article-title":"Bridging the capacity gap between interactive and one-way communication","author":"haeupler","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref7","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267778"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849655"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849512.pdf?arnumber=8849512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:47Z","timestamp":1773347627000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849512\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849512","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}