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

e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null

Evidence atom

back to sources

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

id: vea_e52ed1f184951ecd
frontier: Erdős problems frontier
source: vs_eda32dd43a25bc9a
finding: vf_12edf5d520c20c45

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #295 remains OPEN. Statement: Let $k(N)$ denote the smallest $k$ such that there exists $N ≤ n_1 < ⋯ < n_k$ with $\frac 1 {n_1} + ... + \frac 1 {n_k} = 1$ Is it true that $\lim_{N \to \infty} k(N) - (e - 1)N = \infty$? Topics: number theory, unit fractions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A192881.

source binding

source-bound

cap_61973ee16b553d57 · vc_14418b2b2bd92fa8

vs_eda32dd43a25bc9a

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_14418b2b2bd92fa8"}

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_b0483d3adf12b2fb

caveats

No caveats recorded.

Review, event, and evaluation records

events

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

reviewable changes

vpr_7081f1371827ff39finding.add
Candidate claim vc_14418b2b2bd92fa8 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_cc056a1fcb00ca11finding.note
SEMANTIC-EDGE DRAFT -> Erdos #289 (vf_e03590a9131c59a7) [reduction, confidence 0.6]: The dense Egyptian-representation lemma 295 supplies the building block that reduces the interval-construction question 289 to packing such reciprocal runs. -- 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_14418b2b2bd92fa8

1 events

Review, event, and evaluation records

Search Vela