{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CU5RZYJN5ZQR65OSDM3OV3T5OM","short_pith_number":"pith:CU5RZYJN","schema_version":"1.0","canonical_sha256":"153b1ce12dee611f75d21b36eaee7d73270718154acf398fe751ff215f0df354","source":{"kind":"arxiv","id":"1411.5414","version":1},"attestation_state":"computed","paper":{"title":"Fast Matrix Multiplication: Limitations of the Laser Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Fran\\c{c}ois Le Gall, Yuval Filmus","submitted_at":"2014-11-20T01:07:08Z","abstract_excerpt":"Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time $O(n^{2.3755})$. Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le Gall has led to an improved algorithm running in time $O(n^{2.3729})$. These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time $O(n^{2.3725})$, and identify a wide class of variants of this approach which cannot result in an algorithm"},"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":"1411.5414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-11-20T01:07:08Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"84c4cdf19950ab2eb261f50d5bf7c8df3774392bc2e7651c93f364c7fa9da8cc","abstract_canon_sha256":"2bc01f0622c1343f3c04143bddccd622219b42666c16574d57022404ebd8807f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:36.785716Z","signature_b64":"9Q5h9w24eam6QDakq0jCZFQAV8x8DBOmvFzwVCG7PdwHexQGKAOqdYHhJQgxEkXl+R/8Jxw6/xV/w/TVmbq0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153b1ce12dee611f75d21b36eaee7d73270718154acf398fe751ff215f0df354","last_reissued_at":"2026-07-05T03:19:36.785224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:36.785224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Matrix Multiplication: Limitations of the Laser Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Fran\\c{c}ois Le Gall, Yuval Filmus","submitted_at":"2014-11-20T01:07:08Z","abstract_excerpt":"Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time $O(n^{2.3755})$. Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le Gall has led to an improved algorithm running in time $O(n^{2.3729})$. These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time $O(n^{2.3725})$, and identify a wide class of variants of this approach which cannot result in an algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5414","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1411.5414/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1411.5414","created_at":"2026-07-05T03:19:36.785280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.5414v1","created_at":"2026-07-05T03:19:36.785280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5414","created_at":"2026-07-05T03:19:36.785280+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU5RZYJN5ZQR","created_at":"2026-07-05T03:19:36.785280+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU5RZYJN5ZQR65OS","created_at":"2026-07-05T03:19:36.785280+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU5RZYJN","created_at":"2026-07-05T03:19:36.785280+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/CU5RZYJN5ZQR65OSDM3OV3T5OM","json":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM.json","graph_json":"https://pith.science/api/pith-number/CU5RZYJN5ZQR65OSDM3OV3T5OM/graph.json","events_json":"https://pith.science/api/pith-number/CU5RZYJN5ZQR65OSDM3OV3T5OM/events.json","paper":"https://pith.science/paper/CU5RZYJN"},"agent_actions":{"view_html":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM","download_json":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM.json","view_paper":"https://pith.science/paper/CU5RZYJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.5414&json=true","fetch_graph":"https://pith.science/api/pith-number/CU5RZYJN5ZQR65OSDM3OV3T5OM/graph.json","fetch_events":"https://pith.science/api/pith-number/CU5RZYJN5ZQR65OSDM3OV3T5OM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM/action/storage_attestation","attest_author":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM/action/author_attestation","sign_citation":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM/action/citation_signature","submit_replication":"https://pith.science/pith/CU5RZYJN5ZQR65OSDM3OV3T5OM/action/replication_record"}},"created_at":"2026-07-05T03:19:36.785280+00:00","updated_at":"2026-07-05T03:19:36.785280+00:00"}