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

id
vea_71ac78f6798be101
frontier
Erdős problems frontier
source
vs_73fe5212d640e313
finding
vf_b2c9adf370bbc6a8

evidence boundary

supports

computational

finding binding

bound

open_question

Erdős Problem #96 remains OPEN. Statement: If $n$ points in $\mathbb{R}^2$ form a convex polygon then there are $O(n)$ many pairs which are distance $1$ apart. Topics: geometry, distances, convex. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.

source binding

source-bound

cap_61973ee16b553d57 · vc_0fdd15875f2299e9

vs_73fe5212d640e313

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

locator

span:0

extraction method

artifact_to_state_import

support relation

supports

condition refs

vcnd_dce4c485f760c06c

caveats

No caveats recorded.

Review, event, and evaluation records

3

events

  • vev_fe1c8a3527ae424dfinding.asserted

    Candidate claim vc_0fdd15875f2299e9 imported from artifact packet cap_61973ee16b553d57

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

reviewable changes

  • vpr_428a37f45781880dfinding.note

    SEMANTIC-EDGE DRAFT -> Erdos #1085 (vf_cd90f1defdd5e12b) [specializes, confidence 0.65]: Problem 96 counts unit distances among the vertices of a convex n-gon, a convex-position restriction of the maximum-unit-distances problem 1085 for n points in R^d. -- 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_6f7c0a3575418a63finding.add

    Candidate claim vc_0fdd15875f2299e9 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.