{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:08Z","timestamp":1740131708021,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Swarnajayanti Fellowship awarded to the second author by the Department of Science and Technology, India"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/tit.2016.2533546","type":"journal-article","created":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T19:08:18Z","timestamp":1456254498000},"page":"3811-3830","source":"Crossref","is-referenced-by-count":23,"title":["On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model"],"prefix":"10.1109","volume":"62","author":[{"given":"Manuj","family":"Mukherjee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8834-0082","authenticated-orcid":false,"given":"Navin","family":"Kashyap","sequence":"additional","affiliation":[]},{"given":"Yogesh","family":"Sankarasubramaniam","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.48.7.1142"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283586"},{"key":"ref31","first-page":"1063","article-title":"Asymptotic enumeration methods","volume":"2","author":"odlyzko","year":"1995","journal-title":"Handbook of Combinatorics"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176782"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535768.001.0001","author":"colbourn","year":"1999","journal-title":"Triple Systems"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2013.6487950"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282463"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2290993"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874938"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874938"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282547"},{"article-title":"Common randomness, efficiency, and actions","year":"2011","author":"zhao","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034191"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"article-title":"Wyner’s common information: Generalizations and a new lossy source coding interpretation","year":"2013","author":"xu","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081210"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050832"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"yao","year":"1979","journal-title":"Proc 11th Annu ACM Symp Theory Comput (STOC)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620288"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2347282"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875389"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046253"},{"key":"ref23","article-title":"Information complexity is computable","author":"braverman","year":"2015","journal-title":"Electron Colloq Comput Complex"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283722"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464805"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7491395\/07416199.pdf?arnumber=7416199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,14]],"date-time":"2024-06-14T15:17:36Z","timestamp":1718378256000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7416199\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":35,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2533546","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2016,7]]}}}