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

Reviewable change

back to review

finding.note

claimed — no verifier run, no signed judgmentopen

Erdős Problem #592 remains OPEN. Statement: Determine which countable ordinals $β$ have the property that, if $α = \omega^β$, then in any red/blue colouring of the edges of $K_α$ there is either a red $K_α$ or a blue $K_3$. Topics: set theory, ramsey theory. Erdős prize: $1000. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

id
vpr_760198e68ab754aa
frontier
Erdős problems frontier
kind
finding.note
created
2026-06-10

A proposal; no authority until an accepted review event.

accept gate

0 of 4 on record
·
signature
no terminal verdict yet
·
chain
no state transition yet
witness
no verifier attachment on record for this target
grade
in state · unreviewed

timeline

  1. 2026-06-10proposeproposed · finding.noteagent — machine actor, no signing keyagent:semantic-edge-extractorvpr_760198e68ab754aaSEMANTIC-EDGE DRAFT -> Erdos #598 (vf_3be6fbb0bb72199c) [shares_technique, confidence 0.55]: Both are partition-calculus questions about arrow relations on infinite structures (592 on K_{ω^β} for countable ordinals, 598 on K_κ for κ=(2^{ℵ_0})^+), solved by the same Erdős–Rado ordinal/cardinal partition machinery. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.

proposed

reason

SEMANTIC-EDGE DRAFT -> Erdos #598 (vf_3be6fbb0bb72199c) [shares_technique, confidence 0.55]: Both are partition-calculus questions about arrow relations on infinite structures (592 on K_{ω^β} for countable ordinals, 598 on K_κ for κ=(2^{ℵ_0})^+), solved by the same Erdős–Rado ordinal/cardinal partition machinery. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.

provenance

proposed by

agent — machine actor, no signing keyagent:semantic-edge-extractor

actor type

human

created at

2026-06-10

target type

finding

Erdős Problem #592 remains OPEN. Statement: Determine which countable ordinals $β$ have the property that, if $α = \omega^β$, then in any red/blue colouring of the edges of $K_α$ there is either a red $K_α$ or a blue $K_3$. Topics: set theory, ramsey theory. Erdős prize: $1000. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.

vf_adb50d657b7bed82

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.