{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SGBBLAWZYZ4724XP2FM2Z4QNNY","short_pith_number":"pith:SGBBLAWZ","canonical_record":{"source":{"id":"2605.16787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:43:19Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ec1a0c61f014ba0d0ab86b2b250cf1910d0c67d264cd9b26ef7f759e9fc17930","abstract_canon_sha256":"d17927674a6936d454676c062b0206446384d52b5f939868107fff7be642c183"},"schema_version":"1.0"},"canonical_sha256":"91821582d9c679fd72efd159acf20d6e359accc592e17e1a9e4fcc9c9e133bce","source":{"kind":"arxiv","id":"2605.16787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16787","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16787v1","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16787","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"SGBBLAWZYZ47","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"pith_short_16","alias_value":"SGBBLAWZYZ4724XP","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"pith_short_8","alias_value":"SGBBLAWZ","created_at":"2026-05-20T00:03:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SGBBLAWZYZ4724XP2FM2Z4QNNY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:43:19Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"ec1a0c61f014ba0d0ab86b2b250cf1910d0c67d264cd9b26ef7f759e9fc17930","abstract_canon_sha256":"d17927674a6936d454676c062b0206446384d52b5f939868107fff7be642c183"},"schema_version":"1.0"},"canonical_sha256":"91821582d9c679fd72efd159acf20d6e359accc592e17e1a9e4fcc9c9e133bce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:21.984979Z","signature_b64":"uUeunQJQ+y/+mdUTXlUQZ9KmucuVN1wbE+Um0OTeH4VR1TUQ91cKSHQP7v5ZtIwn386QCkqeuxJcPGvfL2orAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91821582d9c679fd72efd159acf20d6e359accc592e17e1a9e4fcc9c9e133bce","last_reissued_at":"2026-05-20T00:03:21.984021Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:21.984021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16787","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-20T00:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eR7ObuagLKQiprw24H9b1sVLA/Jd0L2TfUBThE1YmPlk0/asF2AFFpAo+g7SAXdoYfjDqTfuLKtwzsXVtnaOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:17:59.871403Z"},"content_sha256":"7b02b5230fef62a02a59b1225c2ecd0677072bb9bdbb852862e0050947274343","schema_version":"1.0","event_id":"sha256:7b02b5230fef62a02a59b1225c2ecd0677072bb9bdbb852862e0050947274343"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SGBBLAWZYZ4724XP2FM2Z4QNNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Unlearnability Phenomenon in RLVR for Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A substantial subset of hard examples remains unlearnable in RLVR even when correct rollouts are available.","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Chen Zhao, He He, Yulin Chen","submitted_at":"2026-05-16T03:43:19Z","abstract_excerpt":"Reinforcement Learning with Verifiable Reward (RLVR) has proven effective in improving Large Language Model's (LLM) reasoning ability. However, the learning dynamics of RLVR remain underexplored. In this paper, we reveal a counterintuitive phenomenon: among hard examples that the model initially struggles with, a substantial subset remains unlearnable even when correct rollouts are present. To understand the phenomenon, we first demonstrate that existing optimization and sampling techniques fail to resolve unlearnability. With cross-example gradient analysis, we show that unlearnable examples "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"among hard examples that the model initially struggles with, a substantial subset remains unlearnable even when correct rollouts are present, characterized by low gradient similarity with the rest of the examples and ungeneralizable reasoning patterns.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That cross-example gradient analysis reliably detects fundamental representation issues causing unlearnability, and that failure of data augmentation to improve gradient similarity demonstrates inherent limitations of RL approaches.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"RLVR training for language models exhibits an unlearnability phenomenon where certain hard examples stay unlearnable due to low gradient similarity and ungeneralizable reasoning patterns.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A substantial subset of hard examples remains unlearnable in RLVR even when correct rollouts are available.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0442aa8e0c1996074c647de33d9a9a84f2aa157696221ffb85e432a94d5cab82"},"source":{"id":"2605.16787","kind":"arxiv","version":1},"verdict":{"id":"53416e6d-e9ed-4f2f-b547-ca99d0b58c26","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:34:46.572541Z","strongest_claim":"among hard examples that the model initially struggles with, a substantial subset remains unlearnable even when correct rollouts are present, characterized by low gradient similarity with the rest of the examples and ungeneralizable reasoning patterns.","one_line_summary":"RLVR training for language models exhibits an unlearnability phenomenon where certain hard examples stay unlearnable due to low gradient similarity and ungeneralizable reasoning patterns.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That cross-example gradient analysis reliably detects fundamental representation issues causing unlearnability, and that failure of data augmentation to improve gradient similarity demonstrates inherent limitations of RL approaches.","pith_extraction_headline":"A substantial subset of hard examples remains unlearnable in RLVR even when correct rollouts are available."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16787/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.637991Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:40:53.320904Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.297811Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.433407Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"344db38d5eef81d2f33d7b949bd665284a8db74a5051cbf37cebe9e2c5cd664e"},"references":{"count":22,"sample":[{"doi":"","year":2025,"title":"arXiv preprint arXiv:2512.01775 , year=","work_id":"52575a72-367d-476d-89e4-a3641cc0cecd","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Qwen2.5 Technical Report","work_id":"d8432992-4980-4a81-85c7-9fa2c2b87f85","ref_index":2,"cited_arxiv_id":"2412.15115","is_internal_anchor":true},{"doi":"","year":null,"title":"We have also tried different sampling batch size and gradient update batch size to vary the maximum number of off-policy update","work_id":"f41dc38a-ebeb-4a7d-ad1b-a86cae1a975e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"A reader should be able to solve any single subproblem without seeing the others","work_id":"497a4852-4ee4-4ca8-89d5-c29e360162a1","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Clarity: Each subproblem must be unambiguous and have a unique, well-defined answer","work_id":"925fbace-7d7c-4f4c-ac17-57b13af878b6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":22,"snapshot_sha256":"aab469435f40f1eb4fdcef417f388936a7b532241aba15ae80bd6bd80f847046","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b417023e8fbf76db7c06b26d33aabe58271aee8772119b671c6a85aa140b5ef4"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"53416e6d-e9ed-4f2f-b547-ca99d0b58c26"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91v+oPIlgFm0DYP5eqArJhp5J9ueRRXympQUdjyQ4ohuWvdxRaGWsXXjsaIJtNhcyiwPQoxuVxDS2OvSeIyDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:17:59.872394Z"},"content_sha256":"1b9659d4f26898e1091de9410af85b6075330592a05842d9c80b31281c56d177","schema_version":"1.0","event_id":"sha256:1b9659d4f26898e1091de9410af85b6075330592a05842d9c80b31281c56d177"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SGBBLAWZYZ4724XP2FM2Z4QNNY/bundle.json","state_url":"https://pith.science/pith/SGBBLAWZYZ4724XP2FM2Z4QNNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SGBBLAWZYZ4724XP2FM2Z4QNNY/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-05T06:17:59Z","links":{"resolver":"https://pith.science/pith/SGBBLAWZYZ4724XP2FM2Z4QNNY","bundle":"https://pith.science/pith/SGBBLAWZYZ4724XP2FM2Z4QNNY/bundle.json","state":"https://pith.science/pith/SGBBLAWZYZ4724XP2FM2Z4QNNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SGBBLAWZYZ4724XP2FM2Z4QNNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SGBBLAWZYZ4724XP2FM2Z4QNNY","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":"d17927674a6936d454676c062b0206446384d52b5f939868107fff7be642c183","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:43:19Z","title_canon_sha256":"ec1a0c61f014ba0d0ab86b2b250cf1910d0c67d264cd9b26ef7f759e9fc17930"},"schema_version":"1.0","source":{"id":"2605.16787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16787","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16787v1","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16787","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"SGBBLAWZYZ47","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"pith_short_16","alias_value":"SGBBLAWZYZ4724XP","created_at":"2026-05-20T00:03:21Z"},{"alias_kind":"pith_short_8","alias_value":"SGBBLAWZ","created_at":"2026-05-20T00:03:21Z"}],"graph_snapshots":[{"event_id":"sha256:1b9659d4f26898e1091de9410af85b6075330592a05842d9c80b31281c56d177","target":"graph","created_at":"2026-05-20T00:03:21Z","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":"among hard examples that the model initially struggles with, a substantial subset remains unlearnable even when correct rollouts are present, characterized by low gradient similarity with the rest of the examples and ungeneralizable reasoning patterns."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That cross-example gradient analysis reliably detects fundamental representation issues causing unlearnability, and that failure of data augmentation to improve gradient similarity demonstrates inherent limitations of RL approaches."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"RLVR training for language models exhibits an unlearnability phenomenon where certain hard examples stay unlearnable due to low gradient similarity and ungeneralizable reasoning patterns."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A substantial subset of hard examples remains unlearnable in RLVR even when correct rollouts are available."}],"snapshot_sha256":"0442aa8e0c1996074c647de33d9a9a84f2aa157696221ffb85e432a94d5cab82"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b417023e8fbf76db7c06b26d33aabe58271aee8772119b671c6a85aa140b5ef4"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.637991Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:40:53.320904Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.297811Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.433407Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16787/integrity.json","findings":[],"snapshot_sha256":"344db38d5eef81d2f33d7b949bd665284a8db74a5051cbf37cebe9e2c5cd664e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reinforcement Learning with Verifiable Reward (RLVR) has proven effective in improving Large Language Model's (LLM) reasoning ability. However, the learning dynamics of RLVR remain underexplored. In this paper, we reveal a counterintuitive phenomenon: among hard examples that the model initially struggles with, a substantial subset remains unlearnable even when correct rollouts are present. To understand the phenomenon, we first demonstrate that existing optimization and sampling techniques fail to resolve unlearnability. With cross-example gradient analysis, we show that unlearnable examples ","authors_text":"Chen Zhao, He He, Yulin Chen","cross_cats":["cs.CL"],"headline":"A substantial subset of hard examples remains unlearnable in RLVR even when correct rollouts are available.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:43:19Z","title":"The Unlearnability Phenomenon in RLVR for Language Models"},"references":{"count":22,"internal_anchors":1,"resolved_work":22,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"arXiv preprint arXiv:2512.01775 , year=","work_id":"52575a72-367d-476d-89e4-a3641cc0cecd","year":2025},{"cited_arxiv_id":"2412.15115","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Qwen2.5 Technical Report","work_id":"d8432992-4980-4a81-85c7-9fa2c2b87f85","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"We have also tried different sampling batch size and gradient update batch size to vary the maximum number of off-policy update","work_id":"f41dc38a-ebeb-4a7d-ad1b-a86cae1a975e","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A reader should be able to solve any single subproblem without seeing the others","work_id":"497a4852-4ee4-4ca8-89d5-c29e360162a1","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Clarity: Each subproblem must be unambiguous and have a unique, well-defined answer","work_id":"925fbace-7d7c-4f4c-ac17-57b13af878b6","year":null}],"snapshot_sha256":"aab469435f40f1eb4fdcef417f388936a7b532241aba15ae80bd6bd80f847046"},"source":{"id":"2605.16787","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:34:46.572541Z","id":"53416e6d-e9ed-4f2f-b547-ca99d0b58c26","model_set":{"reader":"grok-4.3"},"one_line_summary":"RLVR training for language models exhibits an unlearnability phenomenon where certain hard examples stay unlearnable due to low gradient similarity and ungeneralizable reasoning patterns.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A substantial subset of hard examples remains unlearnable in RLVR even when correct rollouts are available.","strongest_claim":"among hard examples that the model initially struggles with, a substantial subset remains unlearnable even when correct rollouts are present, characterized by low gradient similarity with the rest of the examples and ungeneralizable reasoning patterns.","weakest_assumption":"That cross-example gradient analysis reliably detects fundamental representation issues causing unlearnability, and that failure of data augmentation to improve gradient similarity demonstrates inherent limitations of RL approaches."}},"verdict_id":"53416e6d-e9ed-4f2f-b547-ca99d0b58c26"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7b02b5230fef62a02a59b1225c2ecd0677072bb9bdbb852862e0050947274343","target":"record","created_at":"2026-05-20T00:03:21Z","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":"d17927674a6936d454676c062b0206446384d52b5f939868107fff7be642c183","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T03:43:19Z","title_canon_sha256":"ec1a0c61f014ba0d0ab86b2b250cf1910d0c67d264cd9b26ef7f759e9fc17930"},"schema_version":"1.0","source":{"id":"2605.16787","kind":"arxiv","version":1}},"canonical_sha256":"91821582d9c679fd72efd159acf20d6e359accc592e17e1a9e4fcc9c9e133bce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91821582d9c679fd72efd159acf20d6e359accc592e17e1a9e4fcc9c9e133bce","first_computed_at":"2026-05-20T00:03:21.984021Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:21.984021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uUeunQJQ+y/+mdUTXlUQZ9KmucuVN1wbE+Um0OTeH4VR1TUQ91cKSHQP7v5ZtIwn386QCkqeuxJcPGvfL2orAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:21.984979Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b02b5230fef62a02a59b1225c2ecd0677072bb9bdbb852862e0050947274343","sha256:1b9659d4f26898e1091de9410af85b6075330592a05842d9c80b31281c56d177"],"state_sha256":"ee5c3ce83133bfb3f3b2520fe8dac1ffd7f22ebad564ec0a0d7343cefe5166bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVt/1LkJGan98rI3WbhXgjY6yB/5b0CKeT2vtQVuWIDVTnzTbaKjLk7v0MkEFP5jMlYylteZQI+i9l0EkvHdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:17:59.877234Z","bundle_sha256":"17e3c8e78a3e5637bf0e398700c3659f2098856c6fdcd89fa4007bfec8ecf988"}}