{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WO54QOFUVDYU5D7NJL5QDXF2HA","short_pith_number":"pith:WO54QOFU","schema_version":"1.0","canonical_sha256":"b3bbc838b4a8f14e8fed4afb01dcba381b5fde8421ffe680262a9d43b3f6f479","source":{"kind":"arxiv","id":"1509.03048","version":1},"attestation_state":"computed","paper":{"title":"Consistency of circuit evaluation, extended resolution and total NP search problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Jan Krajicek","submitted_at":"2015-09-10T07:49:05Z","abstract_excerpt":"We consider sets $\\Gamma(n,s,k)$ of narrow clauses expressing that no definition of a size $s$ circuit with $n$ inputs is refutable in resolution R in $k$ steps. We show that every CNF shortly refutable in Extended R, ER, can be easily reduced to an instance of $\\Gamma(0,s,k)$ (with $s,k$ depending on the size of the ER-refutation) and, in particular, that $\\Gamma(0,s,k)$ when interpreted as a relativized NP search problem is complete among all such problems provably total in bounded arithmetic theory $V^1_1$.\n  We use the ideas of implicit proofs to define from $\\Gamma(0,s,k)$ a non-relativiz"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.03048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-09-10T07:49:05Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"5462524d00f5c24e23510b67ba95f158ffe84e76c77dadf3cd785808bc7464de","abstract_canon_sha256":"ce1d19613eb2995e7c1dbe9ae3b120c80c16384e88b5cc1a519aa0dddade940a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:55.056559Z","signature_b64":"l+T9rUSWA9OA0V+og5nHo6dOY054sBb9vMOVwqjXEtQEW7ni0tIdrGa8QM5mbznGWVf8unIdadZbyl/VtYJDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3bbc838b4a8f14e8fed4afb01dcba381b5fde8421ffe680262a9d43b3f6f479","last_reissued_at":"2026-05-18T01:11:55.056163Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:55.056163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistency of circuit evaluation, extended resolution and total NP search problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Jan Krajicek","submitted_at":"2015-09-10T07:49:05Z","abstract_excerpt":"We consider sets $\\Gamma(n,s,k)$ of narrow clauses expressing that no definition of a size $s$ circuit with $n$ inputs is refutable in resolution R in $k$ steps. We show that every CNF shortly refutable in Extended R, ER, can be easily reduced to an instance of $\\Gamma(0,s,k)$ (with $s,k$ depending on the size of the ER-refutation) and, in particular, that $\\Gamma(0,s,k)$ when interpreted as a relativized NP search problem is complete among all such problems provably total in bounded arithmetic theory $V^1_1$.\n  We use the ideas of implicit proofs to define from $\\Gamma(0,s,k)$ a non-relativiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03048","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.03048","created_at":"2026-05-18T01:11:55.056226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03048v1","created_at":"2026-05-18T01:11:55.056226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03048","created_at":"2026-05-18T01:11:55.056226+00:00"},{"alias_kind":"pith_short_12","alias_value":"WO54QOFUVDYU","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WO54QOFUVDYU5D7N","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WO54QOFU","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA","json":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA.json","graph_json":"https://pith.science/api/pith-number/WO54QOFUVDYU5D7NJL5QDXF2HA/graph.json","events_json":"https://pith.science/api/pith-number/WO54QOFUVDYU5D7NJL5QDXF2HA/events.json","paper":"https://pith.science/paper/WO54QOFU"},"agent_actions":{"view_html":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA","download_json":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA.json","view_paper":"https://pith.science/paper/WO54QOFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03048&json=true","fetch_graph":"https://pith.science/api/pith-number/WO54QOFUVDYU5D7NJL5QDXF2HA/graph.json","fetch_events":"https://pith.science/api/pith-number/WO54QOFUVDYU5D7NJL5QDXF2HA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA/action/storage_attestation","attest_author":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA/action/author_attestation","sign_citation":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA/action/citation_signature","submit_replication":"https://pith.science/pith/WO54QOFUVDYU5D7NJL5QDXF2HA/action/replication_record"}},"created_at":"2026-05-18T01:11:55.056226+00:00","updated_at":"2026-05-18T01:11:55.056226+00:00"}