OPEN, the site's label (page last edited 23 January 2026; the problem page and its proof-claims tab accessed 2026-10-06). The tab carries one full proof claim, by Qiyuan Gu, submitted 2026-09-04 with a Zenodo write-up drafted, as the tab discloses, using GPT 6 Astra, running on top of GPT 5.6 Sol and Claude Fable 5.1; it claims to answer the question yes in a stronger form: for any array and any excess degree $r_n=o(n)$ some continuous $f$ makes every sequence of interpolants $p_n$ of degree at most $n+r_n$ satisfy $\limsup_n\lvert p_n(x)\rvert=\infty$ at almost every $x$. The claim is recorded, unadopted, on its claim page (Gu, 2026); the derived standing departs from the site's label because this pending full claim makes the problem claimed as proved, and it stays pending since no outside review or refereed publication of it is known. For a fixed $\epsilon>0$ the opposite holds for suitable arrays: Erdős, Kroó and Szabados [EKS89] give arrays for which every continuous $f$ has interpolants of degree below $(1+\epsilon)n$ converging uniformly, as the site's commentary records.