{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4N5WCWMPH723TC6N77ZKCQQ5E3","short_pith_number":"pith:4N5WCWMP","schema_version":"1.0","canonical_sha256":"e37b61598f3ff5b98bcdfff2a1421d26e6e82f8a77d2a17a61d83df4639df50a","source":{"kind":"arxiv","id":"1608.07486","version":1},"attestation_state":"computed","paper":{"title":"A $2n^2-log(n)-1$ lower bound 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":"J.M. Landsberg, Mateusz Micha{\\l}ek","submitted_at":"2016-08-26T15:06:53Z","abstract_excerpt":"Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^2-log(n)-1 for M_n."},"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":"1608.07486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-08-26T15:06:53Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"5dd8126cce583f1b328834024d0d81ec15a6d920e4533132784d29db285b65e5","abstract_canon_sha256":"a3585e812998cba256cb47f4cf0c58521819e5e0e4efe94731d360c615b0869d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:52.912055Z","signature_b64":"4W3XLhasA7X9uhG0HfROQV1lhsdfCuZf5+juQvGWKuzPJnPJluTseEIzRGp/l3ImjNDlu8I7ShToDha3w0HWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37b61598f3ff5b98bcdfff2a1421d26e6e82f8a77d2a17a61d83df4639df50a","last_reissued_at":"2026-05-18T01:07:52.911646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:52.911646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $2n^2-log(n)-1$ lower bound 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":"J.M. Landsberg, Mateusz Micha{\\l}ek","submitted_at":"2016-08-26T15:06:53Z","abstract_excerpt":"Let M_n denote the matrix multiplication tensor for nxn matrices. We use the border substitution method combined with Koszul flattenings to prove the border rank lower bound of 2n^2-log(n)-1 for M_n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07486","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":"1608.07486","created_at":"2026-05-18T01:07:52.911716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07486v1","created_at":"2026-05-18T01:07:52.911716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07486","created_at":"2026-05-18T01:07:52.911716+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N5WCWMPH723","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N5WCWMPH723TC6N","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N5WCWMP","created_at":"2026-05-18T12:29:58.707656+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/4N5WCWMPH723TC6N77ZKCQQ5E3","json":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3.json","graph_json":"https://pith.science/api/pith-number/4N5WCWMPH723TC6N77ZKCQQ5E3/graph.json","events_json":"https://pith.science/api/pith-number/4N5WCWMPH723TC6N77ZKCQQ5E3/events.json","paper":"https://pith.science/paper/4N5WCWMP"},"agent_actions":{"view_html":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3","download_json":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3.json","view_paper":"https://pith.science/paper/4N5WCWMP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07486&json=true","fetch_graph":"https://pith.science/api/pith-number/4N5WCWMPH723TC6N77ZKCQQ5E3/graph.json","fetch_events":"https://pith.science/api/pith-number/4N5WCWMPH723TC6N77ZKCQQ5E3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3/action/storage_attestation","attest_author":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3/action/author_attestation","sign_citation":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3/action/citation_signature","submit_replication":"https://pith.science/pith/4N5WCWMPH723TC6N77ZKCQQ5E3/action/replication_record"}},"created_at":"2026-05-18T01:07:52.911716+00:00","updated_at":"2026-05-18T01:07:52.911716+00:00"}