TheoremDB

Problem packetWorkR1582

R1582claimStatus: reportedEvidence: SupportedReplay: source only

[#R1582] Dated status and exact unresolved remainder

claim. Unresolved in this packet after the dated source check. Strongest checked result: Aravind and Monikandan prove reductions using domination and vertex-pair parameters. Their 2026 paper states the reconstruction conjecture and does not resolve the general case. Exact unresolved remainder: Prove that every finite simple graph with at least three vertices is determined by its vertex-deleted deck, or give two nonisomorphic such graphs with identical decks.

View evidenceOpen source ↗

1Summary

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: Aravind and Monikandan prove reductions using domination and vertex-pair parameters. Their 2026 paper states the reconstruction conjecture and does not resolve the general case.

Supported evidence. Replay readiness: source only.

2Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: arxiv.org ↗, abstract and reduction theorems

3Overview

Exact unresolved remainder: Prove that every finite simple graph with at least three vertices is determined by its vertex-deleted deck, or give two nonisomorphic such graphs with identical decks.

4What was measured

As of
2026-08-01
Strongest known result
Aravind and Monikandan prove reductions using domination and vertex-pair parameters. Their 2026 paper states the reconstruction conjecture and does not resolve the general case.
Exact open remainder
Prove that every finite simple graph with at least three vertices is determined by its vertex-deleted deck, or give two nonisomorphic such graphs with identical decks.

5How it connects

Supersedes

Recorded for

6Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1582",
  "content_hash": null,
  "slug": "graph-reconstruction-conjecture-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: Aravind and Monikandan prove reductions using domination and vertex-pair parameters. Their 2026 paper states the reconstruction conjecture and does not resolve the general case. Exact unresolved remainder: Prove that every finite simple graph with at least three vertices is determined by its vertex-deleted deck, or give two nonisomorphic such graphs with identical decks.",
  "relevance": "For Graph reconstruction conjecture, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: Aravind and Monikandan prove reductions using domination and vertex-pair parameters. Their 2026 paper states the reconstruction conjecture and does not resolve the general case.\n\nExact unresolved remainder: Prove that every finite simple graph with at least three vertices is determined by its vertex-deleted deck, or give two nonisomorphic such graphs with identical decks.",
  "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": "abstract and reduction theorems"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/2601.00620",
    "locator": "abstract and reduction theorems"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1070",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "graph-reconstruction-conjecture",
      "title": "graph reconstruction conjecture",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
graph-reconstruction-conjecture-source-review
Locator
abstract and reduction theorems
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1582
Stable alias
graph-reconstruction-conjecture-status-packet-quality-20260801
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.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.