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

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Evidence atom

back to sources

{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_0ae4ad8ae17ea9c5"}

id: vea_eb5f38544058a58e
frontier: Erdős problems frontier
source: vs_b58db1d56a4001af
finding: vf_f0526b9fdc0179a6

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #85 remains OPEN. Statement: Is it true that, for all large $n$, $f(n + 1) \ge f(n)$? Topics: graph theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A006672, possible.

source binding

source-bound

cap_61973ee16b553d57 · vc_0ae4ad8ae17ea9c5

vs_b58db1d56a4001af

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

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_c894ab4fb93c67f4

caveats

No caveats recorded.

Review, event, and evaluation records

events

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

reviewable changes

vpr_175c33c59e6f7eb6finding.add
Candidate claim vc_0ae4ad8ae17ea9c5 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_0ae4ad8ae17ea9c5

1 events

Review, event, and evaluation records

Search Vela