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

id: vea_19f6dc3037233a30
frontier: Erdős problems frontier
source: vs_c9681ed193cb2dc3
finding: vf_cd46c7499a157984

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #469 remains OPEN. Statement: Let $A$ be the set of all $n$ such that $n = d_1 + ⋯ + d_k$ with $d_i$ distinct proper divisors of $n$, but this is not true for any $m ∣ n$ with $m < n$. Does: $$ \sum_{n ∈ A} \frac 1 n $$ converge? Topics: number theory, divisors. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A006036, A119425, possible.

source binding

source-bound

cap_61973ee16b553d57 · vc_4494e6d6980b9d1c

vs_c9681ed193cb2dc3

review context

unverified

1 events

3 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_4494e6d6980b9d1c"}

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_90686035fb2f67ab

caveats

No caveats recorded.

Review, event, and evaluation records

events

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

reviewable changes

vpr_06f23eb4d91932f0finding.note
SEMANTIC-EDGE DRAFT -> Erdos #470 (vf_9d981d629f64c6b7) [related, confidence 0.78]: A weird number (the basis of 470's primitive weird numbers) is precisely an abundant number that is NOT a sum of distinct proper divisors, so 470's objects are exactly the n for which 469's predicate fails despite abundance. -- 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_79102ea86b9a0857finding.note
SEMANTIC-EDGE DRAFT -> Erdos #859 (vf_bc60ced0147c0c61) [related, confidence 0.72]: Both concern representing a number as a sum of distinct divisors: 469 asks whether n is a sum of distinct proper divisors, while 859's DivisorSumSet is exactly the set of n for which a target t is a sum of distinct divisors of n. -- 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_dbf87d2f41467d69finding.add
Candidate claim vc_4494e6d6980b9d1c imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30

evaluations

No evaluation rows are attached.

computational

open_question

cap_61973ee16b553d57 · vc_4494e6d6980b9d1c

1 events

Review, event, and evaluation records

Search Vela