Open. The site's label is OPEN. Two claims are recorded. Didin and Pimenov's potential argument, on its claim page (Didin and Pimenov, 2026), proves that the two-edge player wins the $(1:2)$-biased game of the second question for every sufficiently large $n$, with a Lean development naming the threshold $3^{158}$; Cambie confirmed the proof on the thread, so the page records it as an accepted partial claim. Cambie and Provoost's exhaustive search, on its claim page (Cambie Provoost, 2025), shows that Bob wins the unbiased game of the first question for $3\le n\le8$ and determines the maximum-degree game of the third question for $n\le8$ (Alice wins for $n=2,3$, Bob for $4\le n\le8$), a pending partial claim. No claim covers the first or third question for $n\ge9$ or the second question below the threshold, and the frontmatter standing is derived from the claim pages.