{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OOL3BGJ3VTPTHL3TBP3M2QFCCY","short_pith_number":"pith:OOL3BGJ3","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"},"canonical_sha256":"7397b0993bacdf33af730bf6cd40a21615b447cd415998102cac241cee707675","source":{"kind":"arxiv","id":"1207.0988","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0988","created_at":"2026-05-18T03:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0988v2","created_at":"2026-05-18T03:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0988","created_at":"2026-05-18T03:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"OOL3BGJ3VTPT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OOL3BGJ3VTPTHL3T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OOL3BGJ3","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OOL3BGJ3VTPTHL3TBP3M2QFCCY","target":"record","payload":{"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"},"canonical_sha256":"7397b0993bacdf33af730bf6cd40a21615b447cd415998102cac241cee707675","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"},"source_kind":"arxiv","source_id":"1207.0988","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPF0NQkInu8SvrY+MroqqdNd/1N86Rd6+aa60OG6bx0vLmbuVASDs3RdFp7Pu03QJ4Og4nd0/aPK1SR5hwCEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:33:41.271099Z"},"content_sha256":"2ec4d2b2280a10123afd2b263fe339f0966ec52e1b6dd3ff6a9de0baff589e0b","schema_version":"1.0","event_id":"sha256:2ec4d2b2280a10123afd2b263fe339f0966ec52e1b6dd3ff6a9de0baff589e0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OOL3BGJ3VTPTHL3TBP3M2QFCCY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:45:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3Wn9uTMaBa8rLXuWEEBXRMcJ/Tc0nuQdDzHyiPcR62xbLdBjo8Iy2eVdW2/X6+0SNePcsXujRTvmptn3jZYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T00:33:41.271478Z"},"content_sha256":"987e2050ee3112a2ccf7c77c43a23443b95aac0d8e1aef56183f165e305879e9","schema_version":"1.0","event_id":"sha256:987e2050ee3112a2ccf7c77c43a23443b95aac0d8e1aef56183f165e305879e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/bundle.json","state_url":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T00:33:41Z","links":{"resolver":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY","bundle":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/bundle.json","state":"https://pith.science/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOL3BGJ3VTPTHL3TBP3M2QFCCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OOL3BGJ3VTPTHL3TBP3M2QFCCY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dfbcaa6ce0aa7b247e6cf4d2cea80c2c18296f4963c116bce98f010cd2d80f55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T14:10:20Z","title_canon_sha256":"7579fd49858bd1765047fcf0cfbbe8e2b48e362144f6afde6651caa3f4a94137"},"schema_version":"1.0","source":{"id":"1207.0988","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0988","created_at":"2026-05-18T03:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0988v2","created_at":"2026-05-18T03:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0988","created_at":"2026-05-18T03:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"OOL3BGJ3VTPT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OOL3BGJ3VTPTHL3T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OOL3BGJ3","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:987e2050ee3112a2ccf7c77c43a23443b95aac0d8e1aef56183f165e305879e9","target":"graph","created_at":"2026-05-18T03:45:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ilkka Niemel\\\"a, Tero Laitinen, Tommi Junttila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T14:10:20Z","title":"Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0988","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ec4d2b2280a10123afd2b263fe339f0966ec52e1b6dd3ff6a9de0baff589e0b","target":"record","created_at":"2026-05-18T03:45:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dfbcaa6ce0aa7b247e6cf4d2cea80c2c18296f4963c116bce98f010cd2d80f55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-04T14:10:20Z","title_canon_sha256":"7579fd49858bd1765047fcf0cfbbe8e2b48e362144f6afde6651caa3f4a94137"},"schema_version":"1.0","source":{"id":"1207.0988","kind":"arxiv","version":2}},"canonical_sha256":"7397b0993bacdf33af730bf6cd40a21615b447cd415998102cac241cee707675","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7397b0993bacdf33af730bf6cd40a21615b447cd415998102cac241cee707675","first_computed_at":"2026-05-18T03:45:55.074682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:55.074682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LsrjMogZ3D2/krlofyg+CaL6lE6KCkCo5V8z53vqlAibuwUGz0xSPKL4ijZkrK/ZjEL4C/yWjIhoB0mq0np8CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:55.075149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0988","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ec4d2b2280a10123afd2b263fe339f0966ec52e1b6dd3ff6a9de0baff589e0b","sha256:987e2050ee3112a2ccf7c77c43a23443b95aac0d8e1aef56183f165e305879e9"],"state_sha256":"93ddaf8d8e202dc253bb417ec4665cca7165ad18701760e15b1d5a93dc83475d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2KIX9TRXPCgaOr+l5DrFXOlSoXYUQ2tUHOeOoIH3kZWfyJIADMPCo3vq0XCl1GdFL6xOkdmn6XBf3I1tzZUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T00:33:41.273435Z","bundle_sha256":"16c4c8bb54b74ee535c3fe1e354995d132e193d039c03cc255b86d7cedfe6d4f"}}