{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T10:14:55Z","timestamp":1779272095795,"version":"3.51.4"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tit.2024.3461361","type":"journal-article","created":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T17:49:10Z","timestamp":1726508950000},"page":"592-617","source":"Crossref","is-referenced-by-count":6,"title":["Simple Binary Hypothesis Testing Under Local Differential Privacy and Communication Constraints"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3509-1224","authenticated-orcid":false,"given":"Ankit","family":"Pensia","sequence":"first","affiliation":[{"name":"Simons Institute for the Theory of Computing, UC Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3436-3307","authenticated-orcid":false,"given":"Amir R.","family":"Asadi","sequence":"additional","affiliation":[{"name":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4159-0900","authenticated-orcid":false,"given":"Varun","family":"Jog","sequence":"additional","affiliation":[{"name":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6514-7834","authenticated-orcid":false,"given":"Po-Ling","family":"Loh","sequence":"additional","affiliation":[{"name":"Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3461361"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1561\/9781601988195"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3334024"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1933.0009"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731118"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4946-7"},{"key":"ref7","first-page":"1","article-title":"Extremal mechanisms for local differential privacy","volume":"17","author":"Kairouz","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_13"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132769"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00096"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123905"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3059338"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3397305"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00015"},{"key":"ref16","first-page":"297","article-title":"Decentralized detection","volume-title":"Advances in Statistical Signal Processing","author":"Tsitsiklis","year":"1993"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC51858.2021.9593264"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054536"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057250"},{"key":"ref21","first-page":"24593","article-title":"Pointwise bounds for distribution estimation under communication constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"34","author":"Chen"},{"issue":"1","key":"ref22","first-page":"9583","article-title":"Lower bounds for learning distributions under communication constraints via Fisher information","volume":"21","author":"Barnes","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028440"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028439"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053569"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055229"},{"key":"ref27","article-title":"Optimality guarantees for distributed statistical estimation","volume":"abs\/1405.0782","author":"Duchi","year":"2014","journal-title":"CoRR"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"ref29","first-page":"1161","article-title":"Lower bounds for locally private estimation via communication complexity","volume-title":"Proc. 32nd Annu. Conf. Learn. Theory (COLT)","author":"Duchi"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3039461"},{"key":"ref31","first-page":"5061","article-title":"Streaming algorithms for high-dimensional robust statistics","volume-title":"Proc. 39th Int. Conf. Mach. Learn. (ICML)","author":"Diakonikolas"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697590"},{"key":"ref33","first-page":"289","article-title":"A review of recent results on learning with finite memory","volume-title":"Proc. Int. Symp. Inf. Theory (ISIT)","author":"Hellman"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693334"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174505"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00106"},{"key":"ref37","article-title":"Decentralized estimation and decision theory","volume-title":"Proc. IEEE Seven Springs Workshop Inf. Theory","author":"Berger"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057194"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.720540"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551407"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006634"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2779108"},{"key":"ref43","first-page":"4605","article-title":"Locally private hypothesis testing","volume-title":"Proc. 35th Int. Conf. Mach. Learn. (ICML)","author":"Sheffet"},{"key":"ref44","first-page":"1785","article-title":"Locally private hypothesis selection","volume-title":"Proc. 33rd Annu. Conf. Learn. Theory (COLT)","author":"Gopi"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.08.011"},{"key":"ref46","first-page":"27131","article-title":"Deep learning with label differential privacy","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"34","author":"Ghazi"},{"key":"ref47","first-page":"1046","article-title":"Optimal algorithms for mean estimation under local differential privacy","volume-title":"Proc. 39th Int. Conf. Mach. Learn. (ICML)","author":"Asi"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316336"},{"key":"ref49","first-page":"156","article-title":"Private hypothesis selection","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"32","author":"Bun"},{"key":"ref50","first-page":"4205","article-title":"The sample complexity of simple binary hypothesis testing","volume-title":"Proc. 37th Conf. Learn. Theory","volume":"247","author":"Pensia"},{"key":"ref51","volume-title":"Introduction To Linear Optimization","author":"Bertsimas","year":"1997"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.2307\/2283137"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978308"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619506"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834363"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10816277\/10680565.pdf?arnumber=10680565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T06:52:35Z","timestamp":1735195955000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10680565\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":57,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3461361","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}