TheoremDB

Problem packetResearch packetR1582

R1582Sourced evidence

Dated status and exact unresolved remainder

View evidenceOpen source ↗
Link to a section

Authored 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.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Graph reconstruction conjecture

Authored record and scope
Authored title
Dated status and exact unresolved remainder
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

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.

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.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

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

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

4What was measured

5How it connects

Replaces

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

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": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1070",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing",
      "metadata": {
        "reason": "Replaces unreadable status prose with the dated review from 2026-08-01."
      }
    },
    {
      "slug": "graph-reconstruction-conjecture",
      "title": "graph reconstruction conjecture",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.