{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BHEWOMXQ3LPEYNTINPECYHCFCF","short_pith_number":"pith:BHEWOMXQ","schema_version":"1.0","canonical_sha256":"09c96732f0dade4c36686bc82c1c4511792b1fcaed48f863105680b9ebe848e7","source":{"kind":"arxiv","id":"1501.00324","version":1},"attestation_state":"computed","paper":{"title":"A New Sparse Matrix Vector Multiplication GPU Algorithm Designed for Finite Element Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.MS","authors_text":"Ellen Kuhl, Eric Darve, Jonathan Wong","submitted_at":"2015-01-01T21:57:19Z","abstract_excerpt":"Recently, graphics processors (GPUs) have been increasingly leveraged in a variety of scientific computing applications. However, architectural differences between CPUs and GPUs necessitate the development of algorithms that take advantage of GPU hardware. As sparse matrix vector multiplication (SPMV) operations are commonly used in finite element analysis, a new SPMV algorithm and several variations are developed for unstructured finite element meshes on GPUs. The effective bandwidth of current GPU algorithms and the newly proposed algorithms are measured and analyzed for 15 sparse matrices o"},"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":"1501.00324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2015-01-01T21:57:19Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"d62b2aee7f2fa3f74b7e65faf38503dc4fdac248280363c4cf4afc19094bf1b7","abstract_canon_sha256":"03c9e6675800b9b9faaf2f4b882870d53c0b55e0fbc883eb689de287a8164a3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.552465Z","signature_b64":"2N3B1J3yxZf6qzlLOm/iw31GNys3III8HS4d1gSuA7a29Famgyk/EAUJJrOlnJI7YUMsKSZ7Jf8kV0K4XGwbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09c96732f0dade4c36686bc82c1c4511792b1fcaed48f863105680b9ebe848e7","last_reissued_at":"2026-05-18T02:30:09.552002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.552002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Sparse Matrix Vector Multiplication GPU Algorithm Designed for Finite Element Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"cs.MS","authors_text":"Ellen Kuhl, Eric Darve, Jonathan Wong","submitted_at":"2015-01-01T21:57:19Z","abstract_excerpt":"Recently, graphics processors (GPUs) have been increasingly leveraged in a variety of scientific computing applications. However, architectural differences between CPUs and GPUs necessitate the development of algorithms that take advantage of GPU hardware. As sparse matrix vector multiplication (SPMV) operations are commonly used in finite element analysis, a new SPMV algorithm and several variations are developed for unstructured finite element meshes on GPUs. The effective bandwidth of current GPU algorithms and the newly proposed algorithms are measured and analyzed for 15 sparse matrices o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00324","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":"1501.00324","created_at":"2026-05-18T02:30:09.552069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00324v1","created_at":"2026-05-18T02:30:09.552069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00324","created_at":"2026-05-18T02:30:09.552069+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHEWOMXQ3LPE","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHEWOMXQ3LPEYNTI","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHEWOMXQ","created_at":"2026-05-18T12:29:14.074870+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/BHEWOMXQ3LPEYNTINPECYHCFCF","json":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF.json","graph_json":"https://pith.science/api/pith-number/BHEWOMXQ3LPEYNTINPECYHCFCF/graph.json","events_json":"https://pith.science/api/pith-number/BHEWOMXQ3LPEYNTINPECYHCFCF/events.json","paper":"https://pith.science/paper/BHEWOMXQ"},"agent_actions":{"view_html":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF","download_json":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF.json","view_paper":"https://pith.science/paper/BHEWOMXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00324&json=true","fetch_graph":"https://pith.science/api/pith-number/BHEWOMXQ3LPEYNTINPECYHCFCF/graph.json","fetch_events":"https://pith.science/api/pith-number/BHEWOMXQ3LPEYNTINPECYHCFCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF/action/storage_attestation","attest_author":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF/action/author_attestation","sign_citation":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF/action/citation_signature","submit_replication":"https://pith.science/pith/BHEWOMXQ3LPEYNTINPECYHCFCF/action/replication_record"}},"created_at":"2026-05-18T02:30:09.552069+00:00","updated_at":"2026-05-18T02:30:09.552069+00:00"}