proposed
reason
Candidate claim vc_e2633566a9d07742 imported from artifact packet cap_f4e8bcd294c97ba7
finding type
theoretical
proposed confidence
0.95
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
openErdős #340 (?, AMS 5). STATEMENT: Given a finite Sidon set `A` and a lower bound `m`, `go` finds the smallest number `m' ≥ m` such that `A ∪ {m'}` is Sidon. If `A` is empty then this returns the value `m`. Note that the lower bound is required to avoid `0` being a contender in some cases. FORMAL: greedySidon_go_singleton_two: (greedySidon.go {1} (by simp [IsSidon]) 2).val = 2; greedySidon_go_pair_three: (greedySidon.go {1, 2} (by simp [IsSidon]) 3).val = 4; greedySidon_zero: greedySidon 0 = 1 KNOWN/REMARKS: # Erdős Problem 340 *Reference:* erdosproblems.com/340 | Main search loop for generating the greedy Sidon sequence. The return value for step `n` is the finite set of numbers generated so far, a proof that it is Sidon, and the greatest element of the finite set at that point. This is initialised at `{1}`, then `greedySidon.go` is called iteratively using the lower bound `max + 1` to find the next RELATED: [] OEIS: []
- id
- vpr_5e3c93b419c68ad2
- frontier
- Erdős problems frontier
- kind
- finding.add
- created
- 2026-06-04
A proposal; no authority until an accepted review event.
accept gate
0 of 4 on record- ·
- signature
- no terminal verdict yet
- ·
- chain
- no state transition yet
- —
- witness
- no verifier attachment on record for this target
- ·
- grade
- target not (yet) in frontier state
timeline
- 2026-06-04proposeproposed · finding.addagent:erdos-deep-ingest
vpr_5e3c93b419c68ad2Candidate claim vc_e2633566a9d07742 imported from artifact packet cap_f4e8bcd294c97ba7
provenance
proposed by
agent:erdos-deep-ingest
actor type
agent
created at
2026-06-04
target type
finding
Diff
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.