On the public citation graph

Towards the reconstruction of posets

https://doi.org/10.1007/bf01108765
0 signed · 35 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/jgt.3190010108openalex-snapshot
The falsity of the reconstruction conjecture for tournaments
inferredcites →https://doi.org/10.1002/jgt.3190010306openalex-snapshot
Graph reconstruction—a survey
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_4openalex-snapshot
Computationally Tractable Classes of Ordered Sets
inferredcites →https://doi.org/10.1007/978-94-009-2639-4_6openalex-snapshot
The Calculation of Invariants for Ordered Sets
inferredcites →https://doi.org/10.1007/bf00383609openalex-snapshot
Unsolved problems
inferredcites →https://doi.org/10.1007/bf01108595openalex-snapshot
A counterexample about poset reconstruction
inferredcites →https://doi.org/10.1007/bf01578845openalex-snapshot
On the complexity of graph reconstruction
inferredcites →https://doi.org/10.1007/bfb0066431openalex-snapshot
A survey of the reconstruction conjecture
inferredcites →https://doi.org/10.1007/bfb0092266openalex-snapshot
Set-reconstruction of chain sizes in a class of finite topologies
inferredcites →https://doi.org/10.1016/0012-365x(83)90099-7openalex-snapshot
Reconstructibility and perfect graphs
inferredcites →https://doi.org/10.1016/0095-8956(79)90039-xopenalex-snapshot
Relations non reconstructibles par leurs restrictions
inferredcites →https://doi.org/10.1016/0166-218x(81)90013-5openalex-snapshot
Complement reducible graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1017/cbo9780511666216.009openalex-snapshot
“A Graph Reconstructor's Manual”
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2140/pjm.1957.7.961openalex-snapshot
A congruence theorem for trees
inferredcites →https://doi.org/10.56021/9780801844256openalex-snapshot
Combinatorics and Partially Ordered Sets

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcta.1998.2870openalex-snapshot
Reconstructing Subsets of Zn
inferred← citeshttps://doi.org/10.1006/jctb.1998.1859openalex-snapshot
Reconstruction of Posets with the Same Comparability Graph
inferred← citeshttps://doi.org/10.1006/jctb.2002.2126openalex-snapshot
Reconstruction of Finite Truncated Semi-Modular Lattices
inferred← citeshttps://doi.org/10.1007/s11083-013-9306-4openalex-snapshot
Ordered Sets that are Reconstructible from Two Cards and the Number of Comparabilities
inferred← citeshttps://doi.org/10.1007/s11083-024-09684-8openalex-snapshot
Reconstruction of the Ranks of the Nonextremal Cards and of Ordered Sets with a Minmax Pair of Pseudo-Similar Points
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00295-8openalex-snapshot
Width two posets are reconstructible
inferred← citeshttps://doi.org/10.1016/j.dam.2025.09.022openalex-snapshot
Reconstruction of caterpillar tanglegrams
inferred← citeshttps://doi.org/10.1016/j.disc.2003.06.009openalex-snapshot
More examples on ordered set reconstruction
inferred← citeshttps://doi.org/10.1016/j.disc.2004.04.029openalex-snapshot
What is reconstruction for ordered sets?
inferred← citeshttps://doi.org/10.1016/j.disc.2010.06.022openalex-snapshot
Pseudo-similar points in ordered sets
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.035openalex-snapshot
Bipartite operator decomposition of graphs and the reconstruction conjecture
inferred← citeshttps://doi.org/10.1023/a:1006133917784openalex-snapshot
Affine Isomorphism for Partially Ordered Sets
inferred← citeshttps://doi.org/10.1023/a:1010698416799openalex-snapshot
Reconstruction of N-free Ordered Sets
inferred← citeshttps://doi.org/10.1023/a:1021268631525openalex-snapshot
Examples on Ordered Set Reconstruction
inferred← citeshttps://doi.org/10.1023/a:1026596729846openalex-snapshot
Reconstruction of the Neighborhood Deck of an Ordered Set
inferred← citeshttps://doi.org/10.1023/b:orde.0000034587.50489.beopenalex-snapshot
On Ordered Sets with Isomorphic Marked Maximal Cards
inferred← citeshttps://doi.org/10.1587/transinf.2015fop0001openalex-snapshot
Choreography Realization by Re-Constructible Decomposition of Acyclic Relations
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.