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_0945021eed5d97c8"}
- id
- vea_e3ed7dd2100ef377
- frontier
- Erdős problems frontier
- source
- vs_a2f50457ba0d0d3f
- finding
- vf_a5a5f9fdd6ed6430
finding binding
boundopen_question
Erdős Problem #885 remains OPEN. Statement: Is it true that, for every $k \geq 1$, there exist integers $N_1 < \dots < N_k$ such that $|\cap_i D(N_i)| \geq k$? Topics: number theory, divisors. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_0945021eed5d97c8
vs_a2f50457ba0d0d3f
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_0945021eed5d97c8"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_b4c1f08a232adb25
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_0183872c16af3abefinding.assertedCandidate claim vc_0945021eed5d97c8 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_dd9de667113d42cdfinding.addCandidate claim vc_0945021eed5d97c8 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.