{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:48Z","timestamp":1750219848610,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1456\/18"],"award-info":[{"award-number":["1456\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["949707"],"award-info":[{"award-number":["949707"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1750443"],"award-info":[{"award-number":["CCF-1750443"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585249","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1424-1437","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Rate of Interactive Codes Is Bounded Away from 1"],"prefix":"10.1145","author":[{"given":"Klim","family":"Efremenko","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gillat","family":"Kol","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Paramonov","sequence":"additional","affiliation":[{"name":"Princeton University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghuvansh R.","family":"Saxena","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541368"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3104964"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993659"},{"key":"e_1_3_2_1_4_1","unstructured":"Gil Cohen and Shahar Samocha. 2019. Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Electronic Colloquium on Computational Complexity: ECCC 147. \t\t\t\t  Gil Cohen and Shahar Samocha. 2019. Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Electronic Colloquium on Computational Complexity: ECCC 147."},{"key":"e_1_3_2_1_5_1","volume-title":"Interactive Coding with Constant Round and Communication Blowup. In Innovations in Theoretical Computer Science Conference (ITCS), Thomas Vidick (Ed.). 151","author":"Efremenko Klim","year":"2020","unstructured":"Klim Efremenko , Elad Haramaty , and Yael Tauman Kalai . 2020 . Interactive Coding with Constant Round and Communication Blowup. In Innovations in Theoretical Computer Science Conference (ITCS), Thomas Vidick (Ed.). 151 , 7:1\u20137:34. Klim Efremenko, Elad Haramaty, and Yael Tauman Kalai. 2020. Interactive Coding with Constant Round and Communication Blowup. In Innovations in Theoretical Computer Science Conference (ITCS), Thomas Vidick (Ed.). 151, 7:1\u20137:34."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680833478"},{"key":"e_1_3_2_1_7_1","volume-title":"Symposium on Discrete Algorithms (SODA). 1296\u20131311","author":"Gelles Ran","year":"2014","unstructured":"Ran Gelles and Bernhard Haeupler . 2014 . Capacity of Interactive Communication over Erasure Channels and Channels with Feedback . In Symposium on Discrete Algorithms (SODA). 1296\u20131311 . Ran Gelles and Bernhard Haeupler. 2014. Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. In Symposium on Discrete Algorithms (SODA). 1296\u20131311."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch135"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Bernhard Haeupler. 2014. Interactive channel capacity revisited. In Foundations of Computer Science (FOCS). 226\u2013235. \t\t\t\t  Bernhard Haeupler. 2014. Interactive channel capacity revisited. In Foundations of Computer Science (FOCS). 226\u2013235.","DOI":"10.1109\/FOCS.2014.32"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions","volume":"107","author":"Haeupler Bernhard","year":"2018","unstructured":"Bernhard Haeupler , Amirbehshad Shahrasbi , and Ellen Vitercik . 2018 . Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions . In International Colloquium on Automata, Languages, and Programming (ICALP). 107 , 75: 1 \u2013 75 :14. Bernhard Haeupler, Amirbehshad Shahrasbi, and Ellen Vitercik. 2018. Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. In International Colloquium on Automata, Languages, and Programming (ICALP). 107, 75:1\u201375:14.","journal-title":"International Colloquium on Automata, Languages, and Programming (ICALP)."},{"key":"e_1_3_2_1_11_1","volume-title":"Bridging the Capacity Gap Between Interactive and One-Way Communication. In Symposium on Discrete Algorithms (SODA). 2123\u20132142","author":"Haeupler Bernhard","year":"2017","unstructured":"Bernhard Haeupler and Ameya Velingker . 2017 . Bridging the Capacity Gap Between Interactive and One-Way Communication. In Symposium on Discrete Algorithms (SODA). 2123\u20132142 . Bernhard Haeupler and Ameya Velingker. 2017. Bridging the Capacity Gap Between Interactive and One-Way Communication. In Symposium on Discrete Algorithms (SODA). 2123\u20132142."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488699"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103463"},{"key":"e_1_3_2_1_14_1","unstructured":"Denis Pankratov. 2013. On the Power of Feedback in Interactive Channels. Manuscript. \t\t\t\t  Denis Pankratov. 2013. On the Power of Feedback in Interactive Channels. Manuscript."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Leonard J Schulman. 1992. Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS). 724\u2013733. \t\t\t\t  Leonard J Schulman. 1992. Communication on noisy channels: A coding theorem for computation. In Foundations of Computer Science (FOCS). 724\u2013733.","DOI":"10.1109\/SFCS.1992.267778"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167279"},{"key":"e_1_3_2_1_17_1","volume-title":"Originally appeared in Bell System Tech. J. 27:379\u2013423, 623\u2013656","author":"Shannon Claude E.","year":"1948","unstructured":"Claude E. Shannon . 2001. Originally appeared in Bell System Tech. J. 27:379\u2013423, 623\u2013656 , 1948 . A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review, 5, 1 (2001. Originally appeared in Bell System Tech. J. 27:379\u2013423, 623\u2013656, 1948), 3\u201355. Claude E. Shannon. 2001. Originally appeared in Bell System Tech. J. 27:379\u2013423, 623\u2013656, 1948. A mathematical theory of communication. ACM SIGMOBILE Mobile Computing and Communications Review, 5, 1 (2001. Originally appeared in Bell System Tech. J. 27:379\u2013423, 623\u2013656, 1948), 3\u201355."}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585249","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:02Z","timestamp":1750178822000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":17,"alternative-id":["10.1145\/3564246.3585249","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585249","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}