{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:LRWXHJ5QSDO72JVQBEUMC27EX4","short_pith_number":"pith:LRWXHJ5Q","canonical_record":{"source":{"id":"0811.1075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-11-07T15:31:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"694f52abacf2a205a69d844db2cf6ca32b6305edcfc83d3b6d6740b7dd644f25","abstract_canon_sha256":"63c896491ed025a3ffc7da088dd81b3664efd4365bebf715a2ea8c968f842cd9"},"schema_version":"1.0"},"canonical_sha256":"5c6d73a7b090ddfd26b00928c16be4bf190ace05f886db2f07ddf70373b34927","source":{"kind":"arxiv","id":"0811.1075","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.1075","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0811.1075v2","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1075","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"LRWXHJ5QSDO7","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LRWXHJ5QSDO72JVQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LRWXHJ5Q","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:LRWXHJ5QSDO72JVQBEUMC27EX4","target":"record","payload":{"canonical_record":{"source":{"id":"0811.1075","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-11-07T15:31:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"694f52abacf2a205a69d844db2cf6ca32b6305edcfc83d3b6d6740b7dd644f25","abstract_canon_sha256":"63c896491ed025a3ffc7da088dd81b3664efd4365bebf715a2ea8c968f842cd9"},"schema_version":"1.0"},"canonical_sha256":"5c6d73a7b090ddfd26b00928c16be4bf190ace05f886db2f07ddf70373b34927","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.656593Z","signature_b64":"8ZIbEtuk8ALlllkVpUFZl/V5KXEDd/cchMM/IOKcuBCa7vP0u7S/9fYokNmG4ZqC2quYXuUw8Ts8PN3FDchGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c6d73a7b090ddfd26b00928c16be4bf190ace05f886db2f07ddf70373b34927","last_reissued_at":"2026-05-18T01:37:40.656030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.656030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.1075","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-18T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vfaM/FbYGWxqtFl6A4jtHcPi0Qhzn71pb3RfljnNyjNgdgYtJ/LwSIY+xOjOhiLjVpD4ge7WDB2wYV/PKumCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:48:33.883260Z"},"content_sha256":"c29a18c7870650a5238d56e06c125170c99764d4aff39ddce4b883132f38f913","schema_version":"1.0","event_id":"sha256:c29a18c7870650a5238d56e06c125170c99764d4aff39ddce4b883132f38f913"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:LRWXHJ5QSDO72JVQBEUMC27EX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Jan Hoffmann, Jan Johannsen, Samuel R. Buss","submitted_at":"2008-11-07T15:31:58Z","abstract_excerpt":"Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there is no regularity condition. For regular proofs, an exponential separation between regular dag-like resolution and both regular WRTL and regular WRTI is given.\n  It is proved that DLL proof search algorithms that use clause learning based on unit propagation can be polynomially simulated by regular WRTI. More generally, non-greedy DLL algorithms with learning by unit propagation are equivalent to regular WRTI. A gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.1075","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-18T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axHn5OFREza8qrpuewS0SP0M9tFbsCyWTIXqAwZTsPGLnqK6Yord6P3dabwMqa88/oOOJxTjtkWTqhYR7f2vBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:48:33.883609Z"},"content_sha256":"1ef7f71c396dc185e4354ccf93aa36a4f704612c647b1cef341ebb40fceb3587","schema_version":"1.0","event_id":"sha256:1ef7f71c396dc185e4354ccf93aa36a4f704612c647b1cef341ebb40fceb3587"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LRWXHJ5QSDO72JVQBEUMC27EX4/bundle.json","state_url":"https://pith.science/pith/LRWXHJ5QSDO72JVQBEUMC27EX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LRWXHJ5QSDO72JVQBEUMC27EX4/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-25T09:48:33Z","links":{"resolver":"https://pith.science/pith/LRWXHJ5QSDO72JVQBEUMC27EX4","bundle":"https://pith.science/pith/LRWXHJ5QSDO72JVQBEUMC27EX4/bundle.json","state":"https://pith.science/pith/LRWXHJ5QSDO72JVQBEUMC27EX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LRWXHJ5QSDO72JVQBEUMC27EX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:LRWXHJ5QSDO72JVQBEUMC27EX4","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":"63c896491ed025a3ffc7da088dd81b3664efd4365bebf715a2ea8c968f842cd9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-11-07T15:31:58Z","title_canon_sha256":"694f52abacf2a205a69d844db2cf6ca32b6305edcfc83d3b6d6740b7dd644f25"},"schema_version":"1.0","source":{"id":"0811.1075","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.1075","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0811.1075v2","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.1075","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"LRWXHJ5QSDO7","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"LRWXHJ5QSDO72JVQ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"LRWXHJ5Q","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:1ef7f71c396dc185e4354ccf93aa36a4f704612c647b1cef341ebb40fceb3587","target":"graph","created_at":"2026-05-18T01:37:40Z","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":"Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there is no regularity condition. For regular proofs, an exponential separation between regular dag-like resolution and both regular WRTL and regular WRTI is given.\n  It is proved that DLL proof search algorithms that use clause learning based on unit propagation can be polynomially simulated by regular WRTI. More generally, non-greedy DLL algorithms with learning by unit propagation are equivalent to regular WRTI. A gener","authors_text":"Jan Hoffmann, Jan Johannsen, Samuel R. Buss","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-11-07T15:31:58Z","title":"Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.1075","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:c29a18c7870650a5238d56e06c125170c99764d4aff39ddce4b883132f38f913","target":"record","created_at":"2026-05-18T01:37:40Z","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":"63c896491ed025a3ffc7da088dd81b3664efd4365bebf715a2ea8c968f842cd9","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-11-07T15:31:58Z","title_canon_sha256":"694f52abacf2a205a69d844db2cf6ca32b6305edcfc83d3b6d6740b7dd644f25"},"schema_version":"1.0","source":{"id":"0811.1075","kind":"arxiv","version":2}},"canonical_sha256":"5c6d73a7b090ddfd26b00928c16be4bf190ace05f886db2f07ddf70373b34927","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c6d73a7b090ddfd26b00928c16be4bf190ace05f886db2f07ddf70373b34927","first_computed_at":"2026-05-18T01:37:40.656030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:40.656030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ZIbEtuk8ALlllkVpUFZl/V5KXEDd/cchMM/IOKcuBCa7vP0u7S/9fYokNmG4ZqC2quYXuUw8Ts8PN3FDchGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:40.656593Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.1075","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c29a18c7870650a5238d56e06c125170c99764d4aff39ddce4b883132f38f913","sha256:1ef7f71c396dc185e4354ccf93aa36a4f704612c647b1cef341ebb40fceb3587"],"state_sha256":"70f4e4d013539ca9a4061a7d6241c0970160c6bf0c5546c58b49f44bdc7ab4ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4U7l1jRzGvv2ERzt6f+VEF1iWY6AfB38ndVjGUOH7NXw4MDDTy5OGKBGBfqM2v3CxLVBmnitLjX1XnzjIYuTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:48:33.885486Z","bundle_sha256":"9843a38cdf11524ed572eb7b58a434c986f397e01bb3d998a2b3b283c3353ec8"}}