{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ETB6UGJGYLRDVQITJXF7KLITGF","short_pith_number":"pith:ETB6UGJG","schema_version":"1.0","canonical_sha256":"24c3ea1926c2e23ac1134dcbf52d13314f49e4e622cfdb41a38dac66e20b4c5c","source":{"kind":"arxiv","id":"2202.05868","version":1},"attestation_state":"computed","paper":{"title":"Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Flavio Vella, Francesco Silvestri, Massimo Bernaschi, Paolo Sylos Labini","submitted_at":"2022-02-11T19:19:51Z","abstract_excerpt":"Tensor accelerators have gained popularity because they provide a cheap and efficient solution for speeding up computational-expensive tasks in Deep Learning and, more recently, in other Scientific Computing applications. However, since their features are specifically designed for tensor algebra (typically dense matrix-product), it is commonly assumed that they are not suitable for applications with sparse data. To challenge this viewpoint, we discuss methods and present solutions for accelerating sparse matrix multiplication on such architectures. In particular, we present a 1-dimensional blo"},"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":"2202.05868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-11T19:19:51Z","cross_cats_sorted":[],"title_canon_sha256":"610eecd3aa74865372807efe149717cf84eb3e30b24d7025ae0b544d738128e1","abstract_canon_sha256":"2d05a913997fa5a41ec4178025c8524fdaeca39d8aad122325e1bfc4160697c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:18.690702Z","signature_b64":"qUyYy+hrhjahxQsJ+jpV4tVXE0eRgmobD8S9R7Zhr0hRoalSjKQP76QnFLCj3ICIN6UQEw+JLCnAHOk8dFhfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24c3ea1926c2e23ac1134dcbf52d13314f49e4e622cfdb41a38dac66e20b4c5c","last_reissued_at":"2026-07-05T03:56:18.690284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:18.690284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blocking Techniques for Sparse Matrix Multiplication on Tensor Accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Flavio Vella, Francesco Silvestri, Massimo Bernaschi, Paolo Sylos Labini","submitted_at":"2022-02-11T19:19:51Z","abstract_excerpt":"Tensor accelerators have gained popularity because they provide a cheap and efficient solution for speeding up computational-expensive tasks in Deep Learning and, more recently, in other Scientific Computing applications. However, since their features are specifically designed for tensor algebra (typically dense matrix-product), it is commonly assumed that they are not suitable for applications with sparse data. To challenge this viewpoint, we discuss methods and present solutions for accelerating sparse matrix multiplication on such architectures. In particular, we present a 1-dimensional blo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.05868","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/2202.05868/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":"2202.05868","created_at":"2026-07-05T03:56:18.690350+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.05868v1","created_at":"2026-07-05T03:56:18.690350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.05868","created_at":"2026-07-05T03:56:18.690350+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETB6UGJGYLRD","created_at":"2026-07-05T03:56:18.690350+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETB6UGJGYLRDVQIT","created_at":"2026-07-05T03:56:18.690350+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETB6UGJG","created_at":"2026-07-05T03:56:18.690350+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/ETB6UGJGYLRDVQITJXF7KLITGF","json":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF.json","graph_json":"https://pith.science/api/pith-number/ETB6UGJGYLRDVQITJXF7KLITGF/graph.json","events_json":"https://pith.science/api/pith-number/ETB6UGJGYLRDVQITJXF7KLITGF/events.json","paper":"https://pith.science/paper/ETB6UGJG"},"agent_actions":{"view_html":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF","download_json":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF.json","view_paper":"https://pith.science/paper/ETB6UGJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.05868&json=true","fetch_graph":"https://pith.science/api/pith-number/ETB6UGJGYLRDVQITJXF7KLITGF/graph.json","fetch_events":"https://pith.science/api/pith-number/ETB6UGJGYLRDVQITJXF7KLITGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF/action/storage_attestation","attest_author":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF/action/author_attestation","sign_citation":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF/action/citation_signature","submit_replication":"https://pith.science/pith/ETB6UGJGYLRDVQITJXF7KLITGF/action/replication_record"}},"created_at":"2026-07-05T03:56:18.690350+00:00","updated_at":"2026-07-05T03:56:18.690350+00:00"}