{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZKJDOYTZHMLUYYSKWKGHFOX2CN","short_pith_number":"pith:ZKJDOYTZ","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"},"canonical_sha256":"ca923762793b174c624ab28c72bafa135b663018355e05797e0438e3a0aa9543","source":{"kind":"arxiv","id":"1302.3308","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3308","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3308v1","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3308","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZKJDOYTZHMLU","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZKJDOYTZHMLUYYSK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZKJDOYTZ","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZKJDOYTZHMLUYYSKWKGHFOX2CN","target":"record","payload":{"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"},"canonical_sha256":"ca923762793b174c624ab28c72bafa135b663018355e05797e0438e3a0aa9543","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"},"source_kind":"arxiv","source_id":"1302.3308","source_version":1,"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:33:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQUS+4SH4r0zqRsC2hBuhXOHYc8idnQLk3cwdxqHdBQbLNhlWXTRkx28dYzwrhmmbCbJmTogtRPwiOo/cta8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:29:42.974454Z"},"content_sha256":"3e335e5e33d8bdb2e4bdfd2b9323246e90e7874bed6d4012d9feecba15fed595","schema_version":"1.0","event_id":"sha256:3e335e5e33d8bdb2e4bdfd2b9323246e90e7874bed6d4012d9feecba15fed595"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZKJDOYTZHMLUYYSKWKGHFOX2CN","target":"graph","payload":{"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"},"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:33:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zRuCEiSR6+HtUwCWPyBI+4neZjn0eWDYdzzy+pDsXvhTNqi4e2XMN99lAK49nEFV1MGbMYBbQbeFkjXa3NXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:29:42.974999Z"},"content_sha256":"4f8d0232fe33fe15b283afea9c16611173903fece2b22738ed338196517bd3f4","schema_version":"1.0","event_id":"sha256:4f8d0232fe33fe15b283afea9c16611173903fece2b22738ed338196517bd3f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/bundle.json","state_url":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/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-04T17:29:42Z","links":{"resolver":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN","bundle":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/bundle.json","state":"https://pith.science/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKJDOYTZHMLUYYSKWKGHFOX2CN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZKJDOYTZHMLUYYSKWKGHFOX2CN","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":"f37dde62f910d7976769cf080e92e8d0177e3f3ea4cbdf5266088f4f92dc068d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-14T04:25:56Z","title_canon_sha256":"1a7e5c123ce6d2ec6e183ec373e880a6e349fabd2ef07494315a3ac5507d784b"},"schema_version":"1.0","source":{"id":"1302.3308","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3308","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3308v1","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3308","created_at":"2026-05-18T03:33:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZKJDOYTZHMLU","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZKJDOYTZHMLUYYSK","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZKJDOYTZ","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:4f8d0232fe33fe15b283afea9c16611173903fece2b22738ed338196517bd3f4","target":"graph","created_at":"2026-05-18T03:33:39Z","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":"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","authors_text":"Gaurav Maheshwari, Jayalal Sarma M.N, Mrinal Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-14T04:25:56Z","title":"Arithmetic Circuit Lower Bounds via MaxRank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3308","kind":"arxiv","version":1},"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:3e335e5e33d8bdb2e4bdfd2b9323246e90e7874bed6d4012d9feecba15fed595","target":"record","created_at":"2026-05-18T03:33:39Z","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":"f37dde62f910d7976769cf080e92e8d0177e3f3ea4cbdf5266088f4f92dc068d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-14T04:25:56Z","title_canon_sha256":"1a7e5c123ce6d2ec6e183ec373e880a6e349fabd2ef07494315a3ac5507d784b"},"schema_version":"1.0","source":{"id":"1302.3308","kind":"arxiv","version":1}},"canonical_sha256":"ca923762793b174c624ab28c72bafa135b663018355e05797e0438e3a0aa9543","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca923762793b174c624ab28c72bafa135b663018355e05797e0438e3a0aa9543","first_computed_at":"2026-05-18T03:33:39.250086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:39.250086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6W5BzH9OdYaHMB7TM9ee92ecKk7bMOT+xbCOoDvovLW1s+ywI//Z9ynjG1waihHUEPt3rC8I6wPu38spjmFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:39.250608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3308","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e335e5e33d8bdb2e4bdfd2b9323246e90e7874bed6d4012d9feecba15fed595","sha256:4f8d0232fe33fe15b283afea9c16611173903fece2b22738ed338196517bd3f4"],"state_sha256":"094b1cee326d0048866ffd57613f08053053f5315cc9a742365d931ced52f8d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0QAuBl9KIaNnaPk2wDUxWW/xYOoCQs4XNtLuyS2r1syMI+o/bMFerwlDBfO4qHTdMSndquhFeL/ktxhQ0JuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:29:42.977664Z","bundle_sha256":"e70a86470e095ff23f293ef59cda61fe992638060e3b4d770156c3930918e114"}}