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

id: vea_14318411b19217e0
frontier: Erdős problems frontier
source: vs_4c930a8d35d99121
finding: vf_0666e94eb74c8d1f

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #321 remains OPEN. Statement: Let $R(N)$ be the size of the largest $A\subseteq\{1, ..., N\}$ such that all sums $\sum_{n\in S} \frac{1}{n}$ are distinct for $S\subseteq A$. What is $R(N)$? Topics: number theory, unit fractions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A384927, A391592.

source binding

source-bound

cap_61973ee16b553d57 · vc_1575bccede72fc02

vs_4c930a8d35d99121

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

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_898c98ce7bf2d87a

caveats

No caveats recorded.

Review, event, and evaluation records

events

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

reviewable changes

vpr_3ed8bcf2814a401ffinding.add
Candidate claim vc_1575bccede72fc02 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_9bcdeb28beb77d47finding.note
SEMANTIC-EDGE DRAFT -> Erdos #319 (vf_d3d947902c6331cb) [related, confidence 0.55]: Both ask for the largest A in {1,...,N} with a distinctness/signed-sum condition on subset reciprocal sums, the same extremal subset-sum-of-reciprocals setup. -- 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_1575bccede72fc02

1 events

Review, event, and evaluation records

Search Vela