proposed
reason
Candidate claim vc_5fc07748214ab9d3 imported from artifact packet cap_61973ee16b553d57
finding type
open_question
proposed confidence
0.99
confidence basis
agent-imported candidate claim; reviewer acceptance required
frontiers / 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
Reviewable change
back to reviewadd a finding
acceptedErdős Problem #817 remains OPEN. Statement: Let $k \geq 3$. Define $g_k(n)$ to be the minimal $N$ such that $\{1, ..., N\}$ contains some $A$ of size $|A| = n$ such that $$ \langle A\rangle = \left\{\sum_{a \in A} \epsilon_a a : \epsilon_a \in\{0, 1\}\right\} $$ contains no non-trivial $k$-term arithmetic progression. Estimate $g_k(n)$. In particular, is it true that $$ g_3(n) \gg 3^n $$ Topics: additive combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
- id
- vpr_dcc351da4b552fb8
- frontier
- Erdős problems frontier
- kind
- finding.add
- created
- 2026-05-30
- findings
- +1
- state
- null → 5d39a893
accept gate
1 of 4 on record- —
- signature
- reviewer:erdos-db-trust · no key registered on this bundle
- ✓
- chain
- null → 5d39a893
- —
- witness
- no verifier attachment on record for this target
- —
- grade
- in state · unreviewed
timeline
- 2026-05-30proposeproposed · finding.addagent:erdos-spine-ingest
vpr_dcc351da4b552fb8Candidate claim vc_5fc07748214ab9d3 imported from artifact packet cap_61973ee16b553d57 - 2026-05-30acceptfinding.assertedreviewer:erdos-db-trust
null→5d39a893vev_3bf0e37cf725586fCandidate claim vc_5fc07748214ab9d3 imported from artifact packet cap_61973ee16b553d57
provenance
proposed by
agent:erdos-spine-ingest
actor type
agent
created at
2026-05-30
target type
finding
affected
inspect finding →Erdős Problem #817 remains OPEN. Statement: Let $k \geq 3$. Define $g_k(n)$ to be the minimal $N$ such that $\{1, ..., N\}$ contains some $A$ of size $|A| = n$ such that $$ \langle A\rangle = \left\{\sum_{a \in A} \epsilon_a a : \epsilon_a \in\{0, 1\}\right\} $$ contains no non-trivial $k$-term arithmetic progression. Estimate $g_k(n)$. In particular, is it true that $$ g_3(n) \gg 3^n $$ Topics: additive combinatorics. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.
vf_6fd2e4c31e5b09bcDiff
Read-only frontier; diff not recomputed.
Review chain
- 01requestopen review →
Change request
Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.
- 02packetopen the campaign →
Diff packet
The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.
- 03checksinspect checks →
Check output
Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.
- 04reviewread queue →
Reviewer decision
A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.
- 05acceptedinspect events →
Accepted event
Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.