Compression of individual sequences via variable-rate coding
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Compressibility of individual sequences by the class of generalized finite-state information-lossless encoders is investigated. These encoders can operate in a variable-rate mode as well as a fixed-rate one, and they allow for any finite-state scheme of variable-length-to-variable-length coding. For every individual infinite sequencexa quantity\rho(x)is defined, called the compressibility ofx, which is shown to be the asymptotically attainable lower bound on the compression ratio that can be achieved forxby any finite-state encoder. This is demonstrated by means of a constructive coding theorem and its converse that, apart from their asymptotic significance, also provide useful performance criteria for finite and practical data-compression tasks. The proposed concept of compressibility is also shown to play a role analogous to that of entropy in classical information theory where one deals with probabilistic ensembles of sequences rather than with individual sequences. While the definition of\rho(x)allows a different machine for each different sequence to be compressed, the constructive coding theorem leads to a universal algorithm that is asymptotically optimal for all sequences.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“While these sequence prediction algorithms are able to predict the next activity that occurs in a sequence, they do not provide information about when that activity might occur.”
From Forecasting occurrences of activities (2017) · cites this paper as [3]
Citations
Cites
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Self-citationInformation Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
On the Complexity of Finite Sequences
Lempel, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055501 · Cited by 2,717
Self-citationCoding theorems for individual sequences
Ziv, J. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055911 · Cited by 180
Self-citationOn Information Lossless Automata of Finite Order
Even, S. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.263996 · Cited by 76
Generalized automata and their information losslessness
Even, S. (1962) · Annual Symposium on Switching Circuit Theory and Logical Design (SWCT) · doi:10.1109/focs.1962.6 · Cited by 13
Cited by
Items 101–200 of 1,003
A search for good pseudo-random number generators: Survey and empirical studies
Bhattacharjee, K., & Das, S. K. (2022) · Computer Science Review · doi:10.1016/j.cosrev.2022.100471 · Cited by 174
Moffat, A. (1989) · Software: Practice and Experience · doi:10.1002/spe.4380190207 · Cited by 172
Algorithms and Data Structures for External Memory
Vitter, J. S. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601981073 · Cited by 172
Yu, F. R., & Leung, V. C. M. (2002) · Computer Networks · doi:10.1016/s1389-1286(01)00269-9 · Cited by 172
The context-tree weighting method: extensions
Willems, F. M. J. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661523 · Cited by 172
The Entropy of Words—Learnability and Expressivity across More than 1000 Languages
Bentz, C., Alikaniotis, D., Cysouw, M., & Ferrer‐i‐Cancho, R. (2017) · Entropy · doi:10.3390/e19060275 · Cited by 171
Zenil, H., Hernández-Orozco, S., Kiani, N. A., Toscano, F. S., Rueda-Toicen, A., & Tegner, J. N. (2018) · Entropy · doi:10.3390/e20080605 · Cited by 171
Practical Implementations of Arithmetic Coding
Howard, P. G., & Vitter, J. S. (1992) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-1-4615-3596-6_4 · Cited by 169
SCALCE: boosting sequence compression algorithms using locally consistent encoding
Hach, F., Numanagić, I., Alkan, C., & Şahinalp, S. C. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts593 · Cited by 169
Analytical depoissonization and its applications
Jacquet, P., & Szpankowski, W. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00167-9 · Cited by 168
Delta algorithms: an empirical analysis
Hunt, J. J., Vo, K.-P., & Tichy, W. F. (1998) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/279310.279321 · Cited by 168
Brotli: A General-Purpose Data Compressor
Alakuijala, J., Farruggia, A., Ferragina, P., Kliuchnikov, E., Obryk, R., Szabadka, Z., & Vandevenne, L. (2018) · ACM Transactions on Information Systems · doi:10.1145/3231935 · Cited by 164
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
Crochemore, M., Landau, G. M., & Ziv-Ukelson, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702402007 · Cited by 164
Data compression and database performance
Graefe, G., & Shapiro, L. D. (2002) · ACM Symposium on Applied Computing · doi:10.1109/soac.1991.143840 · Cited by 163
Information entropy of humpback whale songs
Suzuki, R., Buck, J. R., & Tyack, P. L. (2006) · The Journal of the Acoustical Society of America · doi:10.1121/1.2161827 · Cited by 162
When is the generalized likelihood ratio test optimal?
Zeitouni, O., Ziv, J., & Merhav, N. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.149515 · Cited by 162
Self-citationEstimating the Entropy Rate of Spike Trains via Lempel-Ziv Complexity
Amigó, J. M., Szczepański, J., Wajnryb, E., & Sanchez-Vives, M. V. (2004) · Neural Computation · doi:10.1162/089976604322860677 · Cited by 160
Ernst, J., Evans, W., Fraser, C. W., Proebsting, T. A., & Lucco, S. E. (1997) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/258915.258947 · Cited by 160
Mining GPS data for mobility patterns: A survey
Lin, M., & Hsu, W.-J. (2014) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2013.06.005 · Cited by 158
Improved Methods for Statistical Modelling of Monophonic Music
Pearce, M. T., & Wiggins, G. A. (2004) · Journal of New Music Research · doi:10.1080/0929821052000343840 · Cited by 158
Using machine-learning methods for musical style modeling
Dubnov, S., Assayag, G., Lartillot, O., & Bejerano, G. (2003) · Computer · doi:10.1109/mc.2003.1236474 · Cited by 157
A Field Guide to Federated Optimization
Wang, J., Charles, Z., Xu, Z., Joshi, G., McMahan, H. B., y Arcas, B. A., Al-Shedivat, M., Andrew, G., Avestimehr, S., Daly, K., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.06917 · Cited by 155
Using Factor Oracles for Machine Improvisation
Assayag, G., & Dubnov, S. (2004) · Soft Computing · doi:10.1007/s00500-004-0385-4 · Cited by 155
High-throughput mapping of a whole rhesus monkey brain at micrometer resolution
Xu, F., Shen, Y. X., Ding, L., Yang, C., Tan, H., Wang, H., Zhu, Q., Xu, R., Wu, F., Xiao, Y., et al. (2021) · Nature Biotechnology · doi:10.1038/s41587-021-00986-5 · Cited by 152
Urban Human Mobility: Data-Driven Modeling and Prediction
Wang, J., Kong, X., Xia, F., & Sun, L. (2019) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3331651.3331653 · Cited by 151
On classification with empirically observed statistics and universal data compression
Ziv, J. (1988) · IEEE Transactions on Information Theory · doi:10.1109/18.2636 · Cited by 150
Self-citationVariable-length Codes for Data Compression
Salomon, D. (2007) · Springer eBooks · doi:10.1007/978-1-84628-959-0 · Cited by 149
Estimating the Entropy of Binary Time Series: Methodology, Some Theory and a Simulation Study
Gao, Y., Kontoyiannis, I., & Bienenstock, E. (2008) · Entropy · doi:10.3390/entropy-e10020071 · Cited by 148
Optimal prefetching via data compression
Vitter, J. S., & Krishnan, P. (1996) · Journal of the ACM · doi:10.1145/234752.234753 · Cited by 148
Squeezing succinct data structures into entropy bounds
Sadakane, K., & Grossi, R. (2006) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1145/1109557.1109693 · Cited by 146
Measuring linguistic complexity: The morphological tier
Juola, P. (1998) · Journal of Quantitative Linguistics · doi:10.1080/09296179808590128 · Cited by 146
Online Sequential Prediction via Incremental Parsing: The Active LeZi Algorithm
Gopalratnam, K., & Cook, D. (2007) · IEEE Intelligent Systems · doi:10.1109/mis.2007.15 · Cited by 143
“d(1) c(1) d(1) c(1) b(1) c(1) b(4) a(3) b(3) a(5) Λ”
A Multi-agent Approach to Controlling a Smart Environment
Cook, D. J., Youngblood, G. M., & Das, S. K. (2006) · Lecture notes in computer science · doi:10.1007/11788485_10 · Cited by 143
Boosting textual compression in optimal linear time
Ferragina, P., Giancarlo, R., Manzini, G., & Sciortino, M. (2005) · Journal of the ACM · doi:10.1145/1082036.1082043 · Cited by 143
The Data Compression Book, 2nd Edition
Nelson, M., & Gailly, J.-L. (1996) · Cited by 143
Mobility prediction-based smartphone energy optimization for everyday location monitoring
Chon, Y., Talipov, E., Shin, H., & Cha, H. (2011) · Proceedings of the 9th ACM Conference on Embedded Networked Sensor Systems · doi:10.1145/2070942.2070952 · Cited by 142
Survey on Prediction Algorithms in Smart Homes
Wu, S., Rendall, J. B., Smith, M. J., Zhu, S., Xu, J., Wang, H., Yang, Q. B., & Qin, P. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2668061 · Cited by 138
Interaction between record matching and data repairing
Fan, W., Li, J., Ma, S., Tang, N., & Yu, W. (2011) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1989323.1989373 · Cited by 138
Universal decoding for finite-state channels
Ziv, J. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057068 · Cited by 138
Self-citationCloud-based adaptive compression and secure management services for 3D healthcare data
Castiglione, A., Pizzolante, R., Santis, A. D., Carpentieri, B., Castiglione, A., & Palmieri, F. (2014) · Future Generation Computer Systems · doi:10.1016/j.future.2014.07.001 · Cited by 136
A tree-structured adaptive network for function approximation in high-dimensional spaces
Sanger, T. D. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80339 · Cited by 135
Effective Strong Dimension in Algorithmic Information and Computational Complexity
Athreya, K. B., Hitchcock, J. M., Lutz, J. H., & Mayordomo, E. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539703446912 · Cited by 135
2022 Review of Data-Driven Plasma Science
Anirudh, R., Archibald, R. K., Asif, M. S., Becker, M. M., Benkadda, S., Bremer, P., Budé, R. H. S., Chang, C. S., Chen, L., Churchill, R. M., et al. (2023) · IEEE Transactions on Plasma Science · doi:10.1109/tps.2023.3268170 · Cited by 132
A simple storage scheme for strings achieving entropy bounds
Ferragina, P., & Venturini, R. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2006.12.012 · Cited by 132
On the estimation of the order of a Markov chain and universal data compression
Merhav, N., Gutman, M., & Ziv, J. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.42210 · Cited by 132
Self-citationDeep Architectures for Image Compression: A Critical Review
Mishra, D., Singh, S. K., & Singh, R. K. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108346 · Cited by 131
Ferragina, P., Manzini, G., Mäkinen, V., & Navarro, G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30213-1_23 · Cited by 131
Unbounded length contexts for PPM
Cleary, J. G., Teahan, W. J., & Witten, I. H. (2002) · Proceedings DCC '95 Data Compression Conference · doi:10.1109/dcc.1995.515495 · Cited by 130
Indexing text using the Ziv–Lempel trie
Navarro, G. (2004) · Journal of Discrete Algorithms · doi:10.1016/s1570-8667(03)00066-2 · Cited by 130
Parallel Huffman Decoding with Applications to JPEG Files
Klein, S. T. (2003) · The Computer Journal · doi:10.1093/comjnl/46.5.487 · Cited by 130
Metrics for characterizing the form of security policies
Goel, S., & Chengalur-Smith, I. N. (2010) · The Journal of Strategic Information Systems · doi:10.1016/j.jsis.2010.10.002 · Cited by 129
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
Kosaraju, S. R., & Manzini, G. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539797331105 · Cited by 129
Introduction to Arithmetic Coding -- Theory and PracticePreprint
Said, A. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2302.00819 · Cited by 129
Unsupervised Language Acquisition
de Marcken, C. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9611002 · Cited by 126
On the performance of wide-area thin-client computing
Lai, A. M., & Nieh, J. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1132026.1132029 · Cited by 126
An extremely fast Ziv-Lempel data compression algorithm
Williams, R. N. (2002) · DCC · doi:10.1109/dcc.1991.213344 · Cited by 124
Universal lossless compression via multilevel pattern matching
Kieffer, J. C., Yang, E., Nelson, G. J., & Cosman, P. C. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850665 · Cited by 124
Compressing Volumetric Radiance Fields to 1 MB
Li, L., Shen, Z., Wang, Z., Shen, L., & Bo, L. (2023) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52729.2023.00411 · Cited by 123
Information and Complexity Measures in Dynamical Systems
Grassberger, P. (1991) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4899-2305-9_2 · Cited by 123
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
Jacquet, P., & Szpankowski, W. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00298-w · Cited by 123
Interval and recency rank source coding: Two on-line adaptive variable-length schemes
Eliaš, P. (1987) · IEEE Transactions on Information Theory · doi:10.1109/tit.1987.1057251 · Cited by 123
Universal Schemes for Prediction, Gambling and Portfolio Selection
Algoet, P. (1992) · The Annals of Probability · doi:10.1214/aop/1176989811 · Cited by 121
Error Analysis of ZFP Compression for Floating-Point Data
Diffenderfer, J., Fox, A., Hittinger, J., Sanders, G., & Lindström, P. (2019) · SIAM Journal on Scientific Computing · doi:10.1137/18m1168832 · Cited by 120
In-memory database acceleration on FPGAs: a survey
Fang, J., Mulder, Y. T. B., Hidders, J., Lee, J., & Hofstee, H. P. (2019) · The VLDB Journal · doi:10.1007/s00778-019-00581-w · Cited by 118
Using artificial intelligence techniques for COVID-19 genome analysis
Nawaz, M. S., Fournier‐Viger, P., Shojaee, A., & Fujita, H. (2021) · Applied Intelligence · doi:10.1007/s10489-021-02193-w · Cited by 118
Mobility prediction clustering algorithm for UAV networking
Zang, C., & Zang, S. (2011) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2011.6162360 · Cited by 118
Fast and Compact Web Graph Representations
Claude, F., & Navarro, G. (2010) · ACM Transactions on the Web · doi:10.1145/1841909.1841913 · Cited by 118
Lossless compression of continuous-tone images
Carpentieri, B., Weinberger, M. J., & Seroussi, G. (2000) · Proceedings of the IEEE · doi:10.1109/5.892715 · Cited by 118
Data Compression Support in Databases
Iyer, B. R., & Wilhite, D. C. (1994) · Very Large Data Bases · Cited by 117
Universal lossless source coding with the Burrows Wheeler transform
Effros, M., Visweswariah, K., Kulkarni, S. R., & Verdú, S. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.995542 · Cited by 117
Estimating the information content of symbol sequences and efficient codes
Grassberger, P. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.30993 · Cited by 116
Quantifying Hidden Order out of Equilibrium
Martiniani, S., Chaikin, P. M., & Levine, D. (2019) · Physical Review X · doi:10.1103/physrevx.9.011031 · Cited by 116
Estimating Entropy Rates with Bayesian Confidence Intervals
Kennel, M. B., Shlens, J., Abarbanel, H. D. I., & Chichilnisky, E. J. (2005) · Neural Computation · doi:10.1162/0899766053723050 · Cited by 115
A Compression Algorithm for DNA Sequences and Its Applications in Genome Comparison.
Chen, X., Kwong, S., & Li, M. (1999) · PubMed · Cited by 115
Design and Implementation of a Predictive File Prefetching Algorithm
Kroeger, T. M., & Long, D. D. E. (2001) · eScholarship (California Digital Library) · Cited by 115
Yang, E., & Kieffer, J. C. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841161 · Cited by 114
Robust universal complete codes for transmission and compression
Fraenkel, A. S., & Klein, S. T. (1996) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)00116-h · Cited by 114
Collage system: a unifying framework for compressed pattern matching
Kida, T., Matsumoto, T., Shibata, Y., Takeda, M., Shinohara, A., & Arikawa, S. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00426-7 · Cited by 114
Textual data compression in computational biology: a synopsis
Giancarlo, R., Scaturro, D., & Utro, F. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp117 · Cited by 113
A simple storage scheme for strings achieving entropy bounds
Ferragina, P., & Venturini, R. (2006) · UnipiEprints Open Archive (Università di Pisa) · Cited by 112
Amigó, J. M., Kennel, M. B., & Kocarev, L. (2005) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2005.07.006 · Cited by 112
Bas, T. P. L., & Huvenne, V. A. I. (2008) · Applied Acoustics · doi:10.1016/j.apacoust.2008.07.010 · Cited by 112
Configuration Compression for Virtex FPGAs
Li, Z., & Hauck, S. (2001) · doi:10.1109/fccm.2001.19 · Cited by 111
On the performance of data compression algorithms based upon string matching
Yang, E., & Kieffer, J. C. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.650987 · Cited by 111
Universal Deep Neural Network Compression
Choi, Y., El‐Khamy, M., & Lee, J. (2020) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2020.2975903 · Cited by 110
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
Navarro, G., & Raffinot, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48452-3_2 · Cited by 110
On delayed prediction of individual sequences
Weinberger, M. J., & Ordentlich, E. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013136 · Cited by 109
Health Monitoring and Assistance to Support Aging in Place
Cook, D. J. (2006) · JUCS - Journal of Universal Computer Science · doi:10.3217/jucs-012-01-0015 · Cited by 108
Context‐based Space Filling Curves
Dafner, R., Cohen‐Or, D., & Matias, Y. (2000) · Computer Graphics Forum · doi:10.1111/1467-8659.00413 · Cited by 108
A compression algorithm for DNA sequences
Chen, X., Kwong, S., & Li, M. (2001) · IEEE Engineering in Medicine and Biology Magazine · doi:10.1109/51.940049 · Cited by 108
A suboptimal lossy data compression based on approximate pattern matching
Łuczak, T., & Szpankowski, W. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.623143 · Cited by 108
Ddelta: A deduplication-inspired fast delta compression approach
Xia, W., Jiang, H., Feng, D., Tian, L., Fu, M., & Zhou, Y. (2014) · Performance Evaluation · doi:10.1016/j.peva.2014.07.016 · Cited by 107
Off-line compression by greedy textual substitution
Apostolico, A., & Lonardi, S. (2000) · Proceedings of the IEEE · doi:10.1109/5.892709 · Cited by 107
Self-Indexed Grammar-Based Compression
Claude, F., & Navarro, G. (2011) · Fundamenta Informaticae · doi:10.3233/fi-2011-565 · Cited by 106
Dai, J. J., Lathrop, J. I., Lutz, J. H., & Mayordomo, E. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(03)00244-5 · Cited by 106
An Alternative to NCD for Large Sequences, Lempel-Ziv Jaccard Distance
Raff, E., & Nicholas, C. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098111 · Cited by 105
Yang, E., & He, D. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.818411 · Cited by 105
Approximation algorithms for grammar-based compression
Lehman, E., & Shelat, A. A. (2002) · Symposium on Discrete Algorithms · doi:10.5555/545381.545407 · Cited by 105
Source coding, large deviations, and approximate pattern matching
Dembo, A., & Kontoyiannis, L. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003841 · Cited by 105
Xia, W., Pu, L., Zou, X., Shilane, P., Li, S., Zhang, H., & Wang, X. (2023) · ACM Transactions on Storage · doi:10.1145/3584663 · Cited by 104
Metadata
- Authors
- Ziv, J., & Lempel, A.
- Affiliations
- AT&T (United States) (US)
- Technion – Israel Institute of Technology (IL)
- Venue
- IEEE Transactions on Information Theory
- Published
- 1978-09
- Volume
- 24
- Issue
- 5
- Pages
- 530-536
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2122962290
- Cited by
- 3,432
- References
- 7
- Citations by year
- 2026: 53 · 2025: 79 · 2024: 76 · 2023: 74 · 2022: 72 · 2021: 106 · 2020: 122 · 2019: 137 · 2018: 92 · 2017: 121 · 2016: 102 · 2015: 108 · 2014: 150 · 2013: 144 · 2012: 136
- FWCI
- 2.08
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Data Compression Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Keywords
- variable-rate coding, compressibility, universal compression
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.