{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PEF32I5IVTUQXPBYUCZG3UCJP2","short_pith_number":"pith:PEF32I5I","canonical_record":{"source":{"id":"2605.14305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-14T03:15:25Z","cross_cats_sorted":[],"title_canon_sha256":"1b752d254629e474560257600ffd2c4644cf0f0198229497f92dc83040d93b40","abstract_canon_sha256":"171bf65d9fc87c334c011d41ec3b1aba7f8636d06328f6b5e6b19f6d1db9d2a8"},"schema_version":"1.0"},"canonical_sha256":"790bbd23a8ace90bbc38a0b26dd0497e8cc9831a5760c0ca7991e26399752eb7","source":{"kind":"arxiv","id":"2605.14305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14305","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14305v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14305","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"PEF32I5IVTUQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"PEF32I5IVTUQXPBY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"PEF32I5I","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PEF32I5IVTUQXPBYUCZG3UCJP2","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-14T03:15:25Z","cross_cats_sorted":[],"title_canon_sha256":"1b752d254629e474560257600ffd2c4644cf0f0198229497f92dc83040d93b40","abstract_canon_sha256":"171bf65d9fc87c334c011d41ec3b1aba7f8636d06328f6b5e6b19f6d1db9d2a8"},"schema_version":"1.0"},"canonical_sha256":"790bbd23a8ace90bbc38a0b26dd0497e8cc9831a5760c0ca7991e26399752eb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:10.055766Z","signature_b64":"7iIg90FyU8LorW++WpaFI6odiMEp70z/cBmnhV+kiKdld5MCzz0yWFbL6gcOCnr8PrSHVHF1bgp1mP8dyMFBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"790bbd23a8ace90bbc38a0b26dd0497e8cc9831a5760c0ca7991e26399752eb7","last_reissued_at":"2026-05-17T23:39:10.055299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:10.055299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14305","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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fDcciZeJEOLTVfugkERfBfPPojsjvGfI+Dx1AZrNx0H8yBlaDkN4S1fY2XaQv0KX3YI151JWaGO4O3GiZ4ADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:01:32.318917Z"},"content_sha256":"e5b7fea5999aea74b94be671c47431f92bb77f0733ef3e7f0583b8efbdd1efb9","schema_version":"1.0","event_id":"sha256:e5b7fea5999aea74b94be671c47431f92bb77f0733ef3e7f0583b8efbdd1efb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PEF32I5IVTUQXPBYUCZG3UCJP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factorization-Error-Free Discrete Diffusion Language Model via Speculative Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"FeF-DLLM eliminates factorization errors in discrete diffusion language models by replacing independent token predictions with an exact prefix-conditioned factorization of the clean posterior.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Hang Yuan, Xun Fang, Yunchen Li, Zhou Yu","submitted_at":"2026-05-14T03:15:25Z","abstract_excerpt":"Discrete diffusion language models improve generation efficiency through parallel token prediction, but standard $X_0$ prediction methods introduce factorization errors by approximating the clean token posterior with independent token-wise distributions. This paper proposes Factorization-Error-Free Discrete Diffusion Language Modeling (FeF-DLLM), which replaces independent clean-token prediction with an exact prefix-conditioned factorization of the clean posterior to better preserve token dependencies. To reduce the sequential cost introduced by prefix conditioning, FeF-DLLM further incorporat"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Theoretically, we prove that FeF-DLLM generates from the true joint distribution and derive its expected acceleration ratio. Experiments demonstrate an average accuracy improvement of 5.04 percentage points and 3.86× inference speedup.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the prefix-conditioned exact factorization can be realized efficiently via speculative decoding without introducing new approximation errors that undermine the joint-distribution guarantee, and that the theoretical acceleration ratio translates to real-world wall-clock gains under the chosen verification strategy.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FeF-DLLM achieves factorization-error-free generation in discrete diffusion language models via prefix-conditioned posterior factorization and speculative decoding, delivering 5.04 pp higher accuracy and 3.86x faster inference on GSM8K, MATH, HumanEval, and MBPP.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"FeF-DLLM eliminates factorization errors in discrete diffusion language models by replacing independent token predictions with an exact prefix-conditioned factorization of the clean posterior.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"89509912be60226ae743191cddd4211db09a505780e39b866a87c9f0fefc587d"},"source":{"id":"2605.14305","kind":"arxiv","version":1},"verdict":{"id":"f48e28fe-d126-41c4-9a4b-9baeb501da81","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:49:04.182737Z","strongest_claim":"Theoretically, we prove that FeF-DLLM generates from the true joint distribution and derive its expected acceleration ratio. Experiments demonstrate an average accuracy improvement of 5.04 percentage points and 3.86× inference speedup.","one_line_summary":"FeF-DLLM achieves factorization-error-free generation in discrete diffusion language models via prefix-conditioned posterior factorization and speculative decoding, delivering 5.04 pp higher accuracy and 3.86x faster inference on GSM8K, MATH, HumanEval, and MBPP.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the prefix-conditioned exact factorization can be realized efficiently via speculative decoding without introducing new approximation errors that undermine the joint-distribution guarantee, and that the theoretical acceleration ratio translates to real-world wall-clock gains under the chosen verification strategy.","pith_extraction_headline":"FeF-DLLM eliminates factorization errors in discrete diffusion language models by replacing independent token predictions with an exact prefix-conditioned factorization of the clean posterior."},"references":{"count":13,"sample":[{"doi":"","year":2024,"title":"Program Synthesis with Large Language Models","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","ref_index":1,"cited_arxiv_id":"2108.07732","is_internal_anchor":true},{"doi":"","year":null,"title":"LLaDA2.0: Scaling Up Diffusion Language Models to 100B","work_id":"a1b1080d-0a91-44a4-8f70-2bf3e7a27e0b","ref_index":2,"cited_arxiv_id":"2512.15745","is_internal_anchor":true},{"doi":"","year":null,"title":"Self-speculative masked diffusions.arXiv preprint arXiv:2510.03929,","work_id":"4f49f986-8a7d-4bfa-9e0c-33519caaa9a1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Accelerating Large Language Model Decoding with Speculative Sampling","work_id":"b53b11e5-8613-439d-9d9d-0e2a9090d79f","ref_index":4,"cited_arxiv_id":"2302.01318","is_internal_anchor":true},{"doi":"","year":null,"title":"Evaluating Large Language Models Trained on Code","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","ref_index":5,"cited_arxiv_id":"2107.03374","is_internal_anchor":true}],"resolved_work":13,"snapshot_sha256":"7460e2dbcee1d2061b1d53df61f779ae071d565a66a0e621ab9af7ca18a6a8eb","internal_anchors":8},"formal_canon":{"evidence_count":2,"snapshot_sha256":"06034cbd89f150feb7a98554406af84a2d91b5ada8d018649c867161298a20bb"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"f48e28fe-d126-41c4-9a4b-9baeb501da81"},"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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sASuIsNi1qTCpeqM3cUJz5y5rIqFg2THLejZ52JSDbakApnGfITIUgBc6ku8C9ECjF125oAJyquKOVqsU7PrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T07:01:32.319912Z"},"content_sha256":"5d5ef6cd441afcbd6db2b2914e51356d13e2cea6f5331cb3e1244c43635f57d2","schema_version":"1.0","event_id":"sha256:5d5ef6cd441afcbd6db2b2914e51356d13e2cea6f5331cb3e1244c43635f57d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEF32I5IVTUQXPBYUCZG3UCJP2/bundle.json","state_url":"https://pith.science/pith/PEF32I5IVTUQXPBYUCZG3UCJP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEF32I5IVTUQXPBYUCZG3UCJP2/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-06-06T07:01:32Z","links":{"resolver":"https://pith.science/pith/PEF32I5IVTUQXPBYUCZG3UCJP2","bundle":"https://pith.science/pith/PEF32I5IVTUQXPBYUCZG3UCJP2/bundle.json","state":"https://pith.science/pith/PEF32I5IVTUQXPBYUCZG3UCJP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEF32I5IVTUQXPBYUCZG3UCJP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PEF32I5IVTUQXPBYUCZG3UCJP2","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":"171bf65d9fc87c334c011d41ec3b1aba7f8636d06328f6b5e6b19f6d1db9d2a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-14T03:15:25Z","title_canon_sha256":"1b752d254629e474560257600ffd2c4644cf0f0198229497f92dc83040d93b40"},"schema_version":"1.0","source":{"id":"2605.14305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14305","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14305v1","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14305","created_at":"2026-05-17T23:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"PEF32I5IVTUQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"PEF32I5IVTUQXPBY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"PEF32I5I","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5d5ef6cd441afcbd6db2b2914e51356d13e2cea6f5331cb3e1244c43635f57d2","target":"graph","created_at":"2026-05-17T23:39: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Theoretically, we prove that FeF-DLLM generates from the true joint distribution and derive its expected acceleration ratio. Experiments demonstrate an average accuracy improvement of 5.04 percentage points and 3.86× inference speedup."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the prefix-conditioned exact factorization can be realized efficiently via speculative decoding without introducing new approximation errors that undermine the joint-distribution guarantee, and that the theoretical acceleration ratio translates to real-world wall-clock gains under the chosen verification strategy."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FeF-DLLM achieves factorization-error-free generation in discrete diffusion language models via prefix-conditioned posterior factorization and speculative decoding, delivering 5.04 pp higher accuracy and 3.86x faster inference on GSM8K, MATH, HumanEval, and MBPP."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"FeF-DLLM eliminates factorization errors in discrete diffusion language models by replacing independent token predictions with an exact prefix-conditioned factorization of the clean posterior."}],"snapshot_sha256":"89509912be60226ae743191cddd4211db09a505780e39b866a87c9f0fefc587d"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"06034cbd89f150feb7a98554406af84a2d91b5ada8d018649c867161298a20bb"},"paper":{"abstract_excerpt":"Discrete diffusion language models improve generation efficiency through parallel token prediction, but standard $X_0$ prediction methods introduce factorization errors by approximating the clean token posterior with independent token-wise distributions. This paper proposes Factorization-Error-Free Discrete Diffusion Language Modeling (FeF-DLLM), which replaces independent clean-token prediction with an exact prefix-conditioned factorization of the clean posterior to better preserve token dependencies. To reduce the sequential cost introduced by prefix conditioning, FeF-DLLM further incorporat","authors_text":"Hang Yuan, Xun Fang, Yunchen Li, Zhou Yu","cross_cats":[],"headline":"FeF-DLLM eliminates factorization errors in discrete diffusion language models by replacing independent token predictions with an exact prefix-conditioned factorization of the clean posterior.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-14T03:15:25Z","title":"Factorization-Error-Free Discrete Diffusion Language Model via Speculative Decoding"},"references":{"count":13,"internal_anchors":8,"resolved_work":13,"sample":[{"cited_arxiv_id":"2108.07732","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Program Synthesis with Large Language Models","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","year":2024},{"cited_arxiv_id":"2512.15745","doi":"","is_internal_anchor":true,"ref_index":2,"title":"LLaDA2.0: Scaling Up Diffusion Language Models to 100B","work_id":"a1b1080d-0a91-44a4-8f70-2bf3e7a27e0b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Self-speculative masked diffusions.arXiv preprint arXiv:2510.03929,","work_id":"4f49f986-8a7d-4bfa-9e0c-33519caaa9a1","year":null},{"cited_arxiv_id":"2302.01318","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Accelerating Large Language Model Decoding with Speculative Sampling","work_id":"b53b11e5-8613-439d-9d9d-0e2a9090d79f","year":null},{"cited_arxiv_id":"2107.03374","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Evaluating Large Language Models Trained on Code","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","year":null}],"snapshot_sha256":"7460e2dbcee1d2061b1d53df61f779ae071d565a66a0e621ab9af7ca18a6a8eb"},"source":{"id":"2605.14305","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:49:04.182737Z","id":"f48e28fe-d126-41c4-9a4b-9baeb501da81","model_set":{"reader":"grok-4.3"},"one_line_summary":"FeF-DLLM achieves factorization-error-free generation in discrete diffusion language models via prefix-conditioned posterior factorization and speculative decoding, delivering 5.04 pp higher accuracy and 3.86x faster inference on GSM8K, MATH, HumanEval, and MBPP.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"FeF-DLLM eliminates factorization errors in discrete diffusion language models by replacing independent token predictions with an exact prefix-conditioned factorization of the clean posterior.","strongest_claim":"Theoretically, we prove that FeF-DLLM generates from the true joint distribution and derive its expected acceleration ratio. Experiments demonstrate an average accuracy improvement of 5.04 percentage points and 3.86× inference speedup.","weakest_assumption":"That the prefix-conditioned exact factorization can be realized efficiently via speculative decoding without introducing new approximation errors that undermine the joint-distribution guarantee, and that the theoretical acceleration ratio translates to real-world wall-clock gains under the chosen verification strategy."}},"verdict_id":"f48e28fe-d126-41c4-9a4b-9baeb501da81"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5b7fea5999aea74b94be671c47431f92bb77f0733ef3e7f0583b8efbdd1efb9","target":"record","created_at":"2026-05-17T23:39: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":"171bf65d9fc87c334c011d41ec3b1aba7f8636d06328f6b5e6b19f6d1db9d2a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-05-14T03:15:25Z","title_canon_sha256":"1b752d254629e474560257600ffd2c4644cf0f0198229497f92dc83040d93b40"},"schema_version":"1.0","source":{"id":"2605.14305","kind":"arxiv","version":1}},"canonical_sha256":"790bbd23a8ace90bbc38a0b26dd0497e8cc9831a5760c0ca7991e26399752eb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"790bbd23a8ace90bbc38a0b26dd0497e8cc9831a5760c0ca7991e26399752eb7","first_computed_at":"2026-05-17T23:39:10.055299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:10.055299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7iIg90FyU8LorW++WpaFI6odiMEp70z/cBmnhV+kiKdld5MCzz0yWFbL6gcOCnr8PrSHVHF1bgp1mP8dyMFBCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:10.055766Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5b7fea5999aea74b94be671c47431f92bb77f0733ef3e7f0583b8efbdd1efb9","sha256:5d5ef6cd441afcbd6db2b2914e51356d13e2cea6f5331cb3e1244c43635f57d2"],"state_sha256":"7e2307bc3412f79b1b0572724f230cfc6f44da3aee733b6366c201b0cb264282"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObqPBNVX5iJyL8ytYOeAyHrj+oQDnwK7dy70cejmuHTN8bATd4eByoPqjxcrdDdS27OqyD3CWTcceu7N5t5/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T07:01:32.325070Z","bundle_sha256":"90dc7f31218ee3649707edf0fc66c94c26baf4464ff28d6027cb77f07cef766f"}}