{"schema":"vela.problem-packet.v0.1","problem":1127,"statement":"Can $\\mathbb{R}^n$ be decomposed into countably many sets, such that within each set all the pairwise distances are distinct?","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)"}