{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T21:58:11Z","timestamp":1766267891671,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"U.S. National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1910497","CCF 2310203"],"award-info":[{"award-number":["CCF 1910497","CCF 2310203"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1109\/tit.2024.3353769","type":"journal-article","created":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T21:04:33Z","timestamp":1705352673000},"page":"4655-4666","source":"Crossref","is-referenced-by-count":3,"title":["Shared Information for a Markov Chain on a Tree"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4408-6902","authenticated-orcid":false,"given":"Sagnik","family":"Bhattacharya","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0710-6305","authenticated-orcid":false,"given":"Prakash","family":"Narayan","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"A measure of statistical complexity based on predictive information","author":"Abdallah","year":"2010","journal-title":"arXiv:1012.1890"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834365"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206503"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2857829"},{"key":"ref6","first-page":"686","article-title":"Correlated bandits or: How to minimize mean-squared error online","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","volume":"97","author":"Boda"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref8","article-title":"On tightness of mutual dependence upperbound for secret-key capacity of multiple terminals","author":"Chan","year":"2008","journal-title":"arXiv:0805.3200"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034285"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089530"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3040492"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555923"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2630054"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464805"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055013"},{"volume-title":"Introduction to Algorithms","year":"2009","author":"Cormen","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2539347"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316365"},{"key":"ref23","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"G\u00e1cs","year":"1973","journal-title":"Problems Control Inf. Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1515\/9783110250329"},{"key":"ref25","first-page":"97","article-title":"Nonprobabilistic mutual information without memory","volume":"4","author":"Goppa","year":"1975","journal-title":"Problems Control Inf. Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90275-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2412945"},{"volume-title":"Probabilistic Graphical Models: Principles and Techniques\u2014Adaptive Computation and Machin","year":"2009","author":"Koller","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68829-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706995"},{"volume-title":"Information Theory, Inference & Learning Algorithms","year":"2002","author":"MacKay","key":"ref33"},{"article-title":"Omniscience and secrecy","volume-title":"Plenary Talk IEEE Int. Symp. Inf. Theory","author":"Narayan","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1561\/0100000072"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081210"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780272"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3501714.3501727"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning\u2013From Theory to Algorithms","author":"Shalev-Shwartz","year":"2014"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262496"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457926"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1147\/rd.41.0066"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref47","first-page":"41","article-title":"Best arm identification in multi-armed bandits","volume-title":"Proc. 23rd Annu. Conf. Learn. Theory","author":"Audibert"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10565302\/10399895-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10565302\/10399895.pdf?arnumber=10399895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T19:41:35Z","timestamp":1719344495000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10399895\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":47,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3353769","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}