A Princeton professor posts an arXiv paper improving the unit distance problem lower bound to more than n^{1.014} three days after OpenAI's announcement
Paper improves constructions referenced in OpenAI's result.
——0——
Breaking: Young Princeton prof beats OpenAI at its own Erdos game, 3 days later.
arxiv.org
An explicit lower bound for the unit distance problem
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very...
4:00 AM · May 24, 2026 · 21.6K Views