{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:44ZJFCPEX3VWDDBSJAXRZRE5F3","short_pith_number":"pith:44ZJFCPE","canonical_record":{"source":{"id":"2605.17029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-16T14:58:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e57c261cd2650ec3a924438c8ec0b19466bad1bf27e72366a52e010d0c884128","abstract_canon_sha256":"4f1ccf25eec5faf3f479ae818a7f7d356430bb51670bf0f7dbad50b02ea40975"},"schema_version":"1.0"},"canonical_sha256":"e7329289e4beeb618c32482f1cc49d2ee7e99d238b24795dda83cc3f25c1bdd8","source":{"kind":"arxiv","id":"2605.17029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17029","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17029v1","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17029","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"44ZJFCPEX3VW","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_16","alias_value":"44ZJFCPEX3VWDDBS","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_8","alias_value":"44ZJFCPE","created_at":"2026-05-20T00:03:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:44ZJFCPEX3VWDDBSJAXRZRE5F3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-16T14:58:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e57c261cd2650ec3a924438c8ec0b19466bad1bf27e72366a52e010d0c884128","abstract_canon_sha256":"4f1ccf25eec5faf3f479ae818a7f7d356430bb51670bf0f7dbad50b02ea40975"},"schema_version":"1.0"},"canonical_sha256":"e7329289e4beeb618c32482f1cc49d2ee7e99d238b24795dda83cc3f25c1bdd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:36.726994Z","signature_b64":"aGHVWgnP/b5F2ZJ9EJi4bDAvc7G+/WsuMwFu5Hgu+auQSB/430VIoHNb/B4nOyy3WJrBAOcs+UXtXvZwN2rDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7329289e4beeb618c32482f1cc49d2ee7e99d238b24795dda83cc3f25c1bdd8","last_reissued_at":"2026-05-20T00:03:36.725924Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:36.725924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17029","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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eF81y//cANt50bamv1dNTnWYg0PU8hIF4TAslu+p1DuWS4N9FVHFt3DoW/PjQU7G6qakj9717pWp8zfn6OAuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:42:11.669981Z"},"content_sha256":"90348b7c839f72d50d13d8e59c78da0d9e44eb804fce11a31845bfec9c4e84c8","schema_version":"1.0","event_id":"sha256:90348b7c839f72d50d13d8e59c78da0d9e44eb804fce11a31845bfec9c4e84c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:44ZJFCPEX3VWDDBSJAXRZRE5F3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Task Abstention for Large Language Models in Code Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Code-generating LLMs can abstain from tasks likely to produce hallucinations by checking consistency of execution results across multiple generations.","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Senrong Xu, Taolue Chen, Xiaoxing Ma, Yanke Zhou, Yuan Yao, Yuhao Tan, Zenan Li","submitted_at":"2026-05-16T14:58:11Z","abstract_excerpt":"Large language models (LLMs) have revolutionized automated code generation. One serious concern, however, is the so-called ``hallucination'', i.e., LLMs may generate seemingly plausible but functionally incorrect code. In this paper, we study the task abstention problem, i.e., determining whether a given LLM should abstain from performing a specific code generation task to avoid likely hallucination. Our approach features a calibrated abstention rule, grounded in the principles of multiple hypothesis testing. The rule assesses generation consistency through code execution outcomes, allowing it"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that our approach provides a rigorous, distribution-free theoretical guarantee on its abstention decisions.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That consistency of code execution outcomes across multiple generations can serve as a reliable proxy for detecting likely hallucinations without oracle test cases or external databases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A distribution-free abstention rule grounded in multiple hypothesis testing uses execution consistency to let code LLMs avoid hallucination-prone tasks with theoretical guarantees.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Code-generating LLMs can abstain from tasks likely to produce hallucinations by checking consistency of execution results across multiple generations.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d61da9b3c5747ed59998ad2935df27ce5d95b6174d3f2741b1e5239375ceff09"},"source":{"id":"2605.17029","kind":"arxiv","version":1},"verdict":{"id":"77e7fa9a-2da0-4b30-a502-e0d0e1610a53","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:00:58.915521Z","strongest_claim":"We prove that our approach provides a rigorous, distribution-free theoretical guarantee on its abstention decisions.","one_line_summary":"A distribution-free abstention rule grounded in multiple hypothesis testing uses execution consistency to let code LLMs avoid hallucination-prone tasks with theoretical guarantees.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That consistency of code execution outcomes across multiple generations can serve as a reliable proxy for detecting likely hallucinations without oracle test cases or external databases.","pith_extraction_headline":"Code-generating LLMs can abstain from tasks likely to produce hallucinations by checking consistency of execution results across multiple generations."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17029/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:18.962086Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:10:46.861813Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T19:49:44.682266Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T18:51:57.335370Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.174467Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:23.491521Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f6ebc9f57031b2474783fec263276853960f716b06e7b379d9db45acf2de6c9a"},"references":{"count":42,"sample":[{"doi":"10.1126/science.abq1158","year":null,"title":"Mankowitz, Esme Sutherland Robson, Pushmeet Kohli, Nando de Freitas, Koray Kavukcuoglu, and Oriol Vinyals","work_id":"cc452f34-3d34-41ff-9206-8edad6625ce6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Code Llama: Open Foundation Models for Code","work_id":"e73bffa4-7620-47ac-9327-259a60db52ca","ref_index":2,"cited_arxiv_id":"2308.12950","is_internal_anchor":true},{"doi":"10.1145/3703155","year":null,"title":"A survey on hallucination in large language models: Principles, taxonomy, challenges, and open questions","work_id":"ed8c5be1-1069-44c0-8dc4-627a7de3a371","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Selfcheckgpt: Zero-resource black-box hallucination detection for generative large language models","work_id":"3ccedf7d-cf9a-41bb-90f4-6926d7b80157","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"CodeT: Code Generation with Generated Tests","work_id":"1280b158-2c5d-444c-8584-ae187cbe83af","ref_index":5,"cited_arxiv_id":"2207.10397","is_internal_anchor":true}],"resolved_work":42,"snapshot_sha256":"178a830d6e47628b69c7c21a354b73bf22f1a1c5678cfffac8652aa646221a69","internal_anchors":8},"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":"77e7fa9a-2da0-4b30-a502-e0d0e1610a53"},"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:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGJLYW1Z7A9xfnoo9IhH+QzadSwbgTh9Md8VYDqDJVCzAE/fEMslFb7Yneumh1HcpBcvGAyHBepETj61MN7XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:42:11.670873Z"},"content_sha256":"c6f01ce1394875c09c3bb629a5420a7d1e26076492697e08183558737f59dc11","schema_version":"1.0","event_id":"sha256:c6f01ce1394875c09c3bb629a5420a7d1e26076492697e08183558737f59dc11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44ZJFCPEX3VWDDBSJAXRZRE5F3/bundle.json","state_url":"https://pith.science/pith/44ZJFCPEX3VWDDBSJAXRZRE5F3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44ZJFCPEX3VWDDBSJAXRZRE5F3/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-23T18:42:11Z","links":{"resolver":"https://pith.science/pith/44ZJFCPEX3VWDDBSJAXRZRE5F3","bundle":"https://pith.science/pith/44ZJFCPEX3VWDDBSJAXRZRE5F3/bundle.json","state":"https://pith.science/pith/44ZJFCPEX3VWDDBSJAXRZRE5F3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44ZJFCPEX3VWDDBSJAXRZRE5F3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:44ZJFCPEX3VWDDBSJAXRZRE5F3","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":"4f1ccf25eec5faf3f479ae818a7f7d356430bb51670bf0f7dbad50b02ea40975","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-16T14:58:11Z","title_canon_sha256":"e57c261cd2650ec3a924438c8ec0b19466bad1bf27e72366a52e010d0c884128"},"schema_version":"1.0","source":{"id":"2605.17029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17029","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17029v1","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17029","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"44ZJFCPEX3VW","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_16","alias_value":"44ZJFCPEX3VWDDBS","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_8","alias_value":"44ZJFCPE","created_at":"2026-05-20T00:03:36Z"}],"graph_snapshots":[{"event_id":"sha256:c6f01ce1394875c09c3bb629a5420a7d1e26076492697e08183558737f59dc11","target":"graph","created_at":"2026-05-20T00:03:36Z","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 prove that our approach provides a rigorous, distribution-free theoretical guarantee on its abstention decisions."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That consistency of code execution outcomes across multiple generations can serve as a reliable proxy for detecting likely hallucinations without oracle test cases or external databases."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A distribution-free abstention rule grounded in multiple hypothesis testing uses execution consistency to let code LLMs avoid hallucination-prone tasks with theoretical guarantees."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Code-generating LLMs can abstain from tasks likely to produce hallucinations by checking consistency of execution results across multiple generations."}],"snapshot_sha256":"d61da9b3c5747ed59998ad2935df27ce5d95b6174d3f2741b1e5239375ceff09"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:18.962086Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:10:46.861813Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T19:49:44.682266Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T18:51:57.335370Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.174467Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:23.491521Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17029/integrity.json","findings":[],"snapshot_sha256":"f6ebc9f57031b2474783fec263276853960f716b06e7b379d9db45acf2de6c9a","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) have revolutionized automated code generation. One serious concern, however, is the so-called ``hallucination'', i.e., LLMs may generate seemingly plausible but functionally incorrect code. In this paper, we study the task abstention problem, i.e., determining whether a given LLM should abstain from performing a specific code generation task to avoid likely hallucination. Our approach features a calibrated abstention rule, grounded in the principles of multiple hypothesis testing. The rule assesses generation consistency through code execution outcomes, allowing it","authors_text":"Senrong Xu, Taolue Chen, Xiaoxing Ma, Yanke Zhou, Yuan Yao, Yuhao Tan, Zenan Li","cross_cats":["cs.AI"],"headline":"Code-generating LLMs can abstain from tasks likely to produce hallucinations by checking consistency of execution results across multiple generations.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-16T14:58:11Z","title":"Task Abstention for Large Language Models in Code Generation"},"references":{"count":42,"internal_anchors":8,"resolved_work":42,"sample":[{"cited_arxiv_id":"","doi":"10.1126/science.abq1158","is_internal_anchor":false,"ref_index":1,"title":"Mankowitz, Esme Sutherland Robson, Pushmeet Kohli, Nando de Freitas, Koray Kavukcuoglu, and Oriol Vinyals","work_id":"cc452f34-3d34-41ff-9206-8edad6625ce6","year":null},{"cited_arxiv_id":"2308.12950","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Code Llama: Open Foundation Models for Code","work_id":"e73bffa4-7620-47ac-9327-259a60db52ca","year":null},{"cited_arxiv_id":"","doi":"10.1145/3703155","is_internal_anchor":false,"ref_index":3,"title":"A survey on hallucination in large language models: Principles, taxonomy, challenges, and open questions","work_id":"ed8c5be1-1069-44c0-8dc4-627a7de3a371","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Selfcheckgpt: Zero-resource black-box hallucination detection for generative large language models","work_id":"3ccedf7d-cf9a-41bb-90f4-6926d7b80157","year":2023},{"cited_arxiv_id":"2207.10397","doi":"","is_internal_anchor":true,"ref_index":5,"title":"CodeT: Code Generation with Generated Tests","work_id":"1280b158-2c5d-444c-8584-ae187cbe83af","year":null}],"snapshot_sha256":"178a830d6e47628b69c7c21a354b73bf22f1a1c5678cfffac8652aa646221a69"},"source":{"id":"2605.17029","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:00:58.915521Z","id":"77e7fa9a-2da0-4b30-a502-e0d0e1610a53","model_set":{"reader":"grok-4.3"},"one_line_summary":"A distribution-free abstention rule grounded in multiple hypothesis testing uses execution consistency to let code LLMs avoid hallucination-prone tasks with theoretical guarantees.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Code-generating LLMs can abstain from tasks likely to produce hallucinations by checking consistency of execution results across multiple generations.","strongest_claim":"We prove that our approach provides a rigorous, distribution-free theoretical guarantee on its abstention decisions.","weakest_assumption":"That consistency of code execution outcomes across multiple generations can serve as a reliable proxy for detecting likely hallucinations without oracle test cases or external databases."}},"verdict_id":"77e7fa9a-2da0-4b30-a502-e0d0e1610a53"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:90348b7c839f72d50d13d8e59c78da0d9e44eb804fce11a31845bfec9c4e84c8","target":"record","created_at":"2026-05-20T00:03:36Z","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":"4f1ccf25eec5faf3f479ae818a7f7d356430bb51670bf0f7dbad50b02ea40975","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-16T14:58:11Z","title_canon_sha256":"e57c261cd2650ec3a924438c8ec0b19466bad1bf27e72366a52e010d0c884128"},"schema_version":"1.0","source":{"id":"2605.17029","kind":"arxiv","version":1}},"canonical_sha256":"e7329289e4beeb618c32482f1cc49d2ee7e99d238b24795dda83cc3f25c1bdd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7329289e4beeb618c32482f1cc49d2ee7e99d238b24795dda83cc3f25c1bdd8","first_computed_at":"2026-05-20T00:03:36.725924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:36.725924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aGHVWgnP/b5F2ZJ9EJi4bDAvc7G+/WsuMwFu5Hgu+auQSB/430VIoHNb/B4nOyy3WJrBAOcs+UXtXvZwN2rDAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:36.726994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90348b7c839f72d50d13d8e59c78da0d9e44eb804fce11a31845bfec9c4e84c8","sha256:c6f01ce1394875c09c3bb629a5420a7d1e26076492697e08183558737f59dc11"],"state_sha256":"b40667cba9acd625c70640dfd7757dabd3af8f0b9e4bf755b54a7030a0424402"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ujOzsWsARUfb6ir81qCsv+Z7xTn4Rt+NSMqtR3Ac0B94T60LIB+qlXy37Iy+BY8t+a50oilJJyweYfNmCQPQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T18:42:11.675818Z","bundle_sha256":"26dcdab56d61407817c5c066609fa8e46b7d6b45bf7eedbc6410a01c7ba45c0c"}}