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_b15d1309176439e7"}
- id
- vea_f7e869d1de7100d1
- frontier
- Erdős problems frontier
- source
- vs_bdf874b3941e1f9c
- finding
- vf_2de03f410f195cdc
finding binding
boundopen_question
Erdős Problem #32 remains OPEN. Statement: Does there exist a set $A \subseteq \mathbb{N}$ such that $|A \cap \{1, \ldots, N\}| = o((\log N)^2)$ and every sufficiently large integer can be written as $p + a$ for some prime $p$ and $a \in A$? Topics: number theory, additive basis. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_b15d1309176439e7
vs_bdf874b3941e1f9c
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_b15d1309176439e7"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_ebd2db7182dc60c2
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_3f506fcf9d3c8f9bfinding.assertedCandidate claim vc_b15d1309176439e7 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_ba9f13f035defe91finding.addCandidate claim vc_b15d1309176439e7 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.