Open: the site labels the problem OPEN (proof-claims tab and thread as of 2026-10-07), and the frontmatter standing is derived from the two claim pages under claims/, the problem's two assertions being its parts. The first, $f(n)=o(2^n)$, is Verstraëte's refereed theorem [Ve04] in the stronger form $o(2^{n-n^c})$ (claim page (Verstraëte, 2004), accepted, partial), sharpened by Nenadov [Ne25] to $2^{n-n^{1/2-o(1)}}$ (claim page (Nenadov, 2025), accepted, partial); the second, $f(n)/2^{n/2}\to\infty$, is open, so the standing is open. One partial proof claim is registered on the tab: Botsford's Zenodo preprint (claim 351 on the tab, registered 25 September 2026, made using GPT-6 Astra and Opus 5.5, as the tab names them) asserts the explicit lower bound $f(n)>19.61\cdot2^{n/2}$ for all $n\ge1024$ by three computer-assisted constructions. It gets no claim page because it settles no instance of either assertion: a constant factor over $2^{n/2}$ is not the divergence asked, and $f(n)=o(2^n)$ is not addressed. The site's remark credits the first problem to Verstraëte with Nenadov's improvement, and the site labels the problem OPEN. The site states that a listing on the tab is no guarantee of correctness.