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_edf93f3feefa98b9"}
- id
- vea_3fdedf073c108545
- frontier
- Erdős problems frontier
- source
- vs_0067cea25713ea97
- finding
- vf_e57b2f6fe26bfed2
finding binding
boundopen_question
Erdős Problem #1139 remains OPEN. Statement: Let $1\leq u_1 < u_2 < \cdots$ be the sequence of integers with at most $2$ prime factors. Is it true that $$\limsup_{k \to \infty} \frac{u_{k+1}-u_k}{\log k}=\infty?$$ Topics: number theory, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
source binding
source-boundcap_61973ee16b553d57 · vc_edf93f3feefa98b9
vs_0067cea25713ea97
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_edf93f3feefa98b9"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_e64282b8ad0dfc4e
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_e4b6c02600576635finding.assertedCandidate claim vc_edf93f3feefa98b9 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_ccd9432b796cac1afinding.addCandidate claim vc_edf93f3feefa98b9 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.