v0.9.0 — Kelmans' 1984 problem verified to 22 vertices

Every 3-connected cubic graph on at most 22 vertices — all 6,339,157 — satisfies Kelmans' 1984 conjecture, together with the applicable strong forms of his equivalence theorem. First recorded computational verification of the problem at any order. Two pipelines sharing no code agree on every count; 43,580 certificates re-verified from graph6 strings by standard-library checkers. Order 24 is attack-side complete (98,101,019 graphs, no failure) with the independent recount outstanding, and is reported at that strength only. Review log: kelmans-paper/FIXLOG.md. Paper: kelmans-paper/note.pdf