{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:33:39Z","timestamp":1772642019819,"version":"3.50.1"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014,1]]},"DOI":"10.1109\/tit.2013.2288257","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T18:49:25Z","timestamp":1384886965000},"page":"740-761","source":"Crossref","is-referenced-by-count":135,"title":["Multiterminal Source Coding Under Logarithmic Loss"],"prefix":"10.1109","volume":"60","author":[{"given":"Thomas A.","family":"Courtade","sequence":"first","affiliation":[]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","volume":"12","author":"mccormick","year":"2005","journal-title":"Handbooks in Operations Research and Management Science Discrete Optimization"},{"key":"ref33","first-page":"2162","article-title":"On approximating the rate regions for lossy source coding with coded and uncoded side information","author":"gu","year":"2008","journal-title":"Proc IEEE ISIT"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313113"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2009.5054692"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref37","author":"fujishige","year":"2010","journal-title":"Submodular Functions and Optimization"},{"key":"ref36","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref35","author":"csiszar","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056173"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.641555"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.669162"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365154"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850110"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033913"},{"key":"ref16","first-page":"368","article-title":"The information bottleneck method","author":"tishby","year":"1999","journal-title":"Proc 37th Annu Allerton Conf Commun Control Comput"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557285"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2006.312762"},{"key":"ref19","author":"berger","year":"1977","journal-title":"Multiterminal source coding"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2005-182"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055469"},{"key":"ref27","author":"globerson","year":"2001","journal-title":"Distributional clustering of movements based on neural responses"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055374"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920242"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920343"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.32119"},{"key":"ref2","author":"courtade","year":"2012","journal-title":"Two problems in multiterminal information theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284661"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.490552"},{"key":"ref20","author":"tung","year":"1978","journal-title":"Multiterminal source coding"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2009.5054692"},{"key":"ref21","author":"gamal","year":"2012","journal-title":"Network Information Theory"},{"key":"ref24","first-page":"595","article-title":"An information theoretic tradeoff between complexity and accuracy","author":"gilad-bachrach","year":"2003","journal-title":"Proc COLT"},{"key":"ref23","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1046\/j.1365-8711.2001.04125.x"},{"key":"ref25","first-page":"1","article-title":"The power of word clusters for text classification","author":"slonim","year":"2001","journal-title":"Proc 23rd Eur Colloq Inf Retr Res"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6690264\/06651793.pdf?arnumber=6651793","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T18:00:33Z","timestamp":1640282433000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6651793\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":38,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2288257","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}