{"schema":"vela.problem-packet.v0.1","problem":89,"statement":"Does every set of $n$ distinct points in $\\mathbb{R}^2$ determine $\\gg n/\\sqrt{\\log n}$ many distinct distances?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A131628","name":"Maximal size of an n-distance set in the plane.","terms":"1,3,5,7,9,12,13","url":"https://oeis.org/A131628"},{"id":"A186704","name":"The minimum number of distinct distances determined by n points in the Euclidean plane.","terms":"0,1,1,2,2,3,3,4,4,5,5,5,6","url":"https://oeis.org/A186704"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}