evidence boundary
unknownfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sourcesErdos distinct distances problem (1946 conjecture, essentially solved by Guth-Katz 2010): n points in the plane determine at least Omega(n / log n) distinct pairwise distances, matching Erdos's lattice-construction upper bound up to log factors.
- id
- vea_ec756f84b75b93fa
- frontier
- Erdős problems frontier
- source
- vs_0460ed79bea681a0
- finding
- vf_88e9c72c825c6e93
finding binding
boundtheoretical
Erdos distinct distances problem (1946 conjecture, essentially solved by Guth-Katz 2010): n points in the plane determine at least Omega(n / log n) distinct pairwise distances, matching Erdos's lattice-construction upper bound up to log factors.
source binding
source-boundGuth, Katz 2015, Annals of Mathematics
vs_0460ed79bea681a0
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Erdos distinct distances problem (1946 conjecture, essentially solved by Guth-Katz 2010): n points in the plane determine at least Omega(n / log n) distinct pairwise distances, matching Erdos's lattice-construction upper bound up to log factors.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_4e7bdace19be0984
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_01cbc1c1f859edc0finding.assertedManual finding added to frontier state
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_bf28adc91bbd702dfinding.addManual finding added to frontier state
applied · agent:vela-curation-bot · 2026-05-10
evaluations
No evaluation rows are attached.