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_957a550339c4ab19"}
- id
- vea_0fc997387dc7dff6
- frontier
- Erdős problems frontier
- source
- vs_67c39501cd7e41e7
- finding
- vf_f64b9cd7d1cf6002
finding binding
boundtheoretical
Erdős Problem #851 has been PROVED (Erdős's conjecture holds). Statement: Let $\epsilon > 0$. Is there some $r \ll_\epsilon 1$ such that the density of integers of the form $2^k+n$, where $k \geq 0$ and $n$ has at most $r$ prime divisors, is at least $1-\epsilon$? This was proved affirmatively by Price and GPT-5.2 Pro [Pr26]. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_957a550339c4ab19
vs_67c39501cd7e41e7
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_957a550339c4ab19"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_8cdca55a7cc89ac6
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_4891c8af5cebdf96finding.assertedCandidate claim vc_957a550339c4ab19 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_89061ad7acc30d1efinding.addCandidate claim vc_957a550339c4ab19 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.