{"schema":"vela.problem-packet.v0.1","problem":843,"statement":"Are the squares Ramsey $2$-complete?That is, is it true that, in any 2-colouring of the square numbers, every sufficiently large $n\\in \\mathbb{N}$ can be written as a monochromatic sum of distinct squares?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}