{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:41:19Z","timestamp":1776886879767,"version":"3.51.2"},"reference-count":34,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195681","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["A Family of Lz78-Based Universal Sequential Probability Assignments"],"prefix":"10.1109","author":[{"given":"Naomi","family":"Sagan","sequence":"first","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}]},{"given":"Tsachy","family":"Weissman","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056645"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/18.133269"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.144706"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1491"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057068"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892782"},{"key":"ref9","volume-title":"On jacob ziv\u2019s individual-sequence approach to information theory,","author":"Merhav","year":"2024"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.312161"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.243445"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1971.1054638"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054738"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2006.54"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.243444"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/icpr.2010.940"},{"key":"ref20","article-title":"Measuring the structural similarity of semistructured documents using entropy,","volume-title":"Very Large Data Bases Conference","author":"Helmer"},{"issue":"6","key":"ref21","doi-asserted-by":"crossref","DOI":"10.3390\/e20060393","article-title":"Comparison of compression-based measures with application to the evolution of primate genomes,","volume":"20","author":"Pratas","year":"2018","journal-title":"Entropy"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.88.048702"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1023\/a:1013759724438"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2007.15"},{"key":"ref25","volume-title":"Language modeling is compression","author":"Del\u00e9tang","year":"2024"},{"key":"ref26","volume-title":"A family of lz78-based universal sequential probability assignments","author":"Sagan","year":"2024"},{"issue":"3","key":"ref27","first-page":"3","article-title":"Universal sequential coding of individual messages,","volume":"23","author":"Shtar\u2019 kov","year":"1987","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.21203\/rs.3.rs-6363017\/v1","volume-title":"Genomic data classification via universal compression","author":"Omri","year":"2025"},{"key":"ref29","volume-title":"char-RNN","author":"Karpathy","year":"2015"},{"key":"ref30","volume-title":"TinyStories: How small can language models be and still speak coherent English","author":"Eldan","year":"2023"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref32","volume-title":"Fashion-MNIST: a novel image dataset for benchmarking machine learning algorithms,","author":"Xiao","year":"2017"},{"key":"ref33","first-page":"142","article-title":"Learning word vectors for sentiment analysis,","volume-title":"Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies","author":"Maas","year":"2011"},{"key":"ref34","author":"Metsis","year":"2006","journal-title":"Spam filtering with naive Bayes - which naive Bayes?"}],"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\/11195681.pdf?arnumber=11195681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:13Z","timestamp":1773347413000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195681","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}