Vela

frontiers / frontier

Erdős problems frontier

constellation seal · derived from vfr_37aec80d874a0239
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_e15dd74067fdfe41"}

id
vea_7b8dbae63097ee3a
frontier
Erdős problems frontier
source
vs_37176db99ccc7543
finding
vf_5a65e348c1b296c0

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #386 remains OPEN. Statement: There is a $k$, such that $2 \le k \le n - 2$ and $\binom{n}{k}$ can be the product of consecutive primes infinitely often? Topics: number theory, binomial coefficients. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A280992.

source binding

source-bound

cap_61973ee16b553d57 · vc_e15dd74067fdfe41

vs_37176db99ccc7543

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

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_88408581df82d442

caveats

No caveats recorded.

Review, event, and evaluation records

3

events

  • vev_12edb96c801e4000finding.asserted

    Candidate claim vc_e15dd74067fdfe41 imported from artifact packet cap_61973ee16b553d57

    reviewer:erdos-db-trustreviewer:erdos-db-trust · 2026-05-30

reviewable changes

  • vpr_889ec26d4fa2e778finding.note

    SEMANTIC-EDGE DRAFT -> Erdos #387 (vf_b3b3b5863382d573) [related, confidence 0.55]: Both concern the multiplicative/divisor structure of binomial coefficients (386: C(n,k) as a product of consecutive primes; 387: C(n,k) having a divisor in (cn,n]), analyzed through prime factorizations of binomials. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.

    agent — machine actor, no signing keypending_review · agent:semantic-edge-extractor · 2026-06-10

  • vpr_ada30f0bfed491a7finding.add

    Candidate claim vc_e15dd74067fdfe41 imported from artifact packet cap_61973ee16b553d57

    agent — machine actor, no signing keyapplied · agent:erdos-spine-ingest · 2026-05-30

evaluations

No evaluation rows are attached.

finding.noted · reviewer:will-blair · 2 days

renders the record as of vev_d199cb2e · 1,338 events · hub

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.