{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1580",
  "content_hash": null,
  "slug": "graph-isomorphism-in-p-claim-literature-frontier",
  "type": "claim",
  "title": "Strongest checked neighboring result",
  "summary": "Babai's deterministic quasipolynomial-time algorithm is the best general worst-case bound located.",
  "relevance": "Locates the present research frontier immediately below Is graph isomorphism solvable in polynomial time?.",
  "relevance_source": "recorded",
  "body": "Babai's deterministic quasipolynomial-time algorithm is the best general worst-case bound located.\n\nThis leaves the following boundary unresolved: A polynomial-time bound remains open. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "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"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1581",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "graph-isomorphism-in-p",
      "title": "graph isomorphism in p",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}