{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QIXIBNB4IS7MQGOWJ6SXOZXXKG","short_pith_number":"pith:QIXIBNB4","canonical_record":{"source":{"id":"1310.4756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-17T15:49:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"34469f91286620ac5f879bf5f242974742175f79e1c8fa8d3acb4888860f5224","abstract_canon_sha256":"41162cfc33965a8bed6903a7d1a54e735bab00896786b3af651461ce9b2d3e2d"},"schema_version":"1.0"},"canonical_sha256":"822e80b43c44bec819d64fa57766f751869ac3971444addfdbbc54c69119809e","source":{"kind":"arxiv","id":"1310.4756","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4756","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4756v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4756","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"QIXIBNB4IS7M","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QIXIBNB4IS7MQGOW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QIXIBNB4","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QIXIBNB4IS7MQGOWJ6SXOZXXKG","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-17T15:49:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"34469f91286620ac5f879bf5f242974742175f79e1c8fa8d3acb4888860f5224","abstract_canon_sha256":"41162cfc33965a8bed6903a7d1a54e735bab00896786b3af651461ce9b2d3e2d"},"schema_version":"1.0"},"canonical_sha256":"822e80b43c44bec819d64fa57766f751869ac3971444addfdbbc54c69119809e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.903331Z","signature_b64":"jxpTA0wbBYET3bSba60SIG6t5unD8YcFG7oespgptg+X5lxNvzcHdptWQzZm2qtVq5qBoDShV0hbzJ9VkAdoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"822e80b43c44bec819d64fa57766f751869ac3971444addfdbbc54c69119809e","last_reissued_at":"2026-05-18T03:10:12.902483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.902483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4756","source_version":1,"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:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Du4k6y+dy8vuaBNIWJsZoF5z7its8ZjeOgeFlW2UdA33715e/S/6pokyN+2h7C+JvCElq/gsXvIcOOYeK05Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:47:49.366949Z"},"content_sha256":"7a8ae52732f2918c869ce3fbf75acc24ccd53ef799c3332b3bcd82309b811cde","schema_version":"1.0","event_id":"sha256:7a8ae52732f2918c869ce3fbf75acc24ccd53ef799c3332b3bcd82309b811cde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QIXIBNB4IS7MQGOWJ6SXOZXXKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effectiveness of pre- and inprocessing for CDCL-based SAT solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Alexander van der Grinten, Andreas Wotzlaw, Ewald Speckenmeyer","submitted_at":"2013-10-17T15:49:32Z","abstract_excerpt":"Applying pre- and inprocessing techniques to simplify CNF formulas both before and during search can considerably improve the performance of modern SAT solvers. These algorithms mostly aim at reducing the number of clauses, literals, and variables in the formula. However, to be worthwhile, it is necessary that their additional runtime does not exceed the runtime saved during the subsequent SAT solver execution. In this paper we investigate the efficiency and the practicability of selected simplification algorithms for CDCL-based SAT solving. We first analyze them by means of their expected imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4756","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"},"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:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gi1lr7FPNOp6Pn1cGE26MtZDXFtBZx3FQImyp8ZHw+bxdBRUvOWrzG/EJpFnROH+K7nCGsK9UYOiiifpC0IVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:47:49.367301Z"},"content_sha256":"cf2c940f61e7bb58eeeb494a183cf5c5d60ed54e7aa36f6ee97bf799bc66bb7c","schema_version":"1.0","event_id":"sha256:cf2c940f61e7bb58eeeb494a183cf5c5d60ed54e7aa36f6ee97bf799bc66bb7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIXIBNB4IS7MQGOWJ6SXOZXXKG/bundle.json","state_url":"https://pith.science/pith/QIXIBNB4IS7MQGOWJ6SXOZXXKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIXIBNB4IS7MQGOWJ6SXOZXXKG/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-24T20:47:49Z","links":{"resolver":"https://pith.science/pith/QIXIBNB4IS7MQGOWJ6SXOZXXKG","bundle":"https://pith.science/pith/QIXIBNB4IS7MQGOWJ6SXOZXXKG/bundle.json","state":"https://pith.science/pith/QIXIBNB4IS7MQGOWJ6SXOZXXKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIXIBNB4IS7MQGOWJ6SXOZXXKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QIXIBNB4IS7MQGOWJ6SXOZXXKG","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":"41162cfc33965a8bed6903a7d1a54e735bab00896786b3af651461ce9b2d3e2d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-17T15:49:32Z","title_canon_sha256":"34469f91286620ac5f879bf5f242974742175f79e1c8fa8d3acb4888860f5224"},"schema_version":"1.0","source":{"id":"1310.4756","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4756","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4756v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4756","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"QIXIBNB4IS7M","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QIXIBNB4IS7MQGOW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QIXIBNB4","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:cf2c940f61e7bb58eeeb494a183cf5c5d60ed54e7aa36f6ee97bf799bc66bb7c","target":"graph","created_at":"2026-05-18T03:10:12Z","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":"Applying pre- and inprocessing techniques to simplify CNF formulas both before and during search can considerably improve the performance of modern SAT solvers. These algorithms mostly aim at reducing the number of clauses, literals, and variables in the formula. However, to be worthwhile, it is necessary that their additional runtime does not exceed the runtime saved during the subsequent SAT solver execution. In this paper we investigate the efficiency and the practicability of selected simplification algorithms for CDCL-based SAT solving. We first analyze them by means of their expected imp","authors_text":"Alexander van der Grinten, Andreas Wotzlaw, Ewald Speckenmeyer","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-17T15:49:32Z","title":"Effectiveness of pre- and inprocessing for CDCL-based SAT solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4756","kind":"arxiv","version":1},"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:7a8ae52732f2918c869ce3fbf75acc24ccd53ef799c3332b3bcd82309b811cde","target":"record","created_at":"2026-05-18T03:10:12Z","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":"41162cfc33965a8bed6903a7d1a54e735bab00896786b3af651461ce9b2d3e2d","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-17T15:49:32Z","title_canon_sha256":"34469f91286620ac5f879bf5f242974742175f79e1c8fa8d3acb4888860f5224"},"schema_version":"1.0","source":{"id":"1310.4756","kind":"arxiv","version":1}},"canonical_sha256":"822e80b43c44bec819d64fa57766f751869ac3971444addfdbbc54c69119809e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"822e80b43c44bec819d64fa57766f751869ac3971444addfdbbc54c69119809e","first_computed_at":"2026-05-18T03:10:12.902483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.902483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jxpTA0wbBYET3bSba60SIG6t5unD8YcFG7oespgptg+X5lxNvzcHdptWQzZm2qtVq5qBoDShV0hbzJ9VkAdoCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.903331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4756","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a8ae52732f2918c869ce3fbf75acc24ccd53ef799c3332b3bcd82309b811cde","sha256:cf2c940f61e7bb58eeeb494a183cf5c5d60ed54e7aa36f6ee97bf799bc66bb7c"],"state_sha256":"7988207f2a857be66ced14308e96da1e3c21bc893b896acd7368ae368269be77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OG6mT9PLhbLCiFRAnz790R7rzoSFaqz2/lPgj94HE/Vw+3gy69xzu2sDx790GE3aUA01BEvbXmTstp4yy8fIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:47:49.369268Z","bundle_sha256":"328f7d8d528585cc4e99c62eda3d1d620597029fca9d6b1c2e2e1ec76fcbc064"}}