{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MD6Z7PEFML6IKRQS5JC5QD3HEL","short_pith_number":"pith:MD6Z7PEF","canonical_record":{"source":{"id":"1107.0044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:39:28Z","cross_cats_sorted":[],"title_canon_sha256":"6198eab26cbe09b6f9949356f8adbab9077d46b9947069d393ff1740c559d121","abstract_canon_sha256":"dbc4639d7532dc087b0e70074c88a0761103f63541229a4498969f463d1e9f5c"},"schema_version":"1.0"},"canonical_sha256":"60fd9fbc8562fc854612ea45d80f6722d6b1258af47dfc8ecacf45d6788c176a","source":{"kind":"arxiv","id":"1107.0044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0044","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0044v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0044","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"MD6Z7PEFML6I","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MD6Z7PEFML6IKRQS","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MD6Z7PEF","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MD6Z7PEFML6IKRQS5JC5QD3HEL","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:39:28Z","cross_cats_sorted":[],"title_canon_sha256":"6198eab26cbe09b6f9949356f8adbab9077d46b9947069d393ff1740c559d121","abstract_canon_sha256":"dbc4639d7532dc087b0e70074c88a0761103f63541229a4498969f463d1e9f5c"},"schema_version":"1.0"},"canonical_sha256":"60fd9fbc8562fc854612ea45d80f6722d6b1258af47dfc8ecacf45d6788c176a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:02.828125Z","signature_b64":"oavpVT6262365kXqqGj/gmIXxavQnzRs67QxB1sVBVI+Wgok/U70uLSkwtr3yl1AGcxsK5npW8efQwiGjiW/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60fd9fbc8562fc854612ea45d80f6722d6b1258af47dfc8ecacf45d6788c176a","last_reissued_at":"2026-05-18T04:19:02.827559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:02.827559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0044","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-18T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PfbpMrAO2Uw/JL79UXy1Bo7pV3UnGE7CcM6akccrEgkvy2K1uzaWlZCklbSTRL0dHy9tavK0sNIk6TQu3zJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:27:35.726413Z"},"content_sha256":"a843c034e78d0345f803345fe322707f082dbb6f7aa03b1e5eb9a0688ccb3323","schema_version":"1.0","event_id":"sha256:a843c034e78d0345f803345fe322707f082dbb6f7aa03b1e5eb9a0688ccb3323"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MD6Z7PEFML6IKRQS5JC5QD3HEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Understanding and Harnessing the Potential of Clause Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. Sabharwal, H. Kautz, P. Beame","submitted_at":"2011-06-30T20:39:28Z","abstract_excerpt":"Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problems, such as verification, planning and design. Despite its importance, little is known of the ultimate strengths and limitations of the technique. This paper presents the first precise characterization of clause learning as a proof system (CL), and begins the task of understanding its power by relating it to the well-studied resolution proof system. In particular, we show that with a new learning scheme, CL can provide e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0044","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-18T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2bWJLmjcSKD1z4lFQ8SVY7M/hKRSUjOXRsAIgetLKv8B5XmhtfQGLIpjY0F/+mjRhBqHvBEKey8niLDG/wHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:27:35.726858Z"},"content_sha256":"23b42a13b235291c4cbd9a371bf1645fa59b93cc6ab3d391f9f596df566a5146","schema_version":"1.0","event_id":"sha256:23b42a13b235291c4cbd9a371bf1645fa59b93cc6ab3d391f9f596df566a5146"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MD6Z7PEFML6IKRQS5JC5QD3HEL/bundle.json","state_url":"https://pith.science/pith/MD6Z7PEFML6IKRQS5JC5QD3HEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MD6Z7PEFML6IKRQS5JC5QD3HEL/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-08-21T16:27:35Z","links":{"resolver":"https://pith.science/pith/MD6Z7PEFML6IKRQS5JC5QD3HEL","bundle":"https://pith.science/pith/MD6Z7PEFML6IKRQS5JC5QD3HEL/bundle.json","state":"https://pith.science/pith/MD6Z7PEFML6IKRQS5JC5QD3HEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MD6Z7PEFML6IKRQS5JC5QD3HEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MD6Z7PEFML6IKRQS5JC5QD3HEL","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":"dbc4639d7532dc087b0e70074c88a0761103f63541229a4498969f463d1e9f5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:39:28Z","title_canon_sha256":"6198eab26cbe09b6f9949356f8adbab9077d46b9947069d393ff1740c559d121"},"schema_version":"1.0","source":{"id":"1107.0044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0044","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0044v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0044","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"MD6Z7PEFML6I","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MD6Z7PEFML6IKRQS","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MD6Z7PEF","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:23b42a13b235291c4cbd9a371bf1645fa59b93cc6ab3d391f9f596df566a5146","target":"graph","created_at":"2026-05-18T04:19:02Z","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":"Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problems, such as verification, planning and design. Despite its importance, little is known of the ultimate strengths and limitations of the technique. This paper presents the first precise characterization of clause learning as a proof system (CL), and begins the task of understanding its power by relating it to the well-studied resolution proof system. In particular, we show that with a new learning scheme, CL can provide e","authors_text":"A. Sabharwal, H. Kautz, P. Beame","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:39:28Z","title":"Towards Understanding and Harnessing the Potential of Clause Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0044","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:a843c034e78d0345f803345fe322707f082dbb6f7aa03b1e5eb9a0688ccb3323","target":"record","created_at":"2026-05-18T04:19:02Z","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":"dbc4639d7532dc087b0e70074c88a0761103f63541229a4498969f463d1e9f5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:39:28Z","title_canon_sha256":"6198eab26cbe09b6f9949356f8adbab9077d46b9947069d393ff1740c559d121"},"schema_version":"1.0","source":{"id":"1107.0044","kind":"arxiv","version":1}},"canonical_sha256":"60fd9fbc8562fc854612ea45d80f6722d6b1258af47dfc8ecacf45d6788c176a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60fd9fbc8562fc854612ea45d80f6722d6b1258af47dfc8ecacf45d6788c176a","first_computed_at":"2026-05-18T04:19:02.827559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:02.827559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oavpVT6262365kXqqGj/gmIXxavQnzRs67QxB1sVBVI+Wgok/U70uLSkwtr3yl1AGcxsK5npW8efQwiGjiW/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:02.828125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a843c034e78d0345f803345fe322707f082dbb6f7aa03b1e5eb9a0688ccb3323","sha256:23b42a13b235291c4cbd9a371bf1645fa59b93cc6ab3d391f9f596df566a5146"],"state_sha256":"95ff9d98e5b24172a85fd031c6d2d373ee8d2d7a6d51963fa194513cd29427f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJTDzkwURa0J+qEZllQQ9NsDXd3ssx2VfjxwWZh4zQbpxEzqSqAVpSnTfispLVncRxCCdlCaF4WWDNsf+6YPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T16:27:35.730968Z","bundle_sha256":"dc313b842243443f5f06349c92fb2ab4d3fd436b56eb5a8ed4364404e89b97ce"}}