{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:45Z","timestamp":1773377985828,"version":"3.50.1"},"reference-count":23,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834412","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"67-72","source":"Crossref","is-referenced-by-count":0,"title":["Universal Compression of Large Alphabets with Constrained Compressors"],"prefix":"10.1109","author":[{"given":"Hao","family":"Lou","sequence":"first","affiliation":[{"name":"University of Virginia,Electrical and Computer Engineering,VA,USA"}]},{"given":"Farzad","family":"Farnoud","sequence":"additional","affiliation":[{"name":"University of Virginia,Electrical and Computer Engineering,VA,USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/e11040634"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008150"},{"key":"ref12","first-page":"111","article-title":"Sparse indexing: Large scale, inline deduplication using sampling and locality","volume":"9","author":"lillibridge","year":"2009","journal-title":"FAST"},{"key":"ref13","first-page":"269","article-title":"Avoiding the disk bottleneck in the data domain deduplication file system","volume":"8","author":"zhu","year":"2008","journal-title":"FAST"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/502059.502052"},{"key":"ref15","first-page":"89","article-title":"Venti: A new approach to archival storage","volume":"2","author":"quinlan","year":"2002","journal-title":"FAST"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916037"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2016.2571298"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174380"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517909"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056936"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834734"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830761"},{"key":"ref5","first-page":"559","article-title":"coding of discrete sources with unknown statistics","author":"shtarkov","year":"1977","journal-title":"Topics in Information Theory"},{"key":"ref8","first-page":"3257","article-title":"Tight bounds on profile redundancy and distinguishability","volume":"2","author":"acharya","year":"2012","journal-title":"Proceedings of the 25th International Conference on Neural Information Processing Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883609"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.872846"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2195769"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620751"},{"key":"ref20","article-title":"Data deduplication with random substitutions","author":"lou","year":"0","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref22","article-title":"An introduction to probability theory and its applications","author":"feller","year":"1957"},{"key":"ref21","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtar\u2019kov","year":"1987","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80045-1"}],"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\/09834412.pdf?arnumber=9834412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:47Z","timestamp":1773347747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834412\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834412","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}