{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6U3QYYO43NFVGLXUHVVIZATFGV","short_pith_number":"pith:6U3QYYO4","canonical_record":{"source":{"id":"2605.11617","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T06:45:00Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"674d727e8f5ec19fa194f772455c66dce228b5a02bdf4e3b7fc2b64abeaf3dc6","abstract_canon_sha256":"e18fe80f0cdff2e47a36d464f385a7c8ddd0537e05682d9fd6b3314833525c37"},"schema_version":"1.0"},"canonical_sha256":"f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637","source":{"kind":"arxiv","id":"2605.11617","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11617","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11617v2","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11617","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"6U3QYYO43NFV","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"6U3QYYO43NFVGLXU","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"6U3QYYO4","created_at":"2026-05-20T00:05:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6U3QYYO43NFVGLXUHVVIZATFGV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.11617","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T06:45:00Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"674d727e8f5ec19fa194f772455c66dce228b5a02bdf4e3b7fc2b64abeaf3dc6","abstract_canon_sha256":"e18fe80f0cdff2e47a36d464f385a7c8ddd0537e05682d9fd6b3314833525c37"},"schema_version":"1.0"},"canonical_sha256":"f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:47.060584Z","signature_b64":"XDQLeXCILXWCvagXDzyQ1wvJBmN8vlTrZOHsG9asew6qI7nCAxZgzCa2GwuNjaTSrBW4s0qKu73ZC+t1raxxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637","last_reissued_at":"2026-05-20T00:05:47.060164Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:47.060164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.11617","source_version":2,"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:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41f4soJU8jHIV6D/7UUjYUCs0yUxevvOB2IjoVr+PDlSwHmD1YvLNOvpgmwkt2kIunEPYbvCeEkFkeBhoO8dDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:39.591676Z"},"content_sha256":"4e35e0a882bce7bd01aabc645e76a98e0f1862f4f01ff66932e5163f924d189d","schema_version":"1.0","event_id":"sha256:4e35e0a882bce7bd01aabc645e76a98e0f1862f4f01ff66932e5163f924d189d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6U3QYYO43NFVGLXUHVVIZATFGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Streaming decision trees achieve reliable splits for online class-incremental learning by using a K-independent McDiarmid bound on Gini impurity together with Bayesian inheritance and quantile sketches.","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Chi-Nguyen Tran, Dao Sy Duy Minh, Huynh Trung Kiet, Long Tran-Thanh, Nguyen Lam Phu Quy, Phu-Hoa Pham","submitted_at":"2026-05-12T06:45:00Z","abstract_excerpt":"Streaming decision trees are natural candidates for open-world continual learning, as they perform local updates, enjoy bounded memory, and static decision boundaries. Despite these, they still fail in online class-incremental learning due to two coupled miscalibrations: (i) their split criterion grows unreliable as the class count K expands, and (ii) the absence of knowledge transfer at split time. Both failures share a common root: the range of Information Gain intrinsically scales with log2 K. Consequently, any Hoeffding-style confidence radius derived from it must inevitably grow with the "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"MIST resolves both failures through three integrated components: (i) a tight, K-independent McDiarmid confidence radius for Gini splitting that acts as a structural regulariser; (ii) a Bayesian inheritance protocol that projects parent statistics to child nodes via truncated-Gaussian moments, with variance reduction guarantees strongest precisely when splitting is most conservative; and (iii) per-leaf KLL quantile sketches that support both continuous threshold evaluation and geometry-adaptive leaf prediction from a single data structure.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that a McDiarmid bound applied to Gini impurity yields a practically tight and K-independent radius under the streaming, non-stationary data regime, and that the truncated-Gaussian moment projection accurately captures the statistical relationship between parent and child nodes without introducing bias that grows with class count.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MIST fixes unreliable splits in streaming decision trees for class-incremental learning by using a K-independent McDiarmid bound on Gini impurity, Bayesian moment projection for knowledge transfer, and KLL quantile sketches for adaptive leaf predictions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Streaming decision trees achieve reliable splits for online class-incremental learning by using a K-independent McDiarmid bound on Gini impurity together with Bayesian inheritance and quantile sketches.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"25e61609b000ebe80fd0728961c8c25189a7c36e848757b292c9c1cb260ef876"},"source":{"id":"2605.11617","kind":"arxiv","version":2},"verdict":{"id":"6ee00463-7afb-4605-bc58-eb64f46d28cf","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T01:15:42.621195Z","strongest_claim":"MIST resolves both failures through three integrated components: (i) a tight, K-independent McDiarmid confidence radius for Gini splitting that acts as a structural regulariser; (ii) a Bayesian inheritance protocol that projects parent statistics to child nodes via truncated-Gaussian moments, with variance reduction guarantees strongest precisely when splitting is most conservative; and (iii) per-leaf KLL quantile sketches that support both continuous threshold evaluation and geometry-adaptive leaf prediction from a single data structure.","one_line_summary":"MIST fixes unreliable splits in streaming decision trees for class-incremental learning by using a K-independent McDiarmid bound on Gini impurity, Bayesian moment projection for knowledge transfer, and KLL quantile sketches for adaptive leaf predictions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that a McDiarmid bound applied to Gini impurity yields a practically tight and K-independent radius under the streaming, non-stationary data regime, and that the truncated-Gaussian moment projection accurately captures the statistical relationship between parent and child nodes without introducing bias that grows with class count.","pith_extraction_headline":"Streaming decision trees achieve reliable splits for online class-incremental learning by using a K-independent McDiarmid bound on Gini impurity together with Bayesian inheritance and quantile sketches."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11617/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T11:40:50.257254Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T09:31:18.077895Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:17:50.935505Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"be9aa7012b0628e329a96be3ca1a35cacf03ab5f13d4e9981fb88330dc588b0e"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4840c08c042eb84f2c72a8e5ee2ac2810e9da83fe101b8dd3c9bfad9fdc306df"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"6ee00463-7afb-4605-bc58-eb64f46d28cf"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DdXLnbBkcjD6Nv/JspIMrceuTjNYvUXU1BWagozgaZWP0bUZJU6kMLjnw5o1hQPSYqwB6lPIZJR/ablecsDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:39.592714Z"},"content_sha256":"85c2d5a852c9ef0b540bdb37e5a385aa43876405cb8295e14517ca26f7b9cbc6","schema_version":"1.0","event_id":"sha256:85c2d5a852c9ef0b540bdb37e5a385aa43876405cb8295e14517ca26f7b9cbc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/bundle.json","state_url":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6U3QYYO43NFVGLXUHVVIZATFGV/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-26T06:51:39Z","links":{"resolver":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV","bundle":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/bundle.json","state":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6U3QYYO43NFVGLXUHVVIZATFGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6U3QYYO43NFVGLXUHVVIZATFGV","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":"e18fe80f0cdff2e47a36d464f385a7c8ddd0537e05682d9fd6b3314833525c37","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T06:45:00Z","title_canon_sha256":"674d727e8f5ec19fa194f772455c66dce228b5a02bdf4e3b7fc2b64abeaf3dc6"},"schema_version":"1.0","source":{"id":"2605.11617","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11617","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11617v2","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11617","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"6U3QYYO43NFV","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"6U3QYYO43NFVGLXU","created_at":"2026-05-20T00:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"6U3QYYO4","created_at":"2026-05-20T00:05:47Z"}],"graph_snapshots":[{"event_id":"sha256:85c2d5a852c9ef0b540bdb37e5a385aa43876405cb8295e14517ca26f7b9cbc6","target":"graph","created_at":"2026-05-20T00:05:47Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"MIST resolves both failures through three integrated components: (i) a tight, K-independent McDiarmid confidence radius for Gini splitting that acts as a structural regulariser; (ii) a Bayesian inheritance protocol that projects parent statistics to child nodes via truncated-Gaussian moments, with variance reduction guarantees strongest precisely when splitting is most conservative; and (iii) per-leaf KLL quantile sketches that support both continuous threshold evaluation and geometry-adaptive leaf prediction from a single data structure."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that a McDiarmid bound applied to Gini impurity yields a practically tight and K-independent radius under the streaming, non-stationary data regime, and that the truncated-Gaussian moment projection accurately captures the statistical relationship between parent and child nodes without introducing bias that grows with class count."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"MIST fixes unreliable splits in streaming decision trees for class-incremental learning by using a K-independent McDiarmid bound on Gini impurity, Bayesian moment projection for knowledge transfer, and KLL quantile sketches for adaptive leaf predictions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Streaming decision trees achieve reliable splits for online class-incremental learning by using a K-independent McDiarmid bound on Gini impurity together with Bayesian inheritance and quantile sketches."}],"snapshot_sha256":"25e61609b000ebe80fd0728961c8c25189a7c36e848757b292c9c1cb260ef876"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4840c08c042eb84f2c72a8e5ee2ac2810e9da83fe101b8dd3c9bfad9fdc306df"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T11:40:50.257254Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T09:31:18.077895Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T08:17:50.935505Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.11617/integrity.json","findings":[],"snapshot_sha256":"be9aa7012b0628e329a96be3ca1a35cacf03ab5f13d4e9981fb88330dc588b0e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Streaming decision trees are natural candidates for open-world continual learning, as they perform local updates, enjoy bounded memory, and static decision boundaries. Despite these, they still fail in online class-incremental learning due to two coupled miscalibrations: (i) their split criterion grows unreliable as the class count K expands, and (ii) the absence of knowledge transfer at split time. Both failures share a common root: the range of Information Gain intrinsically scales with log2 K. Consequently, any Hoeffding-style confidence radius derived from it must inevitably grow with the ","authors_text":"Chi-Nguyen Tran, Dao Sy Duy Minh, Huynh Trung Kiet, Long Tran-Thanh, Nguyen Lam Phu Quy, Phu-Hoa Pham","cross_cats":["math.ST","stat.TH"],"headline":"Streaming decision trees achieve reliable splits for online class-incremental learning by using a K-independent McDiarmid bound on Gini impurity together with Bayesian inheritance and quantile sketches.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T06:45:00Z","title":"MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.11617","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T01:15:42.621195Z","id":"6ee00463-7afb-4605-bc58-eb64f46d28cf","model_set":{"reader":"grok-4.3"},"one_line_summary":"MIST fixes unreliable splits in streaming decision trees for class-incremental learning by using a K-independent McDiarmid bound on Gini impurity, Bayesian moment projection for knowledge transfer, and KLL quantile sketches for adaptive leaf predictions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Streaming decision trees achieve reliable splits for online class-incremental learning by using a K-independent McDiarmid bound on Gini impurity together with Bayesian inheritance and quantile sketches.","strongest_claim":"MIST resolves both failures through three integrated components: (i) a tight, K-independent McDiarmid confidence radius for Gini splitting that acts as a structural regulariser; (ii) a Bayesian inheritance protocol that projects parent statistics to child nodes via truncated-Gaussian moments, with variance reduction guarantees strongest precisely when splitting is most conservative; and (iii) per-leaf KLL quantile sketches that support both continuous threshold evaluation and geometry-adaptive leaf prediction from a single data structure.","weakest_assumption":"The assumption that a McDiarmid bound applied to Gini impurity yields a practically tight and K-independent radius under the streaming, non-stationary data regime, and that the truncated-Gaussian moment projection accurately captures the statistical relationship between parent and child nodes without introducing bias that grows with class count."}},"verdict_id":"6ee00463-7afb-4605-bc58-eb64f46d28cf"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4e35e0a882bce7bd01aabc645e76a98e0f1862f4f01ff66932e5163f924d189d","target":"record","created_at":"2026-05-20T00:05:47Z","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":"e18fe80f0cdff2e47a36d464f385a7c8ddd0537e05682d9fd6b3314833525c37","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T06:45:00Z","title_canon_sha256":"674d727e8f5ec19fa194f772455c66dce228b5a02bdf4e3b7fc2b64abeaf3dc6"},"schema_version":"1.0","source":{"id":"2605.11617","kind":"arxiv","version":2}},"canonical_sha256":"f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637","first_computed_at":"2026-05-20T00:05:47.060164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:47.060164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XDQLeXCILXWCvagXDzyQ1wvJBmN8vlTrZOHsG9asew6qI7nCAxZgzCa2GwuNjaTSrBW4s0qKu73ZC+t1raxxDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:47.060584Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.11617","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e35e0a882bce7bd01aabc645e76a98e0f1862f4f01ff66932e5163f924d189d","sha256:85c2d5a852c9ef0b540bdb37e5a385aa43876405cb8295e14517ca26f7b9cbc6"],"state_sha256":"d3a3e3ddc77f4d4ab7e6b187cd6eaa9cf2c799ab9ac8cf0fa2553d8e8e0e77db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TuOHgtD4fdEP9zSTm345bECxSn5lb++vD182Md9kw3IBrCJUD93fEI2X4xBgwwFw5951zq1moNmgSyQpm0oWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:51:39.597728Z","bundle_sha256":"fc6ab66b7e33c219ce634f6298051883abea19ca1e0e80fc79dcea3bce991be6"}}