{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CWAS3JGZOO5DF53PRWVV2Z2SAE","short_pith_number":"pith:CWAS3JGZ","schema_version":"1.0","canonical_sha256":"15812da4d973ba32f76f8dab5d675201247bb78cacc7f7e7defe2be645f4daa7","source":{"kind":"arxiv","id":"2311.03739","version":2},"attestation_state":"computed","paper":{"title":"Leveraging Large Language Models for Automated Proof Synthesis in Rust","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.FL","authors_text":"Jianan Yao, Weidong Cui, Weiteng Chen, Ziqiao Zhou","submitted_at":"2023-11-07T05:47:47Z","abstract_excerpt":"Formal verification can provably guarantee the correctness of critical system software, but the high proof burden has long hindered its wide adoption. Recently, Large Language Models (LLMs) have shown success in code analysis and synthesis. In this paper, we present a combination of LLMs and static analysis to synthesize invariants, assertions, and other proof structures for a Rust-based formal verification framework called Verus. In a few-shot setting, LLMs demonstrate impressive logical ability in generating postconditions and loop invariants, especially when analyzing short code snippets. H"},"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":"2311.03739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2023-11-07T05:47:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c99ee2afe4b0de03ce48bdcdd6e3a11d39a9b5f4d59c129dce04e475ae9ce83c","abstract_canon_sha256":"31190790a30fe0c270da3b762baadb01043e2e79d31aa002403690b325b2ca18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:02.612200Z","signature_b64":"vR0fGgx+BqDXaegqTc8Wjjk9BZ4EYOJMU0deaOaB8pJ8qMnXG7Lm5atiQpxnQm+IqF8/wMTEY7DRKYxtolSGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15812da4d973ba32f76f8dab5d675201247bb78cacc7f7e7defe2be645f4daa7","last_reissued_at":"2026-07-05T07:16:02.611505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:02.611505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leveraging Large Language Models for Automated Proof Synthesis in Rust","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.FL","authors_text":"Jianan Yao, Weidong Cui, Weiteng Chen, Ziqiao Zhou","submitted_at":"2023-11-07T05:47:47Z","abstract_excerpt":"Formal verification can provably guarantee the correctness of critical system software, but the high proof burden has long hindered its wide adoption. Recently, Large Language Models (LLMs) have shown success in code analysis and synthesis. In this paper, we present a combination of LLMs and static analysis to synthesize invariants, assertions, and other proof structures for a Rust-based formal verification framework called Verus. In a few-shot setting, LLMs demonstrate impressive logical ability in generating postconditions and loop invariants, especially when analyzing short code snippets. H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03739","kind":"arxiv","version":2},"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/2311.03739/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":"2311.03739","created_at":"2026-07-05T07:16:02.611563+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03739v2","created_at":"2026-07-05T07:16:02.611563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03739","created_at":"2026-07-05T07:16:02.611563+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWAS3JGZOO5D","created_at":"2026-07-05T07:16:02.611563+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWAS3JGZOO5DF53P","created_at":"2026-07-05T07:16:02.611563+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWAS3JGZ","created_at":"2026-07-05T07:16:02.611563+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26490","citing_title":"An Empirical Study of LLM-Generated Specifications for VeriFast","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2511.02521","citing_title":"Large Lemma Miners: Can LLMs do Induction Proofs for Hardware?","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE","json":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE.json","graph_json":"https://pith.science/api/pith-number/CWAS3JGZOO5DF53PRWVV2Z2SAE/graph.json","events_json":"https://pith.science/api/pith-number/CWAS3JGZOO5DF53PRWVV2Z2SAE/events.json","paper":"https://pith.science/paper/CWAS3JGZ"},"agent_actions":{"view_html":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE","download_json":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE.json","view_paper":"https://pith.science/paper/CWAS3JGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03739&json=true","fetch_graph":"https://pith.science/api/pith-number/CWAS3JGZOO5DF53PRWVV2Z2SAE/graph.json","fetch_events":"https://pith.science/api/pith-number/CWAS3JGZOO5DF53PRWVV2Z2SAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE/action/storage_attestation","attest_author":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE/action/author_attestation","sign_citation":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE/action/citation_signature","submit_replication":"https://pith.science/pith/CWAS3JGZOO5DF53PRWVV2Z2SAE/action/replication_record"}},"created_at":"2026-07-05T07:16:02.611563+00:00","updated_at":"2026-07-05T07:16:02.611563+00:00"}