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_98fde8cbe04b5b71"}
- id
- vea_a7c37f21e23cb04f
- frontier
- Erdős problems frontier
- source
- vs_9aeb5d672d0cdbd8
- finding
- vf_d6ad604be783e501
finding binding
boundopen_question
Erdős Problem #689 remains OPEN. Statement: Let `n` be sufficiently large. Is there some choice of congruence class `a_p` for all primes `2 ≤ p ≤ n` such that every integer in `[1,n]` satisfies at least two of the congruences `≡ a_p (mod p)`? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_98fde8cbe04b5b71
vs_9aeb5d672d0cdbd8
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_98fde8cbe04b5b71"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_a658f0e1d15b7403
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_e998d389066b1095finding.assertedCandidate claim vc_98fde8cbe04b5b71 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_759c990113fc13b5finding.addCandidate claim vc_98fde8cbe04b5b71 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.