proposed
reason
Candidate claim vc_58717a7c91facae6 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 #158 (?, AMS 5). STATEMENT: A set `A ⊆ ℕ` is said to be a `B₂[g]` set if for all `n`, the equation `a + a' = n, a ≤ a', a, a' ∈ A` has at most `g` solutions. This is defined in [ESS94]. FORMAL: erdos_158: answer(sorry) ↔ ∀ A : Set ℕ, A.Infinite → B2 2 A → liminf (fun N : ℕ => (A ∩ .Iio N).ncard * (N : ℝ) ^ (- 1 / 2 : ℝ)) atTop = 0; erdos_158: Set ℕ} (hAinf : A.Infinite) (hAsid : IsSidon A) : liminf (fun N ↦ ENNReal.ofReal ((A ∩ .Iio N).ncard * N ^ (- 1 / 2 : ℝ) * log N ^ (1 / 2 : ℝ))) atTo KNOWN/REMARKS: # Erdős Problem 158 *References:* - erdosproblems.com/158 - [ESS94] Erdős, P. and Sárközy, A. and Sós, T., On Sum Sets of Sidon Sets, I. Journal of Number Theory (1994), 329-347. | A set is `B₂[1]` iff it is Sidon. | Let `A` be an infinite `B₂[2]` set. Must `liminf |A ∩ {1, ..., N}| * N ^ (- 1 / 2) = 0`? RELATED: [] OEIS: []
- id
- vpr_9c5ff5ad5460da54
- 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_9c5ff5ad5460da54Candidate claim vc_58717a7c91facae6 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.