{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1579",
  "content_hash": null,
  "slug": "graph-isomorphism-in-p-attempt-open-remainder",
  "type": "attempt",
  "title": "Work at the unresolved boundary",
  "summary": "A polynomial-time bound remains open.",
  "relevance": "Turns the remaining uncertainty in Is graph isomorphism solvable in polynomial time? into a checkable research target.",
  "relevance_source": "recorded",
  "body": "Research should address this boundary directly: A polynomial-time bound remains open.\n\nA claimed resolution should satisfy every item below and preserve the statement's exact quantifiers and normalizations:\n- Give and prove a deterministic polynomial-time isomorphism algorithm.\n- Or prove no such algorithm exists in a stated standard model, which would separate complexity classes.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.1145/2897518.2897542",
      "locator": "TheoremDB editorial route recorded 2026-08-01"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1145/2897518.2897542",
    "locator": "TheoremDB editorial route recorded 2026-08-01"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1581",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "graph-isomorphism-in-p",
      "title": "graph isomorphism in p",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}