{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1555",
  "content_hash": null,
  "slug": "frog-game-binary-tree-root-status-packet-quality-20260801",
  "type": "claim",
  "title": "Dated status and exact unresolved remainder",
  "summary": "Unresolved in this packet after the dated source check. Strongest checked result: 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. Exact unresolved remainder: 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.",
  "relevance": "For Gathering the frog game at the root of a full binary tree, this successor gives readable dated status prose and the exact remaining research boundary.",
  "relevance_source": "recorded",
  "body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: 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.\n\nExact unresolved remainder: 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": "Full question, answers, and visible comments concerning Gathering the frog game at the root of a full binary tree; checked 2026-08-01."
    },
    "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": "Full question, answers, and visible comments concerning Gathering the frog game at the root of a full binary tree; checked 2026-08-01."
  },
  "relations": [
    {
      "slug": "R1313",
      "title": "Current checked status and unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "outgoing"
    },
    {
      "slug": "frog-game-binary-tree-root",
      "title": "frog game binary tree root",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}