{"schema":"vela.problem-packet.v0.1","problem":660,"statement":"Let $x_1,\\ldots,x_n\\in \\mathbb{R}^3$ be the vertices of a convex polyhedron. Are there at least\\[(1-o(1))\\frac{n}{2}\\]many distinct distances between the $x_i$?","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)"}