{"schema_version":"source-reader-v1","record":{"source_id":"erdos-unit-distances-remarks","versions":[{"work":{"authors":["Noga Alon","Thomas F. Bloom","W. T. Gowers","Daniel Litt","Will Sawin","Arul Shankar","Jacob Tsimerman","Victor Wang","Melanie Matchett Wood"],"kind":"research_paper","publication":"preprint","publication_note":"Source publication and attributed assessments are distinct from independent OpenMath review.","ai_role":"self_reported","ai_note":"The mathematical starting point is attributed to OpenAI’s model; the nine named authors supply exposition, checking, simplification and context.","artifacts":[],"published":{"value":"2026-05-20"}},"id":"erdos-unit-distances:source:remarks:v1","source_id":"erdos-unit-distances-remarks","title":"Remarks on the Disproof of the Unit Distance Conjecture","owner":"Noga Alon, Thomas F. Bloom, W. T. Gowers, Daniel Litt, Will Sawin, Arul Shankar, Jacob Tsimerman, Victor Wang, Melanie Matchett Wood","url":"https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","subject_scope":"The companion paper provides a human-digested argument and background for the exponent gain, including the classical upper bound.","revision":"2026-05-20","content_sha256":"7c2f90d0792d05503d326102321743340790209a12ceb9ead923f357df7be45f","update_method":"Compare the exact source and publish a new immutable curation revision.","identifier_policy":"Stable source identity with exact versioned passages.","observed_on":"2026-10-13","source_updated_on":null,"rights":"metadata-link","license":"Original source license and document rights apply.","terms_url":"https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","attribution":"Noga Alon, Thomas F. Bloom, W. T. Gowers, Daniel Litt, Will Sawin, Arul Shankar, Jacob Tsimerman, Victor Wang, Melanie Matchett Wood","rights_note":"OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.","check_interval_days":90}],"entries":[{"id":"erdos-unit-distances:entry:remarks-history:v1","source_version_id":"erdos-unit-distances:source:remarks:v1","item_id":"history","url":"https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","wording":"Erdős showed with a √n × √n grid that n points can have n^(1+Ω(1/log log n)) unit distances, and conjectured an upper bound n^(1+o(1)). The best upper bound, O(n^(4/3)), is due to Spencer, Szemerédi and Trotter (1984).","wording_kind":"paraphrase","locator":"§1.1, History of the problem; §2 opening","supersedes":null},{"id":"erdos-unit-distances:entry:remarks:v1","source_version_id":"erdos-unit-distances:source:remarks:v1","item_id":"remarks","url":"https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","wording":"The companion paper provides a human-digested argument and background for the exponent gain, including the classical upper bound.","wording_kind":"paraphrase","locator":"Theorem 1.1; Sections 1.1–1.3 and 2","supersedes":null}],"problems":[{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6}],"selected_version_id":"erdos-unit-distances:source:remarks:v1","available_versions":[{"id":"erdos-unit-distances:source:remarks:v1","revision":"2026-05-20","observed_on":"2026-10-13","title":"Remarks on the Disproof of the Unit Distance Conjecture","publication":"preprint","content_sha256":"7c2f90d0792d05503d326102321743340790209a12ceb9ead923f357df7be45f","used_in_current_publications":true}],"usages":[{"id":"source-use-63d7264f4283eba1e254","entry_id":"erdos-unit-distances:entry:remarks-history:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"assessment","title":"Erdős’s grid construction","claim":{"id":"claim-unit-distances-erdos-grid","version":1,"slug":"unit-distances-erdos-grid","title":"Erdős’s grid lower bound"},"fragment":"claim-unit-distances-erdos-grid","assessment":{"id":"erdos-unit-distances:report:grid:v1","entry_id":"erdos-unit-distances:entry:remarks-history:v1","state":"resolved","source_label":"Erdős’s grid construction","scope":"Only the exact statement and passage cited here; not an independent OpenMath assessment.","source_date":null,"observed_on":"2026-10-21","evidence_url":"https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-1323a73c2f127357ec11","entry_id":"erdos-unit-distances:entry:remarks-history:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"question","title":"Erdős unit-distance problem","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-058cec1cf896a4e5aa65","entry_id":"erdos-unit-distances:entry:remarks-history:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"statement","title":"Erdős’s grid lower bound","claim":{"id":"claim-unit-distances-erdos-grid","version":1,"slug":"unit-distances-erdos-grid","title":"Erdős’s grid lower bound"},"fragment":"claim-unit-distances-erdos-grid","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e689bf07077b6baf7e17","entry_id":"erdos-unit-distances:entry:remarks-history:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"statement","title":"The classical upper bound","claim":{"id":"claim-unit-distances-four-thirds-upper","version":2,"slug":"unit-distances-four-thirds-upper","title":"The classical upper bound"},"fragment":"claim-unit-distances-four-thirds-upper","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-10beef855079aa1699b5","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"assessment","title":"Near-linear Euclidean conjecture refuted","claim":{"id":"claim-unit-distances-near-linear","version":1,"slug":"unit-distances-near-linear","title":"The near-linear unit-distance conjecture"},"fragment":"claim-unit-distances-near-linear","assessment":{"id":"erdos-unit-distances:report:false:v1","entry_id":"erdos-unit-distances:entry:remarks:v1","state":"refuted","source_label":"Near-linear Euclidean conjecture refuted","scope":"The n^(1+o(1)) upper bound, not the exact extremal growth.","source_date":"2026-05-20","observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-156c85a33ac9b8d31a0f","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"assessment","title":"Classical 4/3 upper bound","claim":{"id":"claim-unit-distances-four-thirds-upper","version":2,"slug":"unit-distances-four-thirds-upper","title":"The classical upper bound"},"fragment":"claim-unit-distances-four-thirds-upper","assessment":{"id":"erdos-unit-distances:report:upper:v1","entry_id":"erdos-unit-distances:entry:remarks:v1","state":"resolved","source_label":"Classical 4/3 upper bound","scope":"Historical universal upper bound; not a claim of optimality.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://cdn.openai.com/pdf/74c24085-19b0-4534-9c90-465b8e29ad73/unit-distance-remarks.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-4d89ad38ee334398e5f1","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"milestone","title":"A model-generated construction refutes near-linear growth","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-5106b9f307eba7de1eef","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"milestone","title":"Erdős introduces the planar distance question","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-db198b65e8f62ab7e430","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"milestone","title":"A universal four-thirds upper bound","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-fe1dba1e5d3bc937d0f4","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"question","title":"Erdős unit-distance problem","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-8cf0f3f02c062c59e9a1","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"reading","title":"Read the setting and notation before comparing the results.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-93d2457d2f729cc41942","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"statement","title":"A fixed power gain for infinitely many sizes","claim":{"id":"claim-unit-distances-positive-exponent","version":2,"slug":"unit-distances-positive-exponent","title":"A fixed power gain for infinitely many sizes"},"fragment":"claim-unit-distances-positive-exponent","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-9f92f1bebef85edf8dc3","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"statement","title":"The classical upper bound","claim":{"id":"claim-unit-distances-four-thirds-upper","version":2,"slug":"unit-distances-four-thirds-upper","title":"The classical upper bound"},"fragment":"claim-unit-distances-four-thirds-upper","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-adc7ce47d2ae6f10a16d","entry_id":"erdos-unit-distances:entry:remarks:v1","problem":{"slug":"erdos-unit-distances","title":"Erdős unit-distance problem","publication_version":6},"kind":"statement","title":"The near-linear unit-distance conjecture","claim":{"id":"claim-unit-distances-near-linear","version":1,"slug":"unit-distances-near-linear","title":"The near-linear unit-distance conjecture"},"fragment":"claim-unit-distances-near-linear","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}