{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EEN4SFUOBQCWPK3TCBOJAJBH6S","short_pith_number":"pith:EEN4SFUO","schema_version":"1.0","canonical_sha256":"211bc9168e0c0567ab73105c902427f48907ed1040f7747710e6f3fde7c4a3c5","source":{"kind":"arxiv","id":"1404.3820","version":1},"attestation_state":"computed","paper":{"title":"Circuit complexity, proof complexity, and polynomial identity testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.LO"],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow, Toniann Pitassi","submitted_at":"2014-04-15T05:54:46Z","abstract_excerpt":"We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent does not have polynomial-size algebraic circuits (VNP is not equal to VP). As a corollary to the proof, we also show that super-polynomial lower bounds on the number of lines in Polynomial Calculus proofs (as opposed to the usual measure of number of monomials) imply the Permanent versus Determinant Conjecture. Note that, prior to our work, there was no proof"},"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":"1404.3820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-04-15T05:54:46Z","cross_cats_sorted":["cs.LO","math.LO"],"title_canon_sha256":"700109dadcc4dc882b5c4397ee6be634a87a43e3b63fc9fe2c22eca98d5738ed","abstract_canon_sha256":"5ef800c574da72831b3b07bdb1272d7dccc4a8e98bf097f0f3395b4be4f5d2f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:13.546281Z","signature_b64":"pS/fjzNy2hamxPeR+6ZoFhGy+HKWJP9JxuBh8iJMZMf26PSRJ2cSz1idmWLY0atVC2Qmre8ImDubBajhM12ZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"211bc9168e0c0567ab73105c902427f48907ed1040f7747710e6f3fde7c4a3c5","last_reissued_at":"2026-05-18T02:54:13.545722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:13.545722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuit complexity, proof complexity, and polynomial identity testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.LO"],"primary_cat":"cs.CC","authors_text":"Joshua A. Grochow, Toniann Pitassi","submitted_at":"2014-04-15T05:54:46Z","abstract_excerpt":"We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent does not have polynomial-size algebraic circuits (VNP is not equal to VP). As a corollary to the proof, we also show that super-polynomial lower bounds on the number of lines in Polynomial Calculus proofs (as opposed to the usual measure of number of monomials) imply the Permanent versus Determinant Conjecture. Note that, prior to our work, there was no proof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3820","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":"1404.3820","created_at":"2026-05-18T02:54:13.545808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3820v1","created_at":"2026-05-18T02:54:13.545808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3820","created_at":"2026-05-18T02:54:13.545808+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEN4SFUOBQCW","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEN4SFUOBQCWPK3T","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEN4SFUO","created_at":"2026-05-18T12:28:25.294606+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/EEN4SFUOBQCWPK3TCBOJAJBH6S","json":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S.json","graph_json":"https://pith.science/api/pith-number/EEN4SFUOBQCWPK3TCBOJAJBH6S/graph.json","events_json":"https://pith.science/api/pith-number/EEN4SFUOBQCWPK3TCBOJAJBH6S/events.json","paper":"https://pith.science/paper/EEN4SFUO"},"agent_actions":{"view_html":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S","download_json":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S.json","view_paper":"https://pith.science/paper/EEN4SFUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3820&json=true","fetch_graph":"https://pith.science/api/pith-number/EEN4SFUOBQCWPK3TCBOJAJBH6S/graph.json","fetch_events":"https://pith.science/api/pith-number/EEN4SFUOBQCWPK3TCBOJAJBH6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S/action/storage_attestation","attest_author":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S/action/author_attestation","sign_citation":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S/action/citation_signature","submit_replication":"https://pith.science/pith/EEN4SFUOBQCWPK3TCBOJAJBH6S/action/replication_record"}},"created_at":"2026-05-18T02:54:13.545808+00:00","updated_at":"2026-05-18T02:54:13.545808+00:00"}