{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QDKJVW4M4G2THNQ7UDMHOQNLNW","short_pith_number":"pith:QDKJVW4M","canonical_record":{"source":{"id":"1208.2469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-08-12T22:22:06Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"79db38fb7e0bf7a4db115ed496f382ebb0f86c09ca9735da26e61360e0053c45","abstract_canon_sha256":"69a8449a4cf3c2fea8b1b5161e778eb849573f8337175836d8041a5c3208b472"},"schema_version":"1.0"},"canonical_sha256":"80d49adb8ce1b533b61fa0d87741ab6db4d78d8c903f5df8b7b66bb2c90f6efe","source":{"kind":"arxiv","id":"1208.2469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2469","created_at":"2026-05-18T03:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2469v1","created_at":"2026-05-18T03:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2469","created_at":"2026-05-18T03:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"QDKJVW4M4G2T","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QDKJVW4M4G2THNQ7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QDKJVW4M","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QDKJVW4M4G2THNQ7UDMHOQNLNW","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-08-12T22:22:06Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"79db38fb7e0bf7a4db115ed496f382ebb0f86c09ca9735da26e61360e0053c45","abstract_canon_sha256":"69a8449a4cf3c2fea8b1b5161e778eb849573f8337175836d8041a5c3208b472"},"schema_version":"1.0"},"canonical_sha256":"80d49adb8ce1b533b61fa0d87741ab6db4d78d8c903f5df8b7b66bb2c90f6efe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:57.792782Z","signature_b64":"JZn7BdDBb7qCXceqnQKPuY7Hb7mS3c04LuqVLJZWb5xcuzt7xSt9dew++kjAdvaWVyi8KTqy/rg9CSUZeRhRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80d49adb8ce1b533b61fa0d87741ab6db4d78d8c903f5df8b7b66bb2c90f6efe","last_reissued_at":"2026-05-18T03:48:57.792057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:57.792057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2469","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:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G8cF4SB0zC4jqtsGnCQe5KkJ5UKzSA/ImPCDb8pY/QDGpiUAfS6w2GeSMZBMrmyrWJIvpg0eUR+Vsy7FdtPOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:08:50.263274Z"},"content_sha256":"b260a76c7978544e293b3d949806f41089c79ffc7a39f2f3423c838983b1fc87","schema_version":"1.0","event_id":"sha256:b260a76c7978544e293b3d949806f41089c79ffc7a39f2f3423c838983b1fc87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QDKJVW4M4G2THNQ7UDMHOQNLNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Separations of Regular Resolution from Clause Learning Proof Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Jan Johannsen, Maria Luisa Bonet, Sam Buss","submitted_at":"2012-08-12T22:22:06Z","abstract_excerpt":"We prove that the graph tautology formulas of Alekhnovich, Johannsen, Pitassi, and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses and without degenerate resolution inferences. We also prove that these graph tautology formulas can be refuted by polynomial size DPLL proofs with clause learning, even when restricted to greedy, unit-propagating DPLL search. We prove similar results for the guarded, xor-fied pebbling tautologies which Urquhart proved are hard for regular resolution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2469","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:48:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M4Kl8cQFgkZswV0TL9hOs6uZZoI6aIeQAJ1p0qT2yVjozYqxO56Ci04Rz+nGQjA14wkk4lTSl464SPnnlcEdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:08:50.263634Z"},"content_sha256":"a84bbf03106c01a4134ea1364b666d8d8bd472839e12221a7e459b7b9132a6a4","schema_version":"1.0","event_id":"sha256:a84bbf03106c01a4134ea1364b666d8d8bd472839e12221a7e459b7b9132a6a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDKJVW4M4G2THNQ7UDMHOQNLNW/bundle.json","state_url":"https://pith.science/pith/QDKJVW4M4G2THNQ7UDMHOQNLNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDKJVW4M4G2THNQ7UDMHOQNLNW/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-25T12:08:50Z","links":{"resolver":"https://pith.science/pith/QDKJVW4M4G2THNQ7UDMHOQNLNW","bundle":"https://pith.science/pith/QDKJVW4M4G2THNQ7UDMHOQNLNW/bundle.json","state":"https://pith.science/pith/QDKJVW4M4G2THNQ7UDMHOQNLNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDKJVW4M4G2THNQ7UDMHOQNLNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QDKJVW4M4G2THNQ7UDMHOQNLNW","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":"69a8449a4cf3c2fea8b1b5161e778eb849573f8337175836d8041a5c3208b472","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-08-12T22:22:06Z","title_canon_sha256":"79db38fb7e0bf7a4db115ed496f382ebb0f86c09ca9735da26e61360e0053c45"},"schema_version":"1.0","source":{"id":"1208.2469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2469","created_at":"2026-05-18T03:48:57Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2469v1","created_at":"2026-05-18T03:48:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2469","created_at":"2026-05-18T03:48:57Z"},{"alias_kind":"pith_short_12","alias_value":"QDKJVW4M4G2T","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QDKJVW4M4G2THNQ7","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QDKJVW4M","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:a84bbf03106c01a4134ea1364b666d8d8bd472839e12221a7e459b7b9132a6a4","target":"graph","created_at":"2026-05-18T03:48:57Z","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":"We prove that the graph tautology formulas of Alekhnovich, Johannsen, Pitassi, and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses and without degenerate resolution inferences. We also prove that these graph tautology formulas can be refuted by polynomial size DPLL proofs with clause learning, even when restricted to greedy, unit-propagating DPLL search. We prove similar results for the guarded, xor-fied pebbling tautologies which Urquhart proved are hard for regular resolution.","authors_text":"Jan Johannsen, Maria Luisa Bonet, Sam Buss","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-08-12T22:22:06Z","title":"Improved Separations of Regular Resolution from Clause Learning Proof Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2469","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:b260a76c7978544e293b3d949806f41089c79ffc7a39f2f3423c838983b1fc87","target":"record","created_at":"2026-05-18T03:48:57Z","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":"69a8449a4cf3c2fea8b1b5161e778eb849573f8337175836d8041a5c3208b472","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-08-12T22:22:06Z","title_canon_sha256":"79db38fb7e0bf7a4db115ed496f382ebb0f86c09ca9735da26e61360e0053c45"},"schema_version":"1.0","source":{"id":"1208.2469","kind":"arxiv","version":1}},"canonical_sha256":"80d49adb8ce1b533b61fa0d87741ab6db4d78d8c903f5df8b7b66bb2c90f6efe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80d49adb8ce1b533b61fa0d87741ab6db4d78d8c903f5df8b7b66bb2c90f6efe","first_computed_at":"2026-05-18T03:48:57.792057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:57.792057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JZn7BdDBb7qCXceqnQKPuY7Hb7mS3c04LuqVLJZWb5xcuzt7xSt9dew++kjAdvaWVyi8KTqy/rg9CSUZeRhRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:57.792782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b260a76c7978544e293b3d949806f41089c79ffc7a39f2f3423c838983b1fc87","sha256:a84bbf03106c01a4134ea1364b666d8d8bd472839e12221a7e459b7b9132a6a4"],"state_sha256":"7801ec49fcc06c538c5378054fcc989ef40d4129017c1b14c1121bc088dd421d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwjbaCiRH0tBR60VxyyAho2OQT0dYOcGsJBlERZsl1f/O8JS7EkBxjlafHoAbg/dK76SKMwN03FraTAdF1jOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:08:50.265639Z","bundle_sha256":"17e6e02d06f2df0f6c96424f53e29d049e9a63b296bce17ae42d29a283d1ab9b"}}