Manuscript Psy01-A@1 · Psy01-A.tex · section · 94477fa3

Claim-to-certificate ledger

Claim-to-certificate ledger · lines 2614–2689

Psy01-A@1#tab:ledger

Back to manuscript
status of the proposed theorem candidates.
Proposed claimStatusValid replacement
Proposed claimStatusValid replacement
Universal cue-loss threshold near False for the architecture classInformation obstruction, cue-sensitivity certificate, and a checkpoint-specific diagnostic.
High-density pruning necessarily increases selectivity and decreases stress toleranceNot implied by density or magnitude rankingStrict comparison using stress bounds and Theorem thm:transfer; solved conditional comparison model.
Hard-pruning accuracy surface is Lipschitz away from an empirical thresholdFalse without additional qualificationsParameter-to-logit stability; margin-conditioned accuracy control; soft-density surrogate.
Early and late masks do not commuteFalse for fixed masks; fixed-weight nested rankings agreeLearning-induced ranking defect and the projection–gradient bound.
A unique increasing optimal late-pruning curve always existsNot established; hard paths can have plateaus or jumpsCompact existence, an implicit branch under regularity assumptions, and an explicit comparison-model curve.
Surviving connection count controls observable varianceInsufficient on its ownIndependent-mask matrix variance and bounded edge-influence concentration.
Same final density implies the same fragilityFalseNoise sensitivity depends on margins, geometry, parameterization, and noise covariance.
Quantum landmark results directly prove neural pruning claimsNot a valid model identificationIndependent classical proofs retaining the landmarks' construction, fluctuation, observation, and causal boundaries.

Nearby in this section