{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:49:54Z","timestamp":1777614594236,"version":"3.51.4"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"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 J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/jsait.2023.3245417","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T21:06:55Z","timestamp":1676668015000},"page":"605-615","source":"Crossref","is-referenced-by-count":2,"title":["Compressing Multisets With Large Alphabets"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0472-5300","authenticated-orcid":false,"given":"Daniel","family":"Severo","sequence":"first","affiliation":[{"name":"Meta AI, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Townsend","sequence":"additional","affiliation":[{"name":"Amsterdam Machine Learning Lab, University of Amsterdam, Amsterdam, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2331-8965","authenticated-orcid":false,"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Makhzani","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karen","family":"Ullrich","sequence":"additional","affiliation":[{"name":"Meta AI, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2392093"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404756"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1967.5493"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2011.12"},{"key":"ref11","first-page":"2866","article-title":"Minimax compression and large alphabet approximation through poissonization and tilting","volume":"63","author":"yang","year":"2017","journal-title":"IEEE Trans Inf Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875285"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2016.77"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2006.78"},{"key":"ref17","article-title":"Lossless compression with latent variable models","author":"townsend","year":"2021","journal-title":"arXiv 2104 10544"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413447"},{"key":"ref19","article-title":"Interleaved entropy coders","author":"giesen","year":"2014","journal-title":"arXiv 1402 3392"},{"key":"ref18","article-title":"A tutorial on the range variant of asymmetric numeral systems","author":"townsend","year":"2020","journal-title":"arXiv 2001 09186"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380240306"},{"key":"ref23","first-page":"9136","article-title":"Improving lossless compression rates via Monte Carlo bits-back coding","author":"ruan","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","author":"knuth","year":"1998","journal-title":"The Art of Computer Programming Volume 3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199906)29:7<647::AID-SPE252>3.3.CO;2-X"},{"key":"ref20","first-page":"1","article-title":"Bit-swap: Recursive bits-back coding for lossless compression with hierarchical latent variables","author":"kingma","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","first-page":"1","article-title":"Lossless compression with state space models using bits back coding","author":"townsend","year":"2021","journal-title":"Proc Neural Compression Inf Theory Appl Workshop (ICLR)"},{"key":"ref21","first-page":"1","article-title":"HiLLoC: Lossless image compression with hierarchical latent variable models","author":"townsend","year":"2020","journal-title":"Proc Int Conf Learn Rep (ICLR)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"ref27","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"adelson-velsky","year":"1962","journal-title":"Soviet Math Doklady"},{"key":"ref8","article-title":"Asymmetric numeral systems","author":"duda","year":"2009","journal-title":"arXiv 0902 0271"},{"key":"ref7","first-page":"1","article-title":"Practical lossless compression with latent variables using bits back coding","author":"townsend","year":"2019","journal-title":"Proc Int Conf Learn Rep (ICLR)"},{"key":"ref9","article-title":"Lossless data compression","author":"steinruecken","year":"2014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DCC52660.2022.00040"},{"key":"ref3","first-page":"4","article-title":"Your dataset is a multiset and you should compress it like one","author":"severo","year":"2021","journal-title":"Proc NeurIPS Workshop Deep Gener Models Downstream Appl"},{"key":"ref6","article-title":"Bayesian networks for pattern classification, data compression, and channel coding","author":"frey","year":"1997"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1996.488312"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10153453\/10048500.pdf?arnumber=10048500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T18:36:45Z","timestamp":1688409405000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10048500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":28,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2023.3245417","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}