{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:US6J6GKUPDJ2GE52HPXVWJV6YB","short_pith_number":"pith:US6J6GKU","schema_version":"1.0","canonical_sha256":"a4bc9f195478d3a313ba3bef5b26bec04543e981e11fc464ad26ac243fca3f56","source":{"kind":"arxiv","id":"1605.00263","version":3},"attestation_state":"computed","paper":{"title":"Unprovability of circuit upper bounds in Cook's theory PV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Igor C. Oliveira, Jan Krajicek","submitted_at":"2016-05-01T15:11:04Z","abstract_excerpt":"We establish unconditionally that for every integer $k \\geq 1$ there is a language $L \\in \\mbox{P}$ such that it is consistent with Cook's theory PV that $L \\notin Size(n^k)$. Our argument is non-constructive and does not provide an explicit description of this language."},"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":"1605.00263","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-05-01T15:11:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"04ba4b2c1393c3f29a1988b021ecf39ead664f3554b1cf49edca2224f61f5e1e","abstract_canon_sha256":"d8ee1359375ba64161b09bad6945bf0bec3c19ebbb153a9ce97d62c92c0e20ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:47.707975Z","signature_b64":"oyTtpHodj8aiYOa/G5Kp/Q1lFRYC6FS3dt8tVhrzzSNQvnHQg6G7VQJ5fmbnjA6hx3/jnGWQDOXhF1uIlcLiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4bc9f195478d3a313ba3bef5b26bec04543e981e11fc464ad26ac243fca3f56","last_reissued_at":"2026-05-18T00:50:47.707376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:47.707376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unprovability of circuit upper bounds in Cook's theory PV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Igor C. Oliveira, Jan Krajicek","submitted_at":"2016-05-01T15:11:04Z","abstract_excerpt":"We establish unconditionally that for every integer $k \\geq 1$ there is a language $L \\in \\mbox{P}$ such that it is consistent with Cook's theory PV that $L \\notin Size(n^k)$. Our argument is non-constructive and does not provide an explicit description of this language."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00263","kind":"arxiv","version":3},"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":"1605.00263","created_at":"2026-05-18T00:50:47.707468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00263v3","created_at":"2026-05-18T00:50:47.707468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00263","created_at":"2026-05-18T00:50:47.707468+00:00"},{"alias_kind":"pith_short_12","alias_value":"US6J6GKUPDJ2","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"US6J6GKUPDJ2GE52","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"US6J6GKU","created_at":"2026-05-18T12:30:46.583412+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/US6J6GKUPDJ2GE52HPXVWJV6YB","json":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB.json","graph_json":"https://pith.science/api/pith-number/US6J6GKUPDJ2GE52HPXVWJV6YB/graph.json","events_json":"https://pith.science/api/pith-number/US6J6GKUPDJ2GE52HPXVWJV6YB/events.json","paper":"https://pith.science/paper/US6J6GKU"},"agent_actions":{"view_html":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB","download_json":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB.json","view_paper":"https://pith.science/paper/US6J6GKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00263&json=true","fetch_graph":"https://pith.science/api/pith-number/US6J6GKUPDJ2GE52HPXVWJV6YB/graph.json","fetch_events":"https://pith.science/api/pith-number/US6J6GKUPDJ2GE52HPXVWJV6YB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB/action/storage_attestation","attest_author":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB/action/author_attestation","sign_citation":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB/action/citation_signature","submit_replication":"https://pith.science/pith/US6J6GKUPDJ2GE52HPXVWJV6YB/action/replication_record"}},"created_at":"2026-05-18T00:50:47.707468+00:00","updated_at":"2026-05-18T00:50:47.707468+00:00"}