{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1107",
  "content_hash": null,
  "slug": "node-kayles-subcubic-trees-attempt-resolution-route",
  "type": "attempt",
  "title": "Resolve the stated acceptance condition",
  "summary": "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 Winner complexity of Node Kayles on subcubic trees, record node-kayles-subcubic-trees-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: 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_source": "recorded",
  "body": "Target the displayed statement directly. 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. Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://mathoverflow.net/questions/506760/complexity-of-the-node-kayles-game-in-restriction-to-planar-graphs-and-trees-of",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "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": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1108",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "node-kayles-subcubic-trees",
      "title": "node kayles subcubic trees",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}