{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:22:23Z","timestamp":1775053343368,"version":"3.50.1"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/tit.2013.2251412","type":"journal-article","created":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T18:03:05Z","timestamp":1368727385000},"page":"4071-4094","source":"Crossref","is-referenced-by-count":25,"title":["The Infinite-Message Limit of Two-Terminal Interactive Source Coding"],"prefix":"10.1109","volume":"59","author":[{"given":"Nan","family":"Ma","sequence":"first","affiliation":[]},{"given":"Prakash","family":"Ishwar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557213"},{"key":"ref11","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","author":"rockafellar","year":"1970","journal-title":"Convex Analysis"},{"key":"ref13","author":"ma","year":"2012","journal-title":"Infinite-message distributed source coding for two-terminal interactive computing"},{"key":"ref14","author":"bertsekas","year":"1995","journal-title":"Nonlinear Programming"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2004.12"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917675"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref18","author":"csiszr","year":"1986","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref4","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.86993"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.57210"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057118"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref1","first-page":"51","article-title":"Two-terminal distributed source coding with alternating messages for function computation","author":"ma","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192094"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6530620\/06516890.pdf?arnumber=6516890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:45Z","timestamp":1638218865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6516890\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":18,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2251412","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}