proposed
reason
Manual finding added to frontier state
finding type
theoretical
proposed confidence
0.98
confidence basis
operator-supplied frontier prior; review required
frontiers / frontier
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Reviewable change
back to reviewErdos-Ginzburg-Ziv theorem (1961, solved): among any 2n-1 integers, there exist n whose sum is divisible by n. Tight: 2n-2 integers may admit no such subset.
accept gate
2 of 4 on recordtimeline
vpr_933b01bcb2066d02Manual finding added to frontier statenull→bcc1c04avev_2e5bce2042a57539Manual finding added to frontier stateproposed
reason
Manual finding added to frontier state
finding type
theoretical
proposed confidence
0.98
confidence basis
operator-supplied frontier prior; review required
provenance
proposed by
agent:vela-curation-bot
actor type
human
created at
2026-05-10
target type
finding
affected
inspect finding →Erdos-Ginzburg-Ziv theorem (1961, solved): among any 2n-1 integers, there exist n whose sum is divisible by n. Tight: 2n-2 integers may admit no such subset.
vf_e9e8b34f2a6a7b1dRead-only frontier; diff not recomputed.
Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.
The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.
Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.
A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.
Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.
Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.