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

id: vea_1f330e214802b10d
frontier: Erdős problems frontier
source: vs_e37aa0988dceba8e
finding: vf_d9e346b8e73b7626

evidence boundary

supports

computational

finding binding

bound

theoretical

Erdős Problem #152 has been PROVED (Erdős's conjecture holds). Statement: Must `lim f n = ∞`? This was proved formally by the DeepMind prover agent [DM26a]. Topics: sidon sets. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

source binding

source-bound

cap_61973ee16b553d57 · vc_b36d583be01ef831

vs_e37aa0988dceba8e

review context

unverified

1 events

1 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_b36d583be01ef831"}

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_ea26e67b8d30252a

caveats

No caveats recorded.

Review, event, and evaluation records

events

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

reviewable changes

vpr_bbfec213a293f3cafinding.add
Candidate claim vc_b36d583be01ef831 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30

evaluations

No evaluation rows are attached.

computational

theoretical

cap_61973ee16b553d57 · vc_b36d583be01ef831

1 events

Review, event, and evaluation records

Search Vela