{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QKYFT5NGI2A3IO4L6VE4R2W23T","short_pith_number":"pith:QKYFT5NG","schema_version":"1.0","canonical_sha256":"82b059f5a64681b43b8bf549c8eadadcd29af0b29e0d59a8d2b2ce435230927f","source":{"kind":"arxiv","id":"1902.01829","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Matrix Operations on GPUs: Matrix-Vector Multiplication and Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DS","authors_text":"David E. Keyes, George Turkiyyah, Wajih Halim Boukaram","submitted_at":"2019-02-05T17:59:51Z","abstract_excerpt":"Hierarchical matrices are space and time efficient representations of dense matrices that exploit the low rank structure of matrix blocks at different levels of granularity. The hierarchically low rank block partitioning produces representations that can be stored and operated on in near-linear complexity instead of the usual polynomial complexity of dense matrices. In this paper, we present high performance implementations of matrix vector multiplication and compression operations for the $\\mathcal{H}^2$ variant of hierarchical matrices on GPUs. This variant exploits, in addition to the hiera"},"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":"1902.01829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T17:59:51Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"50757a8a63a999e3c30abeaff608cbea2a21d010a44026caf13e3fe6642aae05","abstract_canon_sha256":"8f5fa56b95afe3f935ba11284de8c25ea7d95c2a8f2441aba25246d8579bbc2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:42.244569Z","signature_b64":"dClr2jm+dCqtn5a/Whyl9Cbr/va7VnslxcluCPg5H6TDh8oe62bN1ve/456EdjAdeUvFs7uj7H1WEt7Sx67RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82b059f5a64681b43b8bf549c8eadadcd29af0b29e0d59a8d2b2ce435230927f","last_reissued_at":"2026-05-17T23:54:42.243988Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:42.243988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Matrix Operations on GPUs: Matrix-Vector Multiplication and Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DS","authors_text":"David E. Keyes, George Turkiyyah, Wajih Halim Boukaram","submitted_at":"2019-02-05T17:59:51Z","abstract_excerpt":"Hierarchical matrices are space and time efficient representations of dense matrices that exploit the low rank structure of matrix blocks at different levels of granularity. The hierarchically low rank block partitioning produces representations that can be stored and operated on in near-linear complexity instead of the usual polynomial complexity of dense matrices. In this paper, we present high performance implementations of matrix vector multiplication and compression operations for the $\\mathcal{H}^2$ variant of hierarchical matrices on GPUs. This variant exploits, in addition to the hiera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01829","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":"1902.01829","created_at":"2026-05-17T23:54:42.244061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01829v1","created_at":"2026-05-17T23:54:42.244061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01829","created_at":"2026-05-17T23:54:42.244061+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKYFT5NGI2A3","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKYFT5NGI2A3IO4L","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKYFT5NG","created_at":"2026-05-18T12:33:27.125529+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/QKYFT5NGI2A3IO4L6VE4R2W23T","json":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T.json","graph_json":"https://pith.science/api/pith-number/QKYFT5NGI2A3IO4L6VE4R2W23T/graph.json","events_json":"https://pith.science/api/pith-number/QKYFT5NGI2A3IO4L6VE4R2W23T/events.json","paper":"https://pith.science/paper/QKYFT5NG"},"agent_actions":{"view_html":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T","download_json":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T.json","view_paper":"https://pith.science/paper/QKYFT5NG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01829&json=true","fetch_graph":"https://pith.science/api/pith-number/QKYFT5NGI2A3IO4L6VE4R2W23T/graph.json","fetch_events":"https://pith.science/api/pith-number/QKYFT5NGI2A3IO4L6VE4R2W23T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T/action/storage_attestation","attest_author":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T/action/author_attestation","sign_citation":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T/action/citation_signature","submit_replication":"https://pith.science/pith/QKYFT5NGI2A3IO4L6VE4R2W23T/action/replication_record"}},"created_at":"2026-05-17T23:54:42.244061+00:00","updated_at":"2026-05-17T23:54:42.244061+00:00"}