{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OLRKQI3SL6EMJH3KTGIDITFVMI","short_pith_number":"pith:OLRKQI3S","canonical_record":{"source":{"id":"2406.14190","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-06-20T10:50:26Z","cross_cats_sorted":[],"title_canon_sha256":"440f496df323feb6e7abb58a29a9008698476c51a8a514e44f8361936ef980df","abstract_canon_sha256":"741f0ed9104fbfc54d9fb336d2c5a254ddb1abf266d7c8e46520637c5a3096e2"},"schema_version":"1.0"},"canonical_sha256":"72e2a823725f88c49f6a9990344cb5622c90fe265136bcf2da5c7d761bbcbf54","source":{"kind":"arxiv","id":"2406.14190","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14190","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14190v5","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14190","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"OLRKQI3SL6EM","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"pith_short_16","alias_value":"OLRKQI3SL6EMJH3K","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"pith_short_8","alias_value":"OLRKQI3S","created_at":"2026-05-25T02:01:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OLRKQI3SL6EMJH3KTGIDITFVMI","target":"record","payload":{"canonical_record":{"source":{"id":"2406.14190","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-06-20T10:50:26Z","cross_cats_sorted":[],"title_canon_sha256":"440f496df323feb6e7abb58a29a9008698476c51a8a514e44f8361936ef980df","abstract_canon_sha256":"741f0ed9104fbfc54d9fb336d2c5a254ddb1abf266d7c8e46520637c5a3096e2"},"schema_version":"1.0"},"canonical_sha256":"72e2a823725f88c49f6a9990344cb5622c90fe265136bcf2da5c7d761bbcbf54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:01.001927Z","signature_b64":"R/RCUishXhlQyzXrv40oT4zGkQToFQvWcmX7teTX3EVEMzOl53fE3y3SYfig19PPirelZff/dDiu466EEYuSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72e2a823725f88c49f6a9990344cb5622c90fe265136bcf2da5c7d761bbcbf54","last_reissued_at":"2026-05-25T02:01:01.001261Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:01.001261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.14190","source_version":5,"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-25T02:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7ByEb13Y3wViQFPHmX3ThkDOvCy5dAIBq2AS43BGIUC4JSXhKr8OCGTlNcwnqJFLhf6EG5Iy4Y8DvmC7ieEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:12:26.908575Z"},"content_sha256":"39b483436642ef83931018c187219518f814048b6979dd71cf4968d934209bcb","schema_version":"1.0","event_id":"sha256:39b483436642ef83931018c187219518f814048b6979dd71cf4968d934209bcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OLRKQI3SL6EMJH3KTGIDITFVMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended Resolution Clause Learning via Dual Implication Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"SAT solvers can learn stronger clauses by dynamically adding variables for dual implication points in the implication graph.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Albert Oliveras, Jonathan Chung, Sam Buss, Vijay Ganesh","submitted_at":"2024-06-20T10:50:26Z","abstract_excerpt":"We present a new extended resolution clause learning (ERCL) algorithm, implemented as part of a conflict-driven clause-learning (CDCL) SAT solver, wherein new variables are dynamically introduced as definitions for {\\it Dual Implication Points} (DIPs) in the implication graph constructed by the solver at runtime. DIPs are generalizations of unique implication points and can be informally viewed as a pair of dominator nodes, from the decision variable at the highest decision level to the conflict node, in an implication graph. We perform extensive experimental evaluation to establish the effica"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that xMapleLCM outperforms these solvers on Tseitin and XORified formulas.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Dynamically introducing new variables for DIPs at runtime produces net benefit without prohibitive overhead or compromising solver correctness on the evaluated instance classes.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"New ERCL method using dual implication points in CDCL solvers outperforms baselines on Tseitin and XORified formulas.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"SAT solvers can learn stronger clauses by dynamically adding variables for dual implication points in the implication graph.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"130704422065b1489782fd2501859f9d4653533a02a7b1a64b2694ee414c7a99"},"source":{"id":"2406.14190","kind":"arxiv","version":5},"verdict":{"id":"b838e7e6-0d26-4bc9-9681-2937b15edd73","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-24T00:27:27.539389Z","strongest_claim":"We show that xMapleLCM outperforms these solvers on Tseitin and XORified formulas.","one_line_summary":"New ERCL method using dual implication points in CDCL solvers outperforms baselines on Tseitin and XORified formulas.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Dynamically introducing new variables for DIPs at runtime produces net benefit without prohibitive overhead or compromising solver correctness on the evaluated instance classes.","pith_extraction_headline":"SAT solvers can learn stronger clauses by dynamically adding variables for dual implication points in the implication graph."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.14190/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"b838e7e6-0d26-4bc9-9681-2937b15edd73"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6l0uumU7x7GbN5vafRUulQCJ3EW3Tv4wmsJbLUhrkoPp+EzrH1hwy8LOBJEQ60/0fK9nWq3MdZrvkiYcKWBSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:12:26.909198Z"},"content_sha256":"bda95b6625a8f91df09fac693394d3f89a7a4f3a1714634fd84a380dee8503d2","schema_version":"1.0","event_id":"sha256:bda95b6625a8f91df09fac693394d3f89a7a4f3a1714634fd84a380dee8503d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLRKQI3SL6EMJH3KTGIDITFVMI/bundle.json","state_url":"https://pith.science/pith/OLRKQI3SL6EMJH3KTGIDITFVMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLRKQI3SL6EMJH3KTGIDITFVMI/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-05-25T23:12:26Z","links":{"resolver":"https://pith.science/pith/OLRKQI3SL6EMJH3KTGIDITFVMI","bundle":"https://pith.science/pith/OLRKQI3SL6EMJH3KTGIDITFVMI/bundle.json","state":"https://pith.science/pith/OLRKQI3SL6EMJH3KTGIDITFVMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLRKQI3SL6EMJH3KTGIDITFVMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OLRKQI3SL6EMJH3KTGIDITFVMI","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":"741f0ed9104fbfc54d9fb336d2c5a254ddb1abf266d7c8e46520637c5a3096e2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-06-20T10:50:26Z","title_canon_sha256":"440f496df323feb6e7abb58a29a9008698476c51a8a514e44f8361936ef980df"},"schema_version":"1.0","source":{"id":"2406.14190","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14190","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14190v5","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14190","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"OLRKQI3SL6EM","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"pith_short_16","alias_value":"OLRKQI3SL6EMJH3K","created_at":"2026-05-25T02:01:01Z"},{"alias_kind":"pith_short_8","alias_value":"OLRKQI3S","created_at":"2026-05-25T02:01:01Z"}],"graph_snapshots":[{"event_id":"sha256:bda95b6625a8f91df09fac693394d3f89a7a4f3a1714634fd84a380dee8503d2","target":"graph","created_at":"2026-05-25T02:01:01Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that xMapleLCM outperforms these solvers on Tseitin and XORified formulas."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Dynamically introducing new variables for DIPs at runtime produces net benefit without prohibitive overhead or compromising solver correctness on the evaluated instance classes."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"New ERCL method using dual implication points in CDCL solvers outperforms baselines on Tseitin and XORified formulas."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"SAT solvers can learn stronger clauses by dynamically adding variables for dual implication points in the implication graph."}],"snapshot_sha256":"130704422065b1489782fd2501859f9d4653533a02a7b1a64b2694ee414c7a99"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.14190/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new extended resolution clause learning (ERCL) algorithm, implemented as part of a conflict-driven clause-learning (CDCL) SAT solver, wherein new variables are dynamically introduced as definitions for {\\it Dual Implication Points} (DIPs) in the implication graph constructed by the solver at runtime. DIPs are generalizations of unique implication points and can be informally viewed as a pair of dominator nodes, from the decision variable at the highest decision level to the conflict node, in an implication graph. We perform extensive experimental evaluation to establish the effica","authors_text":"Albert Oliveras, Jonathan Chung, Sam Buss, Vijay Ganesh","cross_cats":[],"headline":"SAT solvers can learn stronger clauses by dynamically adding variables for dual implication points in the implication graph.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-06-20T10:50:26Z","title":"Extended Resolution Clause Learning via Dual Implication Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14190","kind":"arxiv","version":5},"verdict":{"created_at":"2026-05-24T00:27:27.539389Z","id":"b838e7e6-0d26-4bc9-9681-2937b15edd73","model_set":{"reader":"grok-4.3"},"one_line_summary":"New ERCL method using dual implication points in CDCL solvers outperforms baselines on Tseitin and XORified formulas.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"SAT solvers can learn stronger clauses by dynamically adding variables for dual implication points in the implication graph.","strongest_claim":"We show that xMapleLCM outperforms these solvers on Tseitin and XORified formulas.","weakest_assumption":"Dynamically introducing new variables for DIPs at runtime produces net benefit without prohibitive overhead or compromising solver correctness on the evaluated instance classes."}},"verdict_id":"b838e7e6-0d26-4bc9-9681-2937b15edd73"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:39b483436642ef83931018c187219518f814048b6979dd71cf4968d934209bcb","target":"record","created_at":"2026-05-25T02:01:01Z","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":"741f0ed9104fbfc54d9fb336d2c5a254ddb1abf266d7c8e46520637c5a3096e2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-06-20T10:50:26Z","title_canon_sha256":"440f496df323feb6e7abb58a29a9008698476c51a8a514e44f8361936ef980df"},"schema_version":"1.0","source":{"id":"2406.14190","kind":"arxiv","version":5}},"canonical_sha256":"72e2a823725f88c49f6a9990344cb5622c90fe265136bcf2da5c7d761bbcbf54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72e2a823725f88c49f6a9990344cb5622c90fe265136bcf2da5c7d761bbcbf54","first_computed_at":"2026-05-25T02:01:01.001261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:01.001261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R/RCUishXhlQyzXrv40oT4zGkQToFQvWcmX7teTX3EVEMzOl53fE3y3SYfig19PPirelZff/dDiu466EEYuSDQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:01.001927Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.14190","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39b483436642ef83931018c187219518f814048b6979dd71cf4968d934209bcb","sha256:bda95b6625a8f91df09fac693394d3f89a7a4f3a1714634fd84a380dee8503d2"],"state_sha256":"37e1c3c34022df87b348370a4ce0c5a63a5c2ca11ac4f922a33efda5f19302d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOZ5Zyzl5NvkgPSPRSvAdkG6hiyrXFZONhtWir4lnxCKoODVTIv5/7AbLDSi3UaZScoGAE3cOaaHAQa6ifd8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:12:26.913695Z","bundle_sha256":"6974b011890e4b23c73692607ddd2357ab4886e173840b5b096c9aabf73f98cb"}}