evidence boundary
supportsfrontiers / 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 sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_fa5dc43693fd5595"}
- id
- vea_357edb1f18dd932f
- frontier
- Erdős problems frontier
- source
- vs_beb8b93183dd14a1
- finding
- vf_a799eda095525e0e
finding binding
boundopen_question
Erdős Problem #653 remains OPEN. Statement: Let $x_1,\ldots,x_n\in \mathbb{R}^2$ and let $R(x_i)=\#\{ \lvert x_j-x_i\rvert : j\neq i\}$, where the points are ordered such that $$R(x_1)\leq \cdots \leq R(x_n).$$ Let $g(n)$ be the maximum number of distinct values the $R(x_i)$ can take. Is it true that $g(n) \geq (1-o(1))n$? Topics: geometry, distances. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_fa5dc43693fd5595
vs_beb8b93183dd14a1
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_fa5dc43693fd5595"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_434c758a182dcdcc
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_57c96efc206647bdfinding.assertedCandidate claim vc_fa5dc43693fd5595 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_8a53a408aa575da8finding.addCandidate claim vc_fa5dc43693fd5595 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.