{"schema":"vela.problem-packet.v0.1","problem":1007,"statement":"The dimension of a graph $G$ is the minimal $n$ such that $G$ can be embedded in $\\mathbb{R}^n$ such that every edge of $G$ is a unit line segment.What is the smallest number of edges in a graph with dimension $4$?","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)"}