{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JPFRAFQDMJAXXX6HJI6DSGLTKD","short_pith_number":"pith:JPFRAFQD","schema_version":"1.0","canonical_sha256":"4bcb10160362417bdfc74a3c39197350dae37dfd43f7ca2f1250c7f80285abc3","source":{"kind":"arxiv","id":"2307.07970","version":2},"attestation_state":"computed","paper":{"title":"New Bounds for Matrix Multiplication: from Alpha to Omega","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Renfei Zhou, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu","submitted_at":"2023-07-16T07:46:06Z","abstract_excerpt":"The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou, FOCS 2023], the new method introduces several new ingredients that not only yield an improved bound on the matrix multiplication exponent $\\omega$, but also improve the known bounds on rectangular matrix multiplication by [Le Gall and Urrutia, SODA 2018]. In particular, the new bound on $\\omega$ is $\\omega\\le 2.371552$ (improved from $\\omega\\le 2.371866$). For the dual matrix multiplication exponent $\\alpha$ de"},"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":"2307.07970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-16T07:46:06Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4e84ae923e21712f76e19d4265509d5241de9388e1bcb23f8d99c5a1200be51e","abstract_canon_sha256":"55151832c0f88a8c6c8229dd8f94a121ec881bc84f749eab6a398e5253d19fc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:00.016162Z","signature_b64":"0Czv9Ai2tW+K/POt+dZtEqUFqwETbFvl7OpRFVVpdA1fy5R1TXOuEdX+JIQvmx0hieL4jocyB8vxle5Zorl+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bcb10160362417bdfc74a3c39197350dae37dfd43f7ca2f1250c7f80285abc3","last_reissued_at":"2026-07-05T07:09:00.015738Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:00.015738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Bounds for Matrix Multiplication: from Alpha to Omega","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Renfei Zhou, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu","submitted_at":"2023-07-16T07:46:06Z","abstract_excerpt":"The main contribution of this paper is a new improved variant of the laser method for designing matrix multiplication algorithms. Building upon the recent techniques of [Duan, Wu, Zhou, FOCS 2023], the new method introduces several new ingredients that not only yield an improved bound on the matrix multiplication exponent $\\omega$, but also improve the known bounds on rectangular matrix multiplication by [Le Gall and Urrutia, SODA 2018]. In particular, the new bound on $\\omega$ is $\\omega\\le 2.371552$ (improved from $\\omega\\le 2.371866$). For the dual matrix multiplication exponent $\\alpha$ de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07970","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/2307.07970/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":"2307.07970","created_at":"2026-07-05T07:09:00.015798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.07970v2","created_at":"2026-07-05T07:09:00.015798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07970","created_at":"2026-07-05T07:09:00.015798+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPFRAFQDMJAX","created_at":"2026-07-05T07:09:00.015798+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPFRAFQDMJAXXX6H","created_at":"2026-07-05T07:09:00.015798+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPFRAFQD","created_at":"2026-07-05T07:09:00.015798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.01748","citing_title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD","json":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD.json","graph_json":"https://pith.science/api/pith-number/JPFRAFQDMJAXXX6HJI6DSGLTKD/graph.json","events_json":"https://pith.science/api/pith-number/JPFRAFQDMJAXXX6HJI6DSGLTKD/events.json","paper":"https://pith.science/paper/JPFRAFQD"},"agent_actions":{"view_html":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD","download_json":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD.json","view_paper":"https://pith.science/paper/JPFRAFQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.07970&json=true","fetch_graph":"https://pith.science/api/pith-number/JPFRAFQDMJAXXX6HJI6DSGLTKD/graph.json","fetch_events":"https://pith.science/api/pith-number/JPFRAFQDMJAXXX6HJI6DSGLTKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD/action/storage_attestation","attest_author":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD/action/author_attestation","sign_citation":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD/action/citation_signature","submit_replication":"https://pith.science/pith/JPFRAFQDMJAXXX6HJI6DSGLTKD/action/replication_record"}},"created_at":"2026-07-05T07:09:00.015798+00:00","updated_at":"2026-07-05T07:09:00.015798+00:00"}