{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XFSFPFTMQIZ4KNIJGBZQUFDFA2","short_pith_number":"pith:XFSFPFTM","canonical_record":{"source":{"id":"2605.16829","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:15:47Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"3e5b7fcb567be5220e2a5b0254734beef73a1ff7cb0d835c20d7e2de232a020a","abstract_canon_sha256":"45ab85a239876e39036ce05ab114c3b3d8b16f30ded283362d12db147abc5221"},"schema_version":"1.0"},"canonical_sha256":"b96457966c8233c5350930730a146506aafe593101a5b28afcbc7b7641c415b0","source":{"kind":"arxiv","id":"2605.16829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16829","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16829v1","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16829","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"XFSFPFTMQIZ4","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"XFSFPFTMQIZ4KNIJ","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"XFSFPFTM","created_at":"2026-05-20T00:03:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XFSFPFTMQIZ4KNIJGBZQUFDFA2","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16829","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:15:47Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"3e5b7fcb567be5220e2a5b0254734beef73a1ff7cb0d835c20d7e2de232a020a","abstract_canon_sha256":"45ab85a239876e39036ce05ab114c3b3d8b16f30ded283362d12db147abc5221"},"schema_version":"1.0"},"canonical_sha256":"b96457966c8233c5350930730a146506aafe593101a5b28afcbc7b7641c415b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:24.859055Z","signature_b64":"6B+1uEx/hwXWwhyy9S/UxkuUbjWBHablDjiMqkf1opS5OOKF2S/CUprAu5ncK2GUgHqZYJX2zI0khVYy+XnYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96457966c8233c5350930730a146506aafe593101a5b28afcbc7b7641c415b0","last_reissued_at":"2026-05-20T00:03:24.858095Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:24.858095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16829","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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+yGS8TJFzhIVqla9oQp/Tak7AX3hKSv5jotMhOxKSmlqJyuC4hzuBh4C1AUUWP7h3JGC3/KFWYyMj2LslnFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:22:54.965905Z"},"content_sha256":"f5e276d4758912e0b1c5096393b7d0d698a73851e963a08b477b537614c3f9d4","schema_version":"1.0","event_id":"sha256:f5e276d4758912e0b1c5096393b7d0d698a73851e963a08b477b537614c3f9d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XFSFPFTMQIZ4KNIJGBZQUFDFA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Code Generation with Discrete Diffusion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Constrained Diffusion for Code augments discrete diffusion samplers with optimization-driven operators that steer denoising toward programs satisfying functional, security, and syntax constraints.","cross_cats":["cs.PL"],"primary_cat":"cs.CL","authors_text":"Ferdinando Fioretto, Lize Shao, Michael Cardei, Wenxi Wang, Zichen Xie","submitted_at":"2026-05-16T06:15:47Z","abstract_excerpt":"Discrete diffusion models are a powerful, emerging paradigm for code generation. They construct programs through iterative refinement of partially corrupted token sequences and enable parallel token refinement. Importantly, this paradigm exposes a global program state at each denoising step, which provides a natural intervention point for enforcing program-level functionality and security constraints, guiding the generation before the final code is committed. Building on this observation, the paper introduces Constrained Diffusion for Code (CDC), a training-free neurosymbolic inference framewo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"CDC augments the base discrete diffusion sampler with constraint-aware denoising operators that combine mathematical optimization with program analysis to identify constraint-relevant regions of the intermediate program state and locally adjust the denoising trajectory, steering generation toward feasible programs while remaining close to the base model.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that program analysis can reliably identify constraint-relevant regions in noisy or partially denoised intermediate program states and that local adjustments via optimization will steer the trajectory toward satisfying constraints without harming overall sample quality or requiring model retraining.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Constrained Diffusion for Code (CDC) integrates constraint satisfaction into the reverse denoising process of discrete diffusion models via constraint-aware operators that use optimization and program analysis to steer generation toward feasible programs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Constrained Diffusion for Code augments discrete diffusion samplers with optimization-driven operators that steer denoising toward programs satisfying functional, security, and syntax constraints.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8336227211af9e07830a5539c8f6e234858c7d15d3173edc6597faa3a3f6746b"},"source":{"id":"2605.16829","kind":"arxiv","version":1},"verdict":{"id":"17080bcd-a655-4f3d-a5c7-e0c63af87311","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:20:20.107748Z","strongest_claim":"CDC augments the base discrete diffusion sampler with constraint-aware denoising operators that combine mathematical optimization with program analysis to identify constraint-relevant regions of the intermediate program state and locally adjust the denoising trajectory, steering generation toward feasible programs while remaining close to the base model.","one_line_summary":"Constrained Diffusion for Code (CDC) integrates constraint satisfaction into the reverse denoising process of discrete diffusion models via constraint-aware operators that use optimization and program analysis to steer generation toward feasible programs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that program analysis can reliably identify constraint-relevant regions in noisy or partially denoised intermediate program states and that local adjustments via optimization will steer the trajectory toward satisfying constraints without harming overall sample quality or requiring model retraining.","pith_extraction_headline":"Constrained Diffusion for Code augments discrete diffusion samplers with optimization-driven operators that steer denoising toward programs satisfying functional, security, and syntax constraints."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16829/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.247489Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:30:54.634959Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.260020Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.403990Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"427e2771b0dd0dea81b3cc74ef3693e30e7df1678ba331cc534f72bf36d9f34b"},"references":{"count":36,"sample":[{"doi":"10.1126/science.abq1158","year":2022,"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":2023,"title":"arXiv preprint arXiv:2303.12570 , year=","work_id":"a725c38c-a880-421f-bea1-b7fb1b5b105f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering","work_id":"01826cd9-a652-403c-a2ec-531da9fe2b6a","ref_index":3,"cited_arxiv_id":"2405.15793","is_internal_anchor":true},{"doi":"","year":2025,"title":"Diffucoder: Understanding and improving masked diffusion models for code generation","work_id":"174cb4e5-25ae-4cca-b4e2-405cbd5774ba","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"arXiv preprint arXiv:2509.01142 , year=","work_id":"8a7c9708-6012-4156-8cca-f10969908d10","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":36,"snapshot_sha256":"f8d2b9f9719ef0798889722f5152dd95bacc4776e8ecdeaaa414db4133a88351","internal_anchors":11},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f2087ef7e47ecde7573a2402e4469eb492a530ec708a2bf5ea9dd29e0128436e"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"17080bcd-a655-4f3d-a5c7-e0c63af87311"},"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90B4QvqkacawUe4er0d0N06t8QHAd071mZSa14GRoKfVIBqjhSPCONPcUPGwjvpTBK7H0zzhzryNe+0ChyxkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:22:54.966915Z"},"content_sha256":"48757ecf136e5fdc4ab63900bb68ffe6ffccdf019bb084fb627d7acffa8e3960","schema_version":"1.0","event_id":"sha256:48757ecf136e5fdc4ab63900bb68ffe6ffccdf019bb084fb627d7acffa8e3960"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFSFPFTMQIZ4KNIJGBZQUFDFA2/bundle.json","state_url":"https://pith.science/pith/XFSFPFTMQIZ4KNIJGBZQUFDFA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFSFPFTMQIZ4KNIJGBZQUFDFA2/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-25T18:22:54Z","links":{"resolver":"https://pith.science/pith/XFSFPFTMQIZ4KNIJGBZQUFDFA2","bundle":"https://pith.science/pith/XFSFPFTMQIZ4KNIJGBZQUFDFA2/bundle.json","state":"https://pith.science/pith/XFSFPFTMQIZ4KNIJGBZQUFDFA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFSFPFTMQIZ4KNIJGBZQUFDFA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XFSFPFTMQIZ4KNIJGBZQUFDFA2","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":"45ab85a239876e39036ce05ab114c3b3d8b16f30ded283362d12db147abc5221","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:15:47Z","title_canon_sha256":"3e5b7fcb567be5220e2a5b0254734beef73a1ff7cb0d835c20d7e2de232a020a"},"schema_version":"1.0","source":{"id":"2605.16829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16829","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16829v1","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16829","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"XFSFPFTMQIZ4","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"XFSFPFTMQIZ4KNIJ","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"XFSFPFTM","created_at":"2026-05-20T00:03:24Z"}],"graph_snapshots":[{"event_id":"sha256:48757ecf136e5fdc4ab63900bb68ffe6ffccdf019bb084fb627d7acffa8e3960","target":"graph","created_at":"2026-05-20T00:03:24Z","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":"CDC augments the base discrete diffusion sampler with constraint-aware denoising operators that combine mathematical optimization with program analysis to identify constraint-relevant regions of the intermediate program state and locally adjust the denoising trajectory, steering generation toward feasible programs while remaining close to the base model."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that program analysis can reliably identify constraint-relevant regions in noisy or partially denoised intermediate program states and that local adjustments via optimization will steer the trajectory toward satisfying constraints without harming overall sample quality or requiring model retraining."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Constrained Diffusion for Code (CDC) integrates constraint satisfaction into the reverse denoising process of discrete diffusion models via constraint-aware operators that use optimization and program analysis to steer generation toward feasible programs."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Constrained Diffusion for Code augments discrete diffusion samplers with optimization-driven operators that steer denoising toward programs satisfying functional, security, and syntax constraints."}],"snapshot_sha256":"8336227211af9e07830a5539c8f6e234858c7d15d3173edc6597faa3a3f6746b"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f2087ef7e47ecde7573a2402e4469eb492a530ec708a2bf5ea9dd29e0128436e"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.247489Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:30:54.634959Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.260020Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.403990Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16829/integrity.json","findings":[],"snapshot_sha256":"427e2771b0dd0dea81b3cc74ef3693e30e7df1678ba331cc534f72bf36d9f34b","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Discrete diffusion models are a powerful, emerging paradigm for code generation. They construct programs through iterative refinement of partially corrupted token sequences and enable parallel token refinement. Importantly, this paradigm exposes a global program state at each denoising step, which provides a natural intervention point for enforcing program-level functionality and security constraints, guiding the generation before the final code is committed. Building on this observation, the paper introduces Constrained Diffusion for Code (CDC), a training-free neurosymbolic inference framewo","authors_text":"Ferdinando Fioretto, Lize Shao, Michael Cardei, Wenxi Wang, Zichen Xie","cross_cats":["cs.PL"],"headline":"Constrained Diffusion for Code augments discrete diffusion samplers with optimization-driven operators that steer denoising toward programs satisfying functional, security, and syntax constraints.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:15:47Z","title":"Constrained Code Generation with Discrete Diffusion"},"references":{"count":36,"internal_anchors":11,"resolved_work":36,"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":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"arXiv preprint arXiv:2303.12570 , year=","work_id":"a725c38c-a880-421f-bea1-b7fb1b5b105f","year":2023},{"cited_arxiv_id":"2405.15793","doi":"","is_internal_anchor":true,"ref_index":3,"title":"SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering","work_id":"01826cd9-a652-403c-a2ec-531da9fe2b6a","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Diffucoder: Understanding and improving masked diffusion models for code generation","work_id":"174cb4e5-25ae-4cca-b4e2-405cbd5774ba","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv preprint arXiv:2509.01142 , year=","work_id":"8a7c9708-6012-4156-8cca-f10969908d10","year":2025}],"snapshot_sha256":"f8d2b9f9719ef0798889722f5152dd95bacc4776e8ecdeaaa414db4133a88351"},"source":{"id":"2605.16829","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:20:20.107748Z","id":"17080bcd-a655-4f3d-a5c7-e0c63af87311","model_set":{"reader":"grok-4.3"},"one_line_summary":"Constrained Diffusion for Code (CDC) integrates constraint satisfaction into the reverse denoising process of discrete diffusion models via constraint-aware operators that use optimization and program analysis to steer generation toward feasible programs.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Constrained Diffusion for Code augments discrete diffusion samplers with optimization-driven operators that steer denoising toward programs satisfying functional, security, and syntax constraints.","strongest_claim":"CDC augments the base discrete diffusion sampler with constraint-aware denoising operators that combine mathematical optimization with program analysis to identify constraint-relevant regions of the intermediate program state and locally adjust the denoising trajectory, steering generation toward feasible programs while remaining close to the base model.","weakest_assumption":"The assumption that program analysis can reliably identify constraint-relevant regions in noisy or partially denoised intermediate program states and that local adjustments via optimization will steer the trajectory toward satisfying constraints without harming overall sample quality or requiring model retraining."}},"verdict_id":"17080bcd-a655-4f3d-a5c7-e0c63af87311"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f5e276d4758912e0b1c5096393b7d0d698a73851e963a08b477b537614c3f9d4","target":"record","created_at":"2026-05-20T00:03:24Z","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":"45ab85a239876e39036ce05ab114c3b3d8b16f30ded283362d12db147abc5221","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:15:47Z","title_canon_sha256":"3e5b7fcb567be5220e2a5b0254734beef73a1ff7cb0d835c20d7e2de232a020a"},"schema_version":"1.0","source":{"id":"2605.16829","kind":"arxiv","version":1}},"canonical_sha256":"b96457966c8233c5350930730a146506aafe593101a5b28afcbc7b7641c415b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b96457966c8233c5350930730a146506aafe593101a5b28afcbc7b7641c415b0","first_computed_at":"2026-05-20T00:03:24.858095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:24.858095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6B+1uEx/hwXWwhyy9S/UxkuUbjWBHablDjiMqkf1opS5OOKF2S/CUprAu5ncK2GUgHqZYJX2zI0khVYy+XnYDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:24.859055Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5e276d4758912e0b1c5096393b7d0d698a73851e963a08b477b537614c3f9d4","sha256:48757ecf136e5fdc4ab63900bb68ffe6ffccdf019bb084fb627d7acffa8e3960"],"state_sha256":"7c8cdb26017885ec2a32d849f77ee2d41957df8315c236aec5e34d26e4473765"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDj5ZkBMeqojJX1oYPd4i0B0Tn7akwj9HP4tjqnvSp0A6rnOIdsbuSEt9uX0jHR0nNIGOiKuXaaPEzsjqdMvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:22:54.971563Z","bundle_sha256":"e362dedd58c62e60c4c4532349f0185e22df464fa05aa66eaec54ba1f2f905df"}}