{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JOFI4O7HZO3U5RW4WHOBJ75EWD","short_pith_number":"pith:JOFI4O7H","schema_version":"1.0","canonical_sha256":"4b8a8e3be7cbb74ec6dcb1dc14ffa4b0f10172954456f315c42128a079e5917d","source":{"kind":"arxiv","id":"2210.10173","version":5},"attestation_state":"computed","paper":{"title":"Faster Matrix Multiplication via Asymmetric Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hongxun Wu, Ran Duan, Renfei Zhou","submitted_at":"2022-10-18T21:32:35Z","abstract_excerpt":"Fast matrix multiplication is one of the most fundamental problems in algorithm research. The exponent of the optimal time complexity of matrix multiplication is usually denoted by $\\omega$. This paper discusses new ideas for improving the laser method for fast matrix multiplication. We observe that the analysis of higher powers of the Coppersmith-Winograd tensor [Coppersmith & Winograd 1990] incurs a \"combination loss\", and we partially compensate for it using an asymmetric version of CW's hashing method. By analyzing the eighth power of the CW tensor, we give a new bound of $\\omega<2.371866$"},"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":"2210.10173","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-10-18T21:32:35Z","cross_cats_sorted":[],"title_canon_sha256":"f2324079b1300c4e0e1eecb5bbf8c5c482449257acb287604dd39446c96c9457","abstract_canon_sha256":"25880d935f0ff6d09c9a3a84e4d0fb70aa89e28c239734de02a7b2b380572455"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:23.057901Z","signature_b64":"0jEUQoSN9llc9Z5TXeFbxcvLW3IyZIsVtilhuk5yqagoZeY8CS5nDpWz1DguOIrFGdRzir2Ozy/SpD/4gGZaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b8a8e3be7cbb74ec6dcb1dc14ffa4b0f10172954456f315c42128a079e5917d","last_reissued_at":"2026-07-05T07:17:23.057491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:23.057491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Matrix Multiplication via Asymmetric Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hongxun Wu, Ran Duan, Renfei Zhou","submitted_at":"2022-10-18T21:32:35Z","abstract_excerpt":"Fast matrix multiplication is one of the most fundamental problems in algorithm research. The exponent of the optimal time complexity of matrix multiplication is usually denoted by $\\omega$. This paper discusses new ideas for improving the laser method for fast matrix multiplication. We observe that the analysis of higher powers of the Coppersmith-Winograd tensor [Coppersmith & Winograd 1990] incurs a \"combination loss\", and we partially compensate for it using an asymmetric version of CW's hashing method. By analyzing the eighth power of the CW tensor, we give a new bound of $\\omega<2.371866$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10173","kind":"arxiv","version":5},"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/2210.10173/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":"2210.10173","created_at":"2026-07-05T07:17:23.057547+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.10173v5","created_at":"2026-07-05T07:17:23.057547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10173","created_at":"2026-07-05T07:17:23.057547+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOFI4O7HZO3U","created_at":"2026-07-05T07:17:23.057547+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOFI4O7HZO3U5RW4","created_at":"2026-07-05T07:17:23.057547+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOFI4O7H","created_at":"2026-07-05T07:17:23.057547+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10778","citing_title":"When Does Sparsity Help for k-Independent Set in Hypergraphs and Other Boolean CSPs?","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD","json":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD.json","graph_json":"https://pith.science/api/pith-number/JOFI4O7HZO3U5RW4WHOBJ75EWD/graph.json","events_json":"https://pith.science/api/pith-number/JOFI4O7HZO3U5RW4WHOBJ75EWD/events.json","paper":"https://pith.science/paper/JOFI4O7H"},"agent_actions":{"view_html":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD","download_json":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD.json","view_paper":"https://pith.science/paper/JOFI4O7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.10173&json=true","fetch_graph":"https://pith.science/api/pith-number/JOFI4O7HZO3U5RW4WHOBJ75EWD/graph.json","fetch_events":"https://pith.science/api/pith-number/JOFI4O7HZO3U5RW4WHOBJ75EWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD/action/storage_attestation","attest_author":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD/action/author_attestation","sign_citation":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD/action/citation_signature","submit_replication":"https://pith.science/pith/JOFI4O7HZO3U5RW4WHOBJ75EWD/action/replication_record"}},"created_at":"2026-07-05T07:17:23.057547+00:00","updated_at":"2026-07-05T07:17:23.057547+00:00"}