{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X7T7CRVG5IITUUJE2ZTXHP2XNC","short_pith_number":"pith:X7T7CRVG","schema_version":"1.0","canonical_sha256":"bfe7f146a6ea113a5124d66773bf5768b65e8151e67e589896f9c671a84db06c","source":{"kind":"arxiv","id":"2406.02088","version":1},"attestation_state":"computed","paper":{"title":"Fast and Practical Strassen's Matrix Multiplication using FPGAs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Afzal Ahmad, Linfeng Du, Wei Zhang","submitted_at":"2024-06-04T08:13:43Z","abstract_excerpt":"Matrix multiplication is a cornerstone operation in a wide array of scientific fields, including machine learning and computer graphics. The standard algorithm for matrix multiplication has a complexity of $\\mathcal{O}(n^3)$ for $n\\times n$ matrices. Strassen's algorithm improves this to $\\mathcal{O}(n^{2.807})$, but its practicality is limited for small to medium matrix sizes due to the large number of additions it introduces. This paper presents a novel FPGA-based implementation of Strassen's algorithm that achieves superior speed over an optimized General Matrix Multiply (GeMM) implementati"},"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":"2406.02088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-06-04T08:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"62d9733923b8322f404c29290e15fa91dfb3b9a4f1038bc780ec6fafcc8d0bf0","abstract_canon_sha256":"d350c362ae24362db2a3a81c7404caf286ea6cc19d95aa6d3e5f62c9aacf222b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:14.543815Z","signature_b64":"zCD0hpAFbYwuIsgK07pQohLMAnFcmojHWcIMch1jWv4OVVNyTqmoyJ9IElcKqpcuCLNPiiteDbjfsoFmqmwCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfe7f146a6ea113a5124d66773bf5768b65e8151e67e589896f9c671a84db06c","last_reissued_at":"2026-07-05T08:27:14.543278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:14.543278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Practical Strassen's Matrix Multiplication using FPGAs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Afzal Ahmad, Linfeng Du, Wei Zhang","submitted_at":"2024-06-04T08:13:43Z","abstract_excerpt":"Matrix multiplication is a cornerstone operation in a wide array of scientific fields, including machine learning and computer graphics. The standard algorithm for matrix multiplication has a complexity of $\\mathcal{O}(n^3)$ for $n\\times n$ matrices. Strassen's algorithm improves this to $\\mathcal{O}(n^{2.807})$, but its practicality is limited for small to medium matrix sizes due to the large number of additions it introduces. This paper presents a novel FPGA-based implementation of Strassen's algorithm that achieves superior speed over an optimized General Matrix Multiply (GeMM) implementati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02088","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/2406.02088/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":"2406.02088","created_at":"2026-07-05T08:27:14.543370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02088v1","created_at":"2026-07-05T08:27:14.543370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02088","created_at":"2026-07-05T08:27:14.543370+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7T7CRVG5IIT","created_at":"2026-07-05T08:27:14.543370+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7T7CRVG5IITUUJE","created_at":"2026-07-05T08:27:14.543370+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7T7CRVG","created_at":"2026-07-05T08:27:14.543370+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/X7T7CRVG5IITUUJE2ZTXHP2XNC","json":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC.json","graph_json":"https://pith.science/api/pith-number/X7T7CRVG5IITUUJE2ZTXHP2XNC/graph.json","events_json":"https://pith.science/api/pith-number/X7T7CRVG5IITUUJE2ZTXHP2XNC/events.json","paper":"https://pith.science/paper/X7T7CRVG"},"agent_actions":{"view_html":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC","download_json":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC.json","view_paper":"https://pith.science/paper/X7T7CRVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02088&json=true","fetch_graph":"https://pith.science/api/pith-number/X7T7CRVG5IITUUJE2ZTXHP2XNC/graph.json","fetch_events":"https://pith.science/api/pith-number/X7T7CRVG5IITUUJE2ZTXHP2XNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/action/storage_attestation","attest_author":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/action/author_attestation","sign_citation":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/action/citation_signature","submit_replication":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/action/replication_record"}},"created_at":"2026-07-05T08:27:14.543370+00:00","updated_at":"2026-07-05T08:27:14.543370+00:00"}