{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RRIC3LGLW4E27TFAEIMPR3KTHK","short_pith_number":"pith:RRIC3LGL","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"},"canonical_sha256":"8c502daccbb709afcca02218f8ed533ab9c0e46586bf3f947fc873696ebcf30c","source":{"kind":"arxiv","id":"1708.09707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09707","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09707v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09707","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"RRIC3LGLW4E2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RRIC3LGLW4E27TFA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RRIC3LGL","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RRIC3LGLW4E27TFAEIMPR3KTHK","target":"record","payload":{"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"},"canonical_sha256":"8c502daccbb709afcca02218f8ed533ab9c0e46586bf3f947fc873696ebcf30c","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"},"source_kind":"arxiv","source_id":"1708.09707","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0IcRahD1Xs+PWrfMknbIUIon77M/V1qKKPYuuxlx59htEy6DzdwvkvlC/IP9xQq98KEAA51s+U2MDlnyL98VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:57:12.417795Z"},"content_sha256":"ecc298b5d0ad09939b16eae808d8f5cb68d9dfc3311c15b0207da205f0be5663","schema_version":"1.0","event_id":"sha256:ecc298b5d0ad09939b16eae808d8f5cb68d9dfc3311c15b0207da205f0be5663"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RRIC3LGLW4E27TFAEIMPR3KTHK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGei15kSFWF+jcaJdxxWqCrfcteSZGTFya8iu9FQNg1Wz4eosp5Kpc+LbQnp7rmB9/ylrHTGiWtcC3q8EkmHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:57:12.418381Z"},"content_sha256":"d9d8fa18fb7a4c666ae1d3e2763688ccab4bbf99d2dcb9dfd35297701d26843f","schema_version":"1.0","event_id":"sha256:d9d8fa18fb7a4c666ae1d3e2763688ccab4bbf99d2dcb9dfd35297701d26843f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/bundle.json","state_url":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T23:57:12Z","links":{"resolver":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK","bundle":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/bundle.json","state":"https://pith.science/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRIC3LGLW4E27TFAEIMPR3KTHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RRIC3LGLW4E27TFAEIMPR3KTHK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1a92b378f6e632e4521baa96803dc9914f08c9184d9f3aea9e654920cf36216e","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-31T13:50:42Z","title_canon_sha256":"ff51cbc2979e680f157dabea22fe675f36ada9a289beaff20e720fe5173f8d82"},"schema_version":"1.0","source":{"id":"1708.09707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09707","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09707v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09707","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"RRIC3LGLW4E2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RRIC3LGLW4E27TFA","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RRIC3LGL","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:d9d8fa18fb7a4c666ae1d3e2763688ccab4bbf99d2dcb9dfd35297701d26843f","target":"graph","created_at":"2026-05-18T00:36:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Peter Zaspel","cross_cats":["cs.MS","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-31T13:50:42Z","title":"Algorithmic patterns for $\\mathcal{H}$-matrices on many-core processors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09707","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ecc298b5d0ad09939b16eae808d8f5cb68d9dfc3311c15b0207da205f0be5663","target":"record","created_at":"2026-05-18T00:36:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1a92b378f6e632e4521baa96803dc9914f08c9184d9f3aea9e654920cf36216e","cross_cats_sorted":["cs.MS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-31T13:50:42Z","title_canon_sha256":"ff51cbc2979e680f157dabea22fe675f36ada9a289beaff20e720fe5173f8d82"},"schema_version":"1.0","source":{"id":"1708.09707","kind":"arxiv","version":1}},"canonical_sha256":"8c502daccbb709afcca02218f8ed533ab9c0e46586bf3f947fc873696ebcf30c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c502daccbb709afcca02218f8ed533ab9c0e46586bf3f947fc873696ebcf30c","first_computed_at":"2026-05-18T00:36:13.691249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:13.691249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b7dNzYEpS2uPTKKVEh7DCJvZJtExWrVWSmxRe9vxcRAh9TYw1RM+d0eEPsm6HEpntsTmzUxTdsJhv/NTWywRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:13.691720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecc298b5d0ad09939b16eae808d8f5cb68d9dfc3311c15b0207da205f0be5663","sha256:d9d8fa18fb7a4c666ae1d3e2763688ccab4bbf99d2dcb9dfd35297701d26843f"],"state_sha256":"bb1a5ec6135879e681c525baf6d67b2856c21fb0622b22feb59f0a6d1cb5ad4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njRbrSOAr4g4o4G77gYrQSGOIueJjMgbnMVhKEXaN804G39fGcGHZfUygsSt+1X6z/qGDJ4kP0j2OhRslg0ECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:57:12.421294Z","bundle_sha256":"241ba1e0d7293323443b951f19d183d2d0f52eea9314548038d28a5e4dc93256"}}