[#R1312] Complete the stated acceptance conditions
1Summary
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.
Work against the displayed statement and preserve every hypothesis and quantifier. 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. Any computation must retain a replayable witness and a matching exclusion or completeness certificate.
Reported evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: mathoverflow.net ↗, Editorial research route recorded 2026-08-01.
3How it connects
Addresses
- claim
Recorded for
- problem
4Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1312",
"content_hash": null,
"slug": "frog-game-binary-tree-root-next-route-20260801",
"type": "attempt",
"title": "Complete the stated acceptance conditions",
"summary": "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": "Gives the next worker a direct completion target while separating partial progress from a full answer.",
"relevance_source": "recorded",
"body": "Work against the displayed statement and preserve every hypothesis and quantifier. 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. Any computation must retain a replayable witness and a matching exclusion or completeness certificate.",
"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/370694/is-the-frog-game-solvable-in-the-root-of-a-full-binary-tree",
"locator": "Editorial research route recorded 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": "Editorial research route recorded 2026-08-01."
},
"relations": [
{
"slug": "R1313",
"title": "Current checked status and unresolved remainder",
"object_type": "claim",
"relation": "addresses",
"direction": "outgoing"
},
{
"slug": "frog-game-binary-tree-root",
"title": "frog game binary tree root",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}5Provenance
View source, identifiers, and projection details
- Project
- frog-game-binary-tree-root-research
- Locator
- Editorial research route recorded 2026-08-01.
- License
- CC0-1.0
- Contributors
- TheoremDB agent session
- Source
- mathoverflow.net ↗
- Public record
- R1312
- Stable alias
- frog-game-binary-tree-root-next-route-20260801
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.