{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:X7T7CRVG5IITUUJE2ZTXHP2XNC","short_pith_number":"pith:X7T7CRVG","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"},"canonical_sha256":"bfe7f146a6ea113a5124d66773bf5768b65e8151e67e589896f9c671a84db06c","source":{"kind":"arxiv","id":"2406.02088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02088","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02088v1","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02088","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"X7T7CRVG5IIT","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"X7T7CRVG5IITUUJE","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"X7T7CRVG","created_at":"2026-07-05T08:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:X7T7CRVG5IITUUJE2ZTXHP2XNC","target":"record","payload":{"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"},"canonical_sha256":"bfe7f146a6ea113a5124d66773bf5768b65e8151e67e589896f9c671a84db06c","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"},"source_kind":"arxiv","source_id":"2406.02088","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:27:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adFPHJmtOiGi1RRUMLj24E2hDypwDIyeVPiHEjWvxiqgrIiEIhhBmxNGTyQLKeJrkFy/BiVXLSJ7zQBI0IMiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:36:14.627224Z"},"content_sha256":"96dd42603ab6b639f3a5bc1e8c4eac329d63d0fd0b704c4d0137e235b46705e9","schema_version":"1.0","event_id":"sha256:96dd42603ab6b639f3a5bc1e8c4eac329d63d0fd0b704c4d0137e235b46705e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:X7T7CRVG5IITUUJE2ZTXHP2XNC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:27:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RK9qZjaidiA9tFejBn33/2byCRsMI1AeOslvdUrRwQLfZStJ6NDlwuBcIa5YvSFpjgElqEAoTxchSudk2VmZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T20:36:14.628113Z"},"content_sha256":"8345f87fdca85c06670b5d88448ff972e5b8d290bae218d5641982e85be3e35e","schema_version":"1.0","event_id":"sha256:8345f87fdca85c06670b5d88448ff972e5b8d290bae218d5641982e85be3e35e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/bundle.json","state_url":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T20:36:14Z","links":{"resolver":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC","bundle":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/bundle.json","state":"https://pith.science/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7T7CRVG5IITUUJE2ZTXHP2XNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:X7T7CRVG5IITUUJE2ZTXHP2XNC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d350c362ae24362db2a3a81c7404caf286ea6cc19d95aa6d3e5f62c9aacf222b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-06-04T08:13:43Z","title_canon_sha256":"62d9733923b8322f404c29290e15fa91dfb3b9a4f1038bc780ec6fafcc8d0bf0"},"schema_version":"1.0","source":{"id":"2406.02088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02088","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02088v1","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02088","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"X7T7CRVG5IIT","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"X7T7CRVG5IITUUJE","created_at":"2026-07-05T08:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"X7T7CRVG","created_at":"2026-07-05T08:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:8345f87fdca85c06670b5d88448ff972e5b8d290bae218d5641982e85be3e35e","target":"graph","created_at":"2026-07-05T08:27:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.02088/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Afzal Ahmad, Linfeng Du, Wei Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-06-04T08:13:43Z","title":"Fast and Practical Strassen's Matrix Multiplication using FPGAs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02088","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:96dd42603ab6b639f3a5bc1e8c4eac329d63d0fd0b704c4d0137e235b46705e9","target":"record","created_at":"2026-07-05T08:27:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d350c362ae24362db2a3a81c7404caf286ea6cc19d95aa6d3e5f62c9aacf222b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2024-06-04T08:13:43Z","title_canon_sha256":"62d9733923b8322f404c29290e15fa91dfb3b9a4f1038bc780ec6fafcc8d0bf0"},"schema_version":"1.0","source":{"id":"2406.02088","kind":"arxiv","version":1}},"canonical_sha256":"bfe7f146a6ea113a5124d66773bf5768b65e8151e67e589896f9c671a84db06c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfe7f146a6ea113a5124d66773bf5768b65e8151e67e589896f9c671a84db06c","first_computed_at":"2026-07-05T08:27:14.543278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:14.543278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zCD0hpAFbYwuIsgK07pQohLMAnFcmojHWcIMch1jWv4OVVNyTqmoyJ9IElcKqpcuCLNPiiteDbjfsoFmqmwCBw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:14.543815Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.02088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96dd42603ab6b639f3a5bc1e8c4eac329d63d0fd0b704c4d0137e235b46705e9","sha256:8345f87fdca85c06670b5d88448ff972e5b8d290bae218d5641982e85be3e35e"],"state_sha256":"4b25f1ae54c89dd91765811e984de993abd2e2eb22f7c3714967efe9bf84b758"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBOuA0ez0ppUWKvXqq2bZLLkn4IjYNsbUBj1mFvLgejJuxdZPLToCYhhKjVFn//SGOj4ORzvNIhb7uS8KkUCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T20:36:14.633684Z","bundle_sha256":"ba40dd08405d918be97f8cf20428ddc9f018a235200f43181e94f1330f189f21"}}