{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LX3EEICOULFIO6JTARXNM5MEPT","short_pith_number":"pith:LX3EEICO","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"},"canonical_sha256":"5df642204ea2ca877933046ed675847cc56a624e9c916241748e45099a097e89","source":{"kind":"arxiv","id":"2605.18885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18885","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18885v1","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18885","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"LX3EEICOULFI","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"LX3EEICOULFIO6JT","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"LX3EEICO","created_at":"2026-05-20T00:06:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LX3EEICOULFIO6JTARXNM5MEPT","target":"record","payload":{"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"},"canonical_sha256":"5df642204ea2ca877933046ed675847cc56a624e9c916241748e45099a097e89","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"},"source_kind":"arxiv","source_id":"2605.18885","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQiG/vNr6Y/ai2e4R6k8AcPzwuipPNWsJM0ZB0rCeeuOR2zHYBVyYdwE9KL21dC7mtN2kZbjIpIijh86dUwIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:07.720592Z"},"content_sha256":"dd050ab7eece4d909d2fab2fbe9768d4f47df895e19e85f6bf11338f58532fc1","schema_version":"1.0","event_id":"sha256:dd050ab7eece4d909d2fab2fbe9768d4f47df895e19e85f6bf11338f58532fc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LX3EEICOULFIO6JTARXNM5MEPT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:06:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epcupitwPZ+WDHz/EZ3kElsEcQmepAMdIRI3VI1aT49K7eL+HpbyEVqyiQqTfVL7bxVav0fKsW6BBIy+u4BhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:07.721290Z"},"content_sha256":"4ac0eae045bdda5d0d4299c7367e966654f7e474105324ba8259761a007743d1","schema_version":"1.0","event_id":"sha256:4ac0eae045bdda5d0d4299c7367e966654f7e474105324ba8259761a007743d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/bundle.json","state_url":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LX3EEICOULFIO6JTARXNM5MEPT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T23:51:07Z","links":{"resolver":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT","bundle":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/bundle.json","state":"https://pith.science/pith/LX3EEICOULFIO6JTARXNM5MEPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LX3EEICOULFIO6JTARXNM5MEPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LX3EEICOULFIO6JTARXNM5MEPT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa4658b1ec418c18978d85c8c8fc2dbd93a0b0a3c0d1530651a25671839b5565","cross_cats_sorted":["cs.AI","cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T19:21:37Z","title_canon_sha256":"5dc61f199d2d1cc93b994dcd8ab29e63a7cac1f247c226520578ae170d84dad2"},"schema_version":"1.0","source":{"id":"2605.18885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18885","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18885v1","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18885","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"pith_short_12","alias_value":"LX3EEICOULFI","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"pith_short_16","alias_value":"LX3EEICOULFIO6JT","created_at":"2026-05-20T00:06:30Z"},{"alias_kind":"pith_short_8","alias_value":"LX3EEICO","created_at":"2026-05-20T00:06:30Z"}],"graph_snapshots":[{"event_id":"sha256:4ac0eae045bdda5d0d4299c7367e966654f7e474105324ba8259761a007743d1","target":"graph","created_at":"2026-05-20T00:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.18885/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Piotr Frydrych","cross_cats":["cs.AI","cs.CC","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T19:21:37Z","title":"The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18885","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dd050ab7eece4d909d2fab2fbe9768d4f47df895e19e85f6bf11338f58532fc1","target":"record","created_at":"2026-05-20T00:06:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa4658b1ec418c18978d85c8c8fc2dbd93a0b0a3c0d1530651a25671839b5565","cross_cats_sorted":["cs.AI","cs.CC","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-16T19:21:37Z","title_canon_sha256":"5dc61f199d2d1cc93b994dcd8ab29e63a7cac1f247c226520578ae170d84dad2"},"schema_version":"1.0","source":{"id":"2605.18885","kind":"arxiv","version":1}},"canonical_sha256":"5df642204ea2ca877933046ed675847cc56a624e9c916241748e45099a097e89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5df642204ea2ca877933046ed675847cc56a624e9c916241748e45099a097e89","first_computed_at":"2026-05-20T00:06:30.502434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:06:30.502434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtuklDBjMYQAR1gD58PdoaRj1bDtokVRiiDDRAB9LGR6rJZwWtj0ovr1mC0JLHbnaGgYbJFq94TcuJRVAaOFCQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:06:30.503174Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd050ab7eece4d909d2fab2fbe9768d4f47df895e19e85f6bf11338f58532fc1","sha256:4ac0eae045bdda5d0d4299c7367e966654f7e474105324ba8259761a007743d1"],"state_sha256":"7fd58ebd8ea14155a4b6255eb76206ac2b3ef75924c59e675c6567ec42f7c8a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0JMKBUnmEPBTy+zCIJ7bgDFHYA32MUyXIUdt6uu9QSkEQ+WSfTSkGB2eufqSLdlVVJLir8Zs2wow/SRxJNOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:51:07.725975Z","bundle_sha256":"cf7e13b615af70a9beb45ee99e8fa986d0ddaed53cb7f73381c0d1a3d9c64001"}}