{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:L4AOAKE5MDMCVKLKIBXCDNMNFQ","short_pith_number":"pith:L4AOAKE5","canonical_record":{"source":{"id":"2312.07104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-12T09:34:27Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"20663aade50d6d3d11adb04a5ad6c35f6ec2769b21d5035de74683981c99437c","abstract_canon_sha256":"9ce59c37f265003f302c0f899bc7d96e979fc0db606cd609f6ef9f2d8e0e5095"},"schema_version":"1.0"},"canonical_sha256":"5f00e0289d60d82aa96a406e21b58d2c2c7c57926db5ebcaef860aaa866c83ad","source":{"kind":"arxiv","id":"2312.07104","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07104","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07104v2","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07104","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"L4AOAKE5MDMC","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"L4AOAKE5MDMCVKLK","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"L4AOAKE5","created_at":"2026-07-05T08:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:L4AOAKE5MDMCVKLKIBXCDNMNFQ","target":"record","payload":{"canonical_record":{"source":{"id":"2312.07104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-12T09:34:27Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"20663aade50d6d3d11adb04a5ad6c35f6ec2769b21d5035de74683981c99437c","abstract_canon_sha256":"9ce59c37f265003f302c0f899bc7d96e979fc0db606cd609f6ef9f2d8e0e5095"},"schema_version":"1.0"},"canonical_sha256":"5f00e0289d60d82aa96a406e21b58d2c2c7c57926db5ebcaef860aaa866c83ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:04.248702Z","signature_b64":"62SyM4dU4fgihSfToPpkOoRQtpGHc84TiJ/idB1kkPeSOz0SjS+sUwwhHwbyVV1JTLnE73H3SLfUX5s77u5IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f00e0289d60d82aa96a406e21b58d2c2c7c57926db5ebcaef860aaa866c83ad","last_reissued_at":"2026-07-05T08:28:04.248235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:04.248235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.07104","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-07-05T08:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J218Mys+FFL9+4q1PU3ik7GH+Mk2aRx/eRrYXZxA7yxAcCnbbF9DB2p88+2VVDh2crplE7Uk1h83Zw4RO7UWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:33:37.191633Z"},"content_sha256":"598a2b6e9f4adf4f18ec59a8d6d833cea19a4af06c68440deeb0053fcdb18f30","schema_version":"1.0","event_id":"sha256:598a2b6e9f4adf4f18ec59a8d6d833cea19a4af06c68440deeb0053fcdb18f30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:L4AOAKE5MDMCVKLKIBXCDNMNFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SGLang: Efficient Execution of Structured Language Model Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"SGLang speeds up execution of structured language model programs by reusing computation across calls and accelerating structured decoding.","cross_cats":["cs.PL"],"primary_cat":"cs.AI","authors_text":"Christos Kozyrakis, Chuyue Sun, Clark Barrett, Cody Hao Yu, Ion Stoica, Jeff Huang, Joseph E. Gonzalez, Liangsheng Yin, Lianmin Zheng, Shiyi Cao, Ying Sheng, Zhiqiang Xie","submitted_at":"2023-12-12T09:34:27Z","abstract_excerpt":"Large language models (LLMs) are increasingly used for complex tasks that require multiple generation calls, advanced prompting techniques, control flow, and structured inputs/outputs. However, efficient systems are lacking for programming and executing these applications. We introduce SGLang, a system for efficient execution of complex language model programs. SGLang consists of a frontend language and a runtime. The frontend simplifies programming with primitives for generation and parallelism control. The runtime accelerates execution with novel optimizations like RadixAttention for KV cach"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"SGLang achieves up to 6.4x higher throughput compared to state-of-the-art inference systems on various large language and multi-modal models on tasks including agent control, logical reasoning, few-shot learning benchmarks, JSON decoding, retrieval-augmented generation pipelines, and multi-turn chat.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The novel optimizations (RadixAttention and compressed FSMs) deliver consistent throughput gains across diverse models and workloads without introducing accuracy loss, excessive implementation overhead, or edge-case failures not captured in the reported benchmarks.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SGLang is a new system that speeds up structured LLM programs by up to 6.4x using RadixAttention for KV cache reuse and compressed finite state machines for output decoding.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"SGLang speeds up execution of structured language model programs by reusing computation across calls and accelerating structured decoding.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c101dd8c400adab96fcf757d359f57fc5b98704d9eef3fec6310c703c1244b4f"},"source":{"id":"2312.07104","kind":"arxiv","version":2},"verdict":{"id":"deaf3f40-eae2-480b-89d9-fe0eda7ef684","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T08:14:21.660954Z","strongest_claim":"SGLang achieves up to 6.4x higher throughput compared to state-of-the-art inference systems on various large language and multi-modal models on tasks including agent control, logical reasoning, few-shot learning benchmarks, JSON decoding, retrieval-augmented generation pipelines, and multi-turn chat.","one_line_summary":"SGLang is a new system that speeds up structured LLM programs by up to 6.4x using RadixAttention for KV cache reuse and compressed finite state machines for output decoding.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The novel optimizations (RadixAttention and compressed FSMs) deliver consistent throughput gains across diverse models and workloads without introducing accuracy loss, excessive implementation overhead, or edge-case failures not captured in the reported benchmarks.","pith_extraction_headline":"SGLang speeds up execution of structured language model programs by reusing computation across calls and accelerating structured decoding."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.07104/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":62,"sample":[{"doi":"","year":2024,"title":"Apiserve: Efficient api support for large-language model inferencing","work_id":"afe4eff0-7d45-4632-a2e0-fb6b72ca886d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Flamingo: a visual language model for few-shot learning","work_id":"40995f15-58e1-4bdb-8885-4ad729de9a28","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Deepspeed- inference: enabling efficient inference of transformer models at unprecedented scale","work_id":"ed7907f7-f39c-4996-808b-99f6a049676a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1946,"title":"Prompting is programming: A query language for large language models","work_id":"59479826-b398-45d9-93b2-2172f8fbc674","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1901,"title":"Language models are few-shot learners","work_id":"04bc68bc-b7df-4ec1-8599-da037bd4f085","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":62,"snapshot_sha256":"8288fd36b18aed1245de9632155fa408f4e4345ec31d72c8a4e4a771d6058c57","internal_anchors":16},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a590e3d22bad4b74c4ee3d6abd914d1dca69a8fff20fda2ad16c7e8379dfd1bf"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"deaf3f40-eae2-480b-89d9-fe0eda7ef684"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eUFKSzQmF8eAkHZWn1OoR7Wy7SOu73/ISOkSG5BNeXyzjgbPR8RN/j3rZO5Xqcvi4WvKUG5+1Nqs/hI5vsNADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T16:33:37.192429Z"},"content_sha256":"4e4e42819022761ea2045c8e80c2a513ee04553190c4071d8c052c32fb9e8fb5","schema_version":"1.0","event_id":"sha256:4e4e42819022761ea2045c8e80c2a513ee04553190c4071d8c052c32fb9e8fb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4AOAKE5MDMCVKLKIBXCDNMNFQ/bundle.json","state_url":"https://pith.science/pith/L4AOAKE5MDMCVKLKIBXCDNMNFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4AOAKE5MDMCVKLKIBXCDNMNFQ/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-08-05T16:33:37Z","links":{"resolver":"https://pith.science/pith/L4AOAKE5MDMCVKLKIBXCDNMNFQ","bundle":"https://pith.science/pith/L4AOAKE5MDMCVKLKIBXCDNMNFQ/bundle.json","state":"https://pith.science/pith/L4AOAKE5MDMCVKLKIBXCDNMNFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4AOAKE5MDMCVKLKIBXCDNMNFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:L4AOAKE5MDMCVKLKIBXCDNMNFQ","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":"9ce59c37f265003f302c0f899bc7d96e979fc0db606cd609f6ef9f2d8e0e5095","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-12T09:34:27Z","title_canon_sha256":"20663aade50d6d3d11adb04a5ad6c35f6ec2769b21d5035de74683981c99437c"},"schema_version":"1.0","source":{"id":"2312.07104","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07104","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07104v2","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07104","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"L4AOAKE5MDMC","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"L4AOAKE5MDMCVKLK","created_at":"2026-07-05T08:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"L4AOAKE5","created_at":"2026-07-05T08:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:4e4e42819022761ea2045c8e80c2a513ee04553190c4071d8c052c32fb9e8fb5","target":"graph","created_at":"2026-07-05T08:28:04Z","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":"SGLang achieves up to 6.4x higher throughput compared to state-of-the-art inference systems on various large language and multi-modal models on tasks including agent control, logical reasoning, few-shot learning benchmarks, JSON decoding, retrieval-augmented generation pipelines, and multi-turn chat."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The novel optimizations (RadixAttention and compressed FSMs) deliver consistent throughput gains across diverse models and workloads without introducing accuracy loss, excessive implementation overhead, or edge-case failures not captured in the reported benchmarks."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"SGLang is a new system that speeds up structured LLM programs by up to 6.4x using RadixAttention for KV cache reuse and compressed finite state machines for output decoding."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"SGLang speeds up execution of structured language model programs by reusing computation across calls and accelerating structured decoding."}],"snapshot_sha256":"c101dd8c400adab96fcf757d359f57fc5b98704d9eef3fec6310c703c1244b4f"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"a590e3d22bad4b74c4ee3d6abd914d1dca69a8fff20fda2ad16c7e8379dfd1bf"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.07104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) are increasingly used for complex tasks that require multiple generation calls, advanced prompting techniques, control flow, and structured inputs/outputs. However, efficient systems are lacking for programming and executing these applications. We introduce SGLang, a system for efficient execution of complex language model programs. SGLang consists of a frontend language and a runtime. The frontend simplifies programming with primitives for generation and parallelism control. The runtime accelerates execution with novel optimizations like RadixAttention for KV cach","authors_text":"Christos Kozyrakis, Chuyue Sun, Clark Barrett, Cody Hao Yu, Ion Stoica, Jeff Huang, Joseph E. Gonzalez, Liangsheng Yin, Lianmin Zheng, Shiyi Cao, Ying Sheng, Zhiqiang Xie","cross_cats":["cs.PL"],"headline":"SGLang speeds up execution of structured language model programs by reusing computation across calls and accelerating structured decoding.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-12T09:34:27Z","title":"SGLang: Efficient Execution of Structured Language Model Programs"},"references":{"count":62,"internal_anchors":16,"resolved_work":62,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Apiserve: Efficient api support for large-language model inferencing","work_id":"afe4eff0-7d45-4632-a2e0-fb6b72ca886d","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Flamingo: a visual language model for few-shot learning","work_id":"40995f15-58e1-4bdb-8885-4ad729de9a28","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Deepspeed- inference: enabling efficient inference of transformer models at unprecedented scale","work_id":"ed7907f7-f39c-4996-808b-99f6a049676a","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Prompting is programming: A query language for large language models","work_id":"59479826-b398-45d9-93b2-2172f8fbc674","year":1946},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Language models are few-shot learners","work_id":"04bc68bc-b7df-4ec1-8599-da037bd4f085","year":1901}],"snapshot_sha256":"8288fd36b18aed1245de9632155fa408f4e4345ec31d72c8a4e4a771d6058c57"},"source":{"id":"2312.07104","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-12T08:14:21.660954Z","id":"deaf3f40-eae2-480b-89d9-fe0eda7ef684","model_set":{"reader":"grok-4.3"},"one_line_summary":"SGLang is a new system that speeds up structured LLM programs by up to 6.4x using RadixAttention for KV cache reuse and compressed finite state machines for output decoding.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"SGLang speeds up execution of structured language model programs by reusing computation across calls and accelerating structured decoding.","strongest_claim":"SGLang achieves up to 6.4x higher throughput compared to state-of-the-art inference systems on various large language and multi-modal models on tasks including agent control, logical reasoning, few-shot learning benchmarks, JSON decoding, retrieval-augmented generation pipelines, and multi-turn chat.","weakest_assumption":"The novel optimizations (RadixAttention and compressed FSMs) deliver consistent throughput gains across diverse models and workloads without introducing accuracy loss, excessive implementation overhead, or edge-case failures not captured in the reported benchmarks."}},"verdict_id":"deaf3f40-eae2-480b-89d9-fe0eda7ef684"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:598a2b6e9f4adf4f18ec59a8d6d833cea19a4af06c68440deeb0053fcdb18f30","target":"record","created_at":"2026-07-05T08:28:04Z","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":"9ce59c37f265003f302c0f899bc7d96e979fc0db606cd609f6ef9f2d8e0e5095","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-12-12T09:34:27Z","title_canon_sha256":"20663aade50d6d3d11adb04a5ad6c35f6ec2769b21d5035de74683981c99437c"},"schema_version":"1.0","source":{"id":"2312.07104","kind":"arxiv","version":2}},"canonical_sha256":"5f00e0289d60d82aa96a406e21b58d2c2c7c57926db5ebcaef860aaa866c83ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f00e0289d60d82aa96a406e21b58d2c2c7c57926db5ebcaef860aaa866c83ad","first_computed_at":"2026-07-05T08:28:04.248235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:28:04.248235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"62SyM4dU4fgihSfToPpkOoRQtpGHc84TiJ/idB1kkPeSOz0SjS+sUwwhHwbyVV1JTLnE73H3SLfUX5s77u5IDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:28:04.248702Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.07104","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:598a2b6e9f4adf4f18ec59a8d6d833cea19a4af06c68440deeb0053fcdb18f30","sha256:4e4e42819022761ea2045c8e80c2a513ee04553190c4071d8c052c32fb9e8fb5"],"state_sha256":"7e4bba3a4011205debcede4c57e439825eba278a34d8051dd42474c779cf7971"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TbIrkrcwepjXrK93qrJ+4SoUh8nBp1rgDGbEaqFrwdL9nFc+hjPXxK8bIJ9/it/uOZYHThGd2iS+bp3TbpT9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T16:33:37.196759Z","bundle_sha256":"2b192646dfb8f9b53073b3f1b0103f36a774b421e2ec3a64e5d147098a9737e3"}}