{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:37GEVRQX4O7YKFNBWZWDMV4V2N","short_pith_number":"pith:37GEVRQX","schema_version":"1.0","canonical_sha256":"dfcc4ac617e3bf8515a1b66c365795d3443f76ea3b9dc078b2827565fb4a1856","source":{"kind":"arxiv","id":"2412.14063","version":3},"attestation_state":"computed","paper":{"title":"Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Alex Sanchez-Stern, Emily First, Jo\\~ao F. Ferreira, Kevin Fisher, Kyle Thompson, Nuno Saavedra, Pedro Carrott, Sorin Lerner, Yuriy Brun","submitted_at":"2024-12-18T17:08:42Z","abstract_excerpt":"Formal verification using proof assistants, such as Coq, enables the creation of high-quality software. However, the verification process requires significant expertise and manual effort to write proofs. Recent work has explored automating proof synthesis using machine learning and large language models (LLMs). This work has shown that identifying relevant premises, such as lemmas and definitions, can aid synthesis. We present Rango, a fully automated proof synthesis tool for Coq that automatically identifies relevant premises and also similar proofs from the current project and uses them duri"},"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.14063","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-12-18T17:08:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ab7c2552d7d2d028ac7dba56af6e9dd6cff84300af473d75715c1c66f919d231","abstract_canon_sha256":"90805ed3029e2afa507509d1452b9401277f4ab36523d0fc5a8db24034b24b52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:06:46.380683Z","signature_b64":"9mzSzvlwWo0oEkDmRYJ8arj9wEEvXkLXXHNXv3KJHT6eFLTnNpd6KHVwQj0foyYG5IQzki+SJEd0+bh7ZcZ5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfcc4ac617e3bf8515a1b66c365795d3443f76ea3b9dc078b2827565fb4a1856","last_reissued_at":"2026-07-05T10:06:46.380253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:06:46.380253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Alex Sanchez-Stern, Emily First, Jo\\~ao F. Ferreira, Kevin Fisher, Kyle Thompson, Nuno Saavedra, Pedro Carrott, Sorin Lerner, Yuriy Brun","submitted_at":"2024-12-18T17:08:42Z","abstract_excerpt":"Formal verification using proof assistants, such as Coq, enables the creation of high-quality software. However, the verification process requires significant expertise and manual effort to write proofs. Recent work has explored automating proof synthesis using machine learning and large language models (LLMs). This work has shown that identifying relevant premises, such as lemmas and definitions, can aid synthesis. We present Rango, a fully automated proof synthesis tool for Coq that automatically identifies relevant premises and also similar proofs from the current project and uses them duri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14063","kind":"arxiv","version":3},"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.14063/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.14063","created_at":"2026-07-05T10:06:46.380308+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14063v3","created_at":"2026-07-05T10:06:46.380308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14063","created_at":"2026-07-05T10:06:46.380308+00:00"},{"alias_kind":"pith_short_12","alias_value":"37GEVRQX4O7Y","created_at":"2026-07-05T10:06:46.380308+00:00"},{"alias_kind":"pith_short_16","alias_value":"37GEVRQX4O7YKFNB","created_at":"2026-07-05T10:06:46.380308+00:00"},{"alias_kind":"pith_short_8","alias_value":"37GEVRQX","created_at":"2026-07-05T10:06:46.380308+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01008","citing_title":"FVSpec: Real-World Property-Based Tests as Lean Challenges","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23109","citing_title":"Inductive Deductive Synthesis: Enabling AI to Generate Formally Verified Systems","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2511.12253","citing_title":"The Search for Constrained Random Generators","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18436","citing_title":"VeruSAGE: A Study of Agent-Based Verification for Rust Systems","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16584","citing_title":"Certified Program Synthesis with a Multi-Modal Verifier","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19558","citing_title":"On Reasoning-Centric LLM-based Automated Theorem Proving","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N","json":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N.json","graph_json":"https://pith.science/api/pith-number/37GEVRQX4O7YKFNBWZWDMV4V2N/graph.json","events_json":"https://pith.science/api/pith-number/37GEVRQX4O7YKFNBWZWDMV4V2N/events.json","paper":"https://pith.science/paper/37GEVRQX"},"agent_actions":{"view_html":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N","download_json":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N.json","view_paper":"https://pith.science/paper/37GEVRQX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14063&json=true","fetch_graph":"https://pith.science/api/pith-number/37GEVRQX4O7YKFNBWZWDMV4V2N/graph.json","fetch_events":"https://pith.science/api/pith-number/37GEVRQX4O7YKFNBWZWDMV4V2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N/action/storage_attestation","attest_author":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N/action/author_attestation","sign_citation":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N/action/citation_signature","submit_replication":"https://pith.science/pith/37GEVRQX4O7YKFNBWZWDMV4V2N/action/replication_record"}},"created_at":"2026-07-05T10:06:46.380308+00:00","updated_at":"2026-07-05T10:06:46.380308+00:00"}