{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1578",
  "content_hash": null,
  "slug": "graph-isomorphism-in-p-attempt-dated-source-audit",
  "type": "attempt",
  "title": "Dated source and duplicate audit",
  "summary": "The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Babai's deterministic quasipolynomial-time algorithm is the best general worst-case bound located. Unresolved remainder: A polynomial-time bound remains open.",
  "relevance": "Documents why Is graph isomorphism solvable in polynomial time? was treated as a distinct open target on 2026-08-01.",
  "relevance_source": "recorded",
  "body": "The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.\n\nQueries included:\n- graph isomorphism polynomial time open 2026\n- best general graph isomorphism algorithm quasipolynomial\n\nThe exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Babai's deterministic quasipolynomial-time algorithm is the best general worst-case bound located. Unresolved remainder: A polynomial-time bound remains open.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.1145/2897518.2897542",
      "locator": "L. Babai, Graph isomorphism in quasipolynomial time, STOC 2016. main theorem"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1145/2897518.2897542",
    "locator": "L. Babai, Graph isomorphism in quasipolynomial time, STOC 2016. main theorem"
  },
  "relations": [
    {
      "slug": "R1581",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "evidences",
      "direction": "outgoing"
    },
    {
      "slug": "graph-isomorphism-in-p",
      "title": "graph isomorphism in p",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}