{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Y474WR53YF45NLRL2GDMZWLZ2H","short_pith_number":"pith:Y474WR53","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"},"canonical_sha256":"c73fcb47bbc179d6ae2bd186ccd979d1e70ad2a8a2d6a9ffefd1bcf7cef34fbe","source":{"kind":"arxiv","id":"1308.1640","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1640","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1640v4","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1640","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"Y474WR53YF45","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y474WR53YF45NLRL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y474WR53","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Y474WR53YF45NLRL2GDMZWLZ2H","target":"record","payload":{"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"},"canonical_sha256":"c73fcb47bbc179d6ae2bd186ccd979d1e70ad2a8a2d6a9ffefd1bcf7cef34fbe","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"},"source_kind":"arxiv","source_id":"1308.1640","source_version":4,"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-18T03:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jwRljCqa+PM8Jk8HuBwJfFEfyz+j0mLckL+4l6B2Of0Loos5zfd4m4+QRHyF8F5Vck6B7T/J023skXZ0f1LaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:57:02.233484Z"},"content_sha256":"205232b0b115282f0d3fc5fd3513cc2245331a9190a8f65d048703f233f5c442","schema_version":"1.0","event_id":"sha256:205232b0b115282f0d3fc5fd3513cc2245331a9190a8f65d048703f233f5c442"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Y474WR53YF45NLRL2GDMZWLZ2H","target":"graph","payload":{"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"},"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-18T03:07:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UaRzCAvt4uFQU1gNSIDShUqpYX02Rw4qQSWeSLIw91EAzpA3AGtbW7F17HkKG1Z8R4DzrzKmKhq7sE8dz3MrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:57:02.234129Z"},"content_sha256":"685660dac8921e7e734223e59570aebc279822d57208bc85843901b352dfa1f5","schema_version":"1.0","event_id":"sha256:685660dac8921e7e734223e59570aebc279822d57208bc85843901b352dfa1f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/bundle.json","state_url":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y474WR53YF45NLRL2GDMZWLZ2H/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-11T04:57:02Z","links":{"resolver":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H","bundle":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/bundle.json","state":"https://pith.science/pith/Y474WR53YF45NLRL2GDMZWLZ2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y474WR53YF45NLRL2GDMZWLZ2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Y474WR53YF45NLRL2GDMZWLZ2H","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":"dd306cbe352295aa3719a094b8aaa01455c73f5e544ae4adba17b6dced61ea58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T17:21:16Z","title_canon_sha256":"4ce79e55e5ded3b60dd8c6980eb54f65658481f168d758ffd933fb306a6af2ae"},"schema_version":"1.0","source":{"id":"1308.1640","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.1640","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"1308.1640v4","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1640","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"Y474WR53YF45","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"Y474WR53YF45NLRL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"Y474WR53","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:685660dac8921e7e734223e59570aebc279822d57208bc85843901b352dfa1f5","target":"graph","created_at":"2026-05-18T03:07:03Z","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":"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 ","authors_text":"Partha Mukhopadhyay, Suryajith Chillara","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T17:21:16Z","title":"Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1640","kind":"arxiv","version":4},"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:205232b0b115282f0d3fc5fd3513cc2245331a9190a8f65d048703f233f5c442","target":"record","created_at":"2026-05-18T03:07:03Z","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":"dd306cbe352295aa3719a094b8aaa01455c73f5e544ae4adba17b6dced61ea58","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T17:21:16Z","title_canon_sha256":"4ce79e55e5ded3b60dd8c6980eb54f65658481f168d758ffd933fb306a6af2ae"},"schema_version":"1.0","source":{"id":"1308.1640","kind":"arxiv","version":4}},"canonical_sha256":"c73fcb47bbc179d6ae2bd186ccd979d1e70ad2a8a2d6a9ffefd1bcf7cef34fbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c73fcb47bbc179d6ae2bd186ccd979d1e70ad2a8a2d6a9ffefd1bcf7cef34fbe","first_computed_at":"2026-05-18T03:07:03.635913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:03.635913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p24a4hG+xO9YHjFjkEhCePSYFo+erOq1n+nLogGbnpLRT5KJNZURF3eaDy1L+/fAvv3MFZ9oKfEWAcLDek3zDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:03.636496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.1640","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:205232b0b115282f0d3fc5fd3513cc2245331a9190a8f65d048703f233f5c442","sha256:685660dac8921e7e734223e59570aebc279822d57208bc85843901b352dfa1f5"],"state_sha256":"1a0db01245ced70f6dd8f3ce19df7b152546e1a4fad20a0233edd2f02a8111eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOxpplw6wxNAAqazhUlaamPHCGJguR6jSH5iFRdsysbNHuDc78oj9Mz63Qq8MH51wC19Zt29meMDnDh96xI0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:57:02.238214Z","bundle_sha256":"e4375f35ee791c1683c779fa83cbd1242e393a03ecc41e4a88f7c8880e50fd02"}}