Vela
✦ 5 frontiers

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

Reviewable change

back to review

add a finding

verified — A frozen deterministic verifier re-checked the claim and passed.accepted

Erdős Problem #184 remains OPEN. Statement: Any graph on $n$ vertices can be decomposed into $O(n)$ many edge-disjoint cycles and edges. Topics: graph theory, cycles. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.

id
vpr_4287b9c5a1fb0024
frontier
Erdős problems frontier
kind
finding.add
created
2026-05-30
findings
+1
state
null → 0ba95989

accept gate

1 of 4 on record
—
signature
reviewer:erdos-db-trust · no key registered on this bundle
✓
chain
null → 0ba95989
—
witness
no verifier attachment on record for this target
—
grade
in state · unreviewed

timeline

  1. 2026-05-30proposeproposed · finding.addagent — machine actor, no signing keyagent:erdos-spine-ingestvpr_4287b9c5a1fb0024Candidate claim vc_70a31cfd519c89dd imported from artifact packet cap_61973ee16b553d57
  2. 2026-05-30acceptfinding.assertedreviewer:erdos-db-trustreviewer:erdos-db-trustnull→0ba95989vev_4c32aa2b9d64a54aCandidate claim vc_70a31cfd519c89dd imported from artifact packet cap_61973ee16b553d57

proposed

reason

Candidate claim vc_70a31cfd519c89dd imported from artifact packet cap_61973ee16b553d57

finding type

open_question

proposed confidence

0.99

confidence basis

agent-imported candidate claim; reviewer acceptance required

provenance

proposed by

agent — machine actor, no signing keyagent:erdos-spine-ingest

actor type

agent

created at

2026-05-30

target type

finding

affected

inspect finding →

Erdős Problem #184 remains OPEN. Statement: Any graph on $n$ vertices can be decomposed into $O(n)$ many edge-disjoint cycles and edges. Topics: graph theory, cycles. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: possible.

vf_d2e1cf3758199eb3

Diff

Read-only frontier; diff not recomputed.

Review chain

  1. 01request

    Change request

    Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.

    open review →
  2. 02packet

    Diff packet

    The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.

    open the campaign →
  3. 03checks

    Check output

    Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.

    inspect checks →
  4. 04review

    Reviewer decision

    A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.

    read queue →
  5. 05accepted

    Accepted event

    Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.

    inspect events →

finding.noted · reviewer:will-blair · 1 day

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.