{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GOEXWYZFP46UPOHFFSUZCPMU2W","short_pith_number":"pith:GOEXWYZF","schema_version":"1.0","canonical_sha256":"33897b63257f3d47b8e52ca9913d94d5af983dd66f938721ab65a62937efd6b6","source":{"kind":"arxiv","id":"2208.05046","version":2},"attestation_state":"computed","paper":{"title":"Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Dirk Beyer, Nian-Ze Lee, Philipp Wendler","submitted_at":"2022-08-09T21:33:19Z","abstract_excerpt":"The article \"Interpolation and SAT-Based Model Checking\" (McMillan, 2003) describes a formal-verification algorithm, which was originally devised to verify safety properties of finite-state transition systems. It derives interpolants from unsatisfiable BMC queries and collects them to construct an overapproximation of the set of reachable states. Although 20 years old, the algorithm is still state-of-the-art in hardware model checking. Unlike other formal-verification algorithms, such as k-induction or PDR, which have been extended to handle infinite-state systems and investigated for program "},"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":"2208.05046","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-08-09T21:33:19Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"8df5f308e27a63da95ec7544390ec996e9430cf61d1a03932b671daf0faa1987","abstract_canon_sha256":"de9e594a070101346c123d2110ab19bf140e327a8226dac8ae38b2b22c972950"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:18.891650Z","signature_b64":"eVut6xAi0pliI4AU0Gm5/nEPCfExASjlCwk/ELxI8WHqB5+OaFNYYEWXDa+tbZ582O44qxtWB7vvQ73BgN8hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33897b63257f3d47b8e52ca9913d94d5af983dd66f938721ab65a62937efd6b6","last_reissued_at":"2026-07-05T07:55:18.891094Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:18.891094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Dirk Beyer, Nian-Ze Lee, Philipp Wendler","submitted_at":"2022-08-09T21:33:19Z","abstract_excerpt":"The article \"Interpolation and SAT-Based Model Checking\" (McMillan, 2003) describes a formal-verification algorithm, which was originally devised to verify safety properties of finite-state transition systems. It derives interpolants from unsatisfiable BMC queries and collects them to construct an overapproximation of the set of reachable states. Although 20 years old, the algorithm is still state-of-the-art in hardware model checking. Unlike other formal-verification algorithms, such as k-induction or PDR, which have been extended to handle infinite-state systems and investigated for program "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05046","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/2208.05046/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":"2208.05046","created_at":"2026-07-05T07:55:18.891165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.05046v2","created_at":"2026-07-05T07:55:18.891165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05046","created_at":"2026-07-05T07:55:18.891165+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOEXWYZFP46U","created_at":"2026-07-05T07:55:18.891165+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOEXWYZFP46UPOHF","created_at":"2026-07-05T07:55:18.891165+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOEXWYZF","created_at":"2026-07-05T07:55:18.891165+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/GOEXWYZFP46UPOHFFSUZCPMU2W","json":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W.json","graph_json":"https://pith.science/api/pith-number/GOEXWYZFP46UPOHFFSUZCPMU2W/graph.json","events_json":"https://pith.science/api/pith-number/GOEXWYZFP46UPOHFFSUZCPMU2W/events.json","paper":"https://pith.science/paper/GOEXWYZF"},"agent_actions":{"view_html":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W","download_json":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W.json","view_paper":"https://pith.science/paper/GOEXWYZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.05046&json=true","fetch_graph":"https://pith.science/api/pith-number/GOEXWYZFP46UPOHFFSUZCPMU2W/graph.json","fetch_events":"https://pith.science/api/pith-number/GOEXWYZFP46UPOHFFSUZCPMU2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W/action/storage_attestation","attest_author":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W/action/author_attestation","sign_citation":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W/action/citation_signature","submit_replication":"https://pith.science/pith/GOEXWYZFP46UPOHFFSUZCPMU2W/action/replication_record"}},"created_at":"2026-07-05T07:55:18.891165+00:00","updated_at":"2026-07-05T07:55:18.891165+00:00"}