{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YWKFEGLMOMYZSR76F6V3KBZNNY","short_pith_number":"pith:YWKFEGLM","schema_version":"1.0","canonical_sha256":"c59452196c73319947fe2fabb5072d6e330d61db1a53d22cccc5a80ff3422425","source":{"kind":"arxiv","id":"1705.01477","version":2},"attestation_state":"computed","paper":{"title":"On Tackling the Limits of Resolution in SAT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva","submitted_at":"2017-05-03T15:20:31Z","abstract_excerpt":"The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof system, for which many hard examples exist. This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas. Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resol"},"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":"1705.01477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-03T15:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"a3df09ea367d398a54fddc0ef00c9786dd34bea85f254cb84b50500f94798c9c","abstract_canon_sha256":"acfabdb4de235741eb04db28503f2c455b4c05ea5a38da953bebc34c4dbe3372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:53.758367Z","signature_b64":"tlduQe7LFiV7XVNnXv1xrAViAAkdMlCJIIup1Shm9KKcuPE32JJtG7n17qXGlYpp0zjRrTo3htl+ybKDUxzRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c59452196c73319947fe2fabb5072d6e330d61db1a53d22cccc5a80ff3422425","last_reissued_at":"2026-05-18T00:40:53.757885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:53.757885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Tackling the Limits of Resolution in SAT Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva","submitted_at":"2017-05-03T15:20:31Z","abstract_excerpt":"The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof system, for which many hard examples exist. This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas. Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01477","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":"1705.01477","created_at":"2026-05-18T00:40:53.757957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01477v2","created_at":"2026-05-18T00:40:53.757957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01477","created_at":"2026-05-18T00:40:53.757957+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWKFEGLMOMYZ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWKFEGLMOMYZSR76","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWKFEGLM","created_at":"2026-05-18T12:31:56.362134+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/YWKFEGLMOMYZSR76F6V3KBZNNY","json":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY.json","graph_json":"https://pith.science/api/pith-number/YWKFEGLMOMYZSR76F6V3KBZNNY/graph.json","events_json":"https://pith.science/api/pith-number/YWKFEGLMOMYZSR76F6V3KBZNNY/events.json","paper":"https://pith.science/paper/YWKFEGLM"},"agent_actions":{"view_html":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY","download_json":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY.json","view_paper":"https://pith.science/paper/YWKFEGLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01477&json=true","fetch_graph":"https://pith.science/api/pith-number/YWKFEGLMOMYZSR76F6V3KBZNNY/graph.json","fetch_events":"https://pith.science/api/pith-number/YWKFEGLMOMYZSR76F6V3KBZNNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY/action/storage_attestation","attest_author":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY/action/author_attestation","sign_citation":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY/action/citation_signature","submit_replication":"https://pith.science/pith/YWKFEGLMOMYZSR76F6V3KBZNNY/action/replication_record"}},"created_at":"2026-05-18T00:40:53.757957+00:00","updated_at":"2026-05-18T00:40:53.757957+00:00"}