{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RRIC3LGLW4E27TFAEIMPR3KTHK","short_pith_number":"pith:RRIC3LGL","schema_version":"1.0","canonical_sha256":"8c502daccbb709afcca02218f8ed533ab9c0e46586bf3f947fc873696ebcf30c","source":{"kind":"arxiv","id":"1708.09707","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic patterns for $\\mathcal{H}$-matrices on many-core processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Peter Zaspel","submitted_at":"2017-08-31T13:50:42Z","abstract_excerpt":"In this work, we consider the reformulation of hierarchical ($\\mathcal{H}$) matrix algorithms for many-core processors with a model implementation on graphics processing units (GPUs). $\\mathcal{H}$ matrices approximate specific dense matrices, e.g., from discretized integral equations or kernel ridge regression, leading to log-linear time complexity in dense matrix-vector products. The parallelization of $\\mathcal{H}$ matrix operations on many-core processors is difficult due to the complex nature of the underlying algorithms. While previous algorithmic advances for many-core hardware focused "},"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":"1708.09707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-31T13:50:42Z","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"title_canon_sha256":"ff51cbc2979e680f157dabea22fe675f36ada9a289beaff20e720fe5173f8d82","abstract_canon_sha256":"1a92b378f6e632e4521baa96803dc9914f08c9184d9f3aea9e654920cf36216e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:13.691720Z","signature_b64":"b7dNzYEpS2uPTKKVEh7DCJvZJtExWrVWSmxRe9vxcRAh9TYw1RM+d0eEPsm6HEpntsTmzUxTdsJhv/NTWywRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c502daccbb709afcca02218f8ed533ab9c0e46586bf3f947fc873696ebcf30c","last_reissued_at":"2026-05-18T00:36:13.691249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:13.691249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic patterns for $\\mathcal{H}$-matrices on many-core processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Peter Zaspel","submitted_at":"2017-08-31T13:50:42Z","abstract_excerpt":"In this work, we consider the reformulation of hierarchical ($\\mathcal{H}$) matrix algorithms for many-core processors with a model implementation on graphics processing units (GPUs). $\\mathcal{H}$ matrices approximate specific dense matrices, e.g., from discretized integral equations or kernel ridge regression, leading to log-linear time complexity in dense matrix-vector products. The parallelization of $\\mathcal{H}$ matrix operations on many-core processors is difficult due to the complex nature of the underlying algorithms. While previous algorithmic advances for many-core hardware focused "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09707","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":"1708.09707","created_at":"2026-05-18T00:36:13.691328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09707v1","created_at":"2026-05-18T00:36:13.691328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09707","created_at":"2026-05-18T00:36:13.691328+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRIC3LGLW4E2","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRIC3LGLW4E27TFA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRIC3LGL","created_at":"2026-05-18T12:31:39.905425+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/RRIC3LGLW4E27TFAEIMPR3KTHK","json":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK.json","graph_json":"https://pith.science/api/pith-number/RRIC3LGLW4E27TFAEIMPR3KTHK/graph.json","events_json":"https://pith.science/api/pith-number/RRIC3LGLW4E27TFAEIMPR3KTHK/events.json","paper":"https://pith.science/paper/RRIC3LGL"},"agent_actions":{"view_html":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK","download_json":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK.json","view_paper":"https://pith.science/paper/RRIC3LGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09707&json=true","fetch_graph":"https://pith.science/api/pith-number/RRIC3LGLW4E27TFAEIMPR3KTHK/graph.json","fetch_events":"https://pith.science/api/pith-number/RRIC3LGLW4E27TFAEIMPR3KTHK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/action/storage_attestation","attest_author":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/action/author_attestation","sign_citation":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/action/citation_signature","submit_replication":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/action/replication_record"}},"created_at":"2026-05-18T00:36:13.691328+00:00","updated_at":"2026-05-18T00:36:13.691328+00:00"}