{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GLZBS2TGOKZFJ2IVFRXKPB3P6R","short_pith_number":"pith:GLZBS2TG","canonical_record":{"source":{"id":"2605.15012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T16:12:30Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"e052293624951f68c3678cc6b0909bdfcde0cd03ad3e8bb59c3a68381c2964fa","abstract_canon_sha256":"72bf8a6bce3a9f0829bc7cc8610a61d2b7e444b55a309d0d5ed8b6b6e7a67795"},"schema_version":"1.0"},"canonical_sha256":"32f2196a6672b254e9152c6ea7876ff441069dfe8fdbac8fe9ea8daa56de2923","source":{"kind":"arxiv","id":"2605.15012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15012","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15012v1","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15012","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"GLZBS2TGOKZF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GLZBS2TGOKZFJ2IV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GLZBS2TG","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GLZBS2TGOKZFJ2IVFRXKPB3P6R","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15012","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T16:12:30Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"e052293624951f68c3678cc6b0909bdfcde0cd03ad3e8bb59c3a68381c2964fa","abstract_canon_sha256":"72bf8a6bce3a9f0829bc7cc8610a61d2b7e444b55a309d0d5ed8b6b6e7a67795"},"schema_version":"1.0"},"canonical_sha256":"32f2196a6672b254e9152c6ea7876ff441069dfe8fdbac8fe9ea8daa56de2923","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:54.776695Z","signature_b64":"b6ljze3mYOQ7eppfYBGSg7HabssdQw3eu9XlY1hZotqy3i7YtrOe1fk4KsaZhhGXgd40YzxS4DiIKifLR8/dBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32f2196a6672b254e9152c6ea7876ff441069dfe8fdbac8fe9ea8daa56de2923","last_reissued_at":"2026-05-17T23:38:54.775875Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:54.775875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15012","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:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGt0t2qn52hCk2Jz2qRXX+M/tGsAFkhppmsyBLr38hMhOYHOZCRZPZmcLVZwkQZdkxRdt9vXOkeULHNFdG4RAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:28:18.059302Z"},"content_sha256":"4943327891ed7ac555e03ca799b6de54665a274dab32b978db8a4daa839bc292","schema_version":"1.0","event_id":"sha256:4943327891ed7ac555e03ca799b6de54665a274dab32b978db8a4daa839bc292"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GLZBS2TGOKZFJ2IVFRXKPB3P6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boosting Reinforcement Learning with Verifiable Rewards via Randomly Selected Few-Shot Guidance","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"FEST boosts RLVR performance using only 128 randomly selected demonstrations from SFT data.","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Alexander G. Schwing, Kai Yan, Yu-Xiong Wang","submitted_at":"2026-05-14T16:12:30Z","abstract_excerpt":"Reinforcement Learning with Verifiable Rewards (RLVR) has achieved great success in developing Large Language Models (LLMs) with chain-of-thought rollouts for many tasks such as math and coding. Nevertheless, RLVR struggles with sample efficiency on difficult problems where correct rollouts are hard to generate. Prior works propose to address this issue via demonstration-guided RLVR, i.e., to conduct Supervised FineTuning (SFT) when RL fails; however, SFT often requires a lot of data, which can be expensive to acquire. In this paper, we propose FEST, a FEw-ShoT demonstration-guided RLVR algori"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"FEST attains compelling results with only 128 demonstrations randomly selected from an SFT dataset. We find that three components are vital for the success: supervised signal, on-policy signal, and decaying weights on the few-shot SFT dataset to prevent overfitting from multiple-epoch training. On several benchmarks, FEST outperforms baselines with magnitudes less SFT data, even matching their performance with full dataset.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That randomly selecting 128 demonstrations from an SFT dataset, when combined with supervised and on-policy signals plus decaying weights, will consistently deliver the reported gains without requiring careful example selection or extensive additional tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FEST improves RLVR sample efficiency on math and coding benchmarks by combining supervised signals, on-policy signals, and decaying weights on just 128 randomly chosen demonstrations, matching full-dataset baselines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"FEST boosts RLVR performance using only 128 randomly selected demonstrations from SFT data.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fa080afd2d4baabdbd695e2f8a9183623009d60c8d969a6b530a71723ce964e7"},"source":{"id":"2605.15012","kind":"arxiv","version":1},"verdict":{"id":"25ec7874-e112-440d-8bfe-8da2e36bfdc1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:14:12.279889Z","strongest_claim":"FEST attains compelling results with only 128 demonstrations randomly selected from an SFT dataset. We find that three components are vital for the success: supervised signal, on-policy signal, and decaying weights on the few-shot SFT dataset to prevent overfitting from multiple-epoch training. On several benchmarks, FEST outperforms baselines with magnitudes less SFT data, even matching their performance with full dataset.","one_line_summary":"FEST improves RLVR sample efficiency on math and coding benchmarks by combining supervised signals, on-policy signals, and decaying weights on just 128 randomly chosen demonstrations, matching full-dataset baselines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That randomly selecting 128 demonstrations from an SFT dataset, when combined with supervised and on-policy signals plus decaying weights, will consistently deliver the reported gains without requiring careful example selection or extensive additional tuning.","pith_extraction_headline":"FEST boosts RLVR performance using only 128 randomly selected demonstrations from SFT data."},"references":{"count":109,"sample":[{"doi":"","year":2026,"title":"Afanasyev, M. and Iov, I. Slime: Stabilized likelihood implicit margin enforcement for preference optimization.arXiv preprint arXiv:2602.02383, 2026","work_id":"bb56c608-1d3f-488d-a846-34ff80eb4b27","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Back to basics: Revisiting reinforce-style optimization for learning from human feedback in llms","work_id":"3140a934-1af9-4ff5-9255-b6416092a0d4","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Marthe Ballon, Brecht Verbeken, Vincent Ginis, and Andres Algaba","work_id":"00edb0c5-3c62-421d-a532-03e2594f1dba","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Global overview of Imitation Learning","work_id":"45cac628-ccda-4e17-8d4b-6a5cd3b7612b","ref_index":4,"cited_arxiv_id":"1801.06503","is_internal_anchor":true},{"doi":"","year":2026,"title":"The ai startup fueling chatgpt’s expertise is now valued at $10 bil- lion.The Wall Street Journal, 2026","work_id":"d62cb670-80ef-430d-93f4-0a10066bced1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":109,"snapshot_sha256":"cc93690998b29707846f78941f323820d2dc8732574ca12db79293334dff1e1e","internal_anchors":16},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e19f5ac375a5e9bda95723cbe1e1701a8e6f862cecd8d74b00ad41f07082ea8d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"25ec7874-e112-440d-8bfe-8da2e36bfdc1"},"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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgIt8klQaakxctj90hnnyOSWbFFyJhSI18azL1L7zTAmX2OhARCDTC0v4Q5oiPhPpbUegQdYxb+ZpgLk2IZEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:28:18.060586Z"},"content_sha256":"5d961c48c49f55935701d0baf639ef870374ffe47759de38ae9a73052afca696","schema_version":"1.0","event_id":"sha256:5d961c48c49f55935701d0baf639ef870374ffe47759de38ae9a73052afca696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLZBS2TGOKZFJ2IVFRXKPB3P6R/bundle.json","state_url":"https://pith.science/pith/GLZBS2TGOKZFJ2IVFRXKPB3P6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLZBS2TGOKZFJ2IVFRXKPB3P6R/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-05T21:28:18Z","links":{"resolver":"https://pith.science/pith/GLZBS2TGOKZFJ2IVFRXKPB3P6R","bundle":"https://pith.science/pith/GLZBS2TGOKZFJ2IVFRXKPB3P6R/bundle.json","state":"https://pith.science/pith/GLZBS2TGOKZFJ2IVFRXKPB3P6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLZBS2TGOKZFJ2IVFRXKPB3P6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GLZBS2TGOKZFJ2IVFRXKPB3P6R","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":"72bf8a6bce3a9f0829bc7cc8610a61d2b7e444b55a309d0d5ed8b6b6e7a67795","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T16:12:30Z","title_canon_sha256":"e052293624951f68c3678cc6b0909bdfcde0cd03ad3e8bb59c3a68381c2964fa"},"schema_version":"1.0","source":{"id":"2605.15012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15012","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15012v1","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15012","created_at":"2026-05-17T23:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"GLZBS2TGOKZF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GLZBS2TGOKZFJ2IV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GLZBS2TG","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:5d961c48c49f55935701d0baf639ef870374ffe47759de38ae9a73052afca696","target":"graph","created_at":"2026-05-17T23:38:54Z","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":"FEST attains compelling results with only 128 demonstrations randomly selected from an SFT dataset. We find that three components are vital for the success: supervised signal, on-policy signal, and decaying weights on the few-shot SFT dataset to prevent overfitting from multiple-epoch training. On several benchmarks, FEST outperforms baselines with magnitudes less SFT data, even matching their performance with full dataset."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That randomly selecting 128 demonstrations from an SFT dataset, when combined with supervised and on-policy signals plus decaying weights, will consistently deliver the reported gains without requiring careful example selection or extensive additional tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FEST improves RLVR sample efficiency on math and coding benchmarks by combining supervised signals, on-policy signals, and decaying weights on just 128 randomly chosen demonstrations, matching full-dataset baselines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"FEST boosts RLVR performance using only 128 randomly selected demonstrations from SFT data."}],"snapshot_sha256":"fa080afd2d4baabdbd695e2f8a9183623009d60c8d969a6b530a71723ce964e7"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e19f5ac375a5e9bda95723cbe1e1701a8e6f862cecd8d74b00ad41f07082ea8d"},"paper":{"abstract_excerpt":"Reinforcement Learning with Verifiable Rewards (RLVR) has achieved great success in developing Large Language Models (LLMs) with chain-of-thought rollouts for many tasks such as math and coding. Nevertheless, RLVR struggles with sample efficiency on difficult problems where correct rollouts are hard to generate. Prior works propose to address this issue via demonstration-guided RLVR, i.e., to conduct Supervised FineTuning (SFT) when RL fails; however, SFT often requires a lot of data, which can be expensive to acquire. In this paper, we propose FEST, a FEw-ShoT demonstration-guided RLVR algori","authors_text":"Alexander G. Schwing, Kai Yan, Yu-Xiong Wang","cross_cats":["cs.AI","cs.CL"],"headline":"FEST boosts RLVR performance using only 128 randomly selected demonstrations from SFT data.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T16:12:30Z","title":"Boosting Reinforcement Learning with Verifiable Rewards via Randomly Selected Few-Shot Guidance"},"references":{"count":109,"internal_anchors":16,"resolved_work":109,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Afanasyev, M. and Iov, I. Slime: Stabilized likelihood implicit margin enforcement for preference optimization.arXiv preprint arXiv:2602.02383, 2026","work_id":"bb56c608-1d3f-488d-a846-34ff80eb4b27","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Back to basics: Revisiting reinforce-style optimization for learning from human feedback in llms","work_id":"3140a934-1af9-4ff5-9255-b6416092a0d4","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Marthe Ballon, Brecht Verbeken, Vincent Ginis, and Andres Algaba","work_id":"00edb0c5-3c62-421d-a532-03e2594f1dba","year":2025},{"cited_arxiv_id":"1801.06503","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Global overview of Imitation Learning","work_id":"45cac628-ccda-4e17-8d4b-6a5cd3b7612b","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The ai startup fueling chatgpt’s expertise is now valued at $10 bil- lion.The Wall Street Journal, 2026","work_id":"d62cb670-80ef-430d-93f4-0a10066bced1","year":2026}],"snapshot_sha256":"cc93690998b29707846f78941f323820d2dc8732574ca12db79293334dff1e1e"},"source":{"id":"2605.15012","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:14:12.279889Z","id":"25ec7874-e112-440d-8bfe-8da2e36bfdc1","model_set":{"reader":"grok-4.3"},"one_line_summary":"FEST improves RLVR sample efficiency on math and coding benchmarks by combining supervised signals, on-policy signals, and decaying weights on just 128 randomly chosen demonstrations, matching full-dataset baselines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"FEST boosts RLVR performance using only 128 randomly selected demonstrations from SFT data.","strongest_claim":"FEST attains compelling results with only 128 demonstrations randomly selected from an SFT dataset. We find that three components are vital for the success: supervised signal, on-policy signal, and decaying weights on the few-shot SFT dataset to prevent overfitting from multiple-epoch training. On several benchmarks, FEST outperforms baselines with magnitudes less SFT data, even matching their performance with full dataset.","weakest_assumption":"That randomly selecting 128 demonstrations from an SFT dataset, when combined with supervised and on-policy signals plus decaying weights, will consistently deliver the reported gains without requiring careful example selection or extensive additional tuning."}},"verdict_id":"25ec7874-e112-440d-8bfe-8da2e36bfdc1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4943327891ed7ac555e03ca799b6de54665a274dab32b978db8a4daa839bc292","target":"record","created_at":"2026-05-17T23:38:54Z","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":"72bf8a6bce3a9f0829bc7cc8610a61d2b7e444b55a309d0d5ed8b6b6e7a67795","cross_cats_sorted":["cs.AI","cs.CL"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T16:12:30Z","title_canon_sha256":"e052293624951f68c3678cc6b0909bdfcde0cd03ad3e8bb59c3a68381c2964fa"},"schema_version":"1.0","source":{"id":"2605.15012","kind":"arxiv","version":1}},"canonical_sha256":"32f2196a6672b254e9152c6ea7876ff441069dfe8fdbac8fe9ea8daa56de2923","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32f2196a6672b254e9152c6ea7876ff441069dfe8fdbac8fe9ea8daa56de2923","first_computed_at":"2026-05-17T23:38:54.775875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:54.775875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b6ljze3mYOQ7eppfYBGSg7HabssdQw3eu9XlY1hZotqy3i7YtrOe1fk4KsaZhhGXgd40YzxS4DiIKifLR8/dBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:54.776695Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4943327891ed7ac555e03ca799b6de54665a274dab32b978db8a4daa839bc292","sha256:5d961c48c49f55935701d0baf639ef870374ffe47759de38ae9a73052afca696"],"state_sha256":"f3a9e9905c6d10eb165863471b7ac43f2e1876e7edb43e2e608cca907e5312d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvMmc3NgghHbRdwR2U3o7rp5U0Bj0TUEcvtImUw9yC46TJ/FX+M7lqsdMsIaZJ3+BkBirQOR76XbkluuVv5KAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:28:18.065068Z","bundle_sha256":"96ab8d102e58374651c26f92c0ad810983b3b73ad4cd9bac6fc3ce0dffa4d8ba"}}