On the public citation graph

The miraculous universal distribution

0 signed · 88 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-4612-4184-3openalex-snapshot
Philosophical Essay on Probabilities
inferredcites →https://doi.org/10.1007/978-1-4757-2606-0openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1016/0016-0032(52)90656-xopenalex-snapshot
A philosophical essay on probabilities
inferredcites →https://doi.org/10.1016/0020-0190(92)90138-lopenalex-snapshot
Average case complexity under the universal distribution equals worst-case complexity
inferredcites →https://doi.org/10.1017/cbo9780511620409.040openalex-snapshot
A Treatise of Human Nature
inferredcites →https://doi.org/10.1093/biomet/45.3-4.296openalex-snapshot
AN ESSAY TOWARDS SOLVING A PROBLEM IN THE DOCTRINE OF CHANCES
inferredcites →https://doi.org/10.1093/ia/25.2.247openalex-snapshot
‘History of Western Philosophy’
inferredcites →https://doi.org/10.1093/oseo/instance.00046224openalex-snapshot
The Life of Samuel Johnson, 1709–1765
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1112/plms/s2-43.6.544openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
inferredcites →https://doi.org/10.2307/2181652openalex-snapshot
A History of Western Philosophy.
inferredcites →https://doi.org/10.4324/9780203717943openalex-snapshot
History of Western Philosophy
inferredcites →https://doi.org/10.5479/sil.52126.39088015628399openalex-snapshot
Philosophiae naturalis principia mathematica

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118300442.ch3openalex-snapshot
An Algorithmic Information‐Theoretic Approach to the Behaviour of Financial Markets
inferred← citeshttps://doi.org/10.1002/cplx.20002openalex-snapshot
Genetically induced communication network fault tolerance
inferred← citeshttps://doi.org/10.1002/cplx.20004openalex-snapshot
Kolmogorov complexity estimates for detection of viruses in biologically inspired security systems: A comparison with traditional approaches
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_241openalex-snapshot
Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/3-540-36599-0_45openalex-snapshot
No Free Lunch, Program Induction and Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_315openalex-snapshot
Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4939-6883-1_700openalex-snapshot
Approximations to Algorithmic Probability
inferred← citeshttps://doi.org/10.1007/978-3-032-09176-5_4openalex-snapshot
Curious Coincidences and Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/978-3-0348-8677-2_3openalex-snapshot
Is Earthquake Seismology a Hard, Quantitative Science?
inferred← citeshttps://doi.org/10.1007/978-3-319-43784-2_7openalex-snapshot
The Information-Theoretic and Algorithmic Approach to Human, Animal, and Artificial Cognition
inferred← citeshttps://doi.org/10.1007/978-3-540-69403-8_18openalex-snapshot
Spam Filtering without Text Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_24openalex-snapshot
Genetic Programming — Introduction, Applications, Theory and Open Issues
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_2openalex-snapshot
Impugning Randomness, Convincingly
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_700-1openalex-snapshot
Approximations to Algorithmic Probability
inferred← citeshttps://doi.org/10.1007/978-3-642-41251-6_2openalex-snapshot
Induction and Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-44958-1_17openalex-snapshot
No Free Lunch versus Occam’s Razor in Supervised Learning
inferred← citeshttps://doi.org/10.1007/978-3-658-12153-2_22openalex-snapshot
Algorithmic Data Analytics, Small Data Matters and Correlation versus Causation
inferred← citeshttps://doi.org/10.1007/978-3-662-64985-5_1openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1007/978-3-662-64985-5_2openalex-snapshot
Enumerating and Simulating Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-662-64985-5_4openalex-snapshot
Theoretical Aspects of Finite Approximations to Levin’s Semi-measure
inferred← citeshttps://doi.org/10.1007/978-94-010-0041-3_1openalex-snapshot
Modeling earthquakes
inferred← citeshttps://doi.org/10.1007/s000240050264openalex-snapshot
Is Earthquake Seismology a Hard, Quantitative Science?
inferred← citeshttps://doi.org/10.1007/s10472-024-09932-yopenalex-snapshot
A category theory approach to the semiotics of machine learning
inferred← citeshttps://doi.org/10.1007/s10639-022-11407-8openalex-snapshot
How to help digital-native students to successfully take control of their learning: A return of 8 years of experience on a computer science e-learning platform in higher education
inferred← citeshttps://doi.org/10.1007/s11047-013-9363-zopenalex-snapshot
Turing patterns with Turing machines: emergence and low-level structure formation
inferred← citeshttps://doi.org/10.1007/s11191-012-9574-1openalex-snapshot
Does Science Presuppose Naturalism (or Anything at All)?
inferred← citeshttps://doi.org/10.1007/s11225-012-9375-1openalex-snapshot
Impugning Randomness, Convincingly
inferred← citeshttps://doi.org/10.1007/s11229-009-9542-8openalex-snapshot
Information theory, evolutionary computation, and Dembski’s “complex specified information”
inferred← citeshttps://doi.org/10.1016/b0-08-043076-7/00550-7openalex-snapshot
Algorithmic Complexity
inferred← citeshttps://doi.org/10.1016/j.amc.2011.10.006openalex-snapshot
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness
inferred← citeshttps://doi.org/10.1016/j.comnet.2013.07.028openalex-snapshot
Distribution-based anomaly detection via generalized likelihood ratio test: A general Maximum Entropy approach
inferred← citeshttps://doi.org/10.1016/j.physd.2023.133713openalex-snapshot
Multiclass classification utilising an estimated algorithmic probability prior
inferred← citeshttps://doi.org/10.1016/j.semcdb.2016.01.011openalex-snapshot
Methods of information theory and algorithmic complexity for network biology
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00034-5openalex-snapshot
Applying MDL to learn best model granularity
inferred← citeshttps://doi.org/10.1038/s41467-026-73289-5openalex-snapshot
SuperARC: a test for artificial superintelligence based on compressed modelling, recursive prediction and problem complexity
inferred← citeshttps://doi.org/10.1076/0929-6174(200008)07:02;1-z;ft129openalex-snapshot
Information Theory and Algorithmic Complexity: Applications to Linguistic Discourses and DNA Sequences as Complex Systems Part I: Efficiency of the Genetic Code of DNA
inferred← citeshttps://doi.org/10.1080/00029890.2002.11919838openalex-snapshot
What Is a Random Sequence?
inferred← citeshttps://doi.org/10.1080/17445760.2018.1448932openalex-snapshot
Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability
inferred← citeshttps://doi.org/10.1098/rsos.180399openalex-snapshot
Algorithmically probable mutations reproduce aspects of evolution, such as convergence rate, genetic memory and modularity
inferred← citeshttps://doi.org/10.1109/dance.2002.1003518openalex-snapshot
Active virtual network management prediction: complexity as a framework for prediction, optimization, and assurance
inferred← citeshttps://doi.org/10.1109/discex.2001.932183openalex-snapshot
Information assurance through Kolmogorov complexity
inferred← citeshttps://doi.org/10.1109/icdim.2007.4444242openalex-snapshot
A complexity-based method for anti-spamming
inferred← citeshttps://doi.org/10.1109/iwia.2006.3openalex-snapshot
An Application of Information Theory to Intrusion Detection
inferred← citeshttps://doi.org/10.1109/tsp.2023.3293908openalex-snapshot
Distribution-Agnostic Linear Unbiased Estimation With Saturated Weights for Heterogeneous Data
inferred← citeshttps://doi.org/10.1111/j.1467-6419.2010.00666.xopenalex-snapshot
AN ALGORITHMIC INFORMATION THEORETIC APPROACH TO THE BEHAVIOUR OF FINANCIAL MARKETS
inferred← citeshttps://doi.org/10.1142/9789811200076_0011openalex-snapshot
Compression is Comprehension and the Unreasonable Effectiveness of Digital Computation in the Natural World
inferred← citeshttps://doi.org/10.1142/9789811257155_0009openalex-snapshot
A Computable Piece of Uncomputable Art Whose Expansion May Explain the Universe in Software Space
inferred← citeshttps://doi.org/10.1142/9789812770837_0006openalex-snapshot
On the Kolmogorov-Chaitin Complexity for Short Sequences
inferred← citeshttps://doi.org/10.1142/9789814295482_0017openalex-snapshot
ON THE ALGORITHMIC NATURE OF THE WORLD
inferred← citeshttps://doi.org/10.1142/9789814374309_0001openalex-snapshot
Introducing the Computable Universe
inferred← citeshttps://doi.org/10.1145/1527125.1527148openalex-snapshot
Free lunches for function and program induction
inferred← citeshttps://doi.org/10.1145/1569901.1570074openalex-snapshot
Free lunches for neural network search
inferred← citeshttps://doi.org/10.1145/3460351openalex-snapshot
Fifty years of P vs. NP and the possibility of the impossible
inferred← citeshttps://doi.org/10.1155/2017/7208216openalex-snapshot
A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences
inferred← citeshttps://doi.org/10.1155/2023/9696075openalex-snapshot
Low Complexity, Low Probability Patterns and Consequences for Algorithmic Probability Applications
inferred← citeshttps://doi.org/10.1162/artl_a_00254openalex-snapshot
Undecidability and Irreducibility Conditions for Open-Ended Evolution and Emergence
inferred← citeshttps://doi.org/10.1371/journal.pcsy.0000014openalex-snapshot
Assembly Theory is an approximation to algorithmic complexity based on LZ compression that does not explain selection or evolution
inferred← citeshttps://doi.org/10.17791/jcs.2016.17.1.63openalex-snapshot
Understanding Consciousness as Data Compression
inferred← citeshttps://doi.org/10.22224/gistbok/2020.2.1openalex-snapshot
Philosophical Perspectives
inferred← citeshttps://doi.org/10.25088/complexsystems.27.3.249openalex-snapshot
The Problem of Prediction in Artificial Intelligence and Synthetic Biology
inferred← citeshttps://doi.org/10.3233/com-13019openalex-snapshot
Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures
inferred← citeshttps://doi.org/10.3390/a11110185openalex-snapshot
An Algorithmic Look at Financial Volatility
inferred← citeshttps://doi.org/10.3390/e20080551openalex-snapshot
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
inferred← citeshttps://doi.org/10.3390/e20080605openalex-snapshot
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
inferred← citeshttps://doi.org/10.3390/e21060560openalex-snapshot
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy
inferred← citeshttps://doi.org/10.3390/e22060612openalex-snapshot
A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions
inferred← citeshttps://doi.org/10.3390/proceedings2020047024openalex-snapshot
Towards Demystifying Shannon Entropy, Lossless Compression and Approaches to Statistical Machine Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1109.2237openalex-snapshot
The World is Either Algorithmic or Mostly Random
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3613openalex-snapshot
Turing Minimalism and the Emergence of Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.2101.09147openalex-snapshot
A superstatistical formulation of complexity measures
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0512089openalex-snapshot
On The Effectiveness of Kolmogorov Complexity Estimation to Discriminate Semantic Types
inferred← citeshttps://doi.org/10.48550/arxiv.physics/0005062openalex-snapshot
Applying MDL to Learning Best Model Granularity
inferred← citeshttps://doi.org/10.7551/978-0-262-33936-0-ch039openalex-snapshot
The Limits of Decidable States on Open-Ended Evolution and Emergence
inferred← citeshttps://doi.org/10.7717/peerj-cs.23openalex-snapshot
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
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.