# A certified decoder bridge from finite scalar data to compressed neural heads ## Scope The scalar optimal filter supplies a universal regularity/retention operation, but its oracle form assumes access to a residual function. Finite Lipschitz envelopes already address that access issue. This continuation instead studies **certificate-preserving compression** and a data-adaptive decoder whose guarantees hold on an entire interval, rather than only on sampled queries. The setting is deliberately restricted: one real input, one scalar output, a known piecewise-affine nonnegative guard, and bounded/Lipschitz heads. Piecewise-linear ReLU interpolation, linear programming, Lipschitz envelopes, and metric-entropy arguments are established methods. The proposed contribution is their explicit coupling to the retention contract, including exact continuous-domain constraints, separation, a compression guarantee, and an entropy obstruction. No worldwide priority or general RSI claim is established. ## 1. The finite-data information contract Work on \(I=[-1,1]\), with protected set \(K=\{0\}\), guard \(g(x)=|x|\), and scalar residuals \(r\) satisfying \(r(0)=0\) and \(\operatorname{Lip}(r)\le1\). Given consistent exact samples \((x_i,y_i)\), the established envelopes are \[ \ell(x)=\max\{-g(x),\max_i[y_i-|x-x_i|]\},\quad u(x)=\min\{g(x),\min_i[y_i+|x-x_i|]\}. \] Let \(m=(\ell+u)/2\), \(w=(u-\ell)/2\). Both envelopes themselves belong to the sample-consistent class. Therefore the exact conditional worst-case error of any fixed decoder \(f\) is \[ \mathcal R_S(f)=\sup_{r\text{ consistent}}\|r-f\|_\infty =\sup_{x\in I}\max\{u(x)-f(x),f(x)-\ell(x)\} =\sup_x[w(x)+|m(x)-f(x)|]. \] This certificate concerns every sample-consistent 1-Lipschitz target, not an assumed target formula. It can favor a different prediction from the best prediction on a particular smooth ground truth. ## 2. Exact whole-interval constraints for a compressed ReLU head Take knots \(-1=z_0<\cdots