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
e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null
Evidence atom
back to sourcesErdos unit distance problem (1946, open): the maximum number of unit-distance pairs among n points in the plane is at most O(n^(4/3)) (Spencer-Szemeredi-Trotter 1984) and at least Omega(n^(1 + c / log log n)) (Erdos lattice construction); the truth between these is open.
- id
- vea_4a70717689649273
- frontier
- Erdős problems frontier
- source
- vs_acd26fe21f2593b1
- finding
- vf_bb06a4c06188a214
finding binding
boundtheoretical
Erdos unit distance problem (1946, open): the maximum number of unit-distance pairs among n points in the plane is at most O(n^(4/3)) (Spencer-Szemeredi-Trotter 1984) and at least Omega(n^(1 + c / log log n)) (Erdos lattice construction); the truth between these is open.
source binding
source-boundErdos 1946; Spencer, Szemeredi, Trotter 1984 upper bound
vs_acd26fe21f2593b1
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Erdos unit distance problem (1946, open): the maximum number of unit-distance pairs among n points in the plane is at most O(n^(4/3)) (Spencer-Szemeredi-Trotter 1984) and at least Omega(n^(1 + c / log log n)) (Erdos lattice construction); the truth between these is open.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_8ef1726a5d17e5d7
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_db5aaafeab811d38finding.assertedManual finding added to frontier state
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_0a0e0da8aeaeaaaffinding.addManual finding added to frontier state
applied · agent:vela-curation-bot · 2026-05-10
evaluations
No evaluation rows are attached.