{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HMXERT75B4PBR322ABZZFNH2MF","short_pith_number":"pith:HMXERT75","schema_version":"1.0","canonical_sha256":"3b2e48cffd0f1e18ef5a007392b4fa6176af6c5c47f8d4e802839a3bf057623b","source":{"kind":"arxiv","id":"2607.02847","version":1},"attestation_state":"computed","paper":{"title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Deevashwer Rathee, Fran\\c{c}ois Dupressoir, Mayank Rathee, Pierre-Yves Strub, Raluca Ada Popa, Yiping Ma, Yu-Lin Tsai","submitted_at":"2026-07-03T00:50:51Z","abstract_excerpt":"Cryptographic proofs are produced at a scale that increasingly exceeds the community's ability to verify them manually. Machine-checked proofs offer a path toward scalable proof verification, but writing proof scripts for expressive proof assistants such as EasyCrypt remains a major bottleneck: even when the high-level proof plan is known, converting it into proof tactics requires substantial reasoning effort. This paper presents ShannonProver, an agentic framework for automating cryptographic proofs. ShannonProver targets the setting in which a cryptographer provides the security model and a "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.02847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-07-03T00:50:51Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"9c0b0d12da86aba05ee6cdf139173b22ccfdc7f78f20dddb8f819bc9eb240d0a","abstract_canon_sha256":"a520ad967a4bb43320cedcdd9d967f7bb749c784a4550187417455a2de6f8c41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T00:16:20.533995Z","signature_b64":"9exWumkloZ32mlpusjWCygFpzqLTYtCj7dlEKnKnSgu+XhdrLApuztYleq7aTBFFGiG/BGdCEmnLh82CDGMkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b2e48cffd0f1e18ef5a007392b4fa6176af6c5c47f8d4e802839a3bf057623b","last_reissued_at":"2026-07-07T00:16:20.533030Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T00:16:20.533030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ShannonProver: Towards Automating Formal Cryptographic Proofs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CR","authors_text":"Deevashwer Rathee, Fran\\c{c}ois Dupressoir, Mayank Rathee, Pierre-Yves Strub, Raluca Ada Popa, Yiping Ma, Yu-Lin Tsai","submitted_at":"2026-07-03T00:50:51Z","abstract_excerpt":"Cryptographic proofs are produced at a scale that increasingly exceeds the community's ability to verify them manually. Machine-checked proofs offer a path toward scalable proof verification, but writing proof scripts for expressive proof assistants such as EasyCrypt remains a major bottleneck: even when the high-level proof plan is known, converting it into proof tactics requires substantial reasoning effort. This paper presents ShannonProver, an agentic framework for automating cryptographic proofs. ShannonProver targets the setting in which a cryptographer provides the security model and a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02847","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.02847/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.02847","created_at":"2026-07-07T00:16:20.533174+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02847v1","created_at":"2026-07-07T00:16:20.533174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02847","created_at":"2026-07-07T00:16:20.533174+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMXERT75B4PB","created_at":"2026-07-07T00:16:20.533174+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMXERT75B4PBR322","created_at":"2026-07-07T00:16:20.533174+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMXERT75","created_at":"2026-07-07T00:16:20.533174+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF","json":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF.json","graph_json":"https://pith.science/api/pith-number/HMXERT75B4PBR322ABZZFNH2MF/graph.json","events_json":"https://pith.science/api/pith-number/HMXERT75B4PBR322ABZZFNH2MF/events.json","paper":"https://pith.science/paper/HMXERT75"},"agent_actions":{"view_html":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF","download_json":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF.json","view_paper":"https://pith.science/paper/HMXERT75","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02847&json=true","fetch_graph":"https://pith.science/api/pith-number/HMXERT75B4PBR322ABZZFNH2MF/graph.json","fetch_events":"https://pith.science/api/pith-number/HMXERT75B4PBR322ABZZFNH2MF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF/action/storage_attestation","attest_author":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF/action/author_attestation","sign_citation":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF/action/citation_signature","submit_replication":"https://pith.science/pith/HMXERT75B4PBR322ABZZFNH2MF/action/replication_record"}},"created_at":"2026-07-07T00:16:20.533174+00:00","updated_at":"2026-07-07T00:16:20.533174+00:00"}