{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C6H7YYQBWMMK6VQ2OQO55UAMHY","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":"58a4f68b4b85aaa90634f746ca324ebd4eed539f79cbe3113ebc28f4ffbf5ae3","cross_cats_sorted":["math.AG","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-07T15:36:36Z","title_canon_sha256":"18a5204d8c066bf027b7fe1fd12f829833a6bf0f600f0c1da000c5b2438bdbde"},"schema_version":"1.0","source":{"id":"1206.1530","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1530","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1530v2","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1530","created_at":"2026-05-18T03:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"C6H7YYQBWMMK","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C6H7YYQBWMMK6VQ2","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C6H7YYQB","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:8f57572e56f608cf54c5fa09030e97ed05814eba42e9363230dee5d64b8d013f","target":"graph","created_at":"2026-05-18T03:08:27Z","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":"The rank of the matrix multiplication operator for nxn matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least n^2-o(n^2). More precisely, for any integer p\\leq n -1, the rank is at least (3- 1/(p+1))n^2-(1+2p\\binom{2p}{p-1})n. The previous lower bound, due to Blaser, was 5n^2/2-3n (the case p=1).\n  The new bounds improve Blaser's bound for all n>84. I also prove lower bounds for rectangular matrices significantly better than the the previous bound.","authors_text":"J. M. Landsberg","cross_cats":["math.AG","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-07T15:36:36Z","title":"New lower bounds for the rank of matrix multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1530","kind":"arxiv","version":2},"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:31a5446cabcf657c87b54931a99d81bba15cfbf04b99f168e23ab93f32752f2f","target":"record","created_at":"2026-05-18T03:08:27Z","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":"58a4f68b4b85aaa90634f746ca324ebd4eed539f79cbe3113ebc28f4ffbf5ae3","cross_cats_sorted":["math.AG","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-07T15:36:36Z","title_canon_sha256":"18a5204d8c066bf027b7fe1fd12f829833a6bf0f600f0c1da000c5b2438bdbde"},"schema_version":"1.0","source":{"id":"1206.1530","kind":"arxiv","version":2}},"canonical_sha256":"178ffc6201b318af561a741dded00c3e2c5c7cf0d230722ee1c138ac772f39c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"178ffc6201b318af561a741dded00c3e2c5c7cf0d230722ee1c138ac772f39c9","first_computed_at":"2026-05-18T03:08:27.362260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:27.362260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+SEghtZHIodjoE6tFfJ4378FLex8GXufx/0cdNXSkolf2T7A04Nq5cvtLlNMyZd/h/ZYhImef/Vbz50fRhKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:27.362976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1530","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31a5446cabcf657c87b54931a99d81bba15cfbf04b99f168e23ab93f32752f2f","sha256:8f57572e56f608cf54c5fa09030e97ed05814eba42e9363230dee5d64b8d013f"],"state_sha256":"c61eb09cacb948dfb2cb64f82453620bf401157ca202b766b5c7b584070381c8"}