{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y474WR53YF45NLRL2GDMZWLZ2H","short_pith_number":"pith:Y474WR53","schema_version":"1.0","canonical_sha256":"c73fcb47bbc179d6ae2bd186ccd979d1e70ad2a8a2d6a9ffefd1bcf7cef34fbe","source":{"kind":"arxiv","id":"1308.1640","version":4},"attestation_state":"computed","paper":{"title":"Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Partha Mukhopadhyay, Suryajith Chillara","submitted_at":"2013-08-07T17:21:16Z","abstract_excerpt":"Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\\sqrt{n}\\log n)}. So to prove VP not equal to VNP, it is sufficient to show that an explicit polynomial in VNP of degree n requires 2^{\\omega(\\sqrt{n}\\log n)} size depth-4 circuits. Soon after Tavenas's result, for two different explicit polynomials, depth-4 circuit size lower bounds of 2^{\\Omega(\\sqrt{n}\\log n)} have been proved Kayal et al. and Fournier et al. In particular, using combinatorial design Kayal et al.\\ construct an explicit polynomial in VNP that "},"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":"1308.1640","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T17:21:16Z","cross_cats_sorted":[],"title_canon_sha256":"4ce79e55e5ded3b60dd8c6980eb54f65658481f168d758ffd933fb306a6af2ae","abstract_canon_sha256":"dd306cbe352295aa3719a094b8aaa01455c73f5e544ae4adba17b6dced61ea58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:03.636496Z","signature_b64":"p24a4hG+xO9YHjFjkEhCePSYFo+erOq1n+nLogGbnpLRT5KJNZURF3eaDy1L+/fAvv3MFZ9oKfEWAcLDek3zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c73fcb47bbc179d6ae2bd186ccd979d1e70ad2a8a2d6a9ffefd1bcf7cef34fbe","last_reissued_at":"2026-05-18T03:07:03.635913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:03.635913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Partha Mukhopadhyay, Suryajith Chillara","submitted_at":"2013-08-07T17:21:16Z","abstract_excerpt":"Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\\sqrt{n}\\log n)}. So to prove VP not equal to VNP, it is sufficient to show that an explicit polynomial in VNP of degree n requires 2^{\\omega(\\sqrt{n}\\log n)} size depth-4 circuits. Soon after Tavenas's result, for two different explicit polynomials, depth-4 circuit size lower bounds of 2^{\\Omega(\\sqrt{n}\\log n)} have been proved Kayal et al. and Fournier et al. In particular, using combinatorial design Kayal et al.\\ construct an explicit polynomial in VNP that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1640","kind":"arxiv","version":4},"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":"1308.1640","created_at":"2026-05-18T03:07:03.635988+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1640v4","created_at":"2026-05-18T03:07:03.635988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1640","created_at":"2026-05-18T03:07:03.635988+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y474WR53YF45","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y474WR53YF45NLRL","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y474WR53","created_at":"2026-05-18T12:28:06.772260+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/Y474WR53YF45NLRL2GDMZWLZ2H","json":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H.json","graph_json":"https://pith.science/api/pith-number/Y474WR53YF45NLRL2GDMZWLZ2H/graph.json","events_json":"https://pith.science/api/pith-number/Y474WR53YF45NLRL2GDMZWLZ2H/events.json","paper":"https://pith.science/paper/Y474WR53"},"agent_actions":{"view_html":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H","download_json":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H.json","view_paper":"https://pith.science/paper/Y474WR53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1640&json=true","fetch_graph":"https://pith.science/api/pith-number/Y474WR53YF45NLRL2GDMZWLZ2H/graph.json","fetch_events":"https://pith.science/api/pith-number/Y474WR53YF45NLRL2GDMZWLZ2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/action/storage_attestation","attest_author":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/action/author_attestation","sign_citation":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/action/citation_signature","submit_replication":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/action/replication_record"}},"created_at":"2026-05-18T03:07:03.635988+00:00","updated_at":"2026-05-18T03:07:03.635988+00:00"}