{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:18:59Z","timestamp":1774678739752,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1016625"],"award-info":[{"award-number":["CCF-1016625"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Center for Science of Information"},{"DOI":"10.13039\/100006734","name":"Princeton University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006734","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/tit.2019.2919720","type":"journal-article","created":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T20:02:52Z","timestamp":1559160172000},"page":"8067-8083","source":"Crossref","is-referenced-by-count":2,"title":["Sharp Bounds for Mutual Covering"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5637-5264","authenticated-orcid":false,"given":"Jingbo","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9353-3073","authenticated-orcid":false,"given":"Mohammad Hossein","family":"Yassaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Verdu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<467::AID-RSA15>3.0.CO;2-W"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2307\/2046814"},{"key":"ref32","first-page":"547","article-title":"On measures of information and entropy","author":"renyi","year":"1961","journal-title":"Proc 4th Berkeley Symp Math Statist Probab"},{"key":"ref31","author":"brualdi","year":"2009","journal-title":"Introductory Combinatorics"},{"key":"ref30","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010210"},{"key":"ref36","first-page":"1","article-title":"On large deviation analysis of sampling from typical sets","author":"krithivasan","year":"2007","journal-title":"Inf Theory Appl Workshop (ITA)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1561\/0100000064"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02699376"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2400994"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1109\/TIT.2015.2507602","article-title":"Key capacity for product sources with application to stationary Gaussian processes","volume":"62","author":"liu","year":"2016","journal-title":"IEEE Trans Inf Theory"},{"key":"ref12","first-page":"2629","article-title":"$\\text{E}_{\\gamma}$\n -resolvability","volume":"63","author":"liu","year":"2017","journal-title":"IEEE Trans Inf Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746104"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034824"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006596"},{"key":"ref16","article-title":"A unified framework for one-shot achievability via the poisson matching lemma","author":"li","year":"2018","journal-title":"arXiv 1812 03616"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0128010"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02773611"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553672"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056046"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056302"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437540"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483192"},{"key":"ref6","first-page":"1457","article-title":"One-shot mutual covering lemma and Marton&#x2019;s inner bound with a common message","author":"liu","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904962"},{"key":"ref5","author":"alon","year":"2004","journal-title":"The Probabilistic Method"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282465"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437857"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2529657"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2531795"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133173"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689787"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620434"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282422"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_11"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2348554"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262727"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2449844"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8907537\/8725594-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8907537\/08725594.pdf?arnumber=8725594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:41:29Z","timestamp":1657744889000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8725594\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":43,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2919720","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}