{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BJQSU5IAHQ3UUDLLXFHSU5PRVH","short_pith_number":"pith:BJQSU5IA","canonical_record":{"source":{"id":"2502.11089","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-02-16T11:53:44Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1ee096cb16e96cc1bce6e3699add8767e82e700c718bc04601268dca1b884e55","abstract_canon_sha256":"5c3871eff56bff92b8a0a30d0db50d9978710d95f1d6dbf729b36efb96d7340f"},"schema_version":"1.0"},"canonical_sha256":"0a612a75003c374a0d6bb94f2a75f1a9e4a56978cee08ee17fa06c7ee83a2611","source":{"kind":"arxiv","id":"2502.11089","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11089","created_at":"2026-05-17T23:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11089v2","created_at":"2026-05-17T23:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11089","created_at":"2026-05-17T23:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"BJQSU5IAHQ3U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"BJQSU5IAHQ3UUDLL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"BJQSU5IA","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BJQSU5IAHQ3UUDLLXFHSU5PRVH","target":"record","payload":{"canonical_record":{"source":{"id":"2502.11089","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-02-16T11:53:44Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1ee096cb16e96cc1bce6e3699add8767e82e700c718bc04601268dca1b884e55","abstract_canon_sha256":"5c3871eff56bff92b8a0a30d0db50d9978710d95f1d6dbf729b36efb96d7340f"},"schema_version":"1.0"},"canonical_sha256":"0a612a75003c374a0d6bb94f2a75f1a9e4a56978cee08ee17fa06c7ee83a2611","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:46.196552Z","signature_b64":"+7fJa74wm+RgJ8zVBoXQbE+q5HelXGSFe3TbvdMCADpc6Jser91aBk+n1HFP0zgdW9JCz3t6zrEXuUJpRrnyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a612a75003c374a0d6bb94f2a75f1a9e4a56978cee08ee17fa06c7ee83a2611","last_reissued_at":"2026-05-17T23:38:46.196120Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:46.196120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.11089","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-17T23:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+OlhnSksprh8OgG3Qgr/8WGZPjBjdPxm/pm4z/fEGaiPV/2RpHOHMX+Ulc1h1cqinyGiyn7SrNw8dtSCZGYVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:28:47.820876Z"},"content_sha256":"045dcb15002a11cb0d0e198b245d8723552405ac682f30cfb4d80a63142af3cd","schema_version":"1.0","event_id":"sha256:045dcb15002a11cb0d0e198b245d8723552405ac682f30cfb4d80a63142af3cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BJQSU5IAHQ3UUDLLXFHSU5PRVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"NSA introduces a natively trainable sparse attention that matches full attention performance on long contexts while delivering major speedups.","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Chong Ruan, Damai Dai, Huazuo Gao, Jingyang Yuan, Junyu Luo, Lean Wang, Liang Zhao, Ming Zhang, Wangding Zeng, Wenfeng Liang, Yuqing Wang, Y. X. Wei, Zhenda Xie, Zhengyan Zhang, Zhiping Xiao","submitted_at":"2025-02-16T11:53:44Z","abstract_excerpt":"Long-context modeling is crucial for next-generation language models, yet the high computational cost of standard attention mechanisms poses significant computational challenges. Sparse attention offers a promising direction for improving efficiency while maintaining model capabilities. We present NSA, a Natively trainable Sparse Attention mechanism that integrates algorithmic innovations with hardware-aligned optimizations to achieve efficient long-context modeling. NSA employs a dynamic hierarchical sparse strategy, combining coarse-grained token compression with fine-grained token selection"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments show the model pretrained with NSA maintains or exceeds Full Attention models across general benchmarks, long-context tasks, and instruction-based reasoning, while achieving substantial speedups over Full Attention on 64k-length sequences across decoding, forward, and backward propagation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the dynamic hierarchical sparse strategy (coarse compression plus fine selection) preserves both global context awareness and local precision without introducing systematic biases that would degrade performance on unseen long-context distributions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NSA is a hardware-aligned sparse attention mechanism that enables end-to-end trainable long-context modeling by combining coarse token compression with fine-grained selection.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"NSA introduces a natively trainable sparse attention that matches full attention performance on long contexts while delivering major speedups.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6b3d73f22a95be9348650313a8803a1ed44cfbbb8dbbc57619a748c5a6de06be"},"source":{"id":"2502.11089","kind":"arxiv","version":2},"verdict":{"id":"9296ca77-a347-49d3-af7e-5de7c3339b88","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T23:43:08.833294Z","strongest_claim":"Experiments show the model pretrained with NSA maintains or exceeds Full Attention models across general benchmarks, long-context tasks, and instruction-based reasoning, while achieving substantial speedups over Full Attention on 64k-length sequences across decoding, forward, and backward propagation.","one_line_summary":"NSA is a hardware-aligned sparse attention mechanism that enables end-to-end trainable long-context modeling by combining coarse token compression with fine-grained selection.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the dynamic hierarchical sparse strategy (coarse compression plus fine selection) preserves both global context awareness and local precision without introducing systematic biases that would degrade performance on unseen long-context distributions.","pith_extraction_headline":"NSA introduces a natively trainable sparse attention that matches full attention performance on long contexts while delivering major speedups."},"references":{"count":65,"sample":[{"doi":"","year":2024,"title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","work_id":"1e1df141-cac8-47fd-b068-c4c96e51e331","ref_index":10,"cited_arxiv_id":"2405.04434","is_internal_anchor":true},{"doi":"","year":2025,"title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","ref_index":11,"cited_arxiv_id":"2501.12948","is_internal_anchor":true},{"doi":"","year":2023,"title":"G. Kamradt. LLMTest NeedleInAHaystack . GitHub repository, 2023. URL https://github.com/gkamradt/LLMTest_NeedleInAHaystack. Accessed: [Insert Access Date Here]","work_id":"bd0cb6f6-cd09-4320-9bce-7ea216ab6b50","ref_index":22,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"J. S. Park, J. C. O'Brien, C. J. Cai, M. R. Morris, P. Liang, and M. S. Bernstein. Generative agents: Interactive simulacra of human behavior. In S. Follmer, J. Han, J. Steimle, and N. H. Riche, edito","work_id":"e27cce8a-f8c3-4deb-83b6-ae0bbf253c46","ref_index":26,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"B. Peng, J. Quesnelle, H. Fan, and E. Shippole. Yarn: Efficient context window extension of large language models. In ICLR . OpenReview.net, 2024","work_id":"6bae5175-6cd1-4631-a964-7b1984532309","ref_index":27,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":65,"snapshot_sha256":"2c0626aaef195172790711f872b821201df63ce4cd888875a85a878a66d0a2b0","internal_anchors":24},"formal_canon":{"evidence_count":2,"snapshot_sha256":"812bf6ac4b00b9505aba82c7f1ea18232561654ac7cc322ff60e51eb70083e11"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9296ca77-a347-49d3-af7e-5de7c3339b88"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6clBTEw/W8JeqtK5ZT55uOuahurIIUZG5sYRuhWCE4ANidqcyJIUswfGB63xkoQ1NOtypAAZiORUPqvGktkwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:28:47.821434Z"},"content_sha256":"0c48903a7ca2c8f95bcd3c359633427e9f0dff0f030811925d89122b54e79ea3","schema_version":"1.0","event_id":"sha256:0c48903a7ca2c8f95bcd3c359633427e9f0dff0f030811925d89122b54e79ea3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJQSU5IAHQ3UUDLLXFHSU5PRVH/bundle.json","state_url":"https://pith.science/pith/BJQSU5IAHQ3UUDLLXFHSU5PRVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJQSU5IAHQ3UUDLLXFHSU5PRVH/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-26T23:28:47Z","links":{"resolver":"https://pith.science/pith/BJQSU5IAHQ3UUDLLXFHSU5PRVH","bundle":"https://pith.science/pith/BJQSU5IAHQ3UUDLLXFHSU5PRVH/bundle.json","state":"https://pith.science/pith/BJQSU5IAHQ3UUDLLXFHSU5PRVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJQSU5IAHQ3UUDLLXFHSU5PRVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BJQSU5IAHQ3UUDLLXFHSU5PRVH","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":"5c3871eff56bff92b8a0a30d0db50d9978710d95f1d6dbf729b36efb96d7340f","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-02-16T11:53:44Z","title_canon_sha256":"1ee096cb16e96cc1bce6e3699add8767e82e700c718bc04601268dca1b884e55"},"schema_version":"1.0","source":{"id":"2502.11089","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11089","created_at":"2026-05-17T23:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11089v2","created_at":"2026-05-17T23:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11089","created_at":"2026-05-17T23:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"BJQSU5IAHQ3U","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"BJQSU5IAHQ3UUDLL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"BJQSU5IA","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0c48903a7ca2c8f95bcd3c359633427e9f0dff0f030811925d89122b54e79ea3","target":"graph","created_at":"2026-05-17T23:38:46Z","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":"Experiments show the model pretrained with NSA maintains or exceeds Full Attention models across general benchmarks, long-context tasks, and instruction-based reasoning, while achieving substantial speedups over Full Attention on 64k-length sequences across decoding, forward, and backward propagation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the dynamic hierarchical sparse strategy (coarse compression plus fine selection) preserves both global context awareness and local precision without introducing systematic biases that would degrade performance on unseen long-context distributions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NSA is a hardware-aligned sparse attention mechanism that enables end-to-end trainable long-context modeling by combining coarse token compression with fine-grained selection."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"NSA introduces a natively trainable sparse attention that matches full attention performance on long contexts while delivering major speedups."}],"snapshot_sha256":"6b3d73f22a95be9348650313a8803a1ed44cfbbb8dbbc57619a748c5a6de06be"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"812bf6ac4b00b9505aba82c7f1ea18232561654ac7cc322ff60e51eb70083e11"},"paper":{"abstract_excerpt":"Long-context modeling is crucial for next-generation language models, yet the high computational cost of standard attention mechanisms poses significant computational challenges. Sparse attention offers a promising direction for improving efficiency while maintaining model capabilities. We present NSA, a Natively trainable Sparse Attention mechanism that integrates algorithmic innovations with hardware-aligned optimizations to achieve efficient long-context modeling. NSA employs a dynamic hierarchical sparse strategy, combining coarse-grained token compression with fine-grained token selection","authors_text":"Chong Ruan, Damai Dai, Huazuo Gao, Jingyang Yuan, Junyu Luo, Lean Wang, Liang Zhao, Ming Zhang, Wangding Zeng, Wenfeng Liang, Yuqing Wang, Y. X. Wei, Zhenda Xie, Zhengyan Zhang, Zhiping Xiao","cross_cats":["cs.AI","cs.LG"],"headline":"NSA introduces a natively trainable sparse attention that matches full attention performance on long contexts while delivering major speedups.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-02-16T11:53:44Z","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention"},"references":{"count":65,"internal_anchors":24,"resolved_work":65,"sample":[{"cited_arxiv_id":"2405.04434","doi":"","is_internal_anchor":true,"ref_index":10,"title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","work_id":"1e1df141-cac8-47fd-b068-c4c96e51e331","year":2024},{"cited_arxiv_id":"2501.12948","doi":"","is_internal_anchor":true,"ref_index":11,"title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":22,"title":"G. Kamradt. LLMTest NeedleInAHaystack . GitHub repository, 2023. URL https://github.com/gkamradt/LLMTest_NeedleInAHaystack. Accessed: [Insert Access Date Here]","work_id":"bd0cb6f6-cd09-4320-9bce-7ea216ab6b50","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":26,"title":"J. S. Park, J. C. O'Brien, C. J. Cai, M. R. Morris, P. Liang, and M. S. Bernstein. Generative agents: Interactive simulacra of human behavior. In S. Follmer, J. Han, J. Steimle, and N. H. Riche, edito","work_id":"e27cce8a-f8c3-4deb-83b6-ae0bbf253c46","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":27,"title":"B. Peng, J. Quesnelle, H. Fan, and E. Shippole. Yarn: Efficient context window extension of large language models. In ICLR . OpenReview.net, 2024","work_id":"6bae5175-6cd1-4631-a964-7b1984532309","year":2024}],"snapshot_sha256":"2c0626aaef195172790711f872b821201df63ce4cd888875a85a878a66d0a2b0"},"source":{"id":"2502.11089","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T23:43:08.833294Z","id":"9296ca77-a347-49d3-af7e-5de7c3339b88","model_set":{"reader":"grok-4.3"},"one_line_summary":"NSA is a hardware-aligned sparse attention mechanism that enables end-to-end trainable long-context modeling by combining coarse token compression with fine-grained selection.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"NSA introduces a natively trainable sparse attention that matches full attention performance on long contexts while delivering major speedups.","strongest_claim":"Experiments show the model pretrained with NSA maintains or exceeds Full Attention models across general benchmarks, long-context tasks, and instruction-based reasoning, while achieving substantial speedups over Full Attention on 64k-length sequences across decoding, forward, and backward propagation.","weakest_assumption":"That the dynamic hierarchical sparse strategy (coarse compression plus fine selection) preserves both global context awareness and local precision without introducing systematic biases that would degrade performance on unseen long-context distributions."}},"verdict_id":"9296ca77-a347-49d3-af7e-5de7c3339b88"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:045dcb15002a11cb0d0e198b245d8723552405ac682f30cfb4d80a63142af3cd","target":"record","created_at":"2026-05-17T23:38:46Z","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":"5c3871eff56bff92b8a0a30d0db50d9978710d95f1d6dbf729b36efb96d7340f","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-02-16T11:53:44Z","title_canon_sha256":"1ee096cb16e96cc1bce6e3699add8767e82e700c718bc04601268dca1b884e55"},"schema_version":"1.0","source":{"id":"2502.11089","kind":"arxiv","version":2}},"canonical_sha256":"0a612a75003c374a0d6bb94f2a75f1a9e4a56978cee08ee17fa06c7ee83a2611","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a612a75003c374a0d6bb94f2a75f1a9e4a56978cee08ee17fa06c7ee83a2611","first_computed_at":"2026-05-17T23:38:46.196120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:46.196120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+7fJa74wm+RgJ8zVBoXQbE+q5HelXGSFe3TbvdMCADpc6Jser91aBk+n1HFP0zgdW9JCz3t6zrEXuUJpRrnyDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:46.196552Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11089","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:045dcb15002a11cb0d0e198b245d8723552405ac682f30cfb4d80a63142af3cd","sha256:0c48903a7ca2c8f95bcd3c359633427e9f0dff0f030811925d89122b54e79ea3"],"state_sha256":"01468d8fe3d98f85f7dd8850ec7b90d8e5a4281c0f7a0eb1b67730269e58bae5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qHRWrANuPC55iFASNMk9Lxdf1B1gOjamtSANA67A7WKB9TmYO2ZqkZaQ6DzfpYQRHNgLVIrlZnLWmcz8pCjCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:28:47.824460Z","bundle_sha256":"33ca0f264e2fd681f0cf42e29c30ef50e9a27cebe160c1c0aecdb67d6c3b2e63"}}