{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OOL3BGJ3VTPTHL3TBP3M2QFCCY","short_pith_number":"pith:OOL3BGJ3","schema_version":"1.0","canonical_sha256":"7397b0993bacdf33af730bf6cd40a21615b447cd415998102cac241cee707675","source":{"kind":"arxiv","id":"1207.0988","version":2},"attestation_state":"computed","paper":{"title":"Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ilkka Niemel\\\"a, Tero Laitinen, Tommi Junttila","submitted_at":"2012-07-04T14:10:20Z","abstract_excerpt":"Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instance is a combination of traditional clauses and parity constraints. This paper studies how such combined problems can be efficiently solved by augmenting a modern SAT solver with an xor-reasoning module in the DPLL(XOR) framework. A new xor-reasoning module that deduces all possible implied literals using incremental Gauss-Jordan elimination is presented. A decomposition technique that can greatly reduce the size of pa"},"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":"1207.0988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T14:10:20Z","cross_cats_sorted":[],"title_canon_sha256":"7579fd49858bd1765047fcf0cfbbe8e2b48e362144f6afde6651caa3f4a94137","abstract_canon_sha256":"dfbcaa6ce0aa7b247e6cf4d2cea80c2c18296f4963c116bce98f010cd2d80f55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:55.075149Z","signature_b64":"LsrjMogZ3D2/krlofyg+CaL6lE6KCkCo5V8z53vqlAibuwUGz0xSPKL4ijZkrK/ZjEL4C/yWjIhoB0mq0np8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7397b0993bacdf33af730bf6cd40a21615b447cd415998102cac241cee707675","last_reissued_at":"2026-05-18T03:45:55.074682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:55.074682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ilkka Niemel\\\"a, Tero Laitinen, Tommi Junttila","submitted_at":"2012-07-04T14:10:20Z","abstract_excerpt":"Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instance is a combination of traditional clauses and parity constraints. This paper studies how such combined problems can be efficiently solved by augmenting a modern SAT solver with an xor-reasoning module in the DPLL(XOR) framework. A new xor-reasoning module that deduces all possible implied literals using incremental Gauss-Jordan elimination is presented. A decomposition technique that can greatly reduce the size of pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0988","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":"1207.0988","created_at":"2026-05-18T03:45:55.074753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0988v2","created_at":"2026-05-18T03:45:55.074753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0988","created_at":"2026-05-18T03:45:55.074753+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOL3BGJ3VTPT","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOL3BGJ3VTPTHL3T","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOL3BGJ3","created_at":"2026-05-18T12:27:16.716162+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/OOL3BGJ3VTPTHL3TBP3M2QFCCY","json":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY.json","graph_json":"https://pith.science/api/pith-number/OOL3BGJ3VTPTHL3TBP3M2QFCCY/graph.json","events_json":"https://pith.science/api/pith-number/OOL3BGJ3VTPTHL3TBP3M2QFCCY/events.json","paper":"https://pith.science/paper/OOL3BGJ3"},"agent_actions":{"view_html":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY","download_json":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY.json","view_paper":"https://pith.science/paper/OOL3BGJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0988&json=true","fetch_graph":"https://pith.science/api/pith-number/OOL3BGJ3VTPTHL3TBP3M2QFCCY/graph.json","fetch_events":"https://pith.science/api/pith-number/OOL3BGJ3VTPTHL3TBP3M2QFCCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/action/storage_attestation","attest_author":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/action/author_attestation","sign_citation":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/action/citation_signature","submit_replication":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/action/replication_record"}},"created_at":"2026-05-18T03:45:55.074753+00:00","updated_at":"2026-05-18T03:45:55.074753+00:00"}