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
e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_23a5dcda42a736c4"}
- id
- vea_84351496e0bd9a39
- frontier
- Erdős problems frontier
- source
- vs_25fe96cbd4f0e3da
- finding
- vf_373bfdb5682a1918
finding binding
boundtheoretical
Erdős Problem #402 has been PROVED (Erdős's conjecture holds). Statement: Prove that, for any finite set $A\subset\mathbb{N}$, there exist $a, b\in A$ such that $$ \gcd(a, b)\leq a/|A|. $$ Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_23a5dcda42a736c4
vs_25fe96cbd4f0e3da
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_23a5dcda42a736c4"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_dd1cdbdc644279f5
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_891392027464fdfdfinding.assertedCandidate claim vc_23a5dcda42a736c4 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_c66219be5162c016finding.addCandidate claim vc_23a5dcda42a736c4 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.