{"schema":"vela.problem-packet.v0.1","problem":668,"statement":"Is it true that the number of incongruent sets of $n$ points in $\\mathbb{R}^2$ which maximise the number of unit distances tends to infinity as $n\\to\\infty$? Is it always $>1$ for $n>3$?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A385657","name":"Number of nonisomorphic maximally dense unit-distance graphs on n vertices.","terms":"1,1,1,1,1,4,1,3,1,1,2,1,1,2,1,1,7,16,3,1,5","url":"https://oeis.org/A385657"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}