The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation

arXiv 2605.18885•400ebcc5152083f60e3009791ccf2c118f3effa1dc658ac4e413ef07a234232c
CSIChase-decodingDNA-storageKolmogorov-complexityMIMOXRarXivchannel-estimationcoding-theorycommunicationsdiffusion-modelsfoundation-modelshypothesis-testinghysteresisinformation-theorymachine-learningpointwise-maximal-leakageprivacyrank-modulationroboticssequence-designsoft-coveringtensor-decompositiontime-series-compressionwireless

Paper metadata

arXiv ID
2605.18885
Version
Not specified by this published record
Category
Mathematics — Information Theory (math.IT)

The PDF link points to arxiv.org. Baitaphish does not expose a private stored PDF.

Evidence and limitations

Source ID
arxiv_math_it
Record identifier
400ebcc5152083f60e3009791ccf2c118f3effa1dc658ac4e413ef07a234232c
Enrichment time
2026-05-20T08:51:40Z
AI-assisted enrichment
Yes

This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.

The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation · Baitaphish