Three layers of understanding
01 · Understand the problem
Put many points on paper and connect every pair exactly one unit apart. How many lines can you get? An OpenAI model found examples that beat a long-standing guess about the best arrangement.
02 · Understand the contribution
OpenAI reports an infinite family of configurations exceeding the traditionally expected square-grid behavior by a polynomial factor. External mathematicians checked the argument and wrote accompanying remarks.
03 · Academic context
The planar unit-distance function u(n) counts the maximal number of distance-one pairs among n points. The result refutes a conjectured optimality of lattice-style constructions by giving an improved lower-bound family. It does not determine the exact asymptotics of u(n) or resolve every variant of the unit-distance problem.
What this might change
A concrete example of a new mathematical construction checked by external specialists; may inspire different methods in combinatorial geometry.
What is NOT established
Externally checked according to the published announcement; this site has not audited every step or established journal peer review.