{"schema":"vela.problem-packet.v0.1","problem":507,"statement":"Let $\\alpha(n)$ be such that every set of $n$ points in the unit disk contains three points which determine a triangle of area at most $\\alpha(n)$. Estimate $\\alpha(n)$.","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)"}