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

used by 0 · replayed by 2 producers

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Evidence atom

back to sources

{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_12186626c2859925"}

id: vea_4ce4ab7f99322e89
frontier: Erdős problems frontier
source: vs_cc62b9fc34c7151c
finding: vf_60a2b72edf78e6c9

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #33 remains OPEN. Statement: Let `A ⊆ ℕ` be a set such that every integer can be written as `n^2 + a` for some `a` in `A` and `n ≥ 0`. What is the smallest possible value of `lim sup n → ∞ |A ∩ {1, …, N}| / N^(1/2)`? Topics: number theory, additive basis. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

source binding

source-bound

cap_61973ee16b553d57 · vc_12186626c2859925

vs_cc62b9fc34c7151c

review context

unverified

1 events

2 reviewable changes and 0 evaluation records target this atom or its bound objects.

statement

{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_12186626c2859925"}

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_42d5565b4ea634b9

caveats

No caveats recorded.

Review, event, and evaluation records

events

vev_93a9c7a69cbca6f1finding.asserted
Candidate claim vc_12186626c2859925 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30

reviewable changes

vpr_55c2b057fb64a238finding.add
Candidate claim vc_12186626c2859925 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_8f220b1b3e0a2463finding.note
SEMANTIC-EDGE DRAFT -> Erdos #32 (vf_2de03f410f195cdc) [shares_technique, confidence 0.55]: Both ask for thin sets A that additively complement a fixed sparse set (the squares for 33, the primes for 32) so that the sumset covers all large integers, i.e. additive-complement constructions. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
pending_review · agent:semantic-edge-extractor · 2026-06-10

evaluations

No evaluation rows are attached.

computational

open_question

cap_61973ee16b553d57 · vc_12186626c2859925

1 events

Review, event, and evaluation records

Search Vela