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

id: vea_4b5e6905f26c0286
frontier: Erdős problems frontier
source: vs_b65ddd5864a1ee55
finding: vf_ff49e066608f6dc4

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #757 remains OPEN. Statement: What is the supremum of the set of admissible numbers? Topics: geometry, distances, sidon sets. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.

source binding

source-bound

cap_61973ee16b553d57 · vc_5e74bc696204f8cd

vs_b65ddd5864a1ee55

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

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_a566c5af01511ebf

caveats

No caveats recorded.

Review, event, and evaluation records

events

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

reviewable changes

vpr_e1ee6f180992c4f3finding.add
Candidate claim vc_5e74bc696204f8cd 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_5e74bc696204f8cd

1 events

Review, event, and evaluation records

Search Vela