Claims

../

2026_10_19_plasma_ai: Plasma AI proves that h_G(n)/n tends to infinity for every graph of chromatic number aleph one, because linear edge-bipartization budgets force countable colorings; the proof has an independently graded tier-1 warrant, and the claim is accepted on this corpus's rebuild, Comparator check and kernel replay of its Lean formalization and a graded review of its statements.

---