{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:21Z","timestamp":1773378021836,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001405","name":"Tata Institute of Fundamental Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001405","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518090","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1931-1936","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation"],"prefix":"10.1109","author":[{"given":"Yanjun","family":"Han","sequence":"first","affiliation":[{"name":"Stanford University,USA"}]},{"given":"Kedar","family":"Tatwawadi","sequence":"additional","affiliation":[{"name":"Stanford University,USA"}]},{"given":"Gowtham R.","family":"Kurri","sequence":"additional","affiliation":[{"name":"Arizona State University,USA"}]},{"given":"Zhengqing","family":"Zhou","sequence":"additional","affiliation":[{"name":"Stanford University,USA"}]},{"given":"Vinod M.","family":"Prabhakaran","sequence":"additional","affiliation":[{"name":"Tata Institute of Fundamental Research,India"}]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[{"name":"Stanford University,USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.2627"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761390"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"},{"key":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2533546"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2539347"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.29007\/3b2l"},{"key":"ref4","article-title":"Domain compression and its application to randomness-optimal distributed goodness-of-fit","author":"acharya","year":"2019","journal-title":"ArXiv Preprint"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00533053"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2971215"},{"key":"ref22","article-title":"Optimal communication rates and combinatorial properties for distributed simulation","author":"han","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02804017"},{"key":"ref23","first-page":"357","article-title":"The complexity of nonuniform random number generation","author":"knuth","year":"1976","journal-title":"Algorithms and Complexity New Directions and Results"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518090.pdf?arnumber=9518090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:56Z","timestamp":1773347756000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518090","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}