{"schema":"vela.problem-packet.v0.1","problem":104,"statement":"Given $n$ points in $\\mathbb{R}^2$ the number of distinct unit circles containing at least three points is $o(n^2)$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A003829","name":"Maximal number of unit circles through n points in plane, each circle containing 3 of the points.","terms":"1,4,4,8,12,16","url":"https://oeis.org/A003829"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}