AHT modified unweighted orbit counter: exact-check bundle, 20 November 2026.
Python 3.10+ standard library; no network, provider keys or paid inference.
Run: python3 check_aht_repair_schedule.py --exhaustive-n 8 --random-cases 10000 --output fresh-results.json
The shipped results.json records the original run; the command performs a fresh run.
The implementation uses terminal-only static deletion and immediate stabilization.
It checks the entire orbit relation after every move on 53,667 exhaustive small
systems and 10,000 seeded random systems, plus large exact families.
The finite checks do not prove the universal complexity theorem. See checked-repair.md.
This is an unweighted replacement schedule, not the unchanged printed algorithm,
the weighted extension, a normal-surface realization, or formal verification.
