{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:16:38Z","timestamp":1763644598991,"version":"3.40.4"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["1641\/21","1766\/22"],"award-info":[{"award-number":["1641\/21","1766\/22"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tit.2025.3547871","type":"journal-article","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T18:45:44Z","timestamp":1741113944000},"page":"3334-3349","source":"Crossref","is-referenced-by-count":1,"title":["Memory Complexity of Estimating Entropy and Mutual Information"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5174-5625","authenticated-orcid":false,"given":"Tomer","family":"Berg","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering—Systems, Tel Aviv University, Tel Aviv-Yafo, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5791-7923","authenticated-orcid":false,"given":"Or","family":"Ordentlich","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4321-0318","authenticated-orcid":false,"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering—Systems, Tel Aviv University, Tel Aviv-Yafo, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Estimating entropy of distributions in constant space","author":"Acharya","year":"2019","journal-title":"arXiv:1911.07976"},{"key":"ref2","article-title":"Estimation of entropy in constant space with improved sample complexity","author":"Aliakbarpour","year":"2022","journal-title":"arXiv:2205.09804"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057250"},{"key":"ref5","first-page":"566","article-title":"Deterministic finite-memory bias estimation","volume-title":"Proc. Conf. Learn. Theory","author":"Berg"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129117"},{"key":"ref7","first-page":"3506","article-title":"On the memory complexity of uniformity testing","volume-title":"Proc. Conf. Learn. Theory","author":"Berg"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697590"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177696958"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055081"},{"key":"ref11","first-page":"1564","article-title":"Minimax rates for memory-bounded sparse linear regression","volume-title":"Proc. Conf. Learn. Theory","author":"Steinhardt"},{"key":"ref12","first-page":"1490","article-title":"Memory, communication, and statistical queries","volume-title":"Proc. Conf. Learn. Theory","author":"Steinhardt"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3186563"},{"key":"ref14","first-page":"1145","article-title":"Detecting correlations with little memory and communication","volume-title":"Proc. Conf. Learn. Theory","author":"Dagan"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437851"},{"key":"ref16","first-page":"929","article-title":"Space lower bounds for linear prediction in the streaming model","volume-title":"Proc. Conf. Learn. Theory","author":"Dagan"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316403"},{"key":"ref18","first-page":"60","article-title":"Memory-sample lower bounds for learning parity with noise","volume-title":"Proc. 24th Int. Conf. Approximation Algorithms Combinat. Optim. Problems, APPROX 25th Int. Conf. Randomization Comput.","author":"Garg"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3334024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1104033"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780272"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.833360"},{"key":"ref24","first-page":"179","article-title":"A clt and tight lower bounds for estimating entropy","volume":"17","author":"Valiant","year":"2010","journal-title":"Electron. Colloq. Comput. Complex."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993727"},{"key":"ref26","first-page":"2157","article-title":"Estimating the unseen: Improved estimators for entropy and other properties","volume-title":"Proc. NIPS","volume":"26","author":"Valiant"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.81"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2412945"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2548468"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1140103.1140295"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597038"},{"key":"ref32","first-page":"251","article-title":"Space-efficient estimation of robust statistics and distribution testing","volume-title":"Proc. ICS","author":"Chien"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3481296"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934993"},{"key":"ref35","article-title":"Optimal bounds for approximate counting","author":"Nelson","year":"2020","journal-title":"arXiv:2010.02116"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10975818\/10909664.pdf?arnumber=10909664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:25:30Z","timestamp":1745558730000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10909664\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":37,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3547871","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}