Strong Graph Reconstruction Conjecture
Disproves the Bowler-Brown-Fenner bound of 2*floor((n-1)/3) on common cards between nonisomorphic graphs: an explicit connected 78-vertex pair shares at least 51 cards against the predicted 50, and for every even r >= 4 there are families with overlap fraction asymptotically at least 1 - 1/r, so the attainable fraction approaches the full deck. The Kelly-Ulam reconstruction conjecture itself is untouched.
Exact FrontierDelta
Scope and record
Occurred: Oct 29, 2026
Delta type: REGISTRY REVISION
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.
Canonical aliases: Strong Graph Reconstruction Conjecture
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Lineage and corrections
Corrects Strong Graph Reconstruction Conjecture →
Supersedes Strong Graph Reconstruction Conjecture →
Strong Graph Reconstruction Conjecture evidence for this event
Disproves the Bowler-Brown-Fenner bound of 2*floor((n-1)/3) on common cards between nonisomorphic graphs: an explicit connected 78-vertex pair shares at least 51 cards against the predicted 50, and for every even r >= 4 there are families with overlap fraction asymptotically at least 1 - 1/r, so the attainable fraction approaches the full deck. The Kelly-Ulam reconstruction conjecture itself is untouched. parent of this event
Strong Graph Reconstruction Conjecture parent of this event
This event attributed to gpt-5.6-sol
VibeMathed record: Strong Graph Reconstruction Conjecture evidence for this event
Act on this frontier