{ "schema_version": "1.0.0", "source": "vibemath", "problem_id": "vibemathed:strong-graph-reconstruction-conjecture", "title": "Strong Graph Reconstruction Conjecture", "canonical_statement": "For a graph $G$, its vertex deck is the multiset of graphs obtained by deleting one vertex. Bowler, Brown, and Fenner (BBF) proposed $2\\lfloor\\frac{nāˆ’1}{3}\\rfloor$ as the maximum possible overlap between the decks of two nonisomorphic n-vertex graphs, for all sufficiently large n. We first give an explicit pair of connected nonisomorphic graphs on 78 vertices with at least 51 common cards, exceeding BBF's predicted value of 50. We then construct, for every even $r \\geq 4$, families at arbitrarily large orders whose overlap fraction is asymptotically at least $1āˆ’\\frac{1}{r}$. Consequently, for every $\\alpha<1$, infinitely many pairs have more than $\\alpha n$ common cards, so the attainable fraction is arbitrarily close to the full deck. For representative instances, the predicted overlaps were also checked by complete deck generation and isomorphism testing with Brendan McKay's nauty tools", "plain_summary": "VibeMathed reports this item as resolved. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.", "current_status": "resolved", "solution_events": [ { "id": "vibemathed:strong-graph-reconstruction-conjecture:event", "problem_id": "vibemathed:strong-graph-reconstruction-conjecture", "type": "disproved", "status": "resolved", "occurred_at": "2026-08-12T00:00:00.000Z", "title": "arxiv.org", "summary": "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.", "ai_contribution": "ai_co_developed", "attempt_ids": [ "vibemathed:strong-graph-reconstruction-conjecture:attempt" ], "method_family_ids": [ "vibemathed:strong-graph-reconstruction-conjecture:method" ], "source_assertion_ids": [ "vibemathed:strong-graph-reconstruction-conjecture:assertion" ] } ], "attempts": [ { "id": "vibemathed:strong-graph-reconstruction-conjecture:attempt", "problem_id": "vibemathed:strong-graph-reconstruction-conjecture", "model": "gpt-5.6-sol", "provider": null, "attempted_at": "2026-08-12T00:00:00.000Z", "human_collaborators": [], "exposure": "unknown", "prompt_public": null, "outcome": "Per the author's public statements (not disclosed in the paper itself): GPT-5.6 Sol proved most of the roughly 400 intermediate theorems explored, with the author supplying the decisive construction idea and direction - in the author's words, the models \"could not achieve the goal before I can point to the right idea\". Model-proved steps inside a human-led search is recorded as ai-co-developed.", "failed_routes": [], "artifacts": [], "sources": [ { "label": "arxiv.org", "url": "https://arxiv.org/abs/2608.11930", "kind": "primary-mathematical-source", "license": null }, { "label": "VibeMathed: Strong Graph Reconstruction Conjecture", "url": "https://vibemathed.com/problem/strong-graph-reconstruction-conjecture", "kind": "source-assertion", "license": "https://vibemathed.com/data-license" } ], "cost_usd": null, "independence": "unknown" } ], "verifications": [ { "id": "vibemathed:strong-graph-reconstruction-conjecture:verification", "problem_id": "vibemathed:strong-graph-reconstruction-conjecture", "solution_event_id": "vibemathed:strong-graph-reconstruction-conjecture:event", "level": "unreviewed", "mathematical_correctness": "unknown", "statement_fidelity": "unaudited", "peer_review": "none", "verifier": "VibeMathed (source-reported label)", "verified_at": null, "note": "Checked by this site on 17 August 2026 against the paper's LaTeX (arXiv:2608.11930, Ivanov) and its verification repository, which the paper's own footnote links. Two submitted claims needed correcting. The entry arrived Expert-verified on the strength of the author's own LinkedIn post - self-endorsement is not independent expert verification, so this is Unreviewed. And the paper itself contains NO AI disclosure: the account of GPT-5.6 Sol's role rests entirely on the author's public statements outside the paper, which this entry now says explicitly. The nauty deck checks are author-side. The construction was not verified here.", "sources": [ { "label": "VibeMathed: Strong Graph Reconstruction Conjecture", "url": "https://vibemathed.com/problem/strong-graph-reconstruction-conjecture", "kind": "source-assertion", "license": "https://vibemathed.com/data-license" }, { "label": "arxiv.org", "url": "https://arxiv.org/abs/2608.11930", "kind": "primary-mathematical-source", "license": null } ] } ], "sources": [ { "label": "arxiv.org", "url": "https://arxiv.org/abs/2608.11930", "kind": "primary-mathematical-source", "license": null }, { "label": "VibeMathed: Strong Graph Reconstruction Conjecture", "url": "https://vibemathed.com/problem/strong-graph-reconstruction-conjecture", "kind": "source-assertion", "license": "https://vibemathed.com/data-license" } ], "recommended_mode": "verify", "recommended_exposure": "result_only", "opportunity_signals": [ { "id": "vibemathed:strong-graph-reconstruction-conjecture:signal:watch_only", "problem_id": "vibemathed:strong-graph-reconstruction-conjecture", "kind": "watch_only", "reason": "Current public evidence does not meet the default replay threshold.", "generated_at": "2026-09-13T16:28:40.178Z" } ], "uncertainties": [ "VibeMath has not independently verified the mathematical claim.", "AI-attempt independence and training-data exposure are unknown unless explicitly documented.", "VibeMath has not independently audited the mathematical statement, proof, or novelty claim." ], "generated_at": "2026-09-13T16:28:40.178Z" }