The Disclosure Deficit
What Survives the Fee Family
Which fee-family results remain after removing the topology, safety, and prediction claims?
fee(G) = rank δ_full − rank δ_obs = |H| − #(components touched by hidden fields); the witness matroid is a direct sum of uniform matroids, so the minimum-disclosure-set count is ∏|C_{d,j}|
This internal consolidation lane admits only audited disclosure, rank, incidence, repair, and null results.
Abstract
Six papers advanced a scalar invariant of tool composition and the repair theory built on it; five are withdrawn and one archived. What survives is a rank identity and its matroid backbone: the deficit is a difference of two signed-incidence ranks, equal to the hidden-field count minus the number of components those fields touch, field-independent by total unimodularity. The repair space is a product of carrier-component sizes, not a product of spanning-tree counts. The claimed operational sparsity of the repair space is not supported.
Consolidates only surviving results from the withdrawn fee-family papers; the spanning-tree basis count it replaces was wrong.
Any included result that depends on cycle necessity, topology branding, execution prediction, or a false repair-basis statement must be removed.
not requested
- carries forward The Coherence Fee Paper I
- carries forward The Witness Gram Paper III
- carries forward Witness Geometry Beyond Scalar Fee