{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZKJDOYTZHMLUYYSKWKGHFOX2CN","short_pith_number":"pith:ZKJDOYTZ","schema_version":"1.0","canonical_sha256":"ca923762793b174c624ab28c72bafa135b663018355e05797e0438e3a0aa9543","source":{"kind":"arxiv","id":"1302.3308","version":1},"attestation_state":"computed","paper":{"title":"Arithmetic Circuit Lower Bounds via MaxRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gaurav Maheshwari, Jayalal Sarma M.N, Mrinal Kumar","submitted_at":"2013-02-14T04:25:56Z","abstract_excerpt":"We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against several classes of non-multilinear arithmetic circuits. In particular, we obtain the following results :\n  As our main result, we prove that any homogeneous depth-3 circuit for computing the product of $d$ matrices of dimension $n \\times n$ requires $\\Omega(n^{d-1}/2^d)$ size. This improves the lower bounds by Nisan and Wigderson(1995) when $d=\\omega(1)$.\n  T"},"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":"1302.3308","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-14T04:25:56Z","cross_cats_sorted":[],"title_canon_sha256":"1a7e5c123ce6d2ec6e183ec373e880a6e349fabd2ef07494315a3ac5507d784b","abstract_canon_sha256":"f37dde62f910d7976769cf080e92e8d0177e3f3ea4cbdf5266088f4f92dc068d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:39.250608Z","signature_b64":"G6W5BzH9OdYaHMB7TM9ee92ecKk7bMOT+xbCOoDvovLW1s+ywI//Z9ynjG1waihHUEPt3rC8I6wPu38spjmFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca923762793b174c624ab28c72bafa135b663018355e05797e0438e3a0aa9543","last_reissued_at":"2026-05-18T03:33:39.250086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:39.250086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arithmetic Circuit Lower Bounds via MaxRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gaurav Maheshwari, Jayalal Sarma M.N, Mrinal Kumar","submitted_at":"2013-02-14T04:25:56Z","abstract_excerpt":"We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against several classes of non-multilinear arithmetic circuits. In particular, we obtain the following results :\n  As our main result, we prove that any homogeneous depth-3 circuit for computing the product of $d$ matrices of dimension $n \\times n$ requires $\\Omega(n^{d-1}/2^d)$ size. This improves the lower bounds by Nisan and Wigderson(1995) when $d=\\omega(1)$.\n  T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3308","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":"1302.3308","created_at":"2026-05-18T03:33:39.250169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3308v1","created_at":"2026-05-18T03:33:39.250169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3308","created_at":"2026-05-18T03:33:39.250169+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKJDOYTZHMLU","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKJDOYTZHMLUYYSK","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKJDOYTZ","created_at":"2026-05-18T12:28:09.283467+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/ZKJDOYTZHMLUYYSKWKGHFOX2CN","json":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN.json","graph_json":"https://pith.science/api/pith-number/ZKJDOYTZHMLUYYSKWKGHFOX2CN/graph.json","events_json":"https://pith.science/api/pith-number/ZKJDOYTZHMLUYYSKWKGHFOX2CN/events.json","paper":"https://pith.science/paper/ZKJDOYTZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN","download_json":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN.json","view_paper":"https://pith.science/paper/ZKJDOYTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3308&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKJDOYTZHMLUYYSKWKGHFOX2CN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKJDOYTZHMLUYYSKWKGHFOX2CN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/action/storage_attestation","attest_author":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/action/author_attestation","sign_citation":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/action/citation_signature","submit_replication":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/action/replication_record"}},"created_at":"2026-05-18T03:33:39.250169+00:00","updated_at":"2026-05-18T03:33:39.250169+00:00"}