{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CPLODKVZR7GLLALYZZK7D3KB3D","short_pith_number":"pith:CPLODKVZ","schema_version":"1.0","canonical_sha256":"13d6e1aab98fccb58178ce55f1ed41d8c6a2594dea994a568ebfc1b7b2733002","source":{"kind":"arxiv","id":"1804.00695","version":1},"attestation_state":"computed","paper":{"title":"Sparse Matrix-Matrix Multiplication on Multilevel Memory Architectures : Algorithms and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mehmet Deveci, Michael M. Wolf, Simon D. Hammond, Sivasankaran Rajamanickam","submitted_at":"2018-04-02T18:53:45Z","abstract_excerpt":"Architectures with multiple classes of memory media are becoming a common part of mainstream supercomputer deployments. So called multi-level memories offer differing characteristics for each memory component including variation in bandwidth, latency and capacity. This paper investigates the performance of sparse matrix multiplication kernels on two leading high-performance computing architectures -- Intel's Knights Landing processor and NVIDIA's Pascal GPU. We describe a data placement method and a chunking-based algorithm for our kernels that exploits the existence of the multiple memory spa"},"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":"1804.00695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-02T18:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"682b3d464b91ca7691a9efdd84845739503b8a239cc2ca7ba5b82f5ff752834a","abstract_canon_sha256":"c10d7d9d0ef34ce154a08233e2f590680d0d13e50a82275af3a710c975d14f16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:32.475491Z","signature_b64":"mknzr3ffmgEmaV33jkohp3CKFcmAC9UTkdPFgecwJHkzuB+gkzWOGW2kbEF/bc0fDZ7Ltxqo7Tnix8wa0h1HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13d6e1aab98fccb58178ce55f1ed41d8c6a2594dea994a568ebfc1b7b2733002","last_reissued_at":"2026-05-18T00:19:32.475025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:32.475025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Matrix-Matrix Multiplication on Multilevel Memory Architectures : Algorithms and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Mehmet Deveci, Michael M. Wolf, Simon D. Hammond, Sivasankaran Rajamanickam","submitted_at":"2018-04-02T18:53:45Z","abstract_excerpt":"Architectures with multiple classes of memory media are becoming a common part of mainstream supercomputer deployments. So called multi-level memories offer differing characteristics for each memory component including variation in bandwidth, latency and capacity. This paper investigates the performance of sparse matrix multiplication kernels on two leading high-performance computing architectures -- Intel's Knights Landing processor and NVIDIA's Pascal GPU. We describe a data placement method and a chunking-based algorithm for our kernels that exploits the existence of the multiple memory spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00695","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":"1804.00695","created_at":"2026-05-18T00:19:32.475095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00695v1","created_at":"2026-05-18T00:19:32.475095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00695","created_at":"2026-05-18T00:19:32.475095+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPLODKVZR7GL","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPLODKVZR7GLLALY","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPLODKVZ","created_at":"2026-05-18T12:32:16.446611+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/CPLODKVZR7GLLALYZZK7D3KB3D","json":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D.json","graph_json":"https://pith.science/api/pith-number/CPLODKVZR7GLLALYZZK7D3KB3D/graph.json","events_json":"https://pith.science/api/pith-number/CPLODKVZR7GLLALYZZK7D3KB3D/events.json","paper":"https://pith.science/paper/CPLODKVZ"},"agent_actions":{"view_html":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D","download_json":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D.json","view_paper":"https://pith.science/paper/CPLODKVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00695&json=true","fetch_graph":"https://pith.science/api/pith-number/CPLODKVZR7GLLALYZZK7D3KB3D/graph.json","fetch_events":"https://pith.science/api/pith-number/CPLODKVZR7GLLALYZZK7D3KB3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D/action/storage_attestation","attest_author":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D/action/author_attestation","sign_citation":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D/action/citation_signature","submit_replication":"https://pith.science/pith/CPLODKVZR7GLLALYZZK7D3KB3D/action/replication_record"}},"created_at":"2026-05-18T00:19:32.475095+00:00","updated_at":"2026-05-18T00:19:32.475095+00:00"}