{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:24Z","timestamp":1773378024659,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834365","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3049-3054","source":"Crossref","is-referenced-by-count":2,"title":["Shared Information for a Markov Chain on a Tree"],"prefix":"10.1109","author":[{"given":"Sagnik","family":"Bhattacharya","sequence":"first","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering and the Institute for Systems Research,College Park,MD,USA,20742"}]},{"given":"Prakash","family":"Narayan","sequence":"additional","affiliation":[{"name":"University of Maryland,Department of Electrical and Computer Engineering and the Institute for Systems Research,College Park,MD,USA,20742"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1147\/rd.41.0066"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2457926"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262496"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264355"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055346"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2630054"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464805"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055013"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2539347"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316365"},{"key":"ref17","article-title":"Common information is far less than mutual information","volume":"2","author":"g\u00e1cs","year":"1973","journal-title":"Problems of Control and Information Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1515\/9783110250329"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90275-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780272"},{"key":"ref4","article-title":"Correlated bandits or: How to minimize mean-squared error online","volume":"97","author":"boda","year":"2019","journal-title":"Proceedings of the 36th International Conference on Machine Learning"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081210"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2857829"},{"key":"ref6","article-title":"On tightness of mutual dependence upper-bound for secret-key capacity of multiple terminals","volume":"abs 805 3200","author":"chan","year":"2008","journal-title":"ArXiv"},{"key":"ref29","article-title":"Reverend Bayes on inference engines: A distributed hierarchical approach","author":"pearl","year":"1982","journal-title":"Proceedings of the Second AAAI Conference on Artificial Intelligence ser AAAI’82"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034285"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089530"},{"key":"ref2","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"Proceedings of the Twenty-Third Annual Conference on Learning Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2458316"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10019"},{"key":"ref20","article-title":"Minimax estimation of functionals of discrete distributions","volume":"61","author":"jiao","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706995"},{"key":"ref21","author":"koller","year":"2009","journal-title":"Probabilistic Graphical Models Principles and Techniques - Adaptive Computation and Machine Learning"},{"key":"ref24","article-title":"Omniscience and secrecy","author":"narayan","year":"0","journal-title":"Plenary Talk IEEE International Symposium on Information Theory"},{"key":"ref23","author":"mackay","year":"2002","journal-title":"Information Theory Inference & Learning Algorithms"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081450"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1561\/0100000072"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834365.pdf?arnumber=9834365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:57Z","timestamp":1773347757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834365\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834365","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}