{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:10Z","timestamp":1773377590222,"version":"3.50.1"},"reference-count":10,"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.8849330","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2159-2163","source":"Crossref","is-referenced-by-count":19,"title":["Optimal Privacy-Utility Trade-off under a Rate Constraint"],"prefix":"10.1109","author":[{"given":"Sreejith","family":"Sreekumar","sequence":"first","affiliation":[{"name":"Dept. of Electrical and Electronic Engineering, Imperial College, London"}]},{"given":"Deniz","family":"G\u00fcnd\u00fcz","sequence":"additional","affiliation":[{"name":"Dept. of Electrical and Electronic Engineering, Imperial College, London"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282765"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970882"},{"key":"ref10","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11787006_1","article-title":"Differential privacy","volume":"4052","author":"dwork","year":"2006","journal-title":"Automata Languages and Programming"},{"key":"ref5","article-title":"On perfect privacy and maximal correlation","author":"rassouli","year":"0","journal-title":"arXiv 1712 08500 [cs IT]"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613451"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055437"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref1","article-title":"The information bottleneck method","author":"tishby","year":"2000","journal-title":"Arxiv Preprint Physics\/0004057"}],"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\/08849330.pdf?arnumber=8849330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:30Z","timestamp":1773347670000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849330\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849330","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}