{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4OW6AWSHV2FJ553JIPFDS6ULWB","short_pith_number":"pith:4OW6AWSH","schema_version":"1.0","canonical_sha256":"e3ade05a47ae8a9ef76943ca397a8bb052620c5d1e0fcb17b25743eb67398de6","source":{"kind":"arxiv","id":"1611.05190","version":1},"attestation_state":"computed","paper":{"title":"Driving CDCL Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benjamin Musitsch, Carmine Dodaro, Francesco Ricca, Konstantin Schekotihin, Nicola Leone, Philip Gasteiger","submitted_at":"2016-11-16T09:13:26Z","abstract_excerpt":"The CDCL algorithm is the leading solution adopted by state-of-the-art solvers for SAT, SMT, ASP, and others. Experiments show that the performance of CDCL solvers can be significantly boosted by embedding domain-specific heuristics, especially on large real-world problems. However, a proper integration of such criteria in off-the-shelf CDCL implementations is not obvious. In this paper, we distill the key ingredients that drive the search of CDCL solvers, and propose a general framework for designing and implementing new heuristics. We implemented our strategy in an ASP solver, and we experim"},"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":"1611.05190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-11-16T09:13:26Z","cross_cats_sorted":[],"title_canon_sha256":"e1f12e223591685b3a63b669754250cd4f89b36c9f47239bb4c18f8d05de5f70","abstract_canon_sha256":"8212e48b6fe3e65bd00ff8e250f507065d202689d5cbb940f96e7387d416ec39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:27.705456Z","signature_b64":"mfoNNkcuDwJixnBLn07Etwil3oWVK15DZbuKkFdsa+RyqiboUigPaewAwiLLdGeLr+7S3npTmkiJsvfASawNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ade05a47ae8a9ef76943ca397a8bb052620c5d1e0fcb17b25743eb67398de6","last_reissued_at":"2026-05-18T00:58:27.704805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:27.704805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Driving CDCL Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benjamin Musitsch, Carmine Dodaro, Francesco Ricca, Konstantin Schekotihin, Nicola Leone, Philip Gasteiger","submitted_at":"2016-11-16T09:13:26Z","abstract_excerpt":"The CDCL algorithm is the leading solution adopted by state-of-the-art solvers for SAT, SMT, ASP, and others. Experiments show that the performance of CDCL solvers can be significantly boosted by embedding domain-specific heuristics, especially on large real-world problems. However, a proper integration of such criteria in off-the-shelf CDCL implementations is not obvious. In this paper, we distill the key ingredients that drive the search of CDCL solvers, and propose a general framework for designing and implementing new heuristics. We implemented our strategy in an ASP solver, and we experim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05190","kind":"arxiv","version":1},"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":"1611.05190","created_at":"2026-05-18T00:58:27.704900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05190v1","created_at":"2026-05-18T00:58:27.704900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05190","created_at":"2026-05-18T00:58:27.704900+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OW6AWSHV2FJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OW6AWSHV2FJ553J","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OW6AWSH","created_at":"2026-05-18T12:29:58.707656+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/4OW6AWSHV2FJ553JIPFDS6ULWB","json":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB.json","graph_json":"https://pith.science/api/pith-number/4OW6AWSHV2FJ553JIPFDS6ULWB/graph.json","events_json":"https://pith.science/api/pith-number/4OW6AWSHV2FJ553JIPFDS6ULWB/events.json","paper":"https://pith.science/paper/4OW6AWSH"},"agent_actions":{"view_html":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB","download_json":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB.json","view_paper":"https://pith.science/paper/4OW6AWSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05190&json=true","fetch_graph":"https://pith.science/api/pith-number/4OW6AWSHV2FJ553JIPFDS6ULWB/graph.json","fetch_events":"https://pith.science/api/pith-number/4OW6AWSHV2FJ553JIPFDS6ULWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB/action/storage_attestation","attest_author":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB/action/author_attestation","sign_citation":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB/action/citation_signature","submit_replication":"https://pith.science/pith/4OW6AWSHV2FJ553JIPFDS6ULWB/action/replication_record"}},"created_at":"2026-05-18T00:58:27.704900+00:00","updated_at":"2026-05-18T00:58:27.704900+00:00"}