{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CPKIRBUGYZGAORE74XHR2M5BGX","short_pith_number":"pith:CPKIRBUG","canonical_record":{"source":{"id":"1211.6320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-27T14:58:37Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"a2e103aec773613ba95bf96a94d46fd51c259a326cbb25e8bd4d77dcd6a40363","abstract_canon_sha256":"d9f8db452ff0a4ac3d9d0387c38c80926dcb25276b932fd663c62c87162f3094"},"schema_version":"1.0"},"canonical_sha256":"13d4888686c64c07449fe5cf1d33a135fa4923c6ae6a4ccaf9c41572791b383d","source":{"kind":"arxiv","id":"1211.6320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6320","created_at":"2026-05-18T03:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6320v2","created_at":"2026-05-18T03:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6320","created_at":"2026-05-18T03:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"CPKIRBUGYZGA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CPKIRBUGYZGAORE7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CPKIRBUG","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CPKIRBUGYZGAORE74XHR2M5BGX","target":"record","payload":{"canonical_record":{"source":{"id":"1211.6320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-27T14:58:37Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"a2e103aec773613ba95bf96a94d46fd51c259a326cbb25e8bd4d77dcd6a40363","abstract_canon_sha256":"d9f8db452ff0a4ac3d9d0387c38c80926dcb25276b932fd663c62c87162f3094"},"schema_version":"1.0"},"canonical_sha256":"13d4888686c64c07449fe5cf1d33a135fa4923c6ae6a4ccaf9c41572791b383d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:52.745998Z","signature_b64":"ZJY5CcpO+OvrWcAWvWLLD2a8QXYZsZ3HBxN0Uy4+eoPB33zhW8xY4pXgp+K+TjdEL+/R0qw4m88ZZhEpkIXRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13d4888686c64c07449fe5cf1d33a135fa4923c6ae6a4ccaf9c41572791b383d","last_reissued_at":"2026-05-18T03:07:52.745240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:52.745240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.6320","source_version":2,"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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eBaVRYSw3goHo5ITrvJ0DzM64WxOUhNpETei4CP7xl59fLO8b/2/gs0S3alqhWk+pcyCgIChBEThGDb0AtSXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:22:56.640248Z"},"content_sha256":"0fb5a5db0ce1e87e4931d41d391f0f04f4c7b394a40707fe1d5a71d1f79825b8","schema_version":"1.0","event_id":"sha256:0fb5a5db0ce1e87e4931d41d391f0f04f4c7b394a40707fe1d5a71d1f79825b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CPKIRBUGYZGAORE74XHR2M5BGX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the rank of $n\\times n$ matrix multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.CC","authors_text":"Alex Massarenti, Emanuele Raviolo","submitted_at":"2012-11-27T14:58:37Z","abstract_excerpt":"For every $p\\leq n$ positive integer we obtain the lower bound $(3-\\frac{1}{p+1})n^2-\\big(2\\binom{2p}{p+1}-\\binom{2p-2}{p-1}+2\\big)n$ for the rank of the $n\\times n$ matrix multiplication. This bound improves the previous one $(3-\\frac{1}{p+1})n^2-\\big(1+2p\\binom{2p}{p}\\big)n$ due to Landsberg. Furthermore our bound improves the classic bound $\\frac{5}{2}n^2-3n$, due to Bl\\\"aser, for every $n\\geq 132$. Finally, for $p = 2$, with a sligtly different strategy we menage to obtain the lower bound $\\frac{8}{3}n^2-7n$ which improves Bl\\\"aser's bound for any $n\\geq 24$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6320","kind":"arxiv","version":2},"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:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4eaKWdQIow8n8FnXWxJy0UMuOKqiar+KyQMcEc4y6JmoxtUr0OiUHj17lLbZiQUqEa5W4DtuUVfpuCwqb4rBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:22:56.640611Z"},"content_sha256":"8ecf4ca17dada4334fb52d3b3407df7197bd8d658b8764a0ceee26473716a4f3","schema_version":"1.0","event_id":"sha256:8ecf4ca17dada4334fb52d3b3407df7197bd8d658b8764a0ceee26473716a4f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPKIRBUGYZGAORE74XHR2M5BGX/bundle.json","state_url":"https://pith.science/pith/CPKIRBUGYZGAORE74XHR2M5BGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPKIRBUGYZGAORE74XHR2M5BGX/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-23T20:22:56Z","links":{"resolver":"https://pith.science/pith/CPKIRBUGYZGAORE74XHR2M5BGX","bundle":"https://pith.science/pith/CPKIRBUGYZGAORE74XHR2M5BGX/bundle.json","state":"https://pith.science/pith/CPKIRBUGYZGAORE74XHR2M5BGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPKIRBUGYZGAORE74XHR2M5BGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CPKIRBUGYZGAORE74XHR2M5BGX","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":"d9f8db452ff0a4ac3d9d0387c38c80926dcb25276b932fd663c62c87162f3094","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-27T14:58:37Z","title_canon_sha256":"a2e103aec773613ba95bf96a94d46fd51c259a326cbb25e8bd4d77dcd6a40363"},"schema_version":"1.0","source":{"id":"1211.6320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.6320","created_at":"2026-05-18T03:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1211.6320v2","created_at":"2026-05-18T03:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.6320","created_at":"2026-05-18T03:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"CPKIRBUGYZGA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CPKIRBUGYZGAORE7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CPKIRBUG","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:8ecf4ca17dada4334fb52d3b3407df7197bd8d658b8764a0ceee26473716a4f3","target":"graph","created_at":"2026-05-18T03:07:52Z","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":"For every $p\\leq n$ positive integer we obtain the lower bound $(3-\\frac{1}{p+1})n^2-\\big(2\\binom{2p}{p+1}-\\binom{2p-2}{p-1}+2\\big)n$ for the rank of the $n\\times n$ matrix multiplication. This bound improves the previous one $(3-\\frac{1}{p+1})n^2-\\big(1+2p\\binom{2p}{p}\\big)n$ due to Landsberg. Furthermore our bound improves the classic bound $\\frac{5}{2}n^2-3n$, due to Bl\\\"aser, for every $n\\geq 132$. Finally, for $p = 2$, with a sligtly different strategy we menage to obtain the lower bound $\\frac{8}{3}n^2-7n$ which improves Bl\\\"aser's bound for any $n\\geq 24$.","authors_text":"Alex Massarenti, Emanuele Raviolo","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-27T14:58:37Z","title":"On the rank of $n\\times n$ matrix multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.6320","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:0fb5a5db0ce1e87e4931d41d391f0f04f4c7b394a40707fe1d5a71d1f79825b8","target":"record","created_at":"2026-05-18T03:07:52Z","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":"d9f8db452ff0a4ac3d9d0387c38c80926dcb25276b932fd663c62c87162f3094","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-27T14:58:37Z","title_canon_sha256":"a2e103aec773613ba95bf96a94d46fd51c259a326cbb25e8bd4d77dcd6a40363"},"schema_version":"1.0","source":{"id":"1211.6320","kind":"arxiv","version":2}},"canonical_sha256":"13d4888686c64c07449fe5cf1d33a135fa4923c6ae6a4ccaf9c41572791b383d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13d4888686c64c07449fe5cf1d33a135fa4923c6ae6a4ccaf9c41572791b383d","first_computed_at":"2026-05-18T03:07:52.745240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:52.745240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZJY5CcpO+OvrWcAWvWLLD2a8QXYZsZ3HBxN0Uy4+eoPB33zhW8xY4pXgp+K+TjdEL+/R0qw4m88ZZhEpkIXRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:52.745998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.6320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fb5a5db0ce1e87e4931d41d391f0f04f4c7b394a40707fe1d5a71d1f79825b8","sha256:8ecf4ca17dada4334fb52d3b3407df7197bd8d658b8764a0ceee26473716a4f3"],"state_sha256":"ed62f310801c3ba4735324028482d04d8aecc0656699781b9379d97eb4a65567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oUH4zxVs4U0k1/Fmi/+9SZIb0Cg4fl2aQ2cGgEeScebUbTSpGu9ArnjRr2lv87Isd9QrJL79hT4bADC20ufWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:22:56.642590Z","bundle_sha256":"049a2041b13864f9289ca7d38ea53655a955299df6052dfcf5a0b3c81b3198ea"}}