{"schema":"vela.problem-packet.v0.1","problem":211,"statement":"Let $1\\leq k<n$. Given $n$ points in $\\mathbb{R}^2$, at most $n-k$ on any line, there are $\\gg kn$ many lines which contain at least two points.","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)"}