{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GV7LXWOKGBGVM7HK5NHM7HGVSB","short_pith_number":"pith:GV7LXWOK","canonical_record":{"source":{"id":"2512.09675","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-12-10T14:20:07Z","cross_cats_sorted":[],"title_canon_sha256":"5673ae3477bc9076392b812683e6a943c3cb2cabb2cd24fcbcff524a05dd645d","abstract_canon_sha256":"c4bd192b984bf8a15d602a98877b8dd1a914d13181161bed1b9dd5c6aa836b7e"},"schema_version":"1.0"},"canonical_sha256":"357ebbd9ca304d567ceaeb4ecf9cd5904104ecc1e84d6cea35936d42def7cb39","source":{"kind":"arxiv","id":"2512.09675","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.09675","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.09675v3","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.09675","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"GV7LXWOKGBGV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GV7LXWOKGBGVM7HK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GV7LXWOK","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GV7LXWOKGBGVM7HK5NHM7HGVSB","target":"record","payload":{"canonical_record":{"source":{"id":"2512.09675","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-12-10T14:20:07Z","cross_cats_sorted":[],"title_canon_sha256":"5673ae3477bc9076392b812683e6a943c3cb2cabb2cd24fcbcff524a05dd645d","abstract_canon_sha256":"c4bd192b984bf8a15d602a98877b8dd1a914d13181161bed1b9dd5c6aa836b7e"},"schema_version":"1.0"},"canonical_sha256":"357ebbd9ca304d567ceaeb4ecf9cd5904104ecc1e84d6cea35936d42def7cb39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:32.809700Z","signature_b64":"J65+NGBbVYdksflCTYfqomE6hcL+7Ar1rl1GNyCjeF1Um/xNIh9kxVTAK9q+Q8F3is3m+eAT75DKZuxx/ZJHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"357ebbd9ca304d567ceaeb4ecf9cd5904104ecc1e84d6cea35936d42def7cb39","last_reissued_at":"2026-05-18T03:09:32.809039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:32.809039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.09675","source_version":3,"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-18T03:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DtS+VsWV9o4mHyNKhZOo6+6XWivps6uMmyMsAmWs8tuxMDAzSieSgCwDNN15gSVyLl6B6G2Qma6AdSwwgzocDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:54:28.319102Z"},"content_sha256":"f41a39d35cbc5559e1d46ffd8ad29da3ddbcd5fb7b5ddaff6f9dde31da4455fb","schema_version":"1.0","event_id":"sha256:f41a39d35cbc5559e1d46ffd8ad29da3ddbcd5fb7b5ddaff6f9dde31da4455fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GV7LXWOKGBGVM7HK5NHM7HGVSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"d-TreeRPO: Towards More Reliable Policy Optimization for Diffusion Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Tree-structured rollouts with verifiable rewards and scheduled self-distillation deliver reliable step-wise advantages for diffusion language models.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aiwei Liu, Bolin Ding, Leyi Pan, Liancheng Fang, Lijie Wen, Lingzhe Zhang, Minghua He, Shuchang Tao, Yunpeng Zhai, Zhaoyang Liu, Zheyu Fu","submitted_at":"2025-12-10T14:20:07Z","abstract_excerpt":"Reinforcement learning (RL) is pivotal for enhancing the reasoning capabilities of diffusion large language models (dLLMs). However, existing dLLM policy optimization methods suffer from two critical reliability bottlenecks: (1) reward sparsity, arising from coarse or unverifiable signals that impede accurate advantage calculation; and (2) their probability estimates do not account for the gap to the unbiased expectation over all decoding orders, which are intractable to compute. To mitigate these issues, we propose d-TreeRPO, a reliable RL framework for dLLMs that leverages tree-structured ro"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Experiments demonstrate that d-TreeRPO outperforms existing baselines and achieves significant improvements across multiple reasoning benchmarks. Specifically, it achieves +86.2% on Sudoku, +51.6% on Countdown, +4.5% on GSM8K, and +5.3% on Math500 compared to the base model.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that tree-structured rollouts based on verifiable outcome rewards can be computed efficiently while still providing unbiased fine-grained step-wise advantage estimates that generalize beyond the sampled trees.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"d-TreeRPO uses tree rollouts for fine-grained verifiable rewards and time-scheduled self-distillation to reduce probability estimation gaps in diffusion LLMs, delivering substantial gains on Sudoku, Countdown, GSM8K, and Math500 benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Tree-structured rollouts with verifiable rewards and scheduled self-distillation deliver reliable step-wise advantages for diffusion language models.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a68458da126562a98d74d05a1d1133d231f6a47beac83bdd785292ee01e9187f"},"source":{"id":"2512.09675","kind":"arxiv","version":3},"verdict":{"id":"1da519d0-f60b-4d58-bc1f-8c774c63d039","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T23:19:28.436792Z","strongest_claim":"Experiments demonstrate that d-TreeRPO outperforms existing baselines and achieves significant improvements across multiple reasoning benchmarks. Specifically, it achieves +86.2% on Sudoku, +51.6% on Countdown, +4.5% on GSM8K, and +5.3% on Math500 compared to the base model.","one_line_summary":"d-TreeRPO uses tree rollouts for fine-grained verifiable rewards and time-scheduled self-distillation to reduce probability estimation gaps in diffusion LLMs, delivering substantial gains on Sudoku, Countdown, GSM8K, and Math500 benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that tree-structured rollouts based on verifiable outcome rewards can be computed efficiently while still providing unbiased fine-grained step-wise advantage estimates that generalize beyond the sampled trees.","pith_extraction_headline":"Tree-structured rollouts with verifiable rewards and scheduled self-distillation deliver reliable step-wise advantages for diffusion language models."},"references":{"count":18,"sample":[{"doi":"","year":2025,"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","ref_index":1,"cited_arxiv_id":"2110.14168","is_internal_anchor":true},{"doi":"","year":2025,"title":"Let's Verify Step by Step","work_id":"6d05b790-04c5-4fd2-91b2-ba1dfdd5770f","ref_index":2,"cited_arxiv_id":"2305.20050","is_internal_anchor":true},{"doi":"","year":2025,"title":"Scaling up masked diffusion models on text","work_id":"18872de0-5f47-4650-ba4f-f48cab3bfc7e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"arXiv preprint arXiv:2510.08554 , year=","work_id":"92530ab8-ecd9-4f9c-9a0e-4a3564931b48","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Dream 7B: Diffusion Large Language Models","work_id":"a8a49dbd-ad10-4c79-b1aa-3ad5173887ad","ref_index":5,"cited_arxiv_id":"2508.15487","is_internal_anchor":true}],"resolved_work":18,"snapshot_sha256":"804cc3048d34890bce4bcce7d8aa4b057ae79218c2efc3b06bf7d6db1b64c894","internal_anchors":3},"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":"1da519d0-f60b-4d58-bc1f-8c774c63d039"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:09:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfrHSOEWTG8AwFxqu2/TatiES5Ot5r1d2EhA35UUOublP3UJ561pMMppQcJda4DxCAbxpQbolkRNfXzEnHjECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:54:28.320570Z"},"content_sha256":"cb6ffb4d42aa3c552e49d133c335da25bdb842e00b82413358622fcdba454203","schema_version":"1.0","event_id":"sha256:cb6ffb4d42aa3c552e49d133c335da25bdb842e00b82413358622fcdba454203"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GV7LXWOKGBGVM7HK5NHM7HGVSB/bundle.json","state_url":"https://pith.science/pith/GV7LXWOKGBGVM7HK5NHM7HGVSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GV7LXWOKGBGVM7HK5NHM7HGVSB/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-27T08:54:28Z","links":{"resolver":"https://pith.science/pith/GV7LXWOKGBGVM7HK5NHM7HGVSB","bundle":"https://pith.science/pith/GV7LXWOKGBGVM7HK5NHM7HGVSB/bundle.json","state":"https://pith.science/pith/GV7LXWOKGBGVM7HK5NHM7HGVSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GV7LXWOKGBGVM7HK5NHM7HGVSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GV7LXWOKGBGVM7HK5NHM7HGVSB","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":"c4bd192b984bf8a15d602a98877b8dd1a914d13181161bed1b9dd5c6aa836b7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-12-10T14:20:07Z","title_canon_sha256":"5673ae3477bc9076392b812683e6a943c3cb2cabb2cd24fcbcff524a05dd645d"},"schema_version":"1.0","source":{"id":"2512.09675","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.09675","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.09675v3","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.09675","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"GV7LXWOKGBGV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GV7LXWOKGBGVM7HK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GV7LXWOK","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:cb6ffb4d42aa3c552e49d133c335da25bdb842e00b82413358622fcdba454203","target":"graph","created_at":"2026-05-18T03:09:32Z","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":"Experiments demonstrate that d-TreeRPO outperforms existing baselines and achieves significant improvements across multiple reasoning benchmarks. Specifically, it achieves +86.2% on Sudoku, +51.6% on Countdown, +4.5% on GSM8K, and +5.3% on Math500 compared to the base model."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that tree-structured rollouts based on verifiable outcome rewards can be computed efficiently while still providing unbiased fine-grained step-wise advantage estimates that generalize beyond the sampled trees."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"d-TreeRPO uses tree rollouts for fine-grained verifiable rewards and time-scheduled self-distillation to reduce probability estimation gaps in diffusion LLMs, delivering substantial gains on Sudoku, Countdown, GSM8K, and Math500 benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Tree-structured rollouts with verifiable rewards and scheduled self-distillation deliver reliable step-wise advantages for diffusion language models."}],"snapshot_sha256":"a68458da126562a98d74d05a1d1133d231f6a47beac83bdd785292ee01e9187f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Reinforcement learning (RL) is pivotal for enhancing the reasoning capabilities of diffusion large language models (dLLMs). However, existing dLLM policy optimization methods suffer from two critical reliability bottlenecks: (1) reward sparsity, arising from coarse or unverifiable signals that impede accurate advantage calculation; and (2) their probability estimates do not account for the gap to the unbiased expectation over all decoding orders, which are intractable to compute. To mitigate these issues, we propose d-TreeRPO, a reliable RL framework for dLLMs that leverages tree-structured ro","authors_text":"Aiwei Liu, Bolin Ding, Leyi Pan, Liancheng Fang, Lijie Wen, Lingzhe Zhang, Minghua He, Shuchang Tao, Yunpeng Zhai, Zhaoyang Liu, Zheyu Fu","cross_cats":[],"headline":"Tree-structured rollouts with verifiable rewards and scheduled self-distillation deliver reliable step-wise advantages for diffusion language models.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-12-10T14:20:07Z","title":"d-TreeRPO: Towards More Reliable Policy Optimization for Diffusion Language Models"},"references":{"count":18,"internal_anchors":3,"resolved_work":18,"sample":[{"cited_arxiv_id":"2110.14168","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2025},{"cited_arxiv_id":"2305.20050","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Let's Verify Step by Step","work_id":"6d05b790-04c5-4fd2-91b2-ba1dfdd5770f","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Scaling up masked diffusion models on text","work_id":"18872de0-5f47-4650-ba4f-f48cab3bfc7e","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"arXiv preprint arXiv:2510.08554 , year=","work_id":"92530ab8-ecd9-4f9c-9a0e-4a3564931b48","year":2017},{"cited_arxiv_id":"2508.15487","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Dream 7B: Diffusion Large Language Models","work_id":"a8a49dbd-ad10-4c79-b1aa-3ad5173887ad","year":2023}],"snapshot_sha256":"804cc3048d34890bce4bcce7d8aa4b057ae79218c2efc3b06bf7d6db1b64c894"},"source":{"id":"2512.09675","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T23:19:28.436792Z","id":"1da519d0-f60b-4d58-bc1f-8c774c63d039","model_set":{"reader":"grok-4.3"},"one_line_summary":"d-TreeRPO uses tree rollouts for fine-grained verifiable rewards and time-scheduled self-distillation to reduce probability estimation gaps in diffusion LLMs, delivering substantial gains on Sudoku, Countdown, GSM8K, and Math500 benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Tree-structured rollouts with verifiable rewards and scheduled self-distillation deliver reliable step-wise advantages for diffusion language models.","strongest_claim":"Experiments demonstrate that d-TreeRPO outperforms existing baselines and achieves significant improvements across multiple reasoning benchmarks. Specifically, it achieves +86.2% on Sudoku, +51.6% on Countdown, +4.5% on GSM8K, and +5.3% on Math500 compared to the base model.","weakest_assumption":"The assumption that tree-structured rollouts based on verifiable outcome rewards can be computed efficiently while still providing unbiased fine-grained step-wise advantage estimates that generalize beyond the sampled trees."}},"verdict_id":"1da519d0-f60b-4d58-bc1f-8c774c63d039"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f41a39d35cbc5559e1d46ffd8ad29da3ddbcd5fb7b5ddaff6f9dde31da4455fb","target":"record","created_at":"2026-05-18T03:09:32Z","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":"c4bd192b984bf8a15d602a98877b8dd1a914d13181161bed1b9dd5c6aa836b7e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-12-10T14:20:07Z","title_canon_sha256":"5673ae3477bc9076392b812683e6a943c3cb2cabb2cd24fcbcff524a05dd645d"},"schema_version":"1.0","source":{"id":"2512.09675","kind":"arxiv","version":3}},"canonical_sha256":"357ebbd9ca304d567ceaeb4ecf9cd5904104ecc1e84d6cea35936d42def7cb39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"357ebbd9ca304d567ceaeb4ecf9cd5904104ecc1e84d6cea35936d42def7cb39","first_computed_at":"2026-05-18T03:09:32.809039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:32.809039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J65+NGBbVYdksflCTYfqomE6hcL+7Ar1rl1GNyCjeF1Um/xNIh9kxVTAK9q+Q8F3is3m+eAT75DKZuxx/ZJHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:32.809700Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.09675","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f41a39d35cbc5559e1d46ffd8ad29da3ddbcd5fb7b5ddaff6f9dde31da4455fb","sha256:cb6ffb4d42aa3c552e49d133c335da25bdb842e00b82413358622fcdba454203"],"state_sha256":"73b66441485748314d447cb702c77e18aaf4bb0e87eca91c19cdcfbd4395615c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ngws3reKC36Zuzh8gEq4nIFWLFDsNfXSXzEKQKecHxGmoO63Vu5O4I8Wm9tk/Cb1PmMS+fhJQ8htQbxSJNEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:54:28.325134Z","bundle_sha256":"c21f7bbb69ac91d43488cd255c1ad79cfb5621a916173ad8bcf6efe439f396dc"}}