{"schema":"vela.problem-packet.v0.1","problem":90,"statement":"Does every set of $n$ distinct points in $\\mathbb{R}^2$ contain at most $n^{1+O(1/\\log\\log n)}$ many pairs which are distance 1 apart?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A186705","name":"The Erdős unit distance problem: the maximum number of occurrences of the same distance among n points in the plane.","terms":"0,1,3,5,7,9,12,14,18,20,23,27,30,33,37,41,43,46,50,54,57","url":"https://oeis.org/A186705"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}