{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XUUK4HNOI77GCX52SJSPFQUD5H","short_pith_number":"pith:XUUK4HNO","canonical_record":{"source":{"id":"2602.19532","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2026-02-23T05:48:58Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"33efe4b725c0d887804372495e33b7214738738197a66c3dbdc1c1ad8c4a8b0f","abstract_canon_sha256":"5f00bec0ef5597893b606682b95cc33568db4b311aac8f2d4f65b8fa8a71f962"},"schema_version":"1.0"},"canonical_sha256":"bd28ae1dae47fe615fba9264f2c283e9fffb760ae7ffd66cbbf6eaeed9cc33e2","source":{"kind":"arxiv","id":"2602.19532","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.19532","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2602.19532v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.19532","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"XUUK4HNOI77G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XUUK4HNOI77GCX52","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XUUK4HNO","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XUUK4HNOI77GCX52SJSPFQUD5H","target":"record","payload":{"canonical_record":{"source":{"id":"2602.19532","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2026-02-23T05:48:58Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"33efe4b725c0d887804372495e33b7214738738197a66c3dbdc1c1ad8c4a8b0f","abstract_canon_sha256":"5f00bec0ef5597893b606682b95cc33568db4b311aac8f2d4f65b8fa8a71f962"},"schema_version":"1.0"},"canonical_sha256":"bd28ae1dae47fe615fba9264f2c283e9fffb760ae7ffd66cbbf6eaeed9cc33e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:16.014823Z","signature_b64":"DQ41jNm6t6aAx1ZPMcim3PIEUuwiaUrUvUci5mghUP0Nqg80GqyQ5qTyasih5WJkAPG0Tf8iY5hETNV3qTDtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd28ae1dae47fe615fba9264f2c283e9fffb760ae7ffd66cbbf6eaeed9cc33e2","last_reissued_at":"2026-05-17T23:39:16.014036Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:16.014036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.19532","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:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJErQkLPzaT3enb9PTLQPO8aE6luXBSKCkPP/8tFqD2x8Dfo+MJmZKsLtSvfaoBMTUjAcO9+gktwOUA0sP6QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:00:11.481174Z"},"content_sha256":"a9417d21902385699d11ebeb4824720ce51bcacf313cc778fe3034ee86419ed6","schema_version":"1.0","event_id":"sha256:a9417d21902385699d11ebeb4824720ce51bcacf313cc778fe3034ee86419ed6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XUUK4HNOI77GCX52SJSPFQUD5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bellman Value Decomposition for Task Logic in Safe Optimal Control","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"The Bellman value for temporal logic tasks decomposes into a graph of simpler values connected by reach-avoid, avoid, and reach-avoid-loop equations.","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Chuchu Fan, Dylan Hirsch, Oswin So, Sylvia Herbert, William Sharpless","submitted_at":"2026-02-23T05:48:58Z","abstract_excerpt":"Real-world tasks involve nuanced combinations of goal and safety specifications. In high dimensions, the challenge is exacerbated: formal automata become cumbersome, and the combination of sparse rewards tends to require laborious tuning. In this work, we consider the innate structure of the Bellman Value as a means to naturally organize the problem for improved automatic performance. Namely, we prove the Bellman Value for a complex task defined in temporal logic can be decomposed into a graph of Bellman Values, connected by a set of well-known Bellman equations (BEs): the Reach-Avoid BE, the "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove the Bellman Value for a complex task defined in temporal logic can be decomposed into a graph of Bellman Values, connected by a set of well-known Bellman equations (BEs): the Reach-Avoid BE, the Avoid BE, and a novel type, the Reach-Avoid-Loop BE.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The innate structure of the Bellman value naturally organizes temporal logic tasks so that the decomposed graph can be embedded in a two-layer neural net that bootstraps implicit dependencies without additional manual tuning or post-hoc adjustments.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Bellman values for temporal logic tasks decompose into a graph of reach-avoid, avoid, and reach-avoid-loop equations solved by embedding the graph in a two-layer neural net (VDPPO) for safe high-dimensional control.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The Bellman value for temporal logic tasks decomposes into a graph of simpler values connected by reach-avoid, avoid, and reach-avoid-loop equations.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e298706ec58e2d408d1259987d24524e6d3507be4713d03a625400634fca6dc8"},"source":{"id":"2602.19532","kind":"arxiv","version":2},"verdict":{"id":"28def877-d3fe-47cf-b2c8-7477c96a6a45","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T21:05:49.837826Z","strongest_claim":"We prove the Bellman Value for a complex task defined in temporal logic can be decomposed into a graph of Bellman Values, connected by a set of well-known Bellman equations (BEs): the Reach-Avoid BE, the Avoid BE, and a novel type, the Reach-Avoid-Loop BE.","one_line_summary":"Bellman values for temporal logic tasks decompose into a graph of reach-avoid, avoid, and reach-avoid-loop equations solved by embedding the graph in a two-layer neural net (VDPPO) for safe high-dimensional control.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The innate structure of the Bellman value naturally organizes temporal logic tasks so that the decomposed graph can be embedded in a two-layer neural net that bootstraps implicit dependencies without additional manual tuning or post-hoc adjustments.","pith_extraction_headline":"The Bellman value for temporal logic tasks decomposes into a graph of simpler values connected by reach-avoid, avoid, and reach-avoid-loop equations."},"references":{"count":97,"sample":[{"doi":"","year":2018,"title":"R. S. Sutton and A. G. Barto,Reinforcement Learning: An Introduction. Cambridge, MA, USA: A Bradford Book, 2018","work_id":"caea0164-1521-4b56-b179-9df9c4a39a6d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"LTL and beyond: Formal languages for reward function specification in reinforcement learning,","work_id":"e96f0e10-cf9a-43d0-be93-c838275ebe9a","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"A time-dependent hamilton-jacobi formulation of reachable sets for continuous dynamic games","work_id":"9e58418c-c52c-4ef6-8637-555a6a72199c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Reach-avoid problems with time-varying dynamics, targets and constraints,","work_id":"c4028cd0-69d1-4155-ab65-6c073a58e50e","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Dual-objective reinforcement learning with novel hamilton-jacobi-bellman formulations,","work_id":"ddd9de40-a70b-40ea-8cf3-087424cc1a7a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":97,"snapshot_sha256":"e43ebe2e72cde1e5e905d7cf359d0501a5f60e2c63188fd2d548aa67a3673d2f","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c9d839d7ce28f82d81fa3ddbffa448d272b95ac9524d48c82030dca79c93e524"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"28def877-d3fe-47cf-b2c8-7477c96a6a45"},"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:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vavO0tkDJN9U6KJdjskV3Q+0txUGPvilt8UkTWNGuIN7UffCG1utu/yCPA3qPmaFvn8CKAdOd1o5ZWE0+UaTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:00:11.482185Z"},"content_sha256":"944f19be6ab1a6cfddc1802d39b9f17c6c2c120ad0a162c5a99c4c04bb0a885a","schema_version":"1.0","event_id":"sha256:944f19be6ab1a6cfddc1802d39b9f17c6c2c120ad0a162c5a99c4c04bb0a885a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUUK4HNOI77GCX52SJSPFQUD5H/bundle.json","state_url":"https://pith.science/pith/XUUK4HNOI77GCX52SJSPFQUD5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUUK4HNOI77GCX52SJSPFQUD5H/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-22T11:00:11Z","links":{"resolver":"https://pith.science/pith/XUUK4HNOI77GCX52SJSPFQUD5H","bundle":"https://pith.science/pith/XUUK4HNOI77GCX52SJSPFQUD5H/bundle.json","state":"https://pith.science/pith/XUUK4HNOI77GCX52SJSPFQUD5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUUK4HNOI77GCX52SJSPFQUD5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XUUK4HNOI77GCX52SJSPFQUD5H","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":"5f00bec0ef5597893b606682b95cc33568db4b311aac8f2d4f65b8fa8a71f962","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2026-02-23T05:48:58Z","title_canon_sha256":"33efe4b725c0d887804372495e33b7214738738197a66c3dbdc1c1ad8c4a8b0f"},"schema_version":"1.0","source":{"id":"2602.19532","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.19532","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2602.19532v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.19532","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"XUUK4HNOI77G","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XUUK4HNOI77GCX52","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XUUK4HNO","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:944f19be6ab1a6cfddc1802d39b9f17c6c2c120ad0a162c5a99c4c04bb0a885a","target":"graph","created_at":"2026-05-17T23:39:16Z","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":"We prove the Bellman Value for a complex task defined in temporal logic can be decomposed into a graph of Bellman Values, connected by a set of well-known Bellman equations (BEs): the Reach-Avoid BE, the Avoid BE, and a novel type, the Reach-Avoid-Loop BE."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The innate structure of the Bellman value naturally organizes temporal logic tasks so that the decomposed graph can be embedded in a two-layer neural net that bootstraps implicit dependencies without additional manual tuning or post-hoc adjustments."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Bellman values for temporal logic tasks decompose into a graph of reach-avoid, avoid, and reach-avoid-loop equations solved by embedding the graph in a two-layer neural net (VDPPO) for safe high-dimensional control."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The Bellman value for temporal logic tasks decomposes into a graph of simpler values connected by reach-avoid, avoid, and reach-avoid-loop equations."}],"snapshot_sha256":"e298706ec58e2d408d1259987d24524e6d3507be4713d03a625400634fca6dc8"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c9d839d7ce28f82d81fa3ddbffa448d272b95ac9524d48c82030dca79c93e524"},"paper":{"abstract_excerpt":"Real-world tasks involve nuanced combinations of goal and safety specifications. In high dimensions, the challenge is exacerbated: formal automata become cumbersome, and the combination of sparse rewards tends to require laborious tuning. In this work, we consider the innate structure of the Bellman Value as a means to naturally organize the problem for improved automatic performance. Namely, we prove the Bellman Value for a complex task defined in temporal logic can be decomposed into a graph of Bellman Values, connected by a set of well-known Bellman equations (BEs): the Reach-Avoid BE, the ","authors_text":"Chuchu Fan, Dylan Hirsch, Oswin So, Sylvia Herbert, William Sharpless","cross_cats":["cs.SY","eess.SY"],"headline":"The Bellman value for temporal logic tasks decomposes into a graph of simpler values connected by reach-avoid, avoid, and reach-avoid-loop equations.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2026-02-23T05:48:58Z","title":"Bellman Value Decomposition for Task Logic in Safe Optimal Control"},"references":{"count":97,"internal_anchors":2,"resolved_work":97,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"R. S. Sutton and A. G. Barto,Reinforcement Learning: An Introduction. Cambridge, MA, USA: A Bradford Book, 2018","work_id":"caea0164-1521-4b56-b179-9df9c4a39a6d","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"LTL and beyond: Formal languages for reward function specification in reinforcement learning,","work_id":"e96f0e10-cf9a-43d0-be93-c838275ebe9a","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A time-dependent hamilton-jacobi formulation of reachable sets for continuous dynamic games","work_id":"9e58418c-c52c-4ef6-8637-555a6a72199c","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Reach-avoid problems with time-varying dynamics, targets and constraints,","work_id":"c4028cd0-69d1-4155-ab65-6c073a58e50e","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Dual-objective reinforcement learning with novel hamilton-jacobi-bellman formulations,","work_id":"ddd9de40-a70b-40ea-8cf3-087424cc1a7a","year":2025}],"snapshot_sha256":"e43ebe2e72cde1e5e905d7cf359d0501a5f60e2c63188fd2d548aa67a3673d2f"},"source":{"id":"2602.19532","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T21:05:49.837826Z","id":"28def877-d3fe-47cf-b2c8-7477c96a6a45","model_set":{"reader":"grok-4.3"},"one_line_summary":"Bellman values for temporal logic tasks decompose into a graph of reach-avoid, avoid, and reach-avoid-loop equations solved by embedding the graph in a two-layer neural net (VDPPO) for safe high-dimensional control.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The Bellman value for temporal logic tasks decomposes into a graph of simpler values connected by reach-avoid, avoid, and reach-avoid-loop equations.","strongest_claim":"We prove the Bellman Value for a complex task defined in temporal logic can be decomposed into a graph of Bellman Values, connected by a set of well-known Bellman equations (BEs): the Reach-Avoid BE, the Avoid BE, and a novel type, the Reach-Avoid-Loop BE.","weakest_assumption":"The innate structure of the Bellman value naturally organizes temporal logic tasks so that the decomposed graph can be embedded in a two-layer neural net that bootstraps implicit dependencies without additional manual tuning or post-hoc adjustments."}},"verdict_id":"28def877-d3fe-47cf-b2c8-7477c96a6a45"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a9417d21902385699d11ebeb4824720ce51bcacf313cc778fe3034ee86419ed6","target":"record","created_at":"2026-05-17T23:39:16Z","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":"5f00bec0ef5597893b606682b95cc33568db4b311aac8f2d4f65b8fa8a71f962","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2026-02-23T05:48:58Z","title_canon_sha256":"33efe4b725c0d887804372495e33b7214738738197a66c3dbdc1c1ad8c4a8b0f"},"schema_version":"1.0","source":{"id":"2602.19532","kind":"arxiv","version":2}},"canonical_sha256":"bd28ae1dae47fe615fba9264f2c283e9fffb760ae7ffd66cbbf6eaeed9cc33e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd28ae1dae47fe615fba9264f2c283e9fffb760ae7ffd66cbbf6eaeed9cc33e2","first_computed_at":"2026-05-17T23:39:16.014036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:16.014036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DQ41jNm6t6aAx1ZPMcim3PIEUuwiaUrUvUci5mghUP0Nqg80GqyQ5qTyasih5WJkAPG0Tf8iY5hETNV3qTDtAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:16.014823Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.19532","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9417d21902385699d11ebeb4824720ce51bcacf313cc778fe3034ee86419ed6","sha256:944f19be6ab1a6cfddc1802d39b9f17c6c2c120ad0a162c5a99c4c04bb0a885a"],"state_sha256":"c4d949c07232b54ae26c7384f884d7a31f98138b7205477c6f2733c6b73de589"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HZjmnU4vMYbo3MhYNhYHEqCFnzWZ+w4dMeIjkzxlwQbsNV0Jp5z7fLFnTn3XCErQoQMESVhPFqqXxMlGsehCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:00:11.486642Z","bundle_sha256":"6ba5016d4c18f94bffcc487edd6038c513d70f6f0cf29bdec9e4962b23ae0bfc"}}