{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SEQTVGXREBQ6NJ27UPORUOOQCB","short_pith_number":"pith:SEQTVGXR","canonical_record":{"source":{"id":"2605.13526","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"ce9b349437b50d37a84d53b7c6a971ca41d679e03b6b05e8e1617addd5b2b844","abstract_canon_sha256":"3692aaf252ed8b1b1275424aefaf96e87009fc56df75197610f80a8887849854"},"schema_version":"1.0"},"canonical_sha256":"91213a9af12061e6a75fa3dd1a39d01069a2e97a2c7d3c37bbee19135ecaab04","source":{"kind":"arxiv","id":"2605.13526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13526","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13526v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13526","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"SEQTVGXREBQ6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"SEQTVGXREBQ6NJ27","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"SEQTVGXR","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SEQTVGXREBQ6NJ27UPORUOOQCB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13526","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"ce9b349437b50d37a84d53b7c6a971ca41d679e03b6b05e8e1617addd5b2b844","abstract_canon_sha256":"3692aaf252ed8b1b1275424aefaf96e87009fc56df75197610f80a8887849854"},"schema_version":"1.0"},"canonical_sha256":"91213a9af12061e6a75fa3dd1a39d01069a2e97a2c7d3c37bbee19135ecaab04","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:24.310075Z","signature_b64":"MXx8vGWBvAzScMMn3Di3bh9Ff5ebZkvB9711jg4fQy4atnAFUaz4N5anISfnlQDgkYt72ceerREVGmAX06peCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91213a9af12061e6a75fa3dd1a39d01069a2e97a2c7d3c37bbee19135ecaab04","last_reissued_at":"2026-05-18T02:44:24.309674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:24.309674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13526","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-18T02:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ESik/zC/Mf5y8o2pYQZuwqH6slzibyE1kNNyLuMmNuDA1RDhDrbNzkf/uODKETMxO+qIvd27MX4GaxVQxvTsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:51.330018Z"},"content_sha256":"d69864711705f432e60d0bf5d564d2665ac966df8469bfd90ba90e19fd90661a","schema_version":"1.0","event_id":"sha256:d69864711705f432e60d0bf5d564d2665ac966df8469bfd90ba90e19fd90661a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SEQTVGXREBQ6NJ27UPORUOOQCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying Exact Samplers for Continuous Distributions with a Discrete Program Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A higher-order separation logic proves exact samplers for continuous distributions correct.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alejandro Aguirre, Joseph Tassarotti, Kwing Hei Li, Lars Birkedal, Markus de Medeiros, Puming Liu","submitted_at":"2026-05-13T13:39:31Z","abstract_excerpt":"Most implementations of sampling algorithms for continuous distributions use floating-point numbers, which introduce round-off errors and approximations. These errors can be difficult to analyze, and can cause security issues when used in algorithms for differential privacy. An alternative is to use exact sampling algorithms based on computable reals, which can lazily generate the digits of a continuous sample to arbitrary precision. However, these algorithms are intricate, and implementing and using them involves a combination of semantically challenging language features, such as probabilist"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present Continuous-Eris, a higher-order separation logic for verifying the correctness of exact sampling algorithms for computable distributions. To demonstrate Continuous-Eris, we verify the correctness of computable samplers for the uniform, Gaussian, and Laplace distributions, as well as a library for exact real arithmetic for working with generated samples. All of the results in this paper have been verified in the Rocq proof assistant.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The underlying programming language semantics for probabilistic choice, higher-order functions, and mutable state are faithfully captured by the separation logic rules, and the model of computable reals correctly represents lazy digit generation without hidden approximation.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Continuous-Eris is a new separation logic, fully verified in Rocq, that proves correctness of exact samplers for uniform, Gaussian, and Laplace distributions plus an exact real arithmetic library.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A higher-order separation logic proves exact samplers for continuous distributions correct.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e041de4c4e86da884205d889a48a3a938a118da6a2a89bf944b6abbbf7daffe8"},"source":{"id":"2605.13526","kind":"arxiv","version":1},"verdict":{"id":"9718ba05-4710-41f1-bea2-d233e0441bec","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:24:00.056657Z","strongest_claim":"We present Continuous-Eris, a higher-order separation logic for verifying the correctness of exact sampling algorithms for computable distributions. To demonstrate Continuous-Eris, we verify the correctness of computable samplers for the uniform, Gaussian, and Laplace distributions, as well as a library for exact real arithmetic for working with generated samples. All of the results in this paper have been verified in the Rocq proof assistant.","one_line_summary":"Continuous-Eris is a new separation logic, fully verified in Rocq, that proves correctness of exact samplers for uniform, Gaussian, and Laplace distributions plus an exact real arithmetic library.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The underlying programming language semantics for probabilistic choice, higher-order functions, and mutable state are faithfully captured by the separation logic rules, and the model of computable reals correctly represents lazy digit generation without hidden approximation.","pith_extraction_headline":"A higher-order separation logic proves exact samplers for continuous distributions correct."},"references":{"count":16,"sample":[{"doi":"10.1145/3321699","year":2019,"title":"1 Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy. On the computability of conditional probability.J. ACM, 66(3):23:1–23:40, 2019.doi:10.1145/3321699. 2 Alejandro Aguirre, Philipp G. Haselw","work_id":"4e612a3e-feaa-4ab9-9a35-547a9bdcc036","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.4230/lipics.icalp.2016.107","year":2016,"title":"5 Kevin Batz, Joost-Pieter Katoen, Francesca Randone, and Tobias Winkler","work_id":"b27c4746-c8a8-405d-8852-15172f50eb75","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3519939.3523721","year":null,"title":"Quickstrom: property-based acceptance testing with ltl specifications","work_id":"ce9c6e95-4a39-4c85-95df-974de64e929c","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"A domain-theoretic approach to brownian motion and general continuous stochastic processes","work_id":"c5d850c5-3442-4c30-90cc-71f8f00f4d86","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/2603088.2603102","year":2020,"title":"Narayan Kumar, and Patrick Totzke","work_id":"9affc654-2cbc-4bc0-8677-1aed0c034b70","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"d2b313354a8edfad4db6c4925356600b3611a5b4bad32f19fc032477b960b83a","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":"9718ba05-4710-41f1-bea2-d233e0441bec"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiaGsK5/9oWKmK8oAbeV826a6FJDu6YtfLHytAfiysnpFEOk+61nYSzxTkOFPCZwqMdVC+2LMjeg60hI6K5vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:51.331300Z"},"content_sha256":"be5e2b6b8f3a90d34a23fb99f892ec384d357e80174fddf02490261ac84358a7","schema_version":"1.0","event_id":"sha256:be5e2b6b8f3a90d34a23fb99f892ec384d357e80174fddf02490261ac84358a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEQTVGXREBQ6NJ27UPORUOOQCB/bundle.json","state_url":"https://pith.science/pith/SEQTVGXREBQ6NJ27UPORUOOQCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEQTVGXREBQ6NJ27UPORUOOQCB/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-25T04:13:51Z","links":{"resolver":"https://pith.science/pith/SEQTVGXREBQ6NJ27UPORUOOQCB","bundle":"https://pith.science/pith/SEQTVGXREBQ6NJ27UPORUOOQCB/bundle.json","state":"https://pith.science/pith/SEQTVGXREBQ6NJ27UPORUOOQCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEQTVGXREBQ6NJ27UPORUOOQCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SEQTVGXREBQ6NJ27UPORUOOQCB","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":"3692aaf252ed8b1b1275424aefaf96e87009fc56df75197610f80a8887849854","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:39:31Z","title_canon_sha256":"ce9b349437b50d37a84d53b7c6a971ca41d679e03b6b05e8e1617addd5b2b844"},"schema_version":"1.0","source":{"id":"2605.13526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13526","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13526v1","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13526","created_at":"2026-05-18T02:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"SEQTVGXREBQ6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"SEQTVGXREBQ6NJ27","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"SEQTVGXR","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:be5e2b6b8f3a90d34a23fb99f892ec384d357e80174fddf02490261ac84358a7","target":"graph","created_at":"2026-05-18T02:44:24Z","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 present Continuous-Eris, a higher-order separation logic for verifying the correctness of exact sampling algorithms for computable distributions. To demonstrate Continuous-Eris, we verify the correctness of computable samplers for the uniform, Gaussian, and Laplace distributions, as well as a library for exact real arithmetic for working with generated samples. All of the results in this paper have been verified in the Rocq proof assistant."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The underlying programming language semantics for probabilistic choice, higher-order functions, and mutable state are faithfully captured by the separation logic rules, and the model of computable reals correctly represents lazy digit generation without hidden approximation."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Continuous-Eris is a new separation logic, fully verified in Rocq, that proves correctness of exact samplers for uniform, Gaussian, and Laplace distributions plus an exact real arithmetic library."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A higher-order separation logic proves exact samplers for continuous distributions correct."}],"snapshot_sha256":"e041de4c4e86da884205d889a48a3a938a118da6a2a89bf944b6abbbf7daffe8"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Most implementations of sampling algorithms for continuous distributions use floating-point numbers, which introduce round-off errors and approximations. These errors can be difficult to analyze, and can cause security issues when used in algorithms for differential privacy. An alternative is to use exact sampling algorithms based on computable reals, which can lazily generate the digits of a continuous sample to arbitrary precision. However, these algorithms are intricate, and implementing and using them involves a combination of semantically challenging language features, such as probabilist","authors_text":"Alejandro Aguirre, Joseph Tassarotti, Kwing Hei Li, Lars Birkedal, Markus de Medeiros, Puming Liu","cross_cats":[],"headline":"A higher-order separation logic proves exact samplers for continuous distributions correct.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:39:31Z","title":"Verifying Exact Samplers for Continuous Distributions with a Discrete Program Logic"},"references":{"count":16,"internal_anchors":0,"resolved_work":16,"sample":[{"cited_arxiv_id":"","doi":"10.1145/3321699","is_internal_anchor":false,"ref_index":1,"title":"1 Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy. On the computability of conditional probability.J. ACM, 66(3):23:1–23:40, 2019.doi:10.1145/3321699. 2 Alejandro Aguirre, Philipp G. Haselw","work_id":"4e612a3e-feaa-4ab9-9a35-547a9bdcc036","year":2019},{"cited_arxiv_id":"","doi":"10.4230/lipics.icalp.2016.107","is_internal_anchor":false,"ref_index":2,"title":"5 Kevin Batz, Joost-Pieter Katoen, Francesca Randone, and Tobias Winkler","work_id":"b27c4746-c8a8-405d-8852-15172f50eb75","year":2016},{"cited_arxiv_id":"","doi":"10.1145/3519939.3523721","is_internal_anchor":false,"ref_index":3,"title":"Quickstrom: property-based acceptance testing with ltl specifications","work_id":"ce9c6e95-4a39-4c85-95df-974de64e929c","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A domain-theoretic approach to brownian motion and general continuous stochastic processes","work_id":"c5d850c5-3442-4c30-90cc-71f8f00f4d86","year":2014},{"cited_arxiv_id":"","doi":"10.1145/2603088.2603102","is_internal_anchor":false,"ref_index":5,"title":"Narayan Kumar, and Patrick Totzke","work_id":"9affc654-2cbc-4bc0-8677-1aed0c034b70","year":2020}],"snapshot_sha256":"d2b313354a8edfad4db6c4925356600b3611a5b4bad32f19fc032477b960b83a"},"source":{"id":"2605.13526","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T18:24:00.056657Z","id":"9718ba05-4710-41f1-bea2-d233e0441bec","model_set":{"reader":"grok-4.3"},"one_line_summary":"Continuous-Eris is a new separation logic, fully verified in Rocq, that proves correctness of exact samplers for uniform, Gaussian, and Laplace distributions plus an exact real arithmetic library.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A higher-order separation logic proves exact samplers for continuous distributions correct.","strongest_claim":"We present Continuous-Eris, a higher-order separation logic for verifying the correctness of exact sampling algorithms for computable distributions. To demonstrate Continuous-Eris, we verify the correctness of computable samplers for the uniform, Gaussian, and Laplace distributions, as well as a library for exact real arithmetic for working with generated samples. All of the results in this paper have been verified in the Rocq proof assistant.","weakest_assumption":"The underlying programming language semantics for probabilistic choice, higher-order functions, and mutable state are faithfully captured by the separation logic rules, and the model of computable reals correctly represents lazy digit generation without hidden approximation."}},"verdict_id":"9718ba05-4710-41f1-bea2-d233e0441bec"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d69864711705f432e60d0bf5d564d2665ac966df8469bfd90ba90e19fd90661a","target":"record","created_at":"2026-05-18T02:44:24Z","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":"3692aaf252ed8b1b1275424aefaf96e87009fc56df75197610f80a8887849854","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T13:39:31Z","title_canon_sha256":"ce9b349437b50d37a84d53b7c6a971ca41d679e03b6b05e8e1617addd5b2b844"},"schema_version":"1.0","source":{"id":"2605.13526","kind":"arxiv","version":1}},"canonical_sha256":"91213a9af12061e6a75fa3dd1a39d01069a2e97a2c7d3c37bbee19135ecaab04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91213a9af12061e6a75fa3dd1a39d01069a2e97a2c7d3c37bbee19135ecaab04","first_computed_at":"2026-05-18T02:44:24.309674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:24.309674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MXx8vGWBvAzScMMn3Di3bh9Ff5ebZkvB9711jg4fQy4atnAFUaz4N5anISfnlQDgkYt72ceerREVGmAX06peCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:24.310075Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d69864711705f432e60d0bf5d564d2665ac966df8469bfd90ba90e19fd90661a","sha256:be5e2b6b8f3a90d34a23fb99f892ec384d357e80174fddf02490261ac84358a7"],"state_sha256":"a4c90da6b17d6b05821c7c96e7b18c432e04eb846a65838f030642df94bb0dcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7VbWWfAn4OrX/qyryv8Qx2ZuYx+Pc8/SXlI5SkgMpKp509EjOJB4VsKQxvFkVpdQZqBi0XymeDQgG6tM2g3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:13:51.336224Z","bundle_sha256":"1249ef418ebf9a7cd8055c38094f6ad1c041794b92d7106c20b69bd657210cd3"}}