The extremum stack is a minimal sufficient statistic for computable causal rate-independent functionals, with Kolmogorov complexity bounds establishing both sufficiency and minimality.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
The extremum stack is a minimal sufficient statistic for computable causal rate-independent functionals, with Kolmogorov complexity bounds establishing both sufficiency and minimality.