{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IEVI4MYFUH5C2AAEBJB3Y3TTK3","short_pith_number":"pith:IEVI4MYF","schema_version":"1.0","canonical_sha256":"412a8e3305a1fa2d00040a43bc6e7356c41899ed937ec0f644956748eec6ddd6","source":{"kind":"arxiv","id":"1610.07902","version":1},"attestation_state":"computed","paper":{"title":"A work-efficient parallel sparse matrix-sparse vector multiplication algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Buluc","submitted_at":"2016-10-25T14:47:42Z","abstract_excerpt":"We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are all sparse. SpMSpV is an important primitive in the emerging GraphBLAS standard and is the workhorse of many graph algorithms including breadth-first search, bipartite graph matching, and maximal independent set. As thread counts increase, existing multithreaded SpMSpV algorithms can spend more time accessing the sparse matrix data structure than doing arithmetic. Our shared-memory parallel SpMSpV algorithm is work "},"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":"1610.07902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-25T14:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"038461b509caf42e42328fd3b14c4642a8051826c10ba653cf1397698036050e","abstract_canon_sha256":"beaef9d6e3c34dd68569826363b6da5b71bb3b6f08dc52390d95342015671b56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:17.240834Z","signature_b64":"1RSfjKXioB/KSIkH7K2jbQU+qxp7CA5YH0OoXVG7Ze+T9LrqezidvmDvKbxdZHJARAvp9SaxixIZB4PmXf1PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"412a8e3305a1fa2d00040a43bc6e7356c41899ed937ec0f644956748eec6ddd6","last_reissued_at":"2026-05-18T01:01:17.240169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:17.240169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A work-efficient parallel sparse matrix-sparse vector multiplication algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ariful Azad, Aydin Buluc","submitted_at":"2016-10-25T14:47:42Z","abstract_excerpt":"We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are all sparse. SpMSpV is an important primitive in the emerging GraphBLAS standard and is the workhorse of many graph algorithms including breadth-first search, bipartite graph matching, and maximal independent set. As thread counts increase, existing multithreaded SpMSpV algorithms can spend more time accessing the sparse matrix data structure than doing arithmetic. Our shared-memory parallel SpMSpV algorithm is work "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07902","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":""},"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":"1610.07902","created_at":"2026-05-18T01:01:17.240283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07902v1","created_at":"2026-05-18T01:01:17.240283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07902","created_at":"2026-05-18T01:01:17.240283+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEVI4MYFUH5C","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEVI4MYFUH5C2AAE","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEVI4MYF","created_at":"2026-05-18T12:30:22.444734+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/IEVI4MYFUH5C2AAEBJB3Y3TTK3","json":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3.json","graph_json":"https://pith.science/api/pith-number/IEVI4MYFUH5C2AAEBJB3Y3TTK3/graph.json","events_json":"https://pith.science/api/pith-number/IEVI4MYFUH5C2AAEBJB3Y3TTK3/events.json","paper":"https://pith.science/paper/IEVI4MYF"},"agent_actions":{"view_html":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3","download_json":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3.json","view_paper":"https://pith.science/paper/IEVI4MYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07902&json=true","fetch_graph":"https://pith.science/api/pith-number/IEVI4MYFUH5C2AAEBJB3Y3TTK3/graph.json","fetch_events":"https://pith.science/api/pith-number/IEVI4MYFUH5C2AAEBJB3Y3TTK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3/action/storage_attestation","attest_author":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3/action/author_attestation","sign_citation":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3/action/citation_signature","submit_replication":"https://pith.science/pith/IEVI4MYFUH5C2AAEBJB3Y3TTK3/action/replication_record"}},"created_at":"2026-05-18T01:01:17.240283+00:00","updated_at":"2026-05-18T01:01:17.240283+00:00"}