{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LX3EEICOULFIO6JTARXNM5MEPT","short_pith_number":"pith:LX3EEICO","schema_version":"1.0","canonical_sha256":"5df642204ea2ca877933046ed675847cc56a624e9c916241748e45099a097e89","source":{"kind":"arxiv","id":"2605.18885","version":1},"attestation_state":"computed","paper":{"title":"The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Piotr Frydrych","submitted_at":"2026-05-16T19:21:37Z","abstract_excerpt":"We prove that the extremum stack of a discrete sequence is a minimal sufficient statistic for the class of all computable, causal, rate-independent functionals, in the sense of Kolmogorov complexity. Specifically, we establish K(Pi_n) - O(1) <= K_R(u_{0:n}) <= K(Pi_n) + O(1), where K_R(u_{0:n}) is the length of the shortest program answering every query in the class R, and the O(1) overhead is independent of both the sequence length n and the stack depth k. Sufficiency follows from the classical wiping property of the Preisach hysteresis operator. Minimality is established via a finite indicat"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.18885","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T19:21:37Z","cross_cats_sorted":["cs.AI","cs.CC","math.IT"],"title_canon_sha256":"5dc61f199d2d1cc93b994dcd8ab29e63a7cac1f247c226520578ae170d84dad2","abstract_canon_sha256":"aa4658b1ec418c18978d85c8c8fc2dbd93a0b0a3c0d1530651a25671839b5565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:06:30.503174Z","signature_b64":"BtuklDBjMYQAR1gD58PdoaRj1bDtokVRiiDDRAB9LGR6rJZwWtj0ovr1mC0JLHbnaGgYbJFq94TcuJRVAaOFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5df642204ea2ca877933046ed675847cc56a624e9c916241748e45099a097e89","last_reissued_at":"2026-05-20T00:06:30.502434Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:06:30.502434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Piotr Frydrych","submitted_at":"2026-05-16T19:21:37Z","abstract_excerpt":"We prove that the extremum stack of a discrete sequence is a minimal sufficient statistic for the class of all computable, causal, rate-independent functionals, in the sense of Kolmogorov complexity. Specifically, we establish K(Pi_n) - O(1) <= K_R(u_{0:n}) <= K(Pi_n) + O(1), where K_R(u_{0:n}) is the length of the shortest program answering every query in the class R, and the O(1) overhead is independent of both the sequence length n and the stack depth k. Sufficiency follows from the classical wiping property of the Preisach hysteresis operator. Minimality is established via a finite indicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18885","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18885/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.18885","created_at":"2026-05-20T00:06:30.502564+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18885v1","created_at":"2026-05-20T00:06:30.502564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18885","created_at":"2026-05-20T00:06:30.502564+00:00"},{"alias_kind":"pith_short_12","alias_value":"LX3EEICOULFI","created_at":"2026-05-20T00:06:30.502564+00:00"},{"alias_kind":"pith_short_16","alias_value":"LX3EEICOULFIO6JT","created_at":"2026-05-20T00:06:30.502564+00:00"},{"alias_kind":"pith_short_8","alias_value":"LX3EEICO","created_at":"2026-05-20T00:06:30.502564+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT","json":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT.json","graph_json":"https://pith.science/api/pith-number/LX3EEICOULFIO6JTARXNM5MEPT/graph.json","events_json":"https://pith.science/api/pith-number/LX3EEICOULFIO6JTARXNM5MEPT/events.json","paper":"https://pith.science/paper/LX3EEICO"},"agent_actions":{"view_html":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT","download_json":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT.json","view_paper":"https://pith.science/paper/LX3EEICO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18885&json=true","fetch_graph":"https://pith.science/api/pith-number/LX3EEICOULFIO6JTARXNM5MEPT/graph.json","fetch_events":"https://pith.science/api/pith-number/LX3EEICOULFIO6JTARXNM5MEPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/action/storage_attestation","attest_author":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/action/author_attestation","sign_citation":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/action/citation_signature","submit_replication":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/action/replication_record"}},"created_at":"2026-05-20T00:06:30.502564+00:00","updated_at":"2026-05-20T00:06:30.502564+00:00"}