{"schema":"vela.problem-packet.v0.1","problem":103,"statement":"Let $h(n)$ count the number of incongruent sets of $n$ points in $\\mathbb{R}^2$ which minimise the diameter subject to the constraint that $d(x,y)\\geq 1$ for all points $x\\neq y$. Is it true that $h(n)\\to \\infty$?","status":"open","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)"}