Rows were labelled, not proof-admitted.
Source, cutoff, regulation-time scope, duplicate reconciliation, and review must be frozen row by row.
M101 / proof folder
Why did Villanova block the C4?
A plain-language proof boundary: which premises exist, which premises fail, and why a shortlist cannot be promoted by presentation alone.
Blocker theorem
A reproducible shortlist is not yet a proved selector.
Admissibility
Eligible(C4) := F AND A AND R AND M AND S10 AND K AND U AND T AND LThe model supports a numerical component M and conditional realm calculation. The proof audit finds row admission A, contradiction lemmas K, unique selector U, and synchronized lock L unresolved. One false conjunct is enough to block eligibility.
The four binding failures
Conditional realms were computed, not legally inherited.
A realm cannot outrun the admission status of the rows from which it is calculated.
Contradiction attacks were incomplete.
Each selected score needs a source-bound attack and a numeric reason it survives the strongest alternative.
The lock missed its public usefulness window.
The label was completed after kickoff, so it cannot be rewritten as a pregame prediction.