{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BJJQRWZQUDSP7G3BNQVIZMIVSM","short_pith_number":"pith:BJJQRWZQ","schema_version":"1.0","canonical_sha256":"0a5308db30a0e4ff9b616c2a8cb11593230ac717d6e590a4a9a9550d0482fc29","source":{"kind":"arxiv","id":"2605.16472","version":1},"attestation_state":"computed","paper":{"title":"Certificate-Aware Property-Directed Reachability","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A certificate-aware variant of property-directed reachability jointly optimizes runtime, certificate size, and checker time on hardware safety problems.","cross_cats":["cs.AR"],"primary_cat":"cs.LO","authors_text":"Arman Ferdowsi, Laura Kovacs","submitted_at":"2026-05-15T14:15:33Z","abstract_excerpt":"Property-Directed Reachability (PDR/IC3) is a standard workhorse for hardware safety verification, but most implementations are tuned primarily for time-to-answer and treat the produced invariant or counterexample as a secondary byproduct. In certified workflows, including recent hardware model checking competition rules, the certificate becomes a deliverable whose size, independent checking time, and reproducibility directly affect end-to-end cost.\n  We present CAPDR, a certificate-aware variant of PDR that targets a joint objective over runtime, certificate size, and checker time, while keep"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16472","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-15T14:15:33Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"6c286a11a7971e102713160ba9ca5472edf7be50418ecc197a5695904c8bac65","abstract_canon_sha256":"3b19558e7fdd7f3776b1107fddb653ebe78b981918b8340528dba670f4146530"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:23.721983Z","signature_b64":"Mi8TD4mujpXANfqd7jbx6k+XbTlcY4uyljryxJpD+HlI2nBxpIPqTXVo6kSH0x4rUThlSvD5vKH4AA6q/+SpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a5308db30a0e4ff9b616c2a8cb11593230ac717d6e590a4a9a9550d0482fc29","last_reissued_at":"2026-05-20T00:02:23.721209Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:23.721209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certificate-Aware Property-Directed Reachability","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A certificate-aware variant of property-directed reachability jointly optimizes runtime, certificate size, and checker time on hardware safety problems.","cross_cats":["cs.AR"],"primary_cat":"cs.LO","authors_text":"Arman Ferdowsi, Laura Kovacs","submitted_at":"2026-05-15T14:15:33Z","abstract_excerpt":"Property-Directed Reachability (PDR/IC3) is a standard workhorse for hardware safety verification, but most implementations are tuned primarily for time-to-answer and treat the produced invariant or counterexample as a secondary byproduct. In certified workflows, including recent hardware model checking competition rules, the certificate becomes a deliverable whose size, independent checking time, and reproducibility directly affect end-to-end cost.\n  We present CAPDR, a certificate-aware variant of PDR that targets a joint objective over runtime, certificate size, and checker time, while keep"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On the 2024 Hardware Model Checking Competition bit-level safety benchmarks, CAPDR solves six more instances than the baseline. Over each configuration's checker-accepted solved set, the median certificate-size proxy decreases by 24.6% and the median checker time by 49%. Post-fixpoint invariant minimization yields further reductions.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The learned ranking policy over PDR choice points (blocker generalization, obligation ordering, clause pushing) produces the observed joint improvements without introducing any unsoundness, given that every state-changing action remains guarded by the identical SAT checks as standard PDR and final claims are accepted only after independent checker validation.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CAPDR augments PDR with a learned ranking policy over blocker generalization, obligation ordering, and clause pushing to reduce median certificate size by 24.6% and checker time by 49% while solving six additional 2024 HWMCC bit-level safety instances.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A certificate-aware variant of property-directed reachability jointly optimizes runtime, certificate size, and checker time on hardware safety problems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c43c3a13fb9e5dceb8986c96c6426a80497cc198f9e41450c493d025ff5c093e"},"source":{"id":"2605.16472","kind":"arxiv","version":1},"verdict":{"id":"c9d66d38-d9da-4fd4-8134-a0de9d19f16d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:44:28.954707Z","strongest_claim":"On the 2024 Hardware Model Checking Competition bit-level safety benchmarks, CAPDR solves six more instances than the baseline. Over each configuration's checker-accepted solved set, the median certificate-size proxy decreases by 24.6% and the median checker time by 49%. Post-fixpoint invariant minimization yields further reductions.","one_line_summary":"CAPDR augments PDR with a learned ranking policy over blocker generalization, obligation ordering, and clause pushing to reduce median certificate size by 24.6% and checker time by 49% while solving six additional 2024 HWMCC bit-level safety instances.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The learned ranking policy over PDR choice points (blocker generalization, obligation ordering, clause pushing) produces the observed joint improvements without introducing any unsoundness, given that every state-changing action remains guarded by the identical SAT checks as standard PDR and final claims are accepted only after independent checker validation.","pith_extraction_headline":"A certificate-aware variant of property-directed reachability jointly optimizes runtime, certificate size, and checker time on hardware safety problems."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16472/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:23.282438Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:52:01.992668Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:23.116098Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:21:57.050155Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"4635829a231a8ade815a783f6ff80cf3675475ebf806b56eb0651d4487b048d5"},"references":{"count":34,"sample":[{"doi":"","year":2011,"title":"Sat-based model checking without unrolling,","work_id":"a95c4290-1123-41e3-b7a8-2068b5c3f85a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Introducing certificates to the hardware model checking competition,","work_id":"a79ad8fa-0216-46cb-9d05-25130586c514","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Hardware model checking competition 2025,","work_id":"c83d9fa9-340f-481a-a537-a58e210f2268","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Improvements in software verification and witness validation: SV-COMP 2025,","work_id":"f7397fdd-b0d1-434e-9a94-33e2507d6ed8","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Deepic3: Guiding ic3 algorithms by graph neural network clause prediction,","work_id":"7b21f59e-9cb1-44f7-8775-54ce87bf9903","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":34,"snapshot_sha256":"70fd83198265bf1ec5647a3f5ca1cffd0b1e8bb389e5d750447a5a11d33362d1","internal_anchors":1},"formal_canon":{"evidence_count":1,"snapshot_sha256":"99c24a8b5b67cc8c90c0d7645cc66d27796f895d4ad82070bb77c8a72106adb3"},"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":"2605.16472","created_at":"2026-05-20T00:02:23.721331+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16472v1","created_at":"2026-05-20T00:02:23.721331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16472","created_at":"2026-05-20T00:02:23.721331+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJJQRWZQUDSP","created_at":"2026-05-20T00:02:23.721331+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJJQRWZQUDSP7G3B","created_at":"2026-05-20T00:02:23.721331+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJJQRWZQ","created_at":"2026-05-20T00:02:23.721331+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM","json":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM.json","graph_json":"https://pith.science/api/pith-number/BJJQRWZQUDSP7G3BNQVIZMIVSM/graph.json","events_json":"https://pith.science/api/pith-number/BJJQRWZQUDSP7G3BNQVIZMIVSM/events.json","paper":"https://pith.science/paper/BJJQRWZQ"},"agent_actions":{"view_html":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM","download_json":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM.json","view_paper":"https://pith.science/paper/BJJQRWZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16472&json=true","fetch_graph":"https://pith.science/api/pith-number/BJJQRWZQUDSP7G3BNQVIZMIVSM/graph.json","fetch_events":"https://pith.science/api/pith-number/BJJQRWZQUDSP7G3BNQVIZMIVSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM/action/storage_attestation","attest_author":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM/action/author_attestation","sign_citation":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM/action/citation_signature","submit_replication":"https://pith.science/pith/BJJQRWZQUDSP7G3BNQVIZMIVSM/action/replication_record"}},"created_at":"2026-05-20T00:02:23.721331+00:00","updated_at":"2026-05-20T00:02:23.721331+00:00"}