On the public citation graph

A unifying theory and improvements for existing approaches to text compression

0 signed · 59 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1951.tb01366.xopenalex-snapshot
Prediction and Entropy of Printed English
inferredcites →https://doi.org/10.1002/j.1538-7305.1959.tb01583.xopenalex-snapshot
Variable-Length Binary Encodings
inferredcites →https://doi.org/10.1007/978-1-4419-8726-6_10openalex-snapshot
Foretelling the Future by Adaptive Modeling
inferredcites →https://doi.org/10.1007/bf01936138openalex-snapshot
Compression of character strings by an adaptive dictionary
inferredcites →https://doi.org/10.1016/0020-0190(76)90071-5openalex-snapshot
An almost optimal algorithm for unbounded searching
inferredcites →https://doi.org/10.1016/0020-0190(84)90021-8openalex-snapshot
Algorithms for adaptive Huffman codes
inferredcites →https://doi.org/10.1016/0020-0271(73)90011-9openalex-snapshot
Selection of equifrequent word fragments for information retrieval
inferredcites →https://doi.org/10.1016/0020-0271(73)90089-2openalex-snapshot
Compression of bibliographic files using an adaptation of run-length coding
inferredcites →https://doi.org/10.1016/0196-6774(85)90036-7openalex-snapshot
Dynamic huffman coding
inferredcites →https://doi.org/10.1016/0306-4573(76)90041-8openalex-snapshot
A mathematical model for estimating the effectiveness of bigram coding
inferredcites →https://doi.org/10.1093/comjnl/18.2.157openalex-snapshot
Information compression by factorising common strings
inferredcites →https://doi.org/10.1093/comjnl/21.1.42openalex-snapshot
Recoding of natural language for economy of transmission or storage
inferredcites →https://doi.org/10.1093/comjnl/21.1.45openalex-snapshot
Text compression with an Associative Parallel Processor
inferredcites →https://doi.org/10.1093/comjnl/30.6.541openalex-snapshot
Data Compression Using Dynamic Markov Modelling
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/mc.1984.1659158openalex-snapshot
A Technique for High-Performance Data Compression
inferredcites →https://doi.org/10.1109/proc.1967.5496openalex-snapshot
Printed english compression by dictionary encoding
inferredcites →https://doi.org/10.1109/tcom.1983.1095765openalex-snapshot
A Double-Adaptive File Compression Algorithm
inferredcites →https://doi.org/10.1109/tcom.1984.1096090openalex-snapshot
Data Compression Using Adaptive Coding and Partial String Matching
inferredcites →https://doi.org/10.1109/tcom.1986.1096485openalex-snapshot
Better OPM/L Text Compression
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1109/tit.1976.1055501openalex-snapshot
On the Complexity of Finite Sequences
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1109/tit.1978.1055959openalex-snapshot
Variations on a theme by Huffman
inferredcites →https://doi.org/10.1109/tit.1980.1056143openalex-snapshot
A general minimum-redundancy source-coding algorithm
inferredcites →https://doi.org/10.1109/tit.1981.1056282openalex-snapshot
Universal modeling and coding
inferredcites →https://doi.org/10.1109/tit.1981.1056356openalex-snapshot
An efficient coding system for long source sequences
inferredcites →https://doi.org/10.1109/tit.1983.1056645openalex-snapshot
A note on the Ziv - Lempel model for compressing individual sequences (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1984.1056889openalex-snapshot
A comparison of enumerative and adaptive codes
inferredcites →https://doi.org/10.1109/tse.1980.234490openalex-snapshot
Overhead Storage Considerations and a Multilinear Method for Data File Compression
inferredcites →https://doi.org/10.1109/tse.1985.231852openalex-snapshot
Data Compression in Scientific and Statistical Databases
inferredcites →https://doi.org/10.1137/0121057openalex-snapshot
Optimal Computer Search Trees and Variable-Length Alphabetical Codes
inferredcites →https://doi.org/10.1145/1499949.1500038openalex-snapshot
A classification of compression methods and their usefulness for a large data processing center
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1145/3149.3152openalex-snapshot
Parallel algorithms for data compression
inferredcites →https://doi.org/10.1145/321088.321094openalex-snapshot
A Study of Methods for Systematically Abbreviating English Words and Names
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/322234.322237openalex-snapshot
Linear Algorithm for Data Compression via String Matching
inferredcites →https://doi.org/10.1145/322344.322346openalex-snapshot
Data compression via textual substitution
inferredcites →https://doi.org/10.1145/360363.360368openalex-snapshot
Experiments in text file compression
inferredcites →https://doi.org/10.1145/361082.361086openalex-snapshot
A new technique for compression and storage of data
inferredcites →https://doi.org/10.1145/361972.361982openalex-snapshot
Common phrases and minimum-space text storage
inferredcites →https://doi.org/10.1145/3812.3815openalex-snapshot
Data compression using static Huffman code-decode tables
inferredcites →https://doi.org/10.1145/5684.5688openalex-snapshot
A locally adaptive data compression scheme
inferredcites →https://doi.org/10.1147/rd.203.0198openalex-snapshot
Generalized Kraft Inequality and Arithmetic Coding
inferredcites →https://doi.org/10.1147/rd.232.0149openalex-snapshot
Arithmetic Coding
inferredcites →https://doi.org/10.6017/ital.v4i4.5595openalex-snapshot
An Algorithm for Compaction of Alphanumeric Data

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.4380190207openalex-snapshot
Word‐based text compression
inferred← citeshttps://doi.org/10.1002/spe.4380230705openalex-snapshot
Longest‐match string searching for ziv‐lempel compression
inferred← citeshttps://doi.org/10.1007/978-1-4615-3596-6_4openalex-snapshot
Practical Implementations of Arithmetic Coding
inferred← citeshttps://doi.org/10.1007/springerreference_64079openalex-snapshot
Indexing Compressed Text
inferred← citeshttps://doi.org/10.1109/access.2020.2974489openalex-snapshot
A Rolling Hash Algorithm and the Implementation to LZ4 Data Compression
inferred← citeshttps://doi.org/10.1109/dcc.1994.305930openalex-snapshot
A hybrid approach to text compression
inferred← citeshttps://doi.org/10.1109/nrsc.1998.711471openalex-snapshot
Data compression for Arabic text
inferred← citeshttps://doi.org/10.1145/179812.179892openalex-snapshot
The relationship between greedy parsing and symbolwise text compression
inferred← citeshttps://doi.org/10.1145/76894.76896openalex-snapshot
Modeling for text compression
inferred← citeshttps://doi.org/10.47749/t/unicamp.1991.37210openalex-snapshot
Metodos universais de compressão de dados
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.