{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6OCHWADAYML6AOBGV2IGXFAHID","short_pith_number":"pith:6OCHWADA","canonical_record":{"source":{"id":"2606.05245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T11:23:57Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"d29a06f2a6d1f800a5b5308f3122f1871f1a497d72bd9a55b4ab5d7518d8b78f","abstract_canon_sha256":"0800a94772cc0f0be30a30956cd9bf71f12415a5abe2143f3cc6c600f92f259a"},"schema_version":"1.0"},"canonical_sha256":"f3847b0060c317e03826ae906b940740ce044b6619524b4c4ed8870b29fdf3cb","source":{"kind":"arxiv","id":"2606.05245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05245","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05245v1","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05245","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"pith_short_12","alias_value":"6OCHWADAYML6","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"pith_short_16","alias_value":"6OCHWADAYML6AOBG","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"pith_short_8","alias_value":"6OCHWADA","created_at":"2026-06-05T00:13:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6OCHWADAYML6AOBGV2IGXFAHID","target":"record","payload":{"canonical_record":{"source":{"id":"2606.05245","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T11:23:57Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"d29a06f2a6d1f800a5b5308f3122f1871f1a497d72bd9a55b4ab5d7518d8b78f","abstract_canon_sha256":"0800a94772cc0f0be30a30956cd9bf71f12415a5abe2143f3cc6c600f92f259a"},"schema_version":"1.0"},"canonical_sha256":"f3847b0060c317e03826ae906b940740ce044b6619524b4c4ed8870b29fdf3cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T00:13:50.343644Z","signature_b64":"voGv7qUCzb8kTDJuJ5KpCUK6Hb7Z84lA844gntocbNB0e/LYU5CQlGhIBbTkjCHrvOFGQjwav+gOk3fR04QRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3847b0060c317e03826ae906b940740ce044b6619524b4c4ed8870b29fdf3cb","last_reissued_at":"2026-06-05T00:13:50.343141Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T00:13:50.343141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.05245","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-06-05T00:13:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6lSfpn4NYtBVOy91w46p8I8g1df/MPBS6ngHbe1+In3LzhKOmiY6uEs8Gd+h+ESOdgEapACgGmhRWANXrkdEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:41:24.288223Z"},"content_sha256":"7a5d98fc7f9250d30b47bfb346252c35463838d0d1c2109e62cf78bd41694239","schema_version":"1.0","event_id":"sha256:7a5d98fc7f9250d30b47bfb346252c35463838d0d1c2109e62cf78bd41694239"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6OCHWADAYML6AOBGV2IGXFAHID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst-Case Update Complexity of the Preisach Extremum Stack","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"cs.DS","authors_text":"Piotr Frydrych","submitted_at":"2026-06-03T11:23:57Z","abstract_excerpt":"The Preisach extremum stack $\\Pi_n$ is the minimal sufficient statistic for the class $\\mathcal{R}$ of computable rate-independent functionals in the Kolmogorov complexity sense [1]. Its standard update algorithm runs in amortised $O(1)$ time, but adversarial inputs can force $\\Theta(k)$ operations per step (where $k$ is the current depth). We establish a three-level complexity picture: (i) any compact exact $\\mathcal{R}$-minimal representation incurs $\\Theta(k)$ output changes per step in the worst case (in a model-independent output-change metric); (ii) the monotone ordering of the Preisach "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05245","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/2606.05245/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-06-05T00:13:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/dF49Lgt424HV0G9UO3LUOXk8XGIdgqAxn629mkDLBKP+0LfkI5iccZtlfmO0rcPWFuslaHC5zeR0UaCgDlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:41:24.288611Z"},"content_sha256":"0dd2ef3d47010e7c03846d5df21a7c3797df0cf84b62d8bc10b7b897d27429c7","schema_version":"1.0","event_id":"sha256:0dd2ef3d47010e7c03846d5df21a7c3797df0cf84b62d8bc10b7b897d27429c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OCHWADAYML6AOBGV2IGXFAHID/bundle.json","state_url":"https://pith.science/pith/6OCHWADAYML6AOBGV2IGXFAHID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OCHWADAYML6AOBGV2IGXFAHID/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-06-29T20:41:24Z","links":{"resolver":"https://pith.science/pith/6OCHWADAYML6AOBGV2IGXFAHID","bundle":"https://pith.science/pith/6OCHWADAYML6AOBGV2IGXFAHID/bundle.json","state":"https://pith.science/pith/6OCHWADAYML6AOBGV2IGXFAHID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OCHWADAYML6AOBGV2IGXFAHID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6OCHWADAYML6AOBGV2IGXFAHID","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":"0800a94772cc0f0be30a30956cd9bf71f12415a5abe2143f3cc6c600f92f259a","cross_cats_sorted":["math.FA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T11:23:57Z","title_canon_sha256":"d29a06f2a6d1f800a5b5308f3122f1871f1a497d72bd9a55b4ab5d7518d8b78f"},"schema_version":"1.0","source":{"id":"2606.05245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05245","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05245v1","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05245","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"pith_short_12","alias_value":"6OCHWADAYML6","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"pith_short_16","alias_value":"6OCHWADAYML6AOBG","created_at":"2026-06-05T00:13:50Z"},{"alias_kind":"pith_short_8","alias_value":"6OCHWADA","created_at":"2026-06-05T00:13:50Z"}],"graph_snapshots":[{"event_id":"sha256:0dd2ef3d47010e7c03846d5df21a7c3797df0cf84b62d8bc10b7b897d27429c7","target":"graph","created_at":"2026-06-05T00:13:50Z","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/2606.05245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Preisach extremum stack $\\Pi_n$ is the minimal sufficient statistic for the class $\\mathcal{R}$ of computable rate-independent functionals in the Kolmogorov complexity sense [1]. Its standard update algorithm runs in amortised $O(1)$ time, but adversarial inputs can force $\\Theta(k)$ operations per step (where $k$ is the current depth). We establish a three-level complexity picture: (i) any compact exact $\\mathcal{R}$-minimal representation incurs $\\Theta(k)$ output changes per step in the worst case (in a model-independent output-change metric); (ii) the monotone ordering of the Preisach ","authors_text":"Piotr Frydrych","cross_cats":["math.FA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T11:23:57Z","title":"Worst-Case Update Complexity of the Preisach Extremum Stack"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05245","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:7a5d98fc7f9250d30b47bfb346252c35463838d0d1c2109e62cf78bd41694239","target":"record","created_at":"2026-06-05T00:13:50Z","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":"0800a94772cc0f0be30a30956cd9bf71f12415a5abe2143f3cc6c600f92f259a","cross_cats_sorted":["math.FA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-03T11:23:57Z","title_canon_sha256":"d29a06f2a6d1f800a5b5308f3122f1871f1a497d72bd9a55b4ab5d7518d8b78f"},"schema_version":"1.0","source":{"id":"2606.05245","kind":"arxiv","version":1}},"canonical_sha256":"f3847b0060c317e03826ae906b940740ce044b6619524b4c4ed8870b29fdf3cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3847b0060c317e03826ae906b940740ce044b6619524b4c4ed8870b29fdf3cb","first_computed_at":"2026-06-05T00:13:50.343141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T00:13:50.343141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"voGv7qUCzb8kTDJuJ5KpCUK6Hb7Z84lA844gntocbNB0e/LYU5CQlGhIBbTkjCHrvOFGQjwav+gOk3fR04QRCg==","signature_status":"signed_v1","signed_at":"2026-06-05T00:13:50.343644Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a5d98fc7f9250d30b47bfb346252c35463838d0d1c2109e62cf78bd41694239","sha256:0dd2ef3d47010e7c03846d5df21a7c3797df0cf84b62d8bc10b7b897d27429c7"],"state_sha256":"21fd643f2f782c3e08725910f382300c0292b13ab46a7e8b70f39f28795224a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6c8x5T91bDIks7nizyGHksm/YswIrsRgWvO0WCoXp6uanDxDbZAG/tTCuBo7J8oDDjbnx+gPaplIa1xvumuzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:41:24.290498Z","bundle_sha256":"6c31831577ce0b33ab7f315709d6152d438aba3c6075ddaf993560d1e1e3832a"}}