{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T21:49:26Z","timestamp":1775684966807,"version":"3.50.1"},"reference-count":21,"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\/501100000735","name":"University of Cambridge","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000735","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.9834363","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3297-3302","source":"Crossref","is-referenced-by-count":3,"title":["Simple Binary Hypothesis Testing under Communication Constraints"],"prefix":"10.1109","author":[{"given":"Ankit","family":"Pensia","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison"}]},{"given":"Po-Ling","family":"Loh","sequence":"additional","affiliation":[{"name":"University of Cambridge"}]},{"given":"Varun","family":"Jog","sequence":"additional","affiliation":[{"name":"University of Cambridge"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3108952"},{"key":"ref12","first-page":"289","article-title":"On the problem of the most efficient tests of statistical hypotheses","volume":"231","author":"neyman","year":"1933","journal-title":"Philosophical Transactions of the Royal Society of London Series A Containing Papers of a Mathematical or Physical Character"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731118"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176342363"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4946-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/e20050383"},{"key":"ref17","article-title":"The structure of optimal private tests for simple hypotheses","author":"canonne","year":"2018"},{"key":"ref18","article-title":"Robust hypothesis testing and distribution estimation in hellinger distance","author":"suresh","year":"2021","journal-title":"The 24th International Conference on Artificial Intelligence and Statistics AISTATS 2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2006.10.027"},{"key":"ref4","first-page":"1490","article-title":"Memory, communication, and statistical queries","volume":"49","author":"steinhardt","year":"0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref6","first-page":"1145","article-title":"Detecting correlations with little memory and communication","volume":"75","author":"dagan","year":"2018","journal-title":"Conference on Learning Theory COLT 2018 Stockholm Sweden 6 - 9 July 2018"},{"key":"ref5","article-title":"A general characterization of the statistical query complexity","author":"feldman","year":"2017","journal-title":"Conference on Learning Theory COLT 2017"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3108952"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref1","first-page":"297","article-title":"Decentralized detection","author":"tsitsiklis","year":"1993","journal-title":"Advances in Statistical Signal Processing"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028440"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133079"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551407"}],"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\/09834363.pdf?arnumber=9834363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:16Z","timestamp":1773347776000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834363","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}