{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WT3EZA3G5D5EZOBWY2KRJEN7MW","short_pith_number":"pith:WT3EZA3G","canonical_record":{"source":{"id":"2603.12554","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-13T01:38:44Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"eb883765a16ce94d3812a5b745e9de2b610999786a1eba7bf646e303312b66d1","abstract_canon_sha256":"6cc9cda4faef32038b33b851dd4c6e2bd601f197bba4741a9d841c24367979fe"},"schema_version":"1.0"},"canonical_sha256":"b4f64c8366e8fa4cb836c6951491bf65a594ae0b44480d887b23fffc857d92ce","source":{"kind":"arxiv","id":"2603.12554","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.12554","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"2603.12554v2","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.12554","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"WT3EZA3G5D5E","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WT3EZA3G5D5EZOBW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WT3EZA3G","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WT3EZA3G5D5EZOBWY2KRJEN7MW","target":"record","payload":{"canonical_record":{"source":{"id":"2603.12554","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-13T01:38:44Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"eb883765a16ce94d3812a5b745e9de2b610999786a1eba7bf646e303312b66d1","abstract_canon_sha256":"6cc9cda4faef32038b33b851dd4c6e2bd601f197bba4741a9d841c24367979fe"},"schema_version":"1.0"},"canonical_sha256":"b4f64c8366e8fa4cb836c6951491bf65a594ae0b44480d887b23fffc857d92ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:59.658502Z","signature_b64":"PhoCoL9YdmeOpXEHPkgXlFo84JNWqUFjhSoj3zuTd3MrD81+z7eK9JY0x+10DDnZLbFjRk7PW/0H1flzVwLIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f64c8366e8fa4cb836c6951491bf65a594ae0b44480d887b23fffc857d92ce","last_reissued_at":"2026-05-17T23:38:59.657765Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:59.657765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.12554","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:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSQdHbI30wfpsCaOYlN/cUPfsjnotPl3pAbzd6FGLv7dPlFN9+qbAwvATb3nCHhXlfovFMF1oE4Vo8aJM3BgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:44:22.633166Z"},"content_sha256":"a936f83263c3b30501669a39dc77a1a39cd0334e64f42662cfaafc11aa256770","schema_version":"1.0","event_id":"sha256:a936f83263c3b30501669a39dc77a1a39cd0334e64f42662cfaafc11aa256770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WT3EZA3G5D5EZOBWY2KRJEN7MW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Diffusion LLMs with Entropy-Guided Step Selection and Stepwise Advantages","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Diffusion language models can be post-trained with reinforcement learning using an exact unbiased policy gradient over the denoising steps that requires no sequence-level likelihood.","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Dileep Kalathil, Fatemeh Doudi, Jean-Francois Chamberland, Krishna Narayanan, Mahdi Farahbakhsh, Vishnu Teja Kunde","submitted_at":"2026-03-13T01:38:44Z","abstract_excerpt":"Reinforcement learning (RL) has been effective for post-training autoregressive (AR) language models, but extending these methods to diffusion language models (DLMs) is challenging due to intractable sequence-level likelihoods. Existing approaches therefore rely on surrogate likelihoods or heuristic approximations, which can introduce bias and obscure the sequential structure of denoising. We formulate diffusion-based sequence generation as a finite-horizon Markov decision process over the denoising trajectory and derive an exact, unbiased policy gradient that decomposes over denoising steps a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We formulate diffusion-based sequence generation as a finite-horizon Markov decision process over the denoising trajectory and derive an exact, unbiased policy gradient that decomposes over denoising steps and is expressed in terms of intermediate advantages, without requiring explicit evaluation of the sequence likelihood.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The one-step denoising reward naturally provided by the diffusion model is sufficient to estimate intermediate advantages accurately enough for the policy gradient to remain unbiased and effective in practice.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Derives an exact unbiased policy gradient for RL post-training of diffusion LLMs via entropy-guided step selection and one-step denoising rewards, achieving state-of-the-art results on coding and logical reasoning benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Diffusion language models can be post-trained with reinforcement learning using an exact unbiased policy gradient over the denoising steps that requires no sequence-level likelihood.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"982fc6a88049c281c32676273eb4fe8db46d3ef9f6dae480baeb5fb8676ef042"},"source":{"id":"2603.12554","kind":"arxiv","version":2},"verdict":{"id":"516944f2-bbd2-4d87-8f7f-fc94e507a1a9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T12:35:02.009614Z","strongest_claim":"We formulate diffusion-based sequence generation as a finite-horizon Markov decision process over the denoising trajectory and derive an exact, unbiased policy gradient that decomposes over denoising steps and is expressed in terms of intermediate advantages, without requiring explicit evaluation of the sequence likelihood.","one_line_summary":"Derives an exact unbiased policy gradient for RL post-training of diffusion LLMs via entropy-guided step selection and one-step denoising rewards, achieving state-of-the-art results on coding and logical reasoning benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The one-step denoising reward naturally provided by the diffusion model is sufficient to estimate intermediate advantages accurately enough for the policy gradient to remain unbiased and effective in practice.","pith_extraction_headline":"Diffusion language models can be post-trained with reinforcement learning using an exact unbiased policy gradient over the denoising steps that requires no sequence-level likelihood."},"references":{"count":19,"sample":[{"doi":"","year":null,"title":"Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Models","work_id":"b34ab928-6ffb-4028-b13c-395a8924d76b","ref_index":1,"cited_arxiv_id":"2503.09573","is_internal_anchor":true},{"doi":"","year":null,"title":"Program Synthesis with Large Language Models","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","ref_index":2,"cited_arxiv_id":"2108.07732","is_internal_anchor":true},{"doi":"","year":null,"title":"Evaluating Large Language Models Trained on Code","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","ref_index":3,"cited_arxiv_id":"2107.03374","is_internal_anchor":true},{"doi":"","year":null,"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","ref_index":4,"cited_arxiv_id":"2110.14168","is_internal_anchor":true},{"doi":"","year":null,"title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","ref_index":5,"cited_arxiv_id":"2501.12948","is_internal_anchor":true}],"resolved_work":19,"snapshot_sha256":"d8b0b1f28550775206ceba8019e520f28dd364a1bd70b1bfa386a5560845f9fc","internal_anchors":12},"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":"516944f2-bbd2-4d87-8f7f-fc94e507a1a9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m++dPP6T0jlm/gfq7FY41p9nQI1+l6ROJt8xKZT88Pq17jW4W6dwHdYh2HP8SZI3BFSGRuVxhuI/nXV9uEZQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:44:22.634097Z"},"content_sha256":"a2956db12f012c53c85086bc49a5b8f6945ba3997f2e66d4f69310114bd2db1c","schema_version":"1.0","event_id":"sha256:a2956db12f012c53c85086bc49a5b8f6945ba3997f2e66d4f69310114bd2db1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WT3EZA3G5D5EZOBWY2KRJEN7MW/bundle.json","state_url":"https://pith.science/pith/WT3EZA3G5D5EZOBWY2KRJEN7MW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WT3EZA3G5D5EZOBWY2KRJEN7MW/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-06T18:44:22Z","links":{"resolver":"https://pith.science/pith/WT3EZA3G5D5EZOBWY2KRJEN7MW","bundle":"https://pith.science/pith/WT3EZA3G5D5EZOBWY2KRJEN7MW/bundle.json","state":"https://pith.science/pith/WT3EZA3G5D5EZOBWY2KRJEN7MW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WT3EZA3G5D5EZOBWY2KRJEN7MW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WT3EZA3G5D5EZOBWY2KRJEN7MW","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":"6cc9cda4faef32038b33b851dd4c6e2bd601f197bba4741a9d841c24367979fe","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-13T01:38:44Z","title_canon_sha256":"eb883765a16ce94d3812a5b745e9de2b610999786a1eba7bf646e303312b66d1"},"schema_version":"1.0","source":{"id":"2603.12554","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.12554","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"2603.12554v2","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.12554","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"WT3EZA3G5D5E","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WT3EZA3G5D5EZOBW","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WT3EZA3G","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:a2956db12f012c53c85086bc49a5b8f6945ba3997f2e66d4f69310114bd2db1c","target":"graph","created_at":"2026-05-17T23:38:59Z","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 formulate diffusion-based sequence generation as a finite-horizon Markov decision process over the denoising trajectory and derive an exact, unbiased policy gradient that decomposes over denoising steps and is expressed in terms of intermediate advantages, without requiring explicit evaluation of the sequence likelihood."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The one-step denoising reward naturally provided by the diffusion model is sufficient to estimate intermediate advantages accurately enough for the policy gradient to remain unbiased and effective in practice."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Derives an exact unbiased policy gradient for RL post-training of diffusion LLMs via entropy-guided step selection and one-step denoising rewards, achieving state-of-the-art results on coding and logical reasoning benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Diffusion language models can be post-trained with reinforcement learning using an exact unbiased policy gradient over the denoising steps that requires no sequence-level likelihood."}],"snapshot_sha256":"982fc6a88049c281c32676273eb4fe8db46d3ef9f6dae480baeb5fb8676ef042"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Reinforcement learning (RL) has been effective for post-training autoregressive (AR) language models, but extending these methods to diffusion language models (DLMs) is challenging due to intractable sequence-level likelihoods. Existing approaches therefore rely on surrogate likelihoods or heuristic approximations, which can introduce bias and obscure the sequential structure of denoising. We formulate diffusion-based sequence generation as a finite-horizon Markov decision process over the denoising trajectory and derive an exact, unbiased policy gradient that decomposes over denoising steps a","authors_text":"Dileep Kalathil, Fatemeh Doudi, Jean-Francois Chamberland, Krishna Narayanan, Mahdi Farahbakhsh, Vishnu Teja Kunde","cross_cats":["cs.AI","cs.CL"],"headline":"Diffusion language models can be post-trained with reinforcement learning using an exact unbiased policy gradient over the denoising steps that requires no sequence-level likelihood.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-13T01:38:44Z","title":"Reinforcement Learning for Diffusion LLMs with Entropy-Guided Step Selection and Stepwise Advantages"},"references":{"count":19,"internal_anchors":12,"resolved_work":19,"sample":[{"cited_arxiv_id":"2503.09573","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Block Diffusion: Interpolating Between Autoregressive and Diffusion Language Models","work_id":"b34ab928-6ffb-4028-b13c-395a8924d76b","year":null},{"cited_arxiv_id":"2108.07732","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Program Synthesis with Large Language Models","work_id":"fd241a05-03b9-4de2-9588-9d77ce176125","year":null},{"cited_arxiv_id":"2107.03374","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Evaluating Large Language Models Trained on Code","work_id":"042493e9-b26f-4b4e-bbde-382072ca9b08","year":null},{"cited_arxiv_id":"2110.14168","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Training Verifiers to Solve Math Word Problems","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":null},{"cited_arxiv_id":"2501.12948","doi":"","is_internal_anchor":true,"ref_index":5,"title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":null}],"snapshot_sha256":"d8b0b1f28550775206ceba8019e520f28dd364a1bd70b1bfa386a5560845f9fc"},"source":{"id":"2603.12554","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T12:35:02.009614Z","id":"516944f2-bbd2-4d87-8f7f-fc94e507a1a9","model_set":{"reader":"grok-4.3"},"one_line_summary":"Derives an exact unbiased policy gradient for RL post-training of diffusion LLMs via entropy-guided step selection and one-step denoising rewards, achieving state-of-the-art results on coding and logical reasoning benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Diffusion language models can be post-trained with reinforcement learning using an exact unbiased policy gradient over the denoising steps that requires no sequence-level likelihood.","strongest_claim":"We formulate diffusion-based sequence generation as a finite-horizon Markov decision process over the denoising trajectory and derive an exact, unbiased policy gradient that decomposes over denoising steps and is expressed in terms of intermediate advantages, without requiring explicit evaluation of the sequence likelihood.","weakest_assumption":"The one-step denoising reward naturally provided by the diffusion model is sufficient to estimate intermediate advantages accurately enough for the policy gradient to remain unbiased and effective in practice."}},"verdict_id":"516944f2-bbd2-4d87-8f7f-fc94e507a1a9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a936f83263c3b30501669a39dc77a1a39cd0334e64f42662cfaafc11aa256770","target":"record","created_at":"2026-05-17T23:38:59Z","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":"6cc9cda4faef32038b33b851dd4c6e2bd601f197bba4741a9d841c24367979fe","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-13T01:38:44Z","title_canon_sha256":"eb883765a16ce94d3812a5b745e9de2b610999786a1eba7bf646e303312b66d1"},"schema_version":"1.0","source":{"id":"2603.12554","kind":"arxiv","version":2}},"canonical_sha256":"b4f64c8366e8fa4cb836c6951491bf65a594ae0b44480d887b23fffc857d92ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4f64c8366e8fa4cb836c6951491bf65a594ae0b44480d887b23fffc857d92ce","first_computed_at":"2026-05-17T23:38:59.657765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:59.657765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PhoCoL9YdmeOpXEHPkgXlFo84JNWqUFjhSoj3zuTd3MrD81+z7eK9JY0x+10DDnZLbFjRk7PW/0H1flzVwLIDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:59.658502Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.12554","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a936f83263c3b30501669a39dc77a1a39cd0334e64f42662cfaafc11aa256770","sha256:a2956db12f012c53c85086bc49a5b8f6945ba3997f2e66d4f69310114bd2db1c"],"state_sha256":"63efc471260b838dfeed33a8f0b926f072b172329b7f918ef3f9385b3e1c290d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6o18WXeQuJlx8LswY+6pr03K9U97JPqH9iAOsGBHYvXu6L4tZbk02LmAV2A3uR6ipSuLX06jSWUCXHJA4JX/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:44:22.638257Z","bundle_sha256":"84aa9aee8c399162671d4ee98f10bc048cc726862971a49893ac8d0d1c8f2e77"}}