{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:U4AU5HNRHH2G6GABMFWXI7R46T","short_pith_number":"pith:U4AU5HNR","canonical_record":{"source":{"id":"2203.07814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-02-08T23:16:31Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1da2a0185583e1bb943ae574017d54669295110e3b94cece6abaf4d7fb37f7da","abstract_canon_sha256":"19e2169186e6eab6de203c81952ddc1cd4bdf26765eeb7d081aeaea8dbcc3c96"},"schema_version":"1.0"},"canonical_sha256":"a7014e9db139f46f1801616d747e3cf4cf4228dde6490cdb0aeefab79c4a2a93","source":{"kind":"arxiv","id":"2203.07814","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.07814","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"2203.07814v1","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07814","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"U4AU5HNRHH2G","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U4AU5HNRHH2G6GAB","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U4AU5HNR","created_at":"2026-07-05T05:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:U4AU5HNRHH2G6GABMFWXI7R46T","target":"record","payload":{"canonical_record":{"source":{"id":"2203.07814","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-02-08T23:16:31Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1da2a0185583e1bb943ae574017d54669295110e3b94cece6abaf4d7fb37f7da","abstract_canon_sha256":"19e2169186e6eab6de203c81952ddc1cd4bdf26765eeb7d081aeaea8dbcc3c96"},"schema_version":"1.0"},"canonical_sha256":"a7014e9db139f46f1801616d747e3cf4cf4228dde6490cdb0aeefab79c4a2a93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:46.991197Z","signature_b64":"eTx3HhMp7TbmHOT/jTcF+8Q0lENhcLlb0LMHUndUNjVX8h46q+/GFFkL1bN5ja7Rp4jnqjzNtn5Eh8b8XI0ZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7014e9db139f46f1801616d747e3cf4cf4228dde6490cdb0aeefab79c4a2a93","last_reissued_at":"2026-07-05T05:31:46.990630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:46.990630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.07814","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-07-05T05:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsWuhwZC7QYOoa/1K8grSa6SyL5yCVgGiDVQ+trOXJY2MRq9/ziYqawDcvxtb6tarA/QM3Ju/c7T5SOYaBD4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:11:36.292953Z"},"content_sha256":"522efdce324e620312a956428322b61fb74c0f8410a8b830234dd62ae2ca7963","schema_version":"1.0","event_id":"sha256:522efdce324e620312a956428322b61fb74c0f8410a8b830234dd62ae2ca7963"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:U4AU5HNRHH2G6GABMFWXI7R46T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competition-Level Code Generation with AlphaCode","license":"http://creativecommons.org/licenses/by/4.0/","headline":"AlphaCode generates novel solutions to complex programming problems by sampling many programs and filtering them according to observed behavior on test cases.","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.PL","authors_text":"Agustin Dal Lago, Alexey Cherepanov, Cyprien de Masson d'Autume, Daniel J. Mankowitz, David Choi, Esme Sutherland Robson, Felix Gimeno, Igor Babuschkin, James Keeling, James Molloy, Johannes Welbl, Julian Schrittwieser, Junyoung Chung, Koray Kavukcuoglu, Nando de Freitas, Nate Kushman, Oriol Vinyals, Peter Choy, Po-Sen Huang, Pushmeet Kohli, R\\'emi Leblond, Sven Gowal, Thomas Hubert, Tom Eccles, Xinyun Chen, Yujia Li","submitted_at":"2022-02-08T23:16:31Z","abstract_excerpt":"Programming is a powerful and ubiquitous problem-solving tool. Developing systems that can assist programmers or even generate programs independently could make programming more productive and accessible, yet so far incorporating innovations in AI has proven challenging. Recent large-scale language models have demonstrated an impressive ability to generate code, and are now able to complete simple programming tasks. However, these models still perform poorly when evaluated on more complex, unseen problems that require problem-solving skills beyond simply translating instructions into code. For"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In simulated evaluations on recent programming competitions on the Codeforces platform, AlphaCode achieved on average a ranking of top 54.3% in competitions with more than 5,000 participants.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The paper assumes that filtering a large set of sampled programs by observed program behavior on test cases or other proxies reliably selects correct solutions for unseen problems without introducing selection bias or overfitting to the evaluation distribution.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"AlphaCode generates novel code solutions for competitive programming problems and achieves an average top 54.3% ranking in Codeforces contests with over 5,000 participants.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"AlphaCode generates novel solutions to complex programming problems by sampling many programs and filtering them according to observed behavior on test cases.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"59d8d62883fbbd42092c94930ad41de69d7e80808a4f3164b941c8cd8d5b34cd"},"source":{"id":"2203.07814","kind":"arxiv","version":1},"verdict":{"id":"9fd7e4fe-11ad-4da0-b2f9-b03e0b2117b6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-18T06:39:26.191298Z","strongest_claim":"In simulated evaluations on recent programming competitions on the Codeforces platform, AlphaCode achieved on average a ranking of top 54.3% in competitions with more than 5,000 participants.","one_line_summary":"AlphaCode generates novel code solutions for competitive programming problems and achieves an average top 54.3% ranking in Codeforces contests with over 5,000 participants.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The paper assumes that filtering a large set of sampled programs by observed program behavior on test cases or other proxies reliably selects correct solutions for unseen problems without introducing selection bias or overfitting to the evaluation distribution.","pith_extraction_headline":"AlphaCode generates novel solutions to complex programming problems by sampling many programs and filtering them according to observed behavior on test cases."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.07814/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":14,"sample":[{"doi":"10.18653/v1/d18-1045","year":2021,"title":"Understanding Back-Translation at Scale","work_id":"b479bc45-a80e-4ac6-b1f2-fb6fd55129f7","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/362566.362568","year":2021,"title":"Scaling Laws for Neural Language Models","work_id":"b7dd8749-9c45-4977-ab9b-64478dce1ae8","ref_index":2,"cited_arxiv_id":"2001.08361","is_internal_anchor":true},{"doi":"","year":2021,"title":"Neural Sketch Learning for Conditional Program Generation","work_id":"89ee572c-ca3a-421d-bb28-e54a555d1607","ref_index":3,"cited_arxiv_id":"1703.05698","is_internal_anchor":true},{"doi":"","year":2022,"title":"38 A.2 Program judging","work_id":"25d43658-c040-4076-94a4-328979e87830","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Submissions for duplicate problems were merged","work_id":"abfe2a38-71a4-407e-b46f-ecc3a40a1210","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"be0f22833990deed97147cecd11056fb524366a049e1c41e1a7aa059a08f1858","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9ed3c437989e2701aa7f51ba8ab5903ac7b65d1d6e3cb6a93f8ee12036cc8d49"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9fd7e4fe-11ad-4da0-b2f9-b03e0b2117b6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyu2Fg320IzS8K+tjzhH8xjUIIqPMYHQYwsJeXRAEvW9BWnap4pjp6M1KlM15RGuNC/pvMJLYIPOz1fX2kV/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:11:36.293816Z"},"content_sha256":"63ac3c5c35196075136ac1a90ec4552d186eb9103e93297cde41ec66fee6768a","schema_version":"1.0","event_id":"sha256:63ac3c5c35196075136ac1a90ec4552d186eb9103e93297cde41ec66fee6768a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4AU5HNRHH2G6GABMFWXI7R46T/bundle.json","state_url":"https://pith.science/pith/U4AU5HNRHH2G6GABMFWXI7R46T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4AU5HNRHH2G6GABMFWXI7R46T/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-08-11T01:11:36Z","links":{"resolver":"https://pith.science/pith/U4AU5HNRHH2G6GABMFWXI7R46T","bundle":"https://pith.science/pith/U4AU5HNRHH2G6GABMFWXI7R46T/bundle.json","state":"https://pith.science/pith/U4AU5HNRHH2G6GABMFWXI7R46T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4AU5HNRHH2G6GABMFWXI7R46T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:U4AU5HNRHH2G6GABMFWXI7R46T","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":"19e2169186e6eab6de203c81952ddc1cd4bdf26765eeb7d081aeaea8dbcc3c96","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-02-08T23:16:31Z","title_canon_sha256":"1da2a0185583e1bb943ae574017d54669295110e3b94cece6abaf4d7fb37f7da"},"schema_version":"1.0","source":{"id":"2203.07814","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.07814","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"2203.07814v1","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.07814","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"U4AU5HNRHH2G","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"U4AU5HNRHH2G6GAB","created_at":"2026-07-05T05:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"U4AU5HNR","created_at":"2026-07-05T05:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:63ac3c5c35196075136ac1a90ec4552d186eb9103e93297cde41ec66fee6768a","target":"graph","created_at":"2026-07-05T05:31:46Z","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":"In simulated evaluations on recent programming competitions on the Codeforces platform, AlphaCode achieved on average a ranking of top 54.3% in competitions with more than 5,000 participants."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The paper assumes that filtering a large set of sampled programs by observed program behavior on test cases or other proxies reliably selects correct solutions for unseen problems without introducing selection bias or overfitting to the evaluation distribution."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"AlphaCode generates novel code solutions for competitive programming problems and achieves an average top 54.3% ranking in Codeforces contests with over 5,000 participants."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"AlphaCode generates novel solutions to complex programming problems by sampling many programs and filtering them according to observed behavior on test cases."}],"snapshot_sha256":"59d8d62883fbbd42092c94930ad41de69d7e80808a4f3164b941c8cd8d5b34cd"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9ed3c437989e2701aa7f51ba8ab5903ac7b65d1d6e3cb6a93f8ee12036cc8d49"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.07814/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Programming is a powerful and ubiquitous problem-solving tool. Developing systems that can assist programmers or even generate programs independently could make programming more productive and accessible, yet so far incorporating innovations in AI has proven challenging. Recent large-scale language models have demonstrated an impressive ability to generate code, and are now able to complete simple programming tasks. However, these models still perform poorly when evaluated on more complex, unseen problems that require problem-solving skills beyond simply translating instructions into code. For","authors_text":"Agustin Dal Lago, Alexey Cherepanov, Cyprien de Masson d'Autume, Daniel J. Mankowitz, David Choi, Esme Sutherland Robson, Felix Gimeno, Igor Babuschkin, James Keeling, James Molloy, Johannes Welbl, Julian Schrittwieser, Junyoung Chung, Koray Kavukcuoglu, Nando de Freitas, Nate Kushman, Oriol Vinyals, Peter Choy, Po-Sen Huang, Pushmeet Kohli, R\\'emi Leblond, Sven Gowal, Thomas Hubert, Tom Eccles, Xinyun Chen, Yujia Li","cross_cats":["cs.AI","cs.LG"],"headline":"AlphaCode generates novel solutions to complex programming problems by sampling many programs and filtering them according to observed behavior on test cases.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-02-08T23:16:31Z","title":"Competition-Level Code Generation with AlphaCode"},"references":{"count":14,"internal_anchors":2,"resolved_work":14,"sample":[{"cited_arxiv_id":"","doi":"10.18653/v1/d18-1045","is_internal_anchor":false,"ref_index":1,"title":"Understanding Back-Translation at Scale","work_id":"b479bc45-a80e-4ac6-b1f2-fb6fd55129f7","year":2021},{"cited_arxiv_id":"2001.08361","doi":"10.1145/362566.362568","is_internal_anchor":true,"ref_index":2,"title":"Scaling Laws for Neural Language Models","work_id":"b7dd8749-9c45-4977-ab9b-64478dce1ae8","year":2021},{"cited_arxiv_id":"1703.05698","doi":"","is_internal_anchor":true,"ref_index":3,"title":"Neural Sketch Learning for Conditional Program Generation","work_id":"89ee572c-ca3a-421d-bb28-e54a555d1607","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"38 A.2 Program judging","work_id":"25d43658-c040-4076-94a4-328979e87830","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Submissions for duplicate problems were merged","work_id":"abfe2a38-71a4-407e-b46f-ecc3a40a1210","year":null}],"snapshot_sha256":"be0f22833990deed97147cecd11056fb524366a049e1c41e1a7aa059a08f1858"},"source":{"id":"2203.07814","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-18T06:39:26.191298Z","id":"9fd7e4fe-11ad-4da0-b2f9-b03e0b2117b6","model_set":{"reader":"grok-4.3"},"one_line_summary":"AlphaCode generates novel code solutions for competitive programming problems and achieves an average top 54.3% ranking in Codeforces contests with over 5,000 participants.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"AlphaCode generates novel solutions to complex programming problems by sampling many programs and filtering them according to observed behavior on test cases.","strongest_claim":"In simulated evaluations on recent programming competitions on the Codeforces platform, AlphaCode achieved on average a ranking of top 54.3% in competitions with more than 5,000 participants.","weakest_assumption":"The paper assumes that filtering a large set of sampled programs by observed program behavior on test cases or other proxies reliably selects correct solutions for unseen problems without introducing selection bias or overfitting to the evaluation distribution."}},"verdict_id":"9fd7e4fe-11ad-4da0-b2f9-b03e0b2117b6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:522efdce324e620312a956428322b61fb74c0f8410a8b830234dd62ae2ca7963","target":"record","created_at":"2026-07-05T05:31:46Z","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":"19e2169186e6eab6de203c81952ddc1cd4bdf26765eeb7d081aeaea8dbcc3c96","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-02-08T23:16:31Z","title_canon_sha256":"1da2a0185583e1bb943ae574017d54669295110e3b94cece6abaf4d7fb37f7da"},"schema_version":"1.0","source":{"id":"2203.07814","kind":"arxiv","version":1}},"canonical_sha256":"a7014e9db139f46f1801616d747e3cf4cf4228dde6490cdb0aeefab79c4a2a93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7014e9db139f46f1801616d747e3cf4cf4228dde6490cdb0aeefab79c4a2a93","first_computed_at":"2026-07-05T05:31:46.990630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:31:46.990630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eTx3HhMp7TbmHOT/jTcF+8Q0lENhcLlb0LMHUndUNjVX8h46q+/GFFkL1bN5ja7Rp4jnqjzNtn5Eh8b8XI0ZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:31:46.991197Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.07814","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:522efdce324e620312a956428322b61fb74c0f8410a8b830234dd62ae2ca7963","sha256:63ac3c5c35196075136ac1a90ec4552d186eb9103e93297cde41ec66fee6768a"],"state_sha256":"bce4815c44f5cf5c487a0bd013a6c379da4650e98614226e2974aa0513f75f61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2pvJCLwqYtnZpuiuWtbEniuEOZUa8EvzarDvGRzEDquSrkfkL0vvvVvsQtajoJnF9l/l3f10zT9gDNuld1QCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:11:36.298600Z","bundle_sha256":"54c50b82c4f81d9d60c734fd537095223c303a591558d3a68f2d5c8f8643319e"}}