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

Source record

back to sources

cap_61973ee16b553d57 · vc_14b7ee3e6bd3013d

id: vs_e3ef5d33d5297f89
frontier: Erdős problems frontier
type: synthetic_report

source boundary

frontier-owned

synthetic

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

3 reviewable changes and 0 evaluations are attached through this source or its findings.

citation

external source

locator

title:cap_61973ee16b553d57 · vc_14b7ee3e6bd3013d

imported

2026-05-30T00:42:06.826507+00:00

extraction mode

artifact_to_state_import

authors

Erdős Open-Problem spine ingest

caveats

source requires human review before being treated as evidence

Bound findings

Erdős Problem #241 remains OPEN. Statement: Is it true that $f(N)\sim N^{1/3}$? Originally asked to Erdős by Bose. This is discussed in problem C11 of Guy's collection [Gu04]. Topics: additive combinatorics, sidon sets. Erdős prize: $100. Statement is machine-verified in Lean (formal-conjectures). OEIS: A387704.
open_question · vf_18e6a86bd3459220

Evidence atoms

vea_be11d57ba4cb6cfdcomputational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_14b7ee3e6bd3013d"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_0ccfebcdedc5c34cfinding.add
Candidate claim vc_14b7ee3e6bd3013d imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_6baf3034f2560f5cfinding.note
SEMANTIC-EDGE DRAFT -> Erdos #41 (vf_e98c39e418546862) [specializes, confidence 0.85]: 241 (max A with all triple sums a+b+c distinct, a B_3 set) is the h=3 case of 41's general B_h condition that all n-tuple sums be distinct up to trivial coincidences. -- 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
vpr_b520f42ac56d6418finding.note
SEMANTIC-EDGE DRAFT -> Erdos #30 (vf_04c2ff267458866e) [shares_technique, confidence 0.7]: Both are extremal problems for the maximum size of an additive-distinctness set in {1,...,N}; 241's B_3 sets and 30's Sidon (B_2) sets are bounded by the same counting/representation-function arguments. -- 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.