{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5KPEJSWCZTXIWV54H234W237TU","short_pith_number":"pith:5KPEJSWC","schema_version":"1.0","canonical_sha256":"ea9e44cac2ccee8b57bc3eb7cb6b7f9d39bc8d8f9530bbd86b5024249e9e476b","source":{"kind":"arxiv","id":"2412.06176","version":1},"attestation_state":"computed","paper":{"title":"AlphaVerus: Bootstrapping Formally Verified Code Generation through Self-Improving Translation and Treefinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bryan Parno, Pranjal Aggarwal, Sean Welleck","submitted_at":"2024-12-09T03:22:35Z","abstract_excerpt":"Automated code generation with large language models has gained significant traction, but there remains no guarantee on the correctness of generated code. We aim to use formal verification to provide mathematical guarantees that the generated code is correct. However, generating formally verified code with LLMs is hindered by the scarcity of training data and the complexity of formal proofs. To tackle this challenge, we introduce AlphaVerus, a self-improving framework that bootstraps formally verified code generation by iteratively translating programs from a higher-resource language and lever"},"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":"2412.06176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-09T03:22:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b81afeff340ec32f97dab5c5d624b7a1c8cfcc1d8657b3759be457702ee754da","abstract_canon_sha256":"5e2567e1f68afdbe7881b72269f60725a66d896863b0c10f2ae48460a32deb85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:16.667567Z","signature_b64":"rAC9ZA9chKodseIBfFEBIRJ3GuV74igW0qgMKByzjJ5JOX36jMF2XCFtvGuRcXct3erRVG94yUnBKYUo+CAdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea9e44cac2ccee8b57bc3eb7cb6b7f9d39bc8d8f9530bbd86b5024249e9e476b","last_reissued_at":"2026-07-05T09:46:16.667184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:16.667184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AlphaVerus: Bootstrapping Formally Verified Code Generation through Self-Improving Translation and Treefinement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bryan Parno, Pranjal Aggarwal, Sean Welleck","submitted_at":"2024-12-09T03:22:35Z","abstract_excerpt":"Automated code generation with large language models has gained significant traction, but there remains no guarantee on the correctness of generated code. We aim to use formal verification to provide mathematical guarantees that the generated code is correct. However, generating formally verified code with LLMs is hindered by the scarcity of training data and the complexity of formal proofs. To tackle this challenge, we introduce AlphaVerus, a self-improving framework that bootstraps formally verified code generation by iteratively translating programs from a higher-resource language and lever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06176","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/2412.06176/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":"2412.06176","created_at":"2026-07-05T09:46:16.667235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06176v1","created_at":"2026-07-05T09:46:16.667235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06176","created_at":"2026-07-05T09:46:16.667235+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KPEJSWCZTXI","created_at":"2026-07-05T09:46:16.667235+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KPEJSWCZTXIWV54","created_at":"2026-07-05T09:46:16.667235+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KPEJSWC","created_at":"2026-07-05T09:46:16.667235+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23109","citing_title":"Inductive Deductive Synthesis: Enabling AI to Generate Formally Verified Systems","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18436","citing_title":"VeruSAGE: A Study of Agent-Based Verification for Rust Systems","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13602","citing_title":"Reward Hacking in the Era of Large Models: Mechanisms, Emergent Misalignment, Challenges","ref_index":198,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU","json":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU.json","graph_json":"https://pith.science/api/pith-number/5KPEJSWCZTXIWV54H234W237TU/graph.json","events_json":"https://pith.science/api/pith-number/5KPEJSWCZTXIWV54H234W237TU/events.json","paper":"https://pith.science/paper/5KPEJSWC"},"agent_actions":{"view_html":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU","download_json":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU.json","view_paper":"https://pith.science/paper/5KPEJSWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06176&json=true","fetch_graph":"https://pith.science/api/pith-number/5KPEJSWCZTXIWV54H234W237TU/graph.json","fetch_events":"https://pith.science/api/pith-number/5KPEJSWCZTXIWV54H234W237TU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU/action/storage_attestation","attest_author":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU/action/author_attestation","sign_citation":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU/action/citation_signature","submit_replication":"https://pith.science/pith/5KPEJSWCZTXIWV54H234W237TU/action/replication_record"}},"created_at":"2026-07-05T09:46:16.667235+00:00","updated_at":"2026-07-05T09:46:16.667235+00:00"}