evidence boundary
unknownfrontiers / frontier
Additive combinatorics: Sidon sets and N(h,k) bounds
- id
- vfr_496956067dc5ad79
- license
- CC-BY-4.0
- findings
- 22
- accepted core
- 1
- contested
- 1
- links
- 0
- sources
- 22
- evidence
- 22
- avg conf
- 0.83
e33/33 · finding.asserted · reviewer:will · 2026-06-03 · null→e123
Evidence atom
back to sourcesRoth's theorem: any subset of {1,...,N} of density alpha > C / log log N contains a nontrivial 3-term arithmetic progression.
- id
- vea_f96038a3a7013c00
- frontier
- Additive combinatorics: Sidon sets and N(h,k) bounds
- source
- vs_2bddd6f29fda7764
- finding
- vf_44e0fc831ac3e089
finding binding
boundtheoretical
Roth's theorem: any subset of {1,...,N} of density alpha > C / log log N contains a nontrivial 3-term arithmetic progression.
source binding
source-boundRoth 1953
vs_2bddd6f29fda7764
review context
unverified1 events
1 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
Roth's theorem: any subset of {1,...,N} of density alpha > C / log log N contains a nontrivial 3-term arithmetic progression.
extraction method
manual_curation
support relation
unknown
condition refs
vcnd_7ea00d244b3623bc
caveats
- missing evidence locator
Review, event, and evaluation records
2events
vev_3fb034752181ed75finding.assertedManual finding added to frontier state
agent:research-bot-2026-05-09 · 2026-05-09
reviewable changes
vpr_74482e3213627d43finding.addManual finding added to frontier state
applied · agent:research-bot-2026-05-09 · 2026-05-09
evaluations
No evaluation rows are attached.