The site labels the problem DECIDABLE, a label it glosses as resolved up to a finite check (page last edited 1 February 2026; the label and the proof-claims thread as of 6 October 2026). The standing in the frontmatter derives from the claim pages. The accepted partial result is the corrected Elliott bound of Purdy and Smith: for $n\ge394$ the minimum is $1+\binom{n-1}{2}-\lfloor(n-1)/2\rfloor$, so only the values for $4\le n\le393$ remain. Elliott's original bound $\binom{n-1}{2}$ is the rejected claim Elliott 1967, and Bálintová and Bálint's bounds on circles through exactly three of the points are the accepted partial claim Bálintová and Bálint 1994. The pending full claim is Wrona's, posted on the site's proof-claims thread on 20 August 2026 with a manuscript and a Lean development, asserting the exact minimum for every $n\ge4$; it is AI-assisted and carries no acceptance evidence.