On the public citation graph

A universal prediction lemma and applications to universal data compression and prediction

0 signed · 21 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.1007/978-1-4615-2694-0_42openalex-snapshot
The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal
inferredcites →https://doi.org/10.1007/978-1-4615-8162-8_8openalex-snapshot
Basic Properties of Strong Mixing Conditions
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.650988openalex-snapshot
On sliding-window universal data compression with limited memory
inferredcites →https://doi.org/10.1109/5.286191openalex-snapshot
The sliding-window Lempel-Ziv algorithm is asymptotically optimal

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00180-007-0021-8openalex-snapshot
Using a VOM model for reconstructing potential coding regions in EST sequences
inferred← citeshttps://doi.org/10.1007/s10614-008-9153-3openalex-snapshot
Measuring the Efficiency of the Intraday Forex Market with a Universal Data Compression Algorithm
inferred← citeshttps://doi.org/10.1023/a:1026198216929openalex-snapshot
Using a Stochastic Complexity Measure to Check the Efficient Market Hypothesis
inferred← citeshttps://doi.org/10.1080/07408170802323018openalex-snapshot
A context tree method for multistage fault detection and isolation with applications to commercial video broadcasting systems
inferred← citeshttps://doi.org/10.1109/eeei.2000.924431openalex-snapshot
On sequential universal coding of sequences with limited amount of training data
inferred← citeshttps://doi.org/10.1109/eeei.2004.1361121openalex-snapshot
A VOM based gene-finder that specializes in short genes
inferred← citeshttps://doi.org/10.1109/icsssm.2009.5175016openalex-snapshot
Data stream clustering and modeling using context-trees
inferred← citeshttps://doi.org/10.1109/spawc.2014.6941726openalex-snapshot
On optimality of data clustering for packet-level memory-assisted compression of network traffic
inferred← citeshttps://doi.org/10.1109/tip.2013.2293429openalex-snapshot
Large Discriminative Structured Set Prediction Modeling With Max-Margin Markov Network for Lossless Image Coding
inferred← citeshttps://doi.org/10.1109/tit.2002.1003847openalex-snapshot
An efficient universal prediction algorithm for unknown sources with limited training data
inferred← citeshttps://doi.org/10.1109/tit.2007.909181openalex-snapshot
Classification With Finite Memory Revisited
inferred← citeshttps://doi.org/10.1109/tsp.2015.2458784openalex-snapshot
Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0407openalex-snapshot
A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection
inferred← citeshttps://doi.org/10.1515/1558-3708.1648openalex-snapshot
Predicting Stock Returns Using a Variable Order Markov Tree Model
inferred← citeshttps://doi.org/10.3233/ida-2006-10605openalex-snapshot
Analyzing a class of pseudo-random bit generator through inductive machine learning paradigm
inferred← citeshttps://doi.org/10.3233/jcm-2007-7103openalex-snapshot
Gene-finding with the VOM model
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.