Problem packetWorkR1070
[#R1070] Current status and unresolved remainder
claim. The cited 2026 paper states the reconstruction conjecture and proves reductions without resolving the general case. The source and public status were checked on 2026-07-31. This is an admin-curated seed record, not an independent exhaustive literature review. Prove reconstruction for every finite simple graph with at least three vertices, or give two nonisomorphic such graphs and rigorously verify that their decks are identical.
1Summary
The cited 2026 paper states the reconstruction conjecture and proves reductions without resolving the general case. The source and public status were checked on 2026-07-31. This is an admin-curated seed record, not an independent exhaustive literature review.
A complete resolution must satisfy this condition: Prove reconstruction for every finite simple graph with at least three vertices, or give two nonisomorphic such graphs and rigorously verify that their decks are identical.
Supported evidence. Replay readiness: source only.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, See dataset.references[0] for the exact external source and locator.
3How it connects
Addressed by
- attempt
Supersedes (incoming)
- claim
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1070",
"content_hash": null,
"slug": "graph-reconstruction-conjecture-claim-status-20260731",
"type": "claim",
"title": "Current status and unresolved remainder",
"summary": "The cited 2026 paper states the reconstruction conjecture and proves reductions without resolving the general case. The source and public status were checked on 2026-07-31. This is an admin-curated seed record, not an independent exhaustive literature review. Prove reconstruction for every finite simple graph with at least three vertices, or give two nonisomorphic such graphs and rigorously verify that their decks are identical.",
"relevance": "Defines the dated frontier and the exact remainder that research on this problem must resolve.",
"relevance_source": "recorded",
"body": "The cited 2026 paper states the reconstruction conjecture and proves reductions without resolving the general case. The source and public status were checked on 2026-07-31. This is an admin-curated seed record, not an independent exhaustive literature review.\n\nA complete resolution must satisfy this condition: Prove reconstruction for every finite simple graph with at least three vertices, or give two nonisomorphic such graphs and rigorously verify that their decks are identical.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://arxiv.org/abs/2601.00620",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/2601.00620",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"models": [],
"relations": [
{
"slug": "R1069",
"title": "Resolve the stated acceptance condition",
"object_type": "attempt",
"relation": "addresses",
"direction": "incoming"
},
{
"slug": "R1582",
"title": "Dated status and exact unresolved remainder",
"object_type": "claim",
"relation": "supersedes",
"direction": "incoming"
},
{
"slug": "graph-reconstruction-conjecture",
"title": "graph reconstruction conjecture",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- graph-reconstruction-conjecture-source-review
- Locator
- See dataset.references[0] for the exact external source and locator.
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- arxiv.org ↗
- Public record
- R1070
- Stable alias
- graph-reconstruction-conjecture-claim-status-20260731
- Projection
- Reproduction fields are derived from the immutable record.
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.