{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NSRMGBSNPWLH36EMQS6DVSJK4A","short_pith_number":"pith:NSRMGBSN","canonical_record":{"source":{"id":"2607.18758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-21T06:27:43Z","cross_cats_sorted":["cs.DC","cs.IT","cs.MS","cs.NA","math.IT"],"title_canon_sha256":"58e6999f35525ea439f6a2debfc0076f1ef32888e41729d0dda405e02fd95a60","abstract_canon_sha256":"f5db03d70ec837ddb7fba15eefe3cddc17d41145a7ad3fa1a05bc7f69a8b1070"},"schema_version":"1.0"},"canonical_sha256":"6ca2c3064d7d967df88c84bc3ac92ae00a2e0ac3c40ff490e59d7d4deebd7945","source":{"kind":"arxiv","id":"2607.18758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.18758","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.18758v1","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18758","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"NSRMGBSNPWLH","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"NSRMGBSNPWLH36EM","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"NSRMGBSN","created_at":"2026-07-22T01:23:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NSRMGBSNPWLH36EMQS6DVSJK4A","target":"record","payload":{"canonical_record":{"source":{"id":"2607.18758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-21T06:27:43Z","cross_cats_sorted":["cs.DC","cs.IT","cs.MS","cs.NA","math.IT"],"title_canon_sha256":"58e6999f35525ea439f6a2debfc0076f1ef32888e41729d0dda405e02fd95a60","abstract_canon_sha256":"f5db03d70ec837ddb7fba15eefe3cddc17d41145a7ad3fa1a05bc7f69a8b1070"},"schema_version":"1.0"},"canonical_sha256":"6ca2c3064d7d967df88c84bc3ac92ae00a2e0ac3c40ff490e59d7d4deebd7945","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:23:10.491976Z","signature_b64":"FTgI017tnog3Q/LEwQ1l1p+6IgXLqp/IhKyIQGSLLdFURg8JU6dFbkoeA15Br6dD3OA2LWNFSkI5qwMQisjFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ca2c3064d7d967df88c84bc3ac92ae00a2e0ac3c40ff490e59d7d4deebd7945","last_reissued_at":"2026-07-22T01:23:10.491085Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:23:10.491085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.18758","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-07-22T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvUReGXg9R19h7l5DXu0Y6vvweT6Qbjzf6YNy8teMD4iNtvHuN4xArQfaVpVZtOonf3yhZOrGQcTpqnHRY+cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:34:46.271117Z"},"content_sha256":"906a681dae1c5239966effb03e5517df652402e275f25bba182f3ab06a67af28","schema_version":"1.0","event_id":"sha256:906a681dae1c5239966effb03e5517df652402e275f25bba182f3ab06a67af28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NSRMGBSNPWLH36EMQS6DVSJK4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Second-Moment Theory for Floating-Point Reduction Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.IT","cs.MS","cs.NA","math.IT"],"primary_cat":"math.NA","authors_text":"Keita Teranishi, Narasinga Miniskar, Pedro Valero-Lara, Piyush Sao, Sudip Seal","submitted_at":"2026-07-21T06:27:43Z","abstract_excerpt":"Summation error depends on partial-sum order, which standard worst-case bounds omit. To capture this dependence, we derive an exact mean-square error (MSE) recurrence for a binary reduction tree T under conditionally unbiased rounding. With unit roundoff u, the constant-nu model sets the local variance at pre-rounding value x to nu u^2 x^2. Its leading tree-dependent cost for the input vector p is p^T K_T p, where the common-ancestor kernel K_T counts the internal ancestors shared by each pair of leaves. For i.i.d. inputs of mean mu and variance tau^2, this expected cost is tau^2 Lambda_1(T) +"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18758","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.18758/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-22T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qv+20xQi7hyHqrJjF2u5uFn9x6NTvSWzmA1jOidzoGRj4AZj9KO5HoZ8WQJaY42Qn5vrlSHCfSbn9V1bhHJlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:34:46.271631Z"},"content_sha256":"19b557f3c8122e1bdf3bb4a4a856e84413d8944fb8053cfb16a693307e2b2e7c","schema_version":"1.0","event_id":"sha256:19b557f3c8122e1bdf3bb4a4a856e84413d8944fb8053cfb16a693307e2b2e7c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:NSRMGBSNPWLH36EMQS6DVSJK4A","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.parco.2015.09.001 resolves to 'Numerical reproducibility for the parallel reduction on multi- and many-core architectures'. A reader following the printed text alone cannot reach it.","snippet":"Caroline Collange et al. “Numerical reproducibility for the parallel reduction on multi- and many-core architectures”. In: Parallel Computing49 (2015), pp. 83–97.DOI: 10.1016/j.parco. 2015.09.001","arxiv_id":"2607.18758","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":"Numerical reproducibility for the parallel reduction on multi- and many-core architectures","printed_excerpt":"10.1016/j.parco","reconstructed_doi":"10.1016/j.parco.2015.09.001"},"severity":"advisory","ref_index":19,"audited_at":"2026-08-01T14:39:51.663703Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.parco.2015.09.001","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"eef026d42e083e6967bddb20ea9f690fd25e89147505feb1dcd2c1a831f0a8e8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Numerical reproducibility for the parallel reduction on multi- and many-core architectures","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15972,"payload_sha256":"a0c415c1558de5104055017a9e243f9db15da112eddd066a7f2a636a33fced32","signature_b64":"SOiukXUjvNCg8AJzTfmAdMW0lM9TktTcgI9Zs3FPX6HQKESWPpYvsWojbyp7bqZ6nUxLb0/3NGgFSBh0dlNaAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T14:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IOH4iL1dPzMpzod1pV/PF8DY+INLc12RsBt/2qJ4kyAJ3s5v/sy5O2+A8g6zGfGnQzjdnYnG7HLlS/E6UX99CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:34:46.275692Z"},"content_sha256":"a554b29d3279ddeaf23fde943a7a2d2bd197b1c3d821482aceb9b8143082d5eb","schema_version":"1.0","event_id":"sha256:a554b29d3279ddeaf23fde943a7a2d2bd197b1c3d821482aceb9b8143082d5eb"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:NSRMGBSNPWLH36EMQS6DVSJK4A","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.laa.2019.04.004 resolves to 'The ancestral matrix of a rooted tree'. A reader following the printed text alone cannot reach it.","snippet":"Eric O. D. Andriantiana, Kenneth Dadedzi, and Stephan Wag- ner. “The Ancestral Matrix of a Rooted Tree”. In:Linear Algebra and its Applications575 (2019), pp. 35–65.DOI: 10.1016/j.laa. 2019.04.004","arxiv_id":"2607.18758","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":"The ancestral matrix of a rooted tree","printed_excerpt":"10.1016/j.laa","reconstructed_doi":"10.1016/j.laa.2019.04.004"},"severity":"advisory","ref_index":3,"audited_at":"2026-08-01T14:39:51.663703Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.laa.2019.04.004","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e9c71e46e63ce23511687ab1a0ca6ab40ed13bbde4e037bf069adce4bfa2d51e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"The ancestral matrix of a rooted tree","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":15971,"payload_sha256":"d07fc210129e3e1b67a51bcd0c1d6666685ed3823b9473326ad506c1b1ceb6ad","signature_b64":"7m/jUXoJLWhstxTbZhRYJEl3JcOIyUmGYIzhFVauDurKpQ/7KJMXh0t4e4onYR8tuAQ+3RcdykZSZhnSbQmiCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T14:43:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huFDBl1LvmJP4x6l6LaUvCUoOz7mpd5K7CdfqESGoyvtralDBkCRzReoEpYBNWDANhWRtLE+LnEZ7+WOs4KcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T14:34:46.276072Z"},"content_sha256":"d7cccbc50bdc9a879bc873d1189aaeaf97f2b037981c52e292903ae103f5752e","schema_version":"1.0","event_id":"sha256:d7cccbc50bdc9a879bc873d1189aaeaf97f2b037981c52e292903ae103f5752e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSRMGBSNPWLH36EMQS6DVSJK4A/bundle.json","state_url":"https://pith.science/pith/NSRMGBSNPWLH36EMQS6DVSJK4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSRMGBSNPWLH36EMQS6DVSJK4A/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-09T14:34:46Z","links":{"resolver":"https://pith.science/pith/NSRMGBSNPWLH36EMQS6DVSJK4A","bundle":"https://pith.science/pith/NSRMGBSNPWLH36EMQS6DVSJK4A/bundle.json","state":"https://pith.science/pith/NSRMGBSNPWLH36EMQS6DVSJK4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSRMGBSNPWLH36EMQS6DVSJK4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NSRMGBSNPWLH36EMQS6DVSJK4A","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f5db03d70ec837ddb7fba15eefe3cddc17d41145a7ad3fa1a05bc7f69a8b1070","cross_cats_sorted":["cs.DC","cs.IT","cs.MS","cs.NA","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-21T06:27:43Z","title_canon_sha256":"58e6999f35525ea439f6a2debfc0076f1ef32888e41729d0dda405e02fd95a60"},"schema_version":"1.0","source":{"id":"2607.18758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.18758","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.18758v1","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18758","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"NSRMGBSNPWLH","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"pith_short_16","alias_value":"NSRMGBSNPWLH36EM","created_at":"2026-07-22T01:23:10Z"},{"alias_kind":"pith_short_8","alias_value":"NSRMGBSN","created_at":"2026-07-22T01:23:10Z"}],"graph_snapshots":[{"event_id":"sha256:19b557f3c8122e1bdf3bb4a4a856e84413d8944fb8053cfb16a693307e2b2e7c","target":"graph","created_at":"2026-07-22T01:23:10Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.18758/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Summation error depends on partial-sum order, which standard worst-case bounds omit. To capture this dependence, we derive an exact mean-square error (MSE) recurrence for a binary reduction tree T under conditionally unbiased rounding. With unit roundoff u, the constant-nu model sets the local variance at pre-rounding value x to nu u^2 x^2. Its leading tree-dependent cost for the input vector p is p^T K_T p, where the common-ancestor kernel K_T counts the internal ancestors shared by each pair of leaves. For i.i.d. inputs of mean mu and variance tau^2, this expected cost is tau^2 Lambda_1(T) +","authors_text":"Keita Teranishi, Narasinga Miniskar, Pedro Valero-Lara, Piyush Sao, Sudip Seal","cross_cats":["cs.DC","cs.IT","cs.MS","cs.NA","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-21T06:27:43Z","title":"A Second-Moment Theory for Floating-Point Reduction Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18758","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:906a681dae1c5239966effb03e5517df652402e275f25bba182f3ab06a67af28","target":"record","created_at":"2026-07-22T01:23:10Z","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":"f5db03d70ec837ddb7fba15eefe3cddc17d41145a7ad3fa1a05bc7f69a8b1070","cross_cats_sorted":["cs.DC","cs.IT","cs.MS","cs.NA","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2026-07-21T06:27:43Z","title_canon_sha256":"58e6999f35525ea439f6a2debfc0076f1ef32888e41729d0dda405e02fd95a60"},"schema_version":"1.0","source":{"id":"2607.18758","kind":"arxiv","version":1}},"canonical_sha256":"6ca2c3064d7d967df88c84bc3ac92ae00a2e0ac3c40ff490e59d7d4deebd7945","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ca2c3064d7d967df88c84bc3ac92ae00a2e0ac3c40ff490e59d7d4deebd7945","first_computed_at":"2026-07-22T01:23:10.491085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-22T01:23:10.491085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FTgI017tnog3Q/LEwQ1l1p+6IgXLqp/IhKyIQGSLLdFURg8JU6dFbkoeA15Br6dD3OA2LWNFSkI5qwMQisjFBQ==","signature_status":"signed_v1","signed_at":"2026-07-22T01:23:10.491976Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.18758","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:a554b29d3279ddeaf23fde943a7a2d2bd197b1c3d821482aceb9b8143082d5eb","sha256:d7cccbc50bdc9a879bc873d1189aaeaf97f2b037981c52e292903ae103f5752e"]}],"invalid_events":[],"applied_event_ids":["sha256:906a681dae1c5239966effb03e5517df652402e275f25bba182f3ab06a67af28","sha256:19b557f3c8122e1bdf3bb4a4a856e84413d8944fb8053cfb16a693307e2b2e7c"],"state_sha256":"c8a0d12c0b1673b10273e8d91cc200c75a2d48a45f49d4657ecde6d4f24a0877"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ElI6xbbGXLeDzux0T4/kQ+y0XXFVmhRHu98xA3TTdhG77g44WaesNF4jMl/CWSi4ZHA+xmOKOF7l7X/0T3fAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T14:34:46.278994Z","bundle_sha256":"0c7059f073e35c81cde740d7a65ab84f4ade317cf722349047b63c3e9ea889f8"}}