{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1108",
  "content_hash": null,
  "slug": "node-kayles-subcubic-trees-claim-status-20260731",
  "type": "claim",
  "title": "Current status and unresolved remainder",
  "summary": "UNKNOWN as of 2026-07-31. General Node Kayles is PSPACE-complete, and exact exponential algorithms are known on trees. The checked recent work on regular-tree families does not classify arbitrary subcubic trees. Give a deterministic polynomial-time winner algorithm for all subcubic trees with proof of its running time and correctness, or give a polynomial-time reduction proving PSPACE-hardness together with the standard PSPACE membership argument.",
  "relevance": "For node kayles subcubic trees, pins the dated research frontier: UNKNOWN as of 2026-07-31. General Node Kayles is PSPACE-complete, and exact exponential algorithms are known on trees. The checked recent work on regular-tree families does not classify arbitrary subcubic trees. Give a deterministic polynomial-time winner algorithm for all subcubic trees with proof.",
  "relevance_source": "recorded",
  "body": "UNKNOWN as of 2026-07-31. General Node Kayles is PSPACE-complete, and exact exponential algorithms are known on trees. The checked recent work on regular-tree families does not classify arbitrary subcubic trees.\n\nA complete resolution must satisfy this condition: Give a deterministic polynomial-time winner algorithm for all subcubic trees with proof of its running time and correctness, or give a polynomial-time reduction proving PSPACE-hardness together with the standard PSPACE membership argument.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://mathoverflow.net/questions/506760/complexity-of-the-node-kayles-game-in-restriction-to-planar-graphs-and-trees-of",
      "locator": "See dataset.references[0] for the exact external source and locator."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/506760/complexity-of-the-node-kayles-game-in-restriction-to-planar-graphs-and-trees-of",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "relations": [
    {
      "slug": "R1107",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "node-kayles-subcubic-trees",
      "title": "node kayles subcubic trees",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}