{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GXJAESPLW35YFLVGA4ZGEWMBMS","short_pith_number":"pith:GXJAESPL","canonical_record":{"source":{"id":"1212.1789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-12-08T13:23:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"55dd1548d17852242177a30600c0557d5a594ee92d06efd454381f27f234b904","abstract_canon_sha256":"b9035e51c5e92c3b8e1bc7d33f669c0b96f081e658101749f30114b1fc7831bb"},"schema_version":"1.0"},"canonical_sha256":"35d20249ebb6fb82aea6073262598164b065ef7bf5fbd877c44790cf1bf2bd4e","source":{"kind":"arxiv","id":"1212.1789","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1789","created_at":"2026-05-18T01:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1789v2","created_at":"2026-05-18T01:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1789","created_at":"2026-05-18T01:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"GXJAESPLW35Y","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GXJAESPLW35YFLVG","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GXJAESPL","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GXJAESPLW35YFLVGA4ZGEWMBMS","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-12-08T13:23:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"55dd1548d17852242177a30600c0557d5a594ee92d06efd454381f27f234b904","abstract_canon_sha256":"b9035e51c5e92c3b8e1bc7d33f669c0b96f081e658101749f30114b1fc7831bb"},"schema_version":"1.0"},"canonical_sha256":"35d20249ebb6fb82aea6073262598164b065ef7bf5fbd877c44790cf1bf2bd4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:27.961949Z","signature_b64":"IGQni11MYw4rZgBqPsf4ilwEFzxEErFMokqgLlOvt3NI7+9Xlz4YyouUHIPpTLCafVv5AHW+4en+R6nbkrTNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35d20249ebb6fb82aea6073262598164b065ef7bf5fbd877c44790cf1bf2bd4e","last_reissued_at":"2026-05-18T01:16:27.961499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:27.961499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1789","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:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dBgP2wAAO8wCMwzh1P/rOJBwDsf/jBSu5UHISW6GkAT3jClbz5ocflCm2XPejnCy0aGtAPkfEEdvGqkEjpBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:32.646271Z"},"content_sha256":"6de89d1cc0d1048fd0af7870901c588220021e6d5a5c37a6ebcaedcd6bfc1584","schema_version":"1.0","event_id":"sha256:6de89d1cc0d1048fd0af7870901c588220021e6d5a5c37a6ebcaedcd6bfc1584"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GXJAESPLW35YFLVGA4ZGEWMBMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the computational complexity of finding hard tautologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Jan Krajicek","submitted_at":"2012-12-08T13:23:20Z","abstract_excerpt":"It is well-known (cf. K.-Pudl\\'ak 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system $P$ exists iff $P$ is not optimal. Such an algorithm takes $1^{(k)}$ and outputs a tautology $\\tau_k$ of size at least $k$ such that $P$ is not p-bounded on the set of all $\\tau_k$'s.\n  We consider two more general search problems involving finding a hard formula, {\\bf Cert} and {\\bf Find}, motivated by two hypothetical situations: that one can prove that $\\np \\neq co\\np$ and that no optimal proof system exists. In {\\bf Cert} one is asked to find a witness that a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1789","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:16:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8529+iuXQuJ0hgOC0u6WTvkTq6PmMRyOyWTaMp90VY37svIJWFwnqFi7R4gvSN7uVue/2YCD3VUj49SsodBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:32.646650Z"},"content_sha256":"8a977834de35a77908ddfbfcc9ce28d1c3d3d5f19fdca73d2296bdff8ac1988d","schema_version":"1.0","event_id":"sha256:8a977834de35a77908ddfbfcc9ce28d1c3d3d5f19fdca73d2296bdff8ac1988d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXJAESPLW35YFLVGA4ZGEWMBMS/bundle.json","state_url":"https://pith.science/pith/GXJAESPLW35YFLVGA4ZGEWMBMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXJAESPLW35YFLVGA4ZGEWMBMS/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-01T06:22:32Z","links":{"resolver":"https://pith.science/pith/GXJAESPLW35YFLVGA4ZGEWMBMS","bundle":"https://pith.science/pith/GXJAESPLW35YFLVGA4ZGEWMBMS/bundle.json","state":"https://pith.science/pith/GXJAESPLW35YFLVGA4ZGEWMBMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXJAESPLW35YFLVGA4ZGEWMBMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GXJAESPLW35YFLVGA4ZGEWMBMS","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":"b9035e51c5e92c3b8e1bc7d33f669c0b96f081e658101749f30114b1fc7831bb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-12-08T13:23:20Z","title_canon_sha256":"55dd1548d17852242177a30600c0557d5a594ee92d06efd454381f27f234b904"},"schema_version":"1.0","source":{"id":"1212.1789","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1789","created_at":"2026-05-18T01:16:27Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1789v2","created_at":"2026-05-18T01:16:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1789","created_at":"2026-05-18T01:16:27Z"},{"alias_kind":"pith_short_12","alias_value":"GXJAESPLW35Y","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GXJAESPLW35YFLVG","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GXJAESPL","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:8a977834de35a77908ddfbfcc9ce28d1c3d3d5f19fdca73d2296bdff8ac1988d","target":"graph","created_at":"2026-05-18T01:16:27Z","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":"It is well-known (cf. K.-Pudl\\'ak 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system $P$ exists iff $P$ is not optimal. Such an algorithm takes $1^{(k)}$ and outputs a tautology $\\tau_k$ of size at least $k$ such that $P$ is not p-bounded on the set of all $\\tau_k$'s.\n  We consider two more general search problems involving finding a hard formula, {\\bf Cert} and {\\bf Find}, motivated by two hypothetical situations: that one can prove that $\\np \\neq co\\np$ and that no optimal proof system exists. In {\\bf Cert} one is asked to find a witness that a g","authors_text":"Jan Krajicek","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-12-08T13:23:20Z","title":"On the computational complexity of finding hard tautologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1789","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:6de89d1cc0d1048fd0af7870901c588220021e6d5a5c37a6ebcaedcd6bfc1584","target":"record","created_at":"2026-05-18T01:16:27Z","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":"b9035e51c5e92c3b8e1bc7d33f669c0b96f081e658101749f30114b1fc7831bb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-12-08T13:23:20Z","title_canon_sha256":"55dd1548d17852242177a30600c0557d5a594ee92d06efd454381f27f234b904"},"schema_version":"1.0","source":{"id":"1212.1789","kind":"arxiv","version":2}},"canonical_sha256":"35d20249ebb6fb82aea6073262598164b065ef7bf5fbd877c44790cf1bf2bd4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35d20249ebb6fb82aea6073262598164b065ef7bf5fbd877c44790cf1bf2bd4e","first_computed_at":"2026-05-18T01:16:27.961499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:27.961499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IGQni11MYw4rZgBqPsf4ilwEFzxEErFMokqgLlOvt3NI7+9Xlz4YyouUHIPpTLCafVv5AHW+4en+R6nbkrTNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:27.961949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1789","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6de89d1cc0d1048fd0af7870901c588220021e6d5a5c37a6ebcaedcd6bfc1584","sha256:8a977834de35a77908ddfbfcc9ce28d1c3d3d5f19fdca73d2296bdff8ac1988d"],"state_sha256":"39fbb87faf1a94f0390ccc59f4e2939569ff604b3318db2c6a51e0432f4b316a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+XjJVSfsu0j3dGQmTRlGnQFWL4BrNBmdErr/ft8Elt7dQUElBX456VAk7LYvVyAL+lftpW8GQurjO/TRrwkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:22:32.648999Z","bundle_sha256":"bcd6aaeaa4ad905a129f43ebad6ddb60d75be33cfea38c4a1706a91db6943f51"}}