{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CTK4D764KYCOYV4MTZK7LLH4AA","short_pith_number":"pith:CTK4D764","schema_version":"1.0","canonical_sha256":"14d5c1ffdc5604ec578c9e55f5acfc003d0c7057adc7d859c1062764b89774cf","source":{"kind":"arxiv","id":"1907.00087","version":2},"attestation_state":"computed","paper":{"title":"DRAT-based Bit-Vector Proofs in CVC4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aina Niemetz, Alex Ozdemir, Clark Barrett, Mathias Preiner, Yoni Zohar","submitted_at":"2019-06-28T21:29:07Z","abstract_excerpt":"Many state-of-the-art Satisfiability Modulo Theories (SMT) solvers for the theory of fixed-size bit-vectors employ an approach called bit-blasting, where a given formula is translated into a Boolean satisfiability (SAT) problem and delegated to a SAT solver. Consequently, producing bit-vector proofs in an SMT solver requires incorporating SAT proofs into its proof infrastructure. In this paper, we describe three approaches for integrating DRAT proofs generated by an off-the-shelf SAT solver into the proof infrastructure of the SMT solver CVC4 and explore their strengths and weaknesses. We impl"},"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":"1907.00087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-06-28T21:29:07Z","cross_cats_sorted":[],"title_canon_sha256":"2d981537865995ad15e56a8001f1aa5e5667a476d31eb0fcd218c5a71d162136","abstract_canon_sha256":"f2d15b1afb9bb1de0f3cfb4a8327c4ca54bc81c7f7ee993af90672667fa67ea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:36.109349Z","signature_b64":"Q0YyTah/ZtnoBcr62pxsnYIpkS0ZXf1WHnu18axhpYjPB62cCOn9aQGR4pYJ3IZ8XkHGYx5Cq0IgtHFXfOfhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14d5c1ffdc5604ec578c9e55f5acfc003d0c7057adc7d859c1062764b89774cf","last_reissued_at":"2026-05-17T23:41:36.108547Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:36.108547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DRAT-based Bit-Vector Proofs in CVC4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aina Niemetz, Alex Ozdemir, Clark Barrett, Mathias Preiner, Yoni Zohar","submitted_at":"2019-06-28T21:29:07Z","abstract_excerpt":"Many state-of-the-art Satisfiability Modulo Theories (SMT) solvers for the theory of fixed-size bit-vectors employ an approach called bit-blasting, where a given formula is translated into a Boolean satisfiability (SAT) problem and delegated to a SAT solver. Consequently, producing bit-vector proofs in an SMT solver requires incorporating SAT proofs into its proof infrastructure. In this paper, we describe three approaches for integrating DRAT proofs generated by an off-the-shelf SAT solver into the proof infrastructure of the SMT solver CVC4 and explore their strengths and weaknesses. We impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00087","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":""},"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":"1907.00087","created_at":"2026-05-17T23:41:36.108680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00087v2","created_at":"2026-05-17T23:41:36.108680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00087","created_at":"2026-05-17T23:41:36.108680+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTK4D764KYCO","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTK4D764KYCOYV4M","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTK4D764","created_at":"2026-05-18T12:33:15.570797+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/CTK4D764KYCOYV4MTZK7LLH4AA","json":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA.json","graph_json":"https://pith.science/api/pith-number/CTK4D764KYCOYV4MTZK7LLH4AA/graph.json","events_json":"https://pith.science/api/pith-number/CTK4D764KYCOYV4MTZK7LLH4AA/events.json","paper":"https://pith.science/paper/CTK4D764"},"agent_actions":{"view_html":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA","download_json":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA.json","view_paper":"https://pith.science/paper/CTK4D764","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00087&json=true","fetch_graph":"https://pith.science/api/pith-number/CTK4D764KYCOYV4MTZK7LLH4AA/graph.json","fetch_events":"https://pith.science/api/pith-number/CTK4D764KYCOYV4MTZK7LLH4AA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA/action/storage_attestation","attest_author":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA/action/author_attestation","sign_citation":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA/action/citation_signature","submit_replication":"https://pith.science/pith/CTK4D764KYCOYV4MTZK7LLH4AA/action/replication_record"}},"created_at":"2026-05-17T23:41:36.108680+00:00","updated_at":"2026-05-17T23:41:36.108680+00:00"}