{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UEKH7SJ3O5O46ET3XSWUSUSWJ7","short_pith_number":"pith:UEKH7SJ3","schema_version":"1.0","canonical_sha256":"a1147fc93b775dcf127bbcad4952564fed478cb26d867f85ad60219cf3283ec6","source":{"kind":"arxiv","id":"2404.16349","version":2},"attestation_state":"computed","paper":{"title":"More Asymmetry Yields Faster Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Josh Alman, Ran Duan, Renfei Zhou, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu","submitted_at":"2024-04-25T05:59:44Z","abstract_excerpt":"We present a new improvement on the laser method for designing fast matrix multiplication algorithms. The new method further develops the recent advances by [Duan, Wu, Zhou FOCS 2023] and [Vassilevska Williams, Xu, Xu, Zhou SODA 2024]. Surprisingly the new improvement is achieved by incorporating more asymmetry in the analysis, circumventing a fundamental tool of prior work that requires two of the three dimensions to be treated identically. The method yields a new bound on the square matrix multiplication exponent $$\\omega<2.371339,$$ improved from the previous bound of $\\omega<2.371552$. We "},"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":"2404.16349","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-25T05:59:44Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"52daa30e41996f69b8ab5aeca4eddeba4cdd2c5d443df2fe0ac54d567b41b300","abstract_canon_sha256":"c25b2660b838b73327fd7a90a6573e44db87fee61b7fbc451d0850a01d800185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:05.144446Z","signature_b64":"zg2zlnaL3Vte3qwdUKs81HeeGwDZgoak6L+gK+skWLZW3ryjVZcDBtFgN4UKsWCLAVMuVVkW3BtJlv1toHj/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1147fc93b775dcf127bbcad4952564fed478cb26d867f85ad60219cf3283ec6","last_reissued_at":"2026-07-05T09:23:05.143937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:05.143937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More Asymmetry Yields Faster Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Josh Alman, Ran Duan, Renfei Zhou, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu","submitted_at":"2024-04-25T05:59:44Z","abstract_excerpt":"We present a new improvement on the laser method for designing fast matrix multiplication algorithms. The new method further develops the recent advances by [Duan, Wu, Zhou FOCS 2023] and [Vassilevska Williams, Xu, Xu, Zhou SODA 2024]. Surprisingly the new improvement is achieved by incorporating more asymmetry in the analysis, circumventing a fundamental tool of prior work that requires two of the three dimensions to be treated identically. The method yields a new bound on the square matrix multiplication exponent $$\\omega<2.371339,$$ improved from the previous bound of $\\omega<2.371552$. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.16349","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.16349/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":"2404.16349","created_at":"2026-07-05T09:23:05.143995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.16349v2","created_at":"2026-07-05T09:23:05.143995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.16349","created_at":"2026-07-05T09:23:05.143995+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEKH7SJ3O5O4","created_at":"2026-07-05T09:23:05.143995+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEKH7SJ3O5O46ET3","created_at":"2026-07-05T09:23:05.143995+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEKH7SJ3","created_at":"2026-07-05T09:23:05.143995+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.22217","citing_title":"Benincasa-Dowker-Glaser causal set actions by quantum counting","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11041","citing_title":"Exploiting the Structure in Tensor Decompositions for Matrix Multiplication","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2510.06337","citing_title":"Recent quantum runtime (dis)advantages","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7","json":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7.json","graph_json":"https://pith.science/api/pith-number/UEKH7SJ3O5O46ET3XSWUSUSWJ7/graph.json","events_json":"https://pith.science/api/pith-number/UEKH7SJ3O5O46ET3XSWUSUSWJ7/events.json","paper":"https://pith.science/paper/UEKH7SJ3"},"agent_actions":{"view_html":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7","download_json":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7.json","view_paper":"https://pith.science/paper/UEKH7SJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.16349&json=true","fetch_graph":"https://pith.science/api/pith-number/UEKH7SJ3O5O46ET3XSWUSUSWJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/UEKH7SJ3O5O46ET3XSWUSUSWJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7/action/storage_attestation","attest_author":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7/action/author_attestation","sign_citation":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7/action/citation_signature","submit_replication":"https://pith.science/pith/UEKH7SJ3O5O46ET3XSWUSUSWJ7/action/replication_record"}},"created_at":"2026-07-05T09:23:05.143995+00:00","updated_at":"2026-07-05T09:23:05.143995+00:00"}