{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OKRWYSAYOYQ2YBEQZU3DUSWYRC","short_pith_number":"pith:OKRWYSAY","canonical_record":{"source":{"id":"2605.12906","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T02:33:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"49a67c3de86fd4f54ab6de25c3887d95f423b20bec2870c56c07b57b806cceb0","abstract_canon_sha256":"32a654e265a252cac2761f4d005baa5ccc25c122046d518230ed6e059987a0a7"},"schema_version":"1.0"},"canonical_sha256":"72a36c48187621ac0490cd363a4ad88884146fe1f1b0830a903a40cf97d88b92","source":{"kind":"arxiv","id":"2605.12906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12906","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12906v1","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12906","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"OKRWYSAYOYQ2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OKRWYSAYOYQ2YBEQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OKRWYSAY","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OKRWYSAYOYQ2YBEQZU3DUSWYRC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12906","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T02:33:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"49a67c3de86fd4f54ab6de25c3887d95f423b20bec2870c56c07b57b806cceb0","abstract_canon_sha256":"32a654e265a252cac2761f4d005baa5ccc25c122046d518230ed6e059987a0a7"},"schema_version":"1.0"},"canonical_sha256":"72a36c48187621ac0490cd363a4ad88884146fe1f1b0830a903a40cf97d88b92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:10.609654Z","signature_b64":"NLl4wpdlwmiBuZnNPq9bOObryNWTkAfRrCcfnyRH3poPE5/PUj7gki5GCrA8hgy/bb93feFpyZTSgNDLXSHmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72a36c48187621ac0490cd363a4ad88884146fe1f1b0830a903a40cf97d88b92","last_reissued_at":"2026-05-18T03:09:10.608910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:10.608910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12906","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-18T03:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycpB9GUaVX5mT68wYzgnp47QqL5uQa7yjnQcJjSTDsThrcSbmoCVpwWDucp7KOq3kqgFwJz5vXObXbaFLsS4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:09:26.008601Z"},"content_sha256":"c7938b14b062149653568291f9a027b1e3be63412a1b713a5e71962444e40c10","schema_version":"1.0","event_id":"sha256:c7938b14b062149653568291f9a027b1e3be63412a1b713a5e71962444e40c10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OKRWYSAYOYQ2YBEQZU3DUSWYRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Difficulty and the Generalization--Extrapolation Tradeoff in LLM Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"For any fixed data budget in LLM fine-tuning, an optimal difficulty level exists and moves toward harder examples as the budget grows.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jingzhao Zhang (IIIS, Shanghai Qi Zhi Institute), Siyuan Liu (IIIS, Tinghong Chen (College of AI, Tsinghua University, Tsinghua University), Xinghan Li (IIIS, Yifei Wang (Amazon AGI SF Lab)","submitted_at":"2026-05-13T02:33:04Z","abstract_excerpt":"Data selection during supervised fine-tuning (SFT) can critically change the behavior of large language models (LLMs). Although existing work has studied the effect of selecting data based on heuristics such as perplexity, difficulty, or length, the reported findings are often inconsistent or context-dependent. In this work, we systematically study the role of data difficulty in fine-tuning from both empirical and theoretical perspectives, and find that there is no universally optimal difficulty level; rather, its effectiveness depends on the dataset size. We show that for a fixed data budget,"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For a fixed data budget, there exists an optimal data difficulty for SFT, and this optimal difficulty shifts toward harder data as the data budget increases.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The controlled synthetic experiments and PAC-Bayesian analysis capture the dominant mechanism in real LLM fine-tuning on natural language data; the paper does not demonstrate that the generalization-extrapolation tradeoff observed synthetically transfers without additional confounding factors from tokenizer or pretraining distributions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For a fixed data budget in LLM supervised fine-tuning, optimal data difficulty shifts toward harder examples as the budget grows because of the tradeoff between in-distribution generalization gap and extrapolation gap.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For any fixed data budget in LLM fine-tuning, an optimal difficulty level exists and moves toward harder examples as the budget grows.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b785b658146054b7944f2666915d79cab21f7c0833b4ecb38b0e0e6a9410308b"},"source":{"id":"2605.12906","kind":"arxiv","version":1},"verdict":{"id":"de06a633-2acb-4c16-aae5-765c9d54f9db","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:56:54.951641Z","strongest_claim":"For a fixed data budget, there exists an optimal data difficulty for SFT, and this optimal difficulty shifts toward harder data as the data budget increases.","one_line_summary":"For a fixed data budget in LLM supervised fine-tuning, optimal data difficulty shifts toward harder examples as the budget grows because of the tradeoff between in-distribution generalization gap and extrapolation gap.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The controlled synthetic experiments and PAC-Bayesian analysis capture the dominant mechanism in real LLM fine-tuning on natural language data; the paper does not demonstrate that the generalization-extrapolation tradeoff observed synthetically transfers without additional confounding factors from tokenizer or pretraining distributions.","pith_extraction_headline":"For any fixed data budget in LLM fine-tuning, an optimal difficulty level exists and moves toward harder examples as the budget grows."},"references":{"count":34,"sample":[{"doi":"","year":2025,"title":"Anchored Supervised Fine-Tuning , author=. 2025 , eprint=","work_id":"ded17877-52d2-440d-8f9e-3356eb74f4c4","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"On the Generalization of SFT: A Reinforcement Learning Perspective with Reward Rectification , author=. 2025 , eprint=","work_id":"b61d4376-e6f6-4605-b4fb-d443d4126ce3","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Proximal Supervised Fine-Tuning , author=. 2025 , eprint=","work_id":"5324c4f2-5d44-477a-afce-bac5d2d3b91a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Beyond Log Likelihood: Probability-Based Objectives for Supervised Fine-Tuning across the Model Capability Continuum , author=. 2025 , eprint=","work_id":"2f3b1b1b-fcaf-4936-a7b7-143b7a1d97ec","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Physics of language models: Part 2.1, grade-school math and the hidden reasoning process","work_id":"2c6517ce-d4db-4a10-ab3a-c160de6ea4ab","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":34,"snapshot_sha256":"74710796a6dce2ce12e8cb5138c5d195b019fc9b1201806bd68391c985a1b92b","internal_anchors":5},"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":"de06a633-2acb-4c16-aae5-765c9d54f9db"},"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:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhVrb2DMu8jVb7BvDtlVLFQaBwFnFMx9pctBPB4wxLEhYq56NZ9llVh1tPwr9CJRt2YHNfLUxB3EG7uEKJ1CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:09:26.009141Z"},"content_sha256":"19784a528a9c8a697282be4843d4cd1512484cc580b459f80296debc4c44041a","schema_version":"1.0","event_id":"sha256:19784a528a9c8a697282be4843d4cd1512484cc580b459f80296debc4c44041a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKRWYSAYOYQ2YBEQZU3DUSWYRC/bundle.json","state_url":"https://pith.science/pith/OKRWYSAYOYQ2YBEQZU3DUSWYRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKRWYSAYOYQ2YBEQZU3DUSWYRC/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-30T05:09:26Z","links":{"resolver":"https://pith.science/pith/OKRWYSAYOYQ2YBEQZU3DUSWYRC","bundle":"https://pith.science/pith/OKRWYSAYOYQ2YBEQZU3DUSWYRC/bundle.json","state":"https://pith.science/pith/OKRWYSAYOYQ2YBEQZU3DUSWYRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKRWYSAYOYQ2YBEQZU3DUSWYRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OKRWYSAYOYQ2YBEQZU3DUSWYRC","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":"32a654e265a252cac2761f4d005baa5ccc25c122046d518230ed6e059987a0a7","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T02:33:04Z","title_canon_sha256":"49a67c3de86fd4f54ab6de25c3887d95f423b20bec2870c56c07b57b806cceb0"},"schema_version":"1.0","source":{"id":"2605.12906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12906","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12906v1","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12906","created_at":"2026-05-18T03:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"OKRWYSAYOYQ2","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"OKRWYSAYOYQ2YBEQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"OKRWYSAY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:19784a528a9c8a697282be4843d4cd1512484cc580b459f80296debc4c44041a","target":"graph","created_at":"2026-05-18T03:09: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":"For a fixed data budget, there exists an optimal data difficulty for SFT, and this optimal difficulty shifts toward harder data as the data budget increases."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The controlled synthetic experiments and PAC-Bayesian analysis capture the dominant mechanism in real LLM fine-tuning on natural language data; the paper does not demonstrate that the generalization-extrapolation tradeoff observed synthetically transfers without additional confounding factors from tokenizer or pretraining distributions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For a fixed data budget in LLM supervised fine-tuning, optimal data difficulty shifts toward harder examples as the budget grows because of the tradeoff between in-distribution generalization gap and extrapolation gap."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For any fixed data budget in LLM fine-tuning, an optimal difficulty level exists and moves toward harder examples as the budget grows."}],"snapshot_sha256":"b785b658146054b7944f2666915d79cab21f7c0833b4ecb38b0e0e6a9410308b"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Data selection during supervised fine-tuning (SFT) can critically change the behavior of large language models (LLMs). Although existing work has studied the effect of selecting data based on heuristics such as perplexity, difficulty, or length, the reported findings are often inconsistent or context-dependent. In this work, we systematically study the role of data difficulty in fine-tuning from both empirical and theoretical perspectives, and find that there is no universally optimal difficulty level; rather, its effectiveness depends on the dataset size. We show that for a fixed data budget,","authors_text":"Jingzhao Zhang (IIIS, Shanghai Qi Zhi Institute), Siyuan Liu (IIIS, Tinghong Chen (College of AI, Tsinghua University, Tsinghua University), Xinghan Li (IIIS, Yifei Wang (Amazon AGI SF Lab)","cross_cats":["cs.AI"],"headline":"For any fixed data budget in LLM fine-tuning, an optimal difficulty level exists and moves toward harder examples as the budget grows.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T02:33:04Z","title":"Data Difficulty and the Generalization--Extrapolation Tradeoff in LLM Fine-Tuning"},"references":{"count":34,"internal_anchors":5,"resolved_work":34,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Anchored Supervised Fine-Tuning , author=. 2025 , eprint=","work_id":"ded17877-52d2-440d-8f9e-3356eb74f4c4","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"On the Generalization of SFT: A Reinforcement Learning Perspective with Reward Rectification , author=. 2025 , eprint=","work_id":"b61d4376-e6f6-4605-b4fb-d443d4126ce3","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Proximal Supervised Fine-Tuning , author=. 2025 , eprint=","work_id":"5324c4f2-5d44-477a-afce-bac5d2d3b91a","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Beyond Log Likelihood: Probability-Based Objectives for Supervised Fine-Tuning across the Model Capability Continuum , author=. 2025 , eprint=","work_id":"2f3b1b1b-fcaf-4936-a7b7-143b7a1d97ec","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Physics of language models: Part 2.1, grade-school math and the hidden reasoning process","work_id":"2c6517ce-d4db-4a10-ab3a-c160de6ea4ab","year":null}],"snapshot_sha256":"74710796a6dce2ce12e8cb5138c5d195b019fc9b1201806bd68391c985a1b92b"},"source":{"id":"2605.12906","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T19:56:54.951641Z","id":"de06a633-2acb-4c16-aae5-765c9d54f9db","model_set":{"reader":"grok-4.3"},"one_line_summary":"For a fixed data budget in LLM supervised fine-tuning, optimal data difficulty shifts toward harder examples as the budget grows because of the tradeoff between in-distribution generalization gap and extrapolation gap.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For any fixed data budget in LLM fine-tuning, an optimal difficulty level exists and moves toward harder examples as the budget grows.","strongest_claim":"For a fixed data budget, there exists an optimal data difficulty for SFT, and this optimal difficulty shifts toward harder data as the data budget increases.","weakest_assumption":"The controlled synthetic experiments and PAC-Bayesian analysis capture the dominant mechanism in real LLM fine-tuning on natural language data; the paper does not demonstrate that the generalization-extrapolation tradeoff observed synthetically transfers without additional confounding factors from tokenizer or pretraining distributions."}},"verdict_id":"de06a633-2acb-4c16-aae5-765c9d54f9db"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c7938b14b062149653568291f9a027b1e3be63412a1b713a5e71962444e40c10","target":"record","created_at":"2026-05-18T03:09: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":"32a654e265a252cac2761f4d005baa5ccc25c122046d518230ed6e059987a0a7","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T02:33:04Z","title_canon_sha256":"49a67c3de86fd4f54ab6de25c3887d95f423b20bec2870c56c07b57b806cceb0"},"schema_version":"1.0","source":{"id":"2605.12906","kind":"arxiv","version":1}},"canonical_sha256":"72a36c48187621ac0490cd363a4ad88884146fe1f1b0830a903a40cf97d88b92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72a36c48187621ac0490cd363a4ad88884146fe1f1b0830a903a40cf97d88b92","first_computed_at":"2026-05-18T03:09:10.608910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:10.608910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NLl4wpdlwmiBuZnNPq9bOObryNWTkAfRrCcfnyRH3poPE5/PUj7gki5GCrA8hgy/bb93feFpyZTSgNDLXSHmBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:10.609654Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7938b14b062149653568291f9a027b1e3be63412a1b713a5e71962444e40c10","sha256:19784a528a9c8a697282be4843d4cd1512484cc580b459f80296debc4c44041a"],"state_sha256":"5e4cf4eb52ea674f35e9f1d6f08e6e51d3d239cc3d91ccbeb1057d3f164bed13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38jm7ninQhzqeXZo1cWA43B/UU93MT+HjjKRba2q/zq/QF9RNUwN8BBvhjAhVMR9l6e7a3e+kHTgLV0euI8AAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:09:26.011700Z","bundle_sha256":"d99c2c1fb2b4fc56e3ba298522620835cc3d686a0bb2a61f1587e6fcb57b77f1"}}