{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P3QRVUQRJX2PL3THF4G476H35H","short_pith_number":"pith:P3QRVUQR","schema_version":"1.0","canonical_sha256":"7ee11ad2114df4f5ee672f0dcff8fbe9e5804e0fc3417fba98eeb5ecf0c8a1f0","source":{"kind":"arxiv","id":"1103.2405","version":1},"attestation_state":"computed","paper":{"title":"Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Ponnuswamy Sadayappan (Ohio State University), Srinivasan Parthasarathy (Ohio State University), Xintian Yang (Ohio State University)","submitted_at":"2011-03-12T01:04:56Z","abstract_excerpt":"Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In this article we present a novel non-parametric, self-tunable, approach to data representation for computing this kernel, particularly targeting sparse matrices representing power-law graphs. Using real data, we show how our representation scheme, coupled with a novel tiling algorithm, can yield significant benefits over the current state of the art GPU efforts on a number of core data mining algorithms such as PageRank, "},"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":"1103.2405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2011-03-12T01:04:56Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"69cfb0c63d99e518a532da249fa6920e211fa8fd2fec511bd2f4b88c4847193d","abstract_canon_sha256":"ba6676382ca37e22fd9ce55b0a8c4cabed36bcf2395cd8821a674431e82ad649"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:03.006581Z","signature_b64":"/FDP2+spy3YEWNxrxOdBjADRsJW084oDQICdzfbI4tyooIBayH6bPnk4tGj1p4DujjohLOWa/v7r5oiLn5h/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ee11ad2114df4f5ee672f0dcff8fbe9e5804e0fc3417fba98eeb5ecf0c8a1f0","last_reissued_at":"2026-05-18T03:38:03.005955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:03.005955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Ponnuswamy Sadayappan (Ohio State University), Srinivasan Parthasarathy (Ohio State University), Xintian Yang (Ohio State University)","submitted_at":"2011-03-12T01:04:56Z","abstract_excerpt":"Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In this article we present a novel non-parametric, self-tunable, approach to data representation for computing this kernel, particularly targeting sparse matrices representing power-law graphs. Using real data, we show how our representation scheme, coupled with a novel tiling algorithm, can yield significant benefits over the current state of the art GPU efforts on a number of core data mining algorithms such as PageRank, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2405","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":"1103.2405","created_at":"2026-05-18T03:38:03.006045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2405v1","created_at":"2026-05-18T03:38:03.006045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2405","created_at":"2026-05-18T03:38:03.006045+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3QRVUQRJX2P","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3QRVUQRJX2PL3TH","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3QRVUQR","created_at":"2026-05-18T12:26:39.201973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.01315","citing_title":"Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H","json":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H.json","graph_json":"https://pith.science/api/pith-number/P3QRVUQRJX2PL3THF4G476H35H/graph.json","events_json":"https://pith.science/api/pith-number/P3QRVUQRJX2PL3THF4G476H35H/events.json","paper":"https://pith.science/paper/P3QRVUQR"},"agent_actions":{"view_html":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H","download_json":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H.json","view_paper":"https://pith.science/paper/P3QRVUQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2405&json=true","fetch_graph":"https://pith.science/api/pith-number/P3QRVUQRJX2PL3THF4G476H35H/graph.json","fetch_events":"https://pith.science/api/pith-number/P3QRVUQRJX2PL3THF4G476H35H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H/action/storage_attestation","attest_author":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H/action/author_attestation","sign_citation":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H/action/citation_signature","submit_replication":"https://pith.science/pith/P3QRVUQRJX2PL3THF4G476H35H/action/replication_record"}},"created_at":"2026-05-18T03:38:03.006045+00:00","updated_at":"2026-05-18T03:38:03.006045+00:00"}