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_03fc7652ee0c537d"}
- id
- vea_40dca7530f8643d1
- frontier
- Erdős problems frontier
- source
- vs_d9a86e7bf8541c3b
- finding
- vf_017fe040a7805919
finding binding
boundopen_question
Erdős Problem #749 remains OPEN. Statement: Let $\epsilon>0$. Does there exist $A\subseteq \mathbb{N}$ such that the lower density of $A+A$ is at least $1-\epsilon$ and yet $1_A\ast 1_A(n) \ll_\epsilon 1$ for all $n$? Topics: additive combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_03fc7652ee0c537d
vs_d9a86e7bf8541c3b
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_03fc7652ee0c537d"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_3191075de1d4bf00
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_60323f247022a724finding.assertedCandidate claim vc_03fc7652ee0c537d imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_665ea2816098ceb9finding.addCandidate claim vc_03fc7652ee0c537d imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.