{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:42Z","timestamp":1773377082906,"version":"3.50.1"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"SERB, India","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/Y028732\/1"],"award-info":[{"award-number":["EP\/Y028732\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195450","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["A Simple Low Complexity Locally Private Compression Scheme"],"prefix":"10.1109","author":[{"given":"Sidharth","family":"Jaggi","sequence":"first","affiliation":[{"name":"University of Bristol,Bristol,UK"}]},{"given":"Shashank","family":"Vatedka","sequence":"additional","affiliation":[{"name":"IIT Hyderabad,Sangareddy,Telangana,India"}]},{"given":"Venkat","family":"Chandar","sequence":"additional","affiliation":[{"name":"DE Shaw,New York,USA"}]},{"given":"Aslan","family":"Tchamkerten","sequence":"additional","affiliation":[{"name":"Institut Polytechnique de Paris,Palaiseau,France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7249014"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394919"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437931"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2804441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173968"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2999909"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3240187"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206999"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619338"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054929"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195450.pdf?arnumber=11195450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:35Z","timestamp":1773347435000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195450\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195450","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}