proposed
reason
Candidate claim vc_c5b2a5d8c28adc54 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 #340 remains OPEN. Statement: Let $A = \{1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, \ldots\}$ be the greedy Sidon sequence: we begin with $1$ and iteratively include the next smallest integer that preserves the Sidon property (i.e. there are no non-trivial solutions to $a + b = c + d$). What is the order of growth of $A$? Is it true that $|A \cap \{1, \ldots, N\}| \gg N^{1/2 - \varepsilon}$ for all $\varepsilon > 0$ and large $N$? Topics: number theory, additive combinatorics, sidon sets. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A080200, A005282.
- id
- vpr_581bb4d35f13589a
- frontier
- Erdős problems frontier
- kind
- finding.add
- created
- 2026-05-30
- findings
- +1
- state
- null → a6a2f422
accept gate
1 of 4 on record- —
- signature
- reviewer:erdos-db-trust · no key registered on this bundle
- ✓
- chain
- null → a6a2f422
- —
- witness
- no verifier attachment on record for this target
- —
- grade
- in state · unreviewed
timeline
- 2026-05-30proposeproposed · finding.addagent:erdos-spine-ingest
vpr_581bb4d35f13589aCandidate claim vc_c5b2a5d8c28adc54 imported from artifact packet cap_61973ee16b553d57 - 2026-05-30acceptfinding.assertedreviewer:erdos-db-trust
null→a6a2f422vev_5a9e6452f4be17e6Candidate claim vc_c5b2a5d8c28adc54 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 #340 remains OPEN. Statement: Let $A = \{1, 2, 4, 8, 13, 21, 31, 45, 66, 81, 97, \ldots\}$ be the greedy Sidon sequence: we begin with $1$ and iteratively include the next smallest integer that preserves the Sidon property (i.e. there are no non-trivial solutions to $a + b = c + d$). What is the order of growth of $A$? Is it true that $|A \cap \{1, \ldots, N\}| \gg N^{1/2 - \varepsilon}$ for all $\varepsilon > 0$ and large $N$? Topics: number theory, additive combinatorics, sidon sets. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A080200, A005282.
vf_663ef26e7045ee26Diff
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.