{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UP3BLD6VTHMQKBP3DV2ZGSGZ2U","short_pith_number":"pith:UP3BLD6V","canonical_record":{"source":{"id":"2605.13864","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-04-30T17:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"43a905c5a228de393201aa39f952812b4c4d7d50fd79610dc213b5e2bac6c570","abstract_canon_sha256":"d80f0c3cddf3b173cb25b181843110318bcc634a13ded83d492f08fc447af7f7"},"schema_version":"1.0"},"canonical_sha256":"a3f6158fd599d90505fb1d759348d9d53cb2223a318299167b83bb47cb592608","source":{"kind":"arxiv","id":"2605.13864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13864","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13864v1","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13864","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"UP3BLD6VTHMQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"UP3BLD6VTHMQKBP3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"UP3BLD6V","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UP3BLD6VTHMQKBP3DV2ZGSGZ2U","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13864","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-04-30T17:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"43a905c5a228de393201aa39f952812b4c4d7d50fd79610dc213b5e2bac6c570","abstract_canon_sha256":"d80f0c3cddf3b173cb25b181843110318bcc634a13ded83d492f08fc447af7f7"},"schema_version":"1.0"},"canonical_sha256":"a3f6158fd599d90505fb1d759348d9d53cb2223a318299167b83bb47cb592608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:19.400841Z","signature_b64":"067PSukNk5Ie4kuJ4xC7uFrYlrjtb992jXf7eqste1XzsoBCeCpC3B6I6v9lciN5PrLvrb5vfftNCOKJLJNqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3f6158fd599d90505fb1d759348d9d53cb2223a318299167b83bb47cb592608","last_reissued_at":"2026-05-17T23:39:19.400098Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:19.400098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13864","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-17T23:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfUjGcRU0pIccaKb3YVQvnhlrZTuZp4q5DJcy770zUmQCx/rlHmg+ULIzXkEDdrpJQlXGFogzah1EH07ZuMYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:21:19.613046Z"},"content_sha256":"e73c3f80c62bb5269393d30e27fbc8c4d707e2fca84e563e621acbb2edc981c5","schema_version":"1.0","event_id":"sha256:e73c3f80c62bb5269393d30e27fbc8c4d707e2fca84e563e621acbb2edc981c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UP3BLD6VTHMQKBP3DV2ZGSGZ2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Source-to-Source Transformations for GPU Code Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"OptiGPU turns verified CPU programs into optimized GPU code through proof-preserving source-to-source transformations.","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arthur Chargu\\'eraud, Cl\\'ement Pit-Claudel, Julien de Castelnau, Thomas Koehler","submitted_at":"2026-04-30T17:27:10Z","abstract_excerpt":"GPUs have become essential in modern high performance computing, but programming them correctly remains a significant challenge. This difficulty arises from subtle concurrency bugs that result from the explicit management of synchronization primitives and data movement across intricate hierarchies of memory and parallel threads. At the same time, the ability to control these aspects explicitly is at the core of the performance gains granted by GPUs. These challenges have motivated interest in safe GPU programming: tools and languages that can prevent or detect such bugs statically. However, ex"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"OptiGPU applies proof-preserving compilation to GPU programming, allowing verification of low-level, optimized GPU programs through refinement of simple, verified CPU programs via source-to-source transformations that automatically preserve proofs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The source-to-source transformations correctly model essential GPU features including kernel launches, shared memory, and synchronous barriers while preserving the proofs of data race freedom, deadlock freedom, and functional correctness.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"OptiGPU enables proof-preserving source-to-source compilation to generate safe CUDA code from verified CPU programs by modeling GPU features like kernels, shared memory, and barriers.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"OptiGPU turns verified CPU programs into optimized GPU code through proof-preserving source-to-source transformations.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"f3314a881cfc4aaa55ce861c971c7273c53e55b8e9f96bf03f2653544d404e25"},"source":{"id":"2605.13864","kind":"arxiv","version":1},"verdict":{"id":"85424eda-acdb-4374-bd7c-52b5536d3529","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T06:29:40.007543Z","strongest_claim":"OptiGPU applies proof-preserving compilation to GPU programming, allowing verification of low-level, optimized GPU programs through refinement of simple, verified CPU programs via source-to-source transformations that automatically preserve proofs.","one_line_summary":"OptiGPU enables proof-preserving source-to-source compilation to generate safe CUDA code from verified CPU programs by modeling GPU features like kernels, shared memory, and barriers.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The source-to-source transformations correctly model essential GPU features including kernel launches, shared memory, and synchronous barriers while preserving the proofs of data race freedom, deadlock freedom, and functional correctness.","pith_extraction_headline":"OptiGPU turns verified CPU programs into optimized GPU code through proof-preserving source-to-source transformations."},"references":{"count":25,"sample":[{"doi":"10.2197/ipsjjip.24.132","year":2016,"title":"Izumi Asakura, Hidehiko Masuhara, and Tomoyuki Aotani. 2016. Proof of Soundness of Concurrent Separation Logic for GPGPU in Coq. Journal of Information Processing 24, 1 (2016), 132–140. https://doi.or","work_id":"d556a2d1-ba98-4a0f-ad89-df408bfbc347","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.entcs.2005.02.026","year":2005,"title":"Fabian Bannwart and Peter Müller. 2005. A Program Logic for Bytecode. Electronic Notes in Theoretical Computer Science 141, 1 (2005), 255–273. https://doi.org/ https:// doi.org/10.1016/j.entcs.2005.02","work_id":"43b65d72-0246-41b2-96f2-9cb745f9916c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Cutler, Saman Amarasinghe, and Jonathan Ragan-Kelley","work_id":"5ca4c2fc-38e4-4683-84df-81bb56237f81","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Guillaume Bertholon. 2025. Interactive compilation via trustworthy source-to-source transformations. Theses. Retrieved from https://theses.hal.science/tel-05302456","work_id":"cae85ea2-9345-41d8-977e-e77919453fd9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Adam Betts, Nathan Chong, Alastair Donaldson, Shaz Qadeer, and Paul Thomson","work_id":"dadbbafe-4b40-480f-b48c-b2eca9102246","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"8c72961a48332b45b3494aaf29e069b6bfc8eb2a7911f1a92ff06195cb16f21a","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":"85424eda-acdb-4374-bd7c-52b5536d3529"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zx2n50PPAhosOxRcNjEoM8yCYHoqR803bcs+RsFgyPZpfRKcUZv2DoMEGdErfnXyIImxGoM1oOgoRT8ilQ04Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:21:19.614117Z"},"content_sha256":"aebfe8db8f691e577947ef1c7b4d7dae242f14a34a1cac36fa2e024f9ada995e","schema_version":"1.0","event_id":"sha256:aebfe8db8f691e577947ef1c7b4d7dae242f14a34a1cac36fa2e024f9ada995e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U/bundle.json","state_url":"https://pith.science/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U/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-31T22:21:19Z","links":{"resolver":"https://pith.science/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U","bundle":"https://pith.science/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U/bundle.json","state":"https://pith.science/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UP3BLD6VTHMQKBP3DV2ZGSGZ2U","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":"d80f0c3cddf3b173cb25b181843110318bcc634a13ded83d492f08fc447af7f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-04-30T17:27:10Z","title_canon_sha256":"43a905c5a228de393201aa39f952812b4c4d7d50fd79610dc213b5e2bac6c570"},"schema_version":"1.0","source":{"id":"2605.13864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13864","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13864v1","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13864","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"UP3BLD6VTHMQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"UP3BLD6VTHMQKBP3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"UP3BLD6V","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:aebfe8db8f691e577947ef1c7b4d7dae242f14a34a1cac36fa2e024f9ada995e","target":"graph","created_at":"2026-05-17T23:39:19Z","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":"OptiGPU applies proof-preserving compilation to GPU programming, allowing verification of low-level, optimized GPU programs through refinement of simple, verified CPU programs via source-to-source transformations that automatically preserve proofs."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The source-to-source transformations correctly model essential GPU features including kernel launches, shared memory, and synchronous barriers while preserving the proofs of data race freedom, deadlock freedom, and functional correctness."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"OptiGPU enables proof-preserving source-to-source compilation to generate safe CUDA code from verified CPU programs by modeling GPU features like kernels, shared memory, and barriers."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"OptiGPU turns verified CPU programs into optimized GPU code through proof-preserving source-to-source transformations."}],"snapshot_sha256":"f3314a881cfc4aaa55ce861c971c7273c53e55b8e9f96bf03f2653544d404e25"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"GPUs have become essential in modern high performance computing, but programming them correctly remains a significant challenge. This difficulty arises from subtle concurrency bugs that result from the explicit management of synchronization primitives and data movement across intricate hierarchies of memory and parallel threads. At the same time, the ability to control these aspects explicitly is at the core of the performance gains granted by GPUs. These challenges have motivated interest in safe GPU programming: tools and languages that can prevent or detect such bugs statically. However, ex","authors_text":"Arthur Chargu\\'eraud, Cl\\'ement Pit-Claudel, Julien de Castelnau, Thomas Koehler","cross_cats":[],"headline":"OptiGPU turns verified CPU programs into optimized GPU code through proof-preserving source-to-source transformations.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-04-30T17:27:10Z","title":"Source-to-Source Transformations for GPU Code Generation"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"10.2197/ipsjjip.24.132","is_internal_anchor":false,"ref_index":1,"title":"Izumi Asakura, Hidehiko Masuhara, and Tomoyuki Aotani. 2016. Proof of Soundness of Concurrent Separation Logic for GPGPU in Coq. Journal of Information Processing 24, 1 (2016), 132–140. https://doi.or","work_id":"d556a2d1-ba98-4a0f-ad89-df408bfbc347","year":2016},{"cited_arxiv_id":"","doi":"10.1016/j.entcs.2005.02.026","is_internal_anchor":false,"ref_index":2,"title":"Fabian Bannwart and Peter Müller. 2005. A Program Logic for Bytecode. Electronic Notes in Theoretical Computer Science 141, 1 (2005), 255–273. https://doi.org/ https:// doi.org/10.1016/j.entcs.2005.02","work_id":"43b65d72-0246-41b2-96f2-9cb745f9916c","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Cutler, Saman Amarasinghe, and Jonathan Ragan-Kelley","work_id":"5ca4c2fc-38e4-4683-84df-81bb56237f81","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Guillaume Bertholon. 2025. Interactive compilation via trustworthy source-to-source transformations. Theses. Retrieved from https://theses.hal.science/tel-05302456","work_id":"cae85ea2-9345-41d8-977e-e77919453fd9","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Adam Betts, Nathan Chong, Alastair Donaldson, Shaz Qadeer, and Paul Thomson","work_id":"dadbbafe-4b40-480f-b48c-b2eca9102246","year":null}],"snapshot_sha256":"8c72961a48332b45b3494aaf29e069b6bfc8eb2a7911f1a92ff06195cb16f21a"},"source":{"id":"2605.13864","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T06:29:40.007543Z","id":"85424eda-acdb-4374-bd7c-52b5536d3529","model_set":{"reader":"grok-4.3"},"one_line_summary":"OptiGPU enables proof-preserving source-to-source compilation to generate safe CUDA code from verified CPU programs by modeling GPU features like kernels, shared memory, and barriers.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"OptiGPU turns verified CPU programs into optimized GPU code through proof-preserving source-to-source transformations.","strongest_claim":"OptiGPU applies proof-preserving compilation to GPU programming, allowing verification of low-level, optimized GPU programs through refinement of simple, verified CPU programs via source-to-source transformations that automatically preserve proofs.","weakest_assumption":"The source-to-source transformations correctly model essential GPU features including kernel launches, shared memory, and synchronous barriers while preserving the proofs of data race freedom, deadlock freedom, and functional correctness."}},"verdict_id":"85424eda-acdb-4374-bd7c-52b5536d3529"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e73c3f80c62bb5269393d30e27fbc8c4d707e2fca84e563e621acbb2edc981c5","target":"record","created_at":"2026-05-17T23:39:19Z","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":"d80f0c3cddf3b173cb25b181843110318bcc634a13ded83d492f08fc447af7f7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-04-30T17:27:10Z","title_canon_sha256":"43a905c5a228de393201aa39f952812b4c4d7d50fd79610dc213b5e2bac6c570"},"schema_version":"1.0","source":{"id":"2605.13864","kind":"arxiv","version":1}},"canonical_sha256":"a3f6158fd599d90505fb1d759348d9d53cb2223a318299167b83bb47cb592608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3f6158fd599d90505fb1d759348d9d53cb2223a318299167b83bb47cb592608","first_computed_at":"2026-05-17T23:39:19.400098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:19.400098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"067PSukNk5Ie4kuJ4xC7uFrYlrjtb992jXf7eqste1XzsoBCeCpC3B6I6v9lciN5PrLvrb5vfftNCOKJLJNqAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:19.400841Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e73c3f80c62bb5269393d30e27fbc8c4d707e2fca84e563e621acbb2edc981c5","sha256:aebfe8db8f691e577947ef1c7b4d7dae242f14a34a1cac36fa2e024f9ada995e"],"state_sha256":"c64121551715d2d642424ea71d733a34dfcccd0341a89f84bfbc5be31e85dd22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEDfV/qmZ+KgFRDWSZOh4/2HPmp61SGiRrR2K/+hRfftrGoLEam49AKnJxj4JZKq5b0xm8PoQImazA3EjFY6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:21:19.619965Z","bundle_sha256":"b1f7aa65b4421ed50b087eb767ab26b37abc062084c99f1f789143ac6ec42e29"}}