{"schema":"vela.problem-packet.v0.1","problem":101,"statement":"Given $n$ points in $\\mathbb{R}^2$, no five of which are on a line, the number of lines containing four points is $o(n^2)$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A006065","name":"Maximal number of 4-tree rows in n-tree orchard problem.","terms":"0,0,0,1,1,1,2,2,3,5,6,7,9,10,12,15,16,18,20,23","url":"https://oeis.org/A006065"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}