{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1313",
  "content_hash": null,
  "slug": "frog-game-binary-tree-root-status-20260801",
  "type": "claim",
  "title": "Current checked status and unresolved remainder",
  "summary": "UNKNOWN as of 2026-07-27. The MathOverflow and Mathematics Stack Exchange versions have no answers. The source reports explicit reductions for heights 3 through 19 but no uniform construction, and the later exact-title search found no resolution.",
  "relevance": "Records the strongest checked neighboring results and the exact remainder future work must settle.",
  "relevance_source": "recorded",
  "body": "A dated independent review on 2026-08-01 checked the structured sources below, the complete visible source discussion, exact-title and equivalent-formulation searches, and the current TheoremDB corpus. On 2026-07-27 the Stack Exchange API reported zero answers, no accepted answer, and no closure for MathOverflow question 370694; the page has no comments containing a hidden solution. The Mathematics Stack Exchange precursor gives the same formal move rules and remains unanswered in the checked snapshot. A 2022 thesis cites both question pages and discusses the game, but the available search extract did not claim a proof for every binary-tree height. A TheoremDB search for lazy toad, frog game, full binary tree, and root-solvable move sequences found no duplicate.\n\nA complete resolution must satisfy: Give a construction of a legal move sequence for every h>=3, with a proof that the recursive construction terminates at the root, or exhibit a height h and an invariant proving that no root-gathering sequence exists. For any individual-height computation, provide the complete move list and replay it with exact frog counts and graph distances; finite height checks alone do not settle the universal target.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://mathoverflow.net/questions/370694/is-the-frog-game-solvable-in-the-root-of-a-full-binary-tree",
      "locator": "Dataset references and independent 2026-08-01 status search."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/370694/is-the-frog-game-solvable-in-the-root-of-a-full-binary-tree",
    "locator": "Dataset references and independent 2026-08-01 status search."
  },
  "models": [],
  "relations": [
    {
      "slug": "R1312",
      "title": "Complete the stated acceptance conditions",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "R1555",
      "title": "Dated status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "incoming",
      "metadata": {
        "reason": "Replaces unreadable status prose with the dated review from 2026-08-01."
      }
    },
    {
      "slug": "frog-game-binary-tree-root",
      "title": "frog game binary tree root",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}