proposed
reason
Candidate claim vc_d91b66fb777e4a82 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 #342 (?, AMS 5 11 40). STATEMENT: `UniqueUlamSum a n m` means that $m$ has a unique representation as $a(i) + a(j)$ with $i < j < n$. FORMAL: erdos_342: ∀ a : ℕ → ℕ, IsUlamSequence a → a 0 = 1; erdos_342: ∀ a : ℕ → ℕ, IsUlamSequence a → a 1 = 2; erdos_342: ∀ a : ℕ → ℕ, IsUlamSequence a → a 2 = 3 KNOWN/REMARKS: # Erdős Problem 342 *References:* - erdosproblems.com/342 - Ben Green's Open Problem 7 - OEIS A002858 - [Gu04] Guy, Richard K., *Unsolved problems in number theory* (2004), xviii+437. | `IsUlamSequence a` means that $a$ is the Ulam sequence (OEIS A002858): $a(0) = 1$, $a(1) = 2$, and for each $n \geq 2$, $a(n)$ is the least integer greater than $a(n-1)$ that has a unique representation as $a(i) + RELATED: [7] OEIS: []
- id
- vpr_1cdf9ac2da49ca0f
- 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_1cdf9ac2da49ca0fCandidate claim vc_d91b66fb777e4a82 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.