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_c287d5a6b1f945dc"}
- id
- vea_c9cec9740237c090
- frontier
- Erdős problems frontier
- source
- vs_2fe29cd371868785
- finding
- vf_d72e9119de22c7fb
finding binding
boundopen_question
Erdős Problem #1145 remains OPEN. Statement: Let $A=\{1\leq a_1 < a_2 < \cdots\}$ and $B=\{1\leq b_1 < b_2 < \cdots\}$ be sets of integers with $a_n/b_n\to 1$. If $A+B$ contains all sufficiently large positive integers then is it true that $\limsup 1_A\ast 1_B(n)=\infty$? A conjecture of Erdős and Sárközy. Topics: additive combinatorics, additive basis. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_c287d5a6b1f945dc
vs_2fe29cd371868785
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_c287d5a6b1f945dc"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_210f6a489164e702
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_673ef1eff363e539finding.assertedCandidate claim vc_c287d5a6b1f945dc imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_3bf988c3c3d8fa40finding.addCandidate claim vc_c287d5a6b1f945dc imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.