{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:56Z","timestamp":1740131696390,"version":"3.37.3"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001502","name":"Department of Atomic Energy, Government of India","doi-asserted-by":"publisher","award":["RTI4001"],"award-info":[{"award-number":["RTI4001"]}],"id":[{"id":"10.13039\/501100001502","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001502","name":"Department of Atomic Energy, Government of India","doi-asserted-by":"publisher","award":["RTI4001"],"award-info":[{"award-number":["RTI4001"]}],"id":[{"id":"10.13039\/501100001502","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board, India","doi-asserted-by":"publisher","award":["MTR\/2020\/000308"],"award-info":[{"award-number":["MTR\/2020\/000308"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/tit.2021.3119976","type":"journal-article","created":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T17:30:04Z","timestamp":1634319004000},"page":"7723-7739","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8335-2364","authenticated-orcid":false,"given":"Yanjun","family":"Han","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3677-4174","authenticated-orcid":false,"given":"Kedar","family":"Tatwawadi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6031-4114","authenticated-orcid":false,"given":"Gowtham R.","family":"Kurri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2870-5136","authenticated-orcid":false,"given":"Zhengqing","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7505-5303","authenticated-orcid":false,"given":"Vinod M.","family":"Prabhakaran","sequence":"additional","affiliation":[]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"209","article-title":"Some complexity questions related to distributive computing (preliminary report)","author":"yao","year":"1979","journal-title":"Proc 11th Annu ACM Symp Theory Comput"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1155\/S1073792802111044"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2897129"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081210"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557610"},{"key":"ref37","article-title":"Simplicial matrix-tree theorems","author":"duval","year":"2008","journal-title":"arXiv 0802 2576"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02804017"},{"key":"ref35","article-title":"Spanning trees of 3-uniform hypergraphs","author":"goodall","year":"2010","journal-title":"arXiv 1002 3331"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00185-2"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2971215"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2802546"},{"key":"ref29","article-title":"Secret key agreement for hypergraphical sources with limited total discussion","author":"chan","year":"2019","journal-title":"arXiv 1910 01894"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746104"},{"key":"ref21","first-page":"1834","article-title":"Resource-efficient common randomness and secret-key schemes","author":"ghazi","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464805"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2533546"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2539347"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503135"},{"key":"ref50","first-page":"3163","article-title":"Geometric lower bounds for distributed parameter estimation under communication constraints","author":"han","year":"2018","journal-title":"Proc 31st Conf Learn Theory"},{"key":"ref51","article-title":"Optimal communication rates and combinatorial properties for common randomness generation","author":"han","year":"2019","journal-title":"arXiv 1904 03271"},{"journal-title":"Fractional Graph Theory A Rational Approach to the Theory of Graphs","year":"2011","author":"scheinerman","key":"ref56"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808737"},{"journal-title":"An Introduction to Algebraic Topology","year":"1998","author":"rotman","key":"ref54"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279330"},{"key":"ref52","first-page":"357","article-title":"The complexity of nonuniform random number generation","author":"knuth","year":"1976","journal-title":"Algorithms and Complexity New Directions and Recent Results"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802208"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.651026"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.825796"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.825797"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120268"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761390"},{"key":"ref4","article-title":"Domain compression and its application to randomness-optimal distributed goodness-of-fit","author":"acharya","year":"2019","journal-title":"arXiv 1907 08743"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574948"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.802612"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2007.03.010"},{"key":"ref8","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"gacs","year":"1973","journal-title":"Problems Control Inf Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref46","first-page":"2328","article-title":"Information-theoretic lower bounds for distributed statistical estimation with communication constraints","author":"zhang","year":"2013","journal-title":"Proc 26th Int Conf Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00005-4"},{"key":"ref48","article-title":"Inference under information constraints I: Lower bounds from chi-square contraction","author":"acharya","year":"2018","journal-title":"arXiv 1812 11476"},{"key":"ref47","article-title":"Distributed simulation and distributed inference","author":"acharya","year":"2018","journal-title":"arXiv 1804 06952"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1992.215401"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.30"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9622121\/09570391.pdf?arnumber=9570391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:21Z","timestamp":1652194461000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9570391\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":56,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3119976","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,12]]}}}