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

id: vea_ad8736939e12bbeb
frontier: Erdős problems frontier
source: vs_63ea20ea4073b7d5
finding: vf_e03590a9131c59a7

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #289 remains OPEN. Statement: Is it true that, for all sufficiently large $k$, there exists finite intervals $I_1, \dotsc, I_k \subset \mathbb{N}$ with $|I_i| \geq 2$ for $1 \leq i \leq k$ such that $$ 1 = \sum_{i=1}^k \sum_{n \in I_i} \frac{1}{n}. $$ Topics: number theory, unit fractions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

source binding

source-bound

cap_61973ee16b553d57 · vc_b9592334a25d488f

vs_63ea20ea4073b7d5

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

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_134a2ef08ef4184d

caveats

No caveats recorded.

Review, event, and evaluation records

events

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

reviewable changes

vpr_b3c5465f50319c14finding.add
Candidate claim vc_b9592334a25d488f imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_cea8a84628903867finding.note
SEMANTIC-EDGE DRAFT -> Erdos #295 (vf_12edf5d520c20c45) [depends_on, confidence 0.7]: Problem 295 is stated as a helper lemma producing a run n_1<...<n_k of integers above N with reciprocal sum a prescribed value, the existence ingredient needed to build the k intervals in 289. -- 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_b9592334a25d488f

1 events

Review, event, and evaluation records

Search Vela