{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RGBP7DYTPKZBKCPEWWYC4QISDG","short_pith_number":"pith:RGBP7DYT","canonical_record":{"source":{"id":"1112.6007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-27T19:24:57Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"9d5c31fb56e5e3749565d4f0fad8da572a65f37d74baa16dd7823bddd716be87","abstract_canon_sha256":"d801a6441894c106f884b36cafb606cd6131838ea3a6c53f7168b25b777b30a0"},"schema_version":"1.0"},"canonical_sha256":"8982ff8f137ab21509e4b5b02e4112198c6f24dbe0f3275174a6a1fdd64031c0","source":{"kind":"arxiv","id":"1112.6007","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6007","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6007v3","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6007","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"RGBP7DYTPKZB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RGBP7DYTPKZBKCPE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RGBP7DYT","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RGBP7DYTPKZBKCPEWWYC4QISDG","target":"record","payload":{"canonical_record":{"source":{"id":"1112.6007","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-27T19:24:57Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"9d5c31fb56e5e3749565d4f0fad8da572a65f37d74baa16dd7823bddd716be87","abstract_canon_sha256":"d801a6441894c106f884b36cafb606cd6131838ea3a6c53f7168b25b777b30a0"},"schema_version":"1.0"},"canonical_sha256":"8982ff8f137ab21509e4b5b02e4112198c6f24dbe0f3275174a6a1fdd64031c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:06.333811Z","signature_b64":"gqusXwjLxwsVIucKgFHd8bTW6mmy9sLZNntF9d36NzgAhJi10b7u27GsBuiUksWF+CuqS/YDKyfKr+db9sJyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8982ff8f137ab21509e4b5b02e4112198c6f24dbe0f3275174a6a1fdd64031c0","last_reissued_at":"2026-05-18T03:22:06.333149Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:06.333149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.6007","source_version":3,"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:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZrY3yg0NkTW6MX2ht01hPT26tuGP5a64q8tLcwKB3A2VGMUwJpwE0XoqCm2rgGZXVLBsS9ego0Wtg0PPWcyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:40:50.044724Z"},"content_sha256":"58ce319fcfc3dccc8fa2c464f1dde0e472a43553a81b761c6fc56817b54f3cd3","schema_version":"1.0","event_id":"sha256:58ce319fcfc3dccc8fa2c464f1dde0e472a43553a81b761c6fc56817b54f3cd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RGBP7DYTPKZBKCPEWWYC4QISDG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New lower bounds for the border rank of matrix multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"cs.CC","authors_text":"Giorgio Ottaviani, J. M. Landsberg","submitted_at":"2011-12-27T19:24:57Z","abstract_excerpt":"The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds are better than the previous lower bound (due to Lickteig in 1985) of 3/2 n^2+ n/2 -1 for all n>2. The bounds are obtained by finding new equations that bilinear maps of small border rank must satisfy, i.e., new equations for secant varieties of triple Segre products, that matrix multiplication fails to satisfy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6007","kind":"arxiv","version":3},"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:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9zWzcRvX8af1+e/prKRKueJnR7MpWkmrCw5sD4HZaWZGGwnunWoaGhYrfApXDJ+cxewsFlX5+HNASNvSi9DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:40:50.045442Z"},"content_sha256":"9c63ef1cf34eec020d71c381b621011f15d9860213a1d059d1c18ac69dd82876","schema_version":"1.0","event_id":"sha256:9c63ef1cf34eec020d71c381b621011f15d9860213a1d059d1c18ac69dd82876"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGBP7DYTPKZBKCPEWWYC4QISDG/bundle.json","state_url":"https://pith.science/pith/RGBP7DYTPKZBKCPEWWYC4QISDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGBP7DYTPKZBKCPEWWYC4QISDG/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-05-29T23:40:50Z","links":{"resolver":"https://pith.science/pith/RGBP7DYTPKZBKCPEWWYC4QISDG","bundle":"https://pith.science/pith/RGBP7DYTPKZBKCPEWWYC4QISDG/bundle.json","state":"https://pith.science/pith/RGBP7DYTPKZBKCPEWWYC4QISDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGBP7DYTPKZBKCPEWWYC4QISDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RGBP7DYTPKZBKCPEWWYC4QISDG","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":"d801a6441894c106f884b36cafb606cd6131838ea3a6c53f7168b25b777b30a0","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-27T19:24:57Z","title_canon_sha256":"9d5c31fb56e5e3749565d4f0fad8da572a65f37d74baa16dd7823bddd716be87"},"schema_version":"1.0","source":{"id":"1112.6007","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.6007","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.6007v3","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6007","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"RGBP7DYTPKZB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RGBP7DYTPKZBKCPE","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RGBP7DYT","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:9c63ef1cf34eec020d71c381b621011f15d9860213a1d059d1c18ac69dd82876","target":"graph","created_at":"2026-05-18T03:22:06Z","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 border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds are better than the previous lower bound (due to Lickteig in 1985) of 3/2 n^2+ n/2 -1 for all n>2. The bounds are obtained by finding new equations that bilinear maps of small border rank must satisfy, i.e., new equations for secant varieties of triple Segre products, that matrix multiplication fails to satisfy.","authors_text":"Giorgio Ottaviani, J. M. Landsberg","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-27T19:24:57Z","title":"New lower bounds for the border rank of matrix multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6007","kind":"arxiv","version":3},"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:58ce319fcfc3dccc8fa2c464f1dde0e472a43553a81b761c6fc56817b54f3cd3","target":"record","created_at":"2026-05-18T03:22:06Z","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":"d801a6441894c106f884b36cafb606cd6131838ea3a6c53f7168b25b777b30a0","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-27T19:24:57Z","title_canon_sha256":"9d5c31fb56e5e3749565d4f0fad8da572a65f37d74baa16dd7823bddd716be87"},"schema_version":"1.0","source":{"id":"1112.6007","kind":"arxiv","version":3}},"canonical_sha256":"8982ff8f137ab21509e4b5b02e4112198c6f24dbe0f3275174a6a1fdd64031c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8982ff8f137ab21509e4b5b02e4112198c6f24dbe0f3275174a6a1fdd64031c0","first_computed_at":"2026-05-18T03:22:06.333149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:06.333149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gqusXwjLxwsVIucKgFHd8bTW6mmy9sLZNntF9d36NzgAhJi10b7u27GsBuiUksWF+CuqS/YDKyfKr+db9sJyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:06.333811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.6007","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58ce319fcfc3dccc8fa2c464f1dde0e472a43553a81b761c6fc56817b54f3cd3","sha256:9c63ef1cf34eec020d71c381b621011f15d9860213a1d059d1c18ac69dd82876"],"state_sha256":"859cae5c0502572cef79f4d8c7761a5e48bc06478d224d18206a6ab801b580df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfyNa+FfNRjMDyT7BUpw4RpMums36/hBhaAx/3lydrIZd9ca6UZI/ywKFhy8CsHwGRRtUS+2x3PByDL1v/b9Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:40:50.049796Z","bundle_sha256":"28199417dfd1de3d01aaf3f1e306ff5317ea496a6d2d6487a7356704723fb99a"}}