{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:51:22Z","timestamp":1773377482085,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849821","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2704-2708","source":"Crossref","is-referenced-by-count":7,"title":["Fisher Information for Distributed Estimation under a Blackboard Communication Protocol"],"prefix":"10.1109","author":[{"given":"Leighton Pate","family":"Barnes","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, 94305"}]},{"given":"Yanjun","family":"Han","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, 94305"}]},{"given":"Ayfer","family":"\u00d6zg\u00fcr","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, 94305"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.2307\/3318681"},{"key":"ref11","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1895.0010"},{"key":"ref13","article-title":"Inference under Information Constraints I: Lower Bounds from Chi-Square Contraction","author":"acharya","year":"2018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162270"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437818"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref5","first-page":"2328","article-title":"Information-Theoretic Lower Bounds for Distributed Statistical Estimation with Communication Constraints","author":"zhang","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref8","author":"borovkov","year":"1998","journal-title":"Mathematical Statistics"},{"key":"ref7","first-page":"2726","article-title":"On communication cost of distributed statistical estimation and dimensionality","author":"garg","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref2","first-page":"1","article-title":"Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints","volume":"75","author":"han","year":"2018","journal-title":"Machine Learning Research"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635899"},{"key":"ref9","article-title":"Introduction to the non-asymptotic analysis of random matrices","author":"vershynin","year":"2010"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849821.pdf?arnumber=8849821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:59Z","timestamp":1773347639000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849821\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849821","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}