On the public citation graph

A graph with p points and enough distinct (p-2)-order subgraphs is reconstructible

https://doi.org/10.1007/bfb0059425
0 signed · 13 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.22409openalex-snapshot
Reconstruction from the deck of ‐vertex induced subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.3190010306openalex-snapshot
Graph reconstruction—a survey
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_76openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/bf01578845openalex-snapshot
On the complexity of graph reconstruction
inferred← citeshttps://doi.org/10.1007/bfb0066431openalex-snapshot
A survey of the reconstruction conjecture
inferred← citeshttps://doi.org/10.1007/s00373-015-1639-xopenalex-snapshot
Generalisations of Hypomorphisms and Reconstruction of Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-020-02131-6openalex-snapshot
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices
inferred← citeshttps://doi.org/10.1109/tit.2020.2983678openalex-snapshot
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices
inferred← citeshttps://doi.org/10.1201/b16132-10openalex-snapshot
The Reconstruction Problem
inferred← citeshttps://doi.org/10.1201/b16132-23openalex-snapshot
DeBruijn Graphs and Sequences
inferred← citeshttps://doi.org/10.1201/b16132-33openalex-snapshot
Applications to Timetabling
inferred← citeshttps://doi.org/10.1201/b16132-6openalex-snapshot
Glossary for Chapter 1
inferred← citeshttps://doi.org/10.48550/arxiv.2004.05527openalex-snapshot
On reconstruction of graphs from the multiset of subgraphs obtained by deleting $\ell$ vertices
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.