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_b61c03ebaab858c5"}
- id
- vea_f64aae315b4a6434
- frontier
- Erdős problems frontier
- source
- vs_cc191353a8ffb11b
- finding
- vf_97b1edf68d581936
finding binding
boundtheoretical
Erdős Problem #69 has been PROVED (Erdős's conjecture holds). Statement: Is $$ \sum_{n\geq 2}\frac{\omega(n)}{2^n} $$ irrational? (Here $\omega(n)$ counts the number of distinct prime divisors of $n$.) Topics: number theory, irrationality. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A262153.
source binding
source-boundcap_61973ee16b553d57 · vc_b61c03ebaab858c5
vs_cc191353a8ffb11b
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_b61c03ebaab858c5"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_5183c64c750d3e8b
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_cd3f98fe807703ddfinding.assertedCandidate claim vc_b61c03ebaab858c5 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_9cc20ef52c717eaffinding.addCandidate claim vc_b61c03ebaab858c5 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.