{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C6VM5LH4JW2RC2ZARTS4A3STJO","short_pith_number":"pith:C6VM5LH4","schema_version":"1.0","canonical_sha256":"17aaceacfc4db5116b208ce5c06e534b9748db20a8a9a8acbffe3c478ffaa28e","source":{"kind":"arxiv","id":"2408.09237","version":7},"attestation_state":"computed","paper":{"title":"QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Abhishek Varghese, Alex Sanchez-Stern, Dylan Zhang, Talia Ringer, Yuriy Brun, Zhanna Kaufman","submitted_at":"2024-08-17T16:06:14Z","abstract_excerpt":"Formal verification is a promising method for producing reliable software, but the difficulty of manually writing verification proofs severely limits its utility in practice. Recent methods have automated some proof synthesis by guiding a search through the proof space using a theorem prover. Unfortunately, the theorem prover provides only the crudest estimate of progress, resulting in effectively undirected search. To address this problem, we create QEDCartographer, an automated proof-synthesis tool that combines supervised and reinforcement learning to more effectively explore the proof spac"},"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":"2408.09237","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2024-08-17T16:06:14Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"1dc0c274086bb022762f7aa6e17fca83ecbd164f7b8d6e16fe9c97cade187e26","abstract_canon_sha256":"4417e350b92329fa407aa49d6761e714e00423f7ddab025e0c196eb3a959d17a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:32.735357Z","signature_b64":"sh6ETD+0JE2IjW3hMHc76t1feHs2RsfLrf18EkNWS1VzxU1ReaoFhPgPPtQc67nMZmi+8Bkk08gFuCq2BByyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17aaceacfc4db5116b208ce5c06e534b9748db20a8a9a8acbffe3c478ffaa28e","last_reissued_at":"2026-07-05T09:50:32.734842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:32.734842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QEDCartographer: Automating Formal Verification Using Reward-Free Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Abhishek Varghese, Alex Sanchez-Stern, Dylan Zhang, Talia Ringer, Yuriy Brun, Zhanna Kaufman","submitted_at":"2024-08-17T16:06:14Z","abstract_excerpt":"Formal verification is a promising method for producing reliable software, but the difficulty of manually writing verification proofs severely limits its utility in practice. Recent methods have automated some proof synthesis by guiding a search through the proof space using a theorem prover. Unfortunately, the theorem prover provides only the crudest estimate of progress, resulting in effectively undirected search. To address this problem, we create QEDCartographer, an automated proof-synthesis tool that combines supervised and reinforcement learning to more effectively explore the proof spac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.09237","kind":"arxiv","version":7},"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/2408.09237/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":"2408.09237","created_at":"2026-07-05T09:50:32.734899+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.09237v7","created_at":"2026-07-05T09:50:32.734899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.09237","created_at":"2026-07-05T09:50:32.734899+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6VM5LH4JW2R","created_at":"2026-07-05T09:50:32.734899+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6VM5LH4JW2RC2ZA","created_at":"2026-07-05T09:50:32.734899+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6VM5LH4","created_at":"2026-07-05T09:50:32.734899+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/C6VM5LH4JW2RC2ZARTS4A3STJO","json":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO.json","graph_json":"https://pith.science/api/pith-number/C6VM5LH4JW2RC2ZARTS4A3STJO/graph.json","events_json":"https://pith.science/api/pith-number/C6VM5LH4JW2RC2ZARTS4A3STJO/events.json","paper":"https://pith.science/paper/C6VM5LH4"},"agent_actions":{"view_html":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO","download_json":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO.json","view_paper":"https://pith.science/paper/C6VM5LH4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.09237&json=true","fetch_graph":"https://pith.science/api/pith-number/C6VM5LH4JW2RC2ZARTS4A3STJO/graph.json","fetch_events":"https://pith.science/api/pith-number/C6VM5LH4JW2RC2ZARTS4A3STJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO/action/storage_attestation","attest_author":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO/action/author_attestation","sign_citation":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO/action/citation_signature","submit_replication":"https://pith.science/pith/C6VM5LH4JW2RC2ZARTS4A3STJO/action/replication_record"}},"created_at":"2026-07-05T09:50:32.734899+00:00","updated_at":"2026-07-05T09:50:32.734899+00:00"}