On the public citation graph

DEEP CLASSES

0 signed · 29 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/malq.19800262502openalex-snapshot
Exact Expressions for Some Randomness Tests
inferredcites →https://doi.org/10.1007/3-540-08353-7_156openalex-snapshot
Invariant properties of informational bulks
inferredcites →https://doi.org/10.1007/978-0-387-68441-3openalex-snapshot
Algorithmic Randomness and Complexity
inferredcites →https://doi.org/10.1007/978-3-7091-6597-3_8openalex-snapshot
Logical Depth and Physical Complexity
inferredcites →https://doi.org/10.1016/j.apal.2008.06.006openalex-snapshot
The upward closure of a perfect thin class
inferredcites →https://doi.org/10.1016/j.apal.2011.06.009openalex-snapshot
Randomness and lowness notions via open covers
inferredcites →https://doi.org/10.1016/j.tcs.2012.06.031openalex-snapshot
Strong reductions in effective randomness
inferredcites →https://doi.org/10.1016/s0019-9958(84)80060-1openalex-snapshot
Randomness conservation inequalities; information and independence in mathematical theories
inferredcites →https://doi.org/10.1090/s0002-9939-2010-10513-0openalex-snapshot
Difference randomness
inferredcites →https://doi.org/10.1093/acprof:oso/9780199230761.001.0001openalex-snapshot
Computability and Randomness
inferredcites →https://doi.org/10.1112/blms/bdr003openalex-snapshot
Diagonally non-recursive functions and effective Hausdorff dimension
inferredcites →https://doi.org/10.1112/jlms/jdl015openalex-snapshot
An extension of the recursively enumerable Turing degrees
inferredcites →https://doi.org/10.1112/jlms/s1-39.1.383openalex-snapshot
DEGREES OF UNSOLVABILITY
inferredcites →https://doi.org/10.1145/2450142.2450145openalex-snapshot
Forbidden information
inferredcites →https://doi.org/10.2178/jsl/1120224726openalex-snapshot
Randomness, relativization and Turing degrees
inferredcites →https://doi.org/10.2178/jsl/1208359062openalex-snapshot
Complex tilings
inferredcites →https://doi.org/10.2748/tmj/1325886278openalex-snapshot
Mass problems associated with effectively closed sets
inferredcites →https://doi.org/10.4310/mrl.2015.v22.n3.a5openalex-snapshot
Density, forcing, and the covering problem
inferredcites →https://doi.org/10.48550/arxiv.1009.3649openalex-snapshot
Everywhere complex sequences and probabilistic method

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_40openalex-snapshot
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions
inferred← citeshttps://doi.org/10.1007/s00224-017-9824-3openalex-snapshot
The Random Members of a Π 1 0 ${\Pi }_{1}^{0}$ Class
inferred← citeshttps://doi.org/10.1007/s11856-021-2200-7openalex-snapshot
Highness properties close to PA completeness
inferred← citeshttps://doi.org/10.1016/j.ic.2016.12.008openalex-snapshot
Diagonally non-computable functions and fireworks
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105136openalex-snapshot
Growth and irreducibility in path-incompressible trees
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105181openalex-snapshot
Pathwise-randomness and models of second-order arithmetic
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105420openalex-snapshot
Bridging computational notions of depth
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105426openalex-snapshot
Collision-resistant hash-shuffles on the reals
inferred← citeshttps://doi.org/10.1112/blms.12458openalex-snapshot
A computable analysis of majorizing martingales
inferred← citeshttps://doi.org/10.1145/3806195openalex-snapshot
Dimensionality and Randomness
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.