{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C6JA7S6JC674DY7LEUUI3Q6OUT","short_pith_number":"pith:C6JA7S6J","canonical_record":{"source":{"id":"1803.10274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T19:04:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"19e1e31708ffb44c428afdafbdf5a60816c4c5630a1050914725f52862fbf800","abstract_canon_sha256":"a2f79f1627a8777d5e35b2bb0e4c11fa133376ae504454cbcac899a773d6899d"},"schema_version":"1.0"},"canonical_sha256":"17920fcbc917bfc1e3eb25288dc3cea4d105fce9ca53a6c06116671f4ab4d1b8","source":{"kind":"arxiv","id":"1803.10274","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10274","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10274v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10274","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"C6JA7S6JC674","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C6JA7S6JC674DY7L","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C6JA7S6J","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C6JA7S6JC674DY7LEUUI3Q6OUT","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T19:04:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"19e1e31708ffb44c428afdafbdf5a60816c4c5630a1050914725f52862fbf800","abstract_canon_sha256":"a2f79f1627a8777d5e35b2bb0e4c11fa133376ae504454cbcac899a773d6899d"},"schema_version":"1.0"},"canonical_sha256":"17920fcbc917bfc1e3eb25288dc3cea4d105fce9ca53a6c06116671f4ab4d1b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:55.966714Z","signature_b64":"gSksi0qHrHoUrxHCWvhvxpClwiQGsrbMA20dVcCDA4aNFKNLAeA5WGUinsDDZBJORMppk1O4s3kN0CEAWX9jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17920fcbc917bfc1e3eb25288dc3cea4d105fce9ca53a6c06116671f4ab4d1b8","last_reissued_at":"2026-05-18T00:19:55.966083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:55.966083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10274","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:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DW9QsQX8lhgoYo408D+D0vALd6upmzJ2bWXN010BImuF6EC/bokBJEmX9phSIf6q9VONrO9EKzSX7ewWNGLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:56:38.128055Z"},"content_sha256":"25103607444efb97738b99c6e3e57469360d1611dadaf82746c1d381c35c0d10","schema_version":"1.0","event_id":"sha256:25103607444efb97738b99c6e3e57469360d1611dadaf82746c1d381c35c0d10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C6JA7S6JC674DY7LEUUI3Q6OUT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Study of Clustering Techniques and Hierarchical Matrix Formats for Kernel Ridge Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Elizaveta Rebrova, Gustavo Chavez, Pieter Ghysels, Xiaoye Sherry Li, Yang Liu","submitted_at":"2018-03-27T19:04:52Z","abstract_excerpt":"We present memory-efficient and scalable algorithms for kernel methods used in machine learning. Using hierarchical matrix approximations for the kernel matrix the memory requirements, the number of floating point operations, and the execution time are drastically reduced compared to standard dense linear algebra routines. We consider both the general $\\mathcal{H}$ matrix hierarchical format as well as Hierarchically Semi-Separable (HSS) matrices. Furthermore, we investigate the impact of several preprocessing and clustering techniques on the hierarchical matrix compression. Effective clusteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10274","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:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cUDjFdT1P1UARhP5Eun4zrAzGikPNoakKIIyjpYwnt256s3bBkNjveUB+Hh7KTfWF/le5GQVcbMbdSTrKFtJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:56:38.128701Z"},"content_sha256":"94f140d59722c75d515245fe7b21cf891d4636d90129a372de34d91bfdd9814c","schema_version":"1.0","event_id":"sha256:94f140d59722c75d515245fe7b21cf891d4636d90129a372de34d91bfdd9814c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6JA7S6JC674DY7LEUUI3Q6OUT/bundle.json","state_url":"https://pith.science/pith/C6JA7S6JC674DY7LEUUI3Q6OUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6JA7S6JC674DY7LEUUI3Q6OUT/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-05-23T19:56:38Z","links":{"resolver":"https://pith.science/pith/C6JA7S6JC674DY7LEUUI3Q6OUT","bundle":"https://pith.science/pith/C6JA7S6JC674DY7LEUUI3Q6OUT/bundle.json","state":"https://pith.science/pith/C6JA7S6JC674DY7LEUUI3Q6OUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6JA7S6JC674DY7LEUUI3Q6OUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C6JA7S6JC674DY7LEUUI3Q6OUT","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":"a2f79f1627a8777d5e35b2bb0e4c11fa133376ae504454cbcac899a773d6899d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T19:04:52Z","title_canon_sha256":"19e1e31708ffb44c428afdafbdf5a60816c4c5630a1050914725f52862fbf800"},"schema_version":"1.0","source":{"id":"1803.10274","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10274","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10274v1","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10274","created_at":"2026-05-18T00:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"C6JA7S6JC674","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C6JA7S6JC674DY7L","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C6JA7S6J","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:94f140d59722c75d515245fe7b21cf891d4636d90129a372de34d91bfdd9814c","target":"graph","created_at":"2026-05-18T00:19:55Z","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":"We present memory-efficient and scalable algorithms for kernel methods used in machine learning. Using hierarchical matrix approximations for the kernel matrix the memory requirements, the number of floating point operations, and the execution time are drastically reduced compared to standard dense linear algebra routines. We consider both the general $\\mathcal{H}$ matrix hierarchical format as well as Hierarchically Semi-Separable (HSS) matrices. Furthermore, we investigate the impact of several preprocessing and clustering techniques on the hierarchical matrix compression. Effective clusteri","authors_text":"Elizaveta Rebrova, Gustavo Chavez, Pieter Ghysels, Xiaoye Sherry Li, Yang Liu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T19:04:52Z","title":"A Study of Clustering Techniques and Hierarchical Matrix Formats for Kernel Ridge Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10274","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:25103607444efb97738b99c6e3e57469360d1611dadaf82746c1d381c35c0d10","target":"record","created_at":"2026-05-18T00:19:55Z","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":"a2f79f1627a8777d5e35b2bb0e4c11fa133376ae504454cbcac899a773d6899d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-27T19:04:52Z","title_canon_sha256":"19e1e31708ffb44c428afdafbdf5a60816c4c5630a1050914725f52862fbf800"},"schema_version":"1.0","source":{"id":"1803.10274","kind":"arxiv","version":1}},"canonical_sha256":"17920fcbc917bfc1e3eb25288dc3cea4d105fce9ca53a6c06116671f4ab4d1b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17920fcbc917bfc1e3eb25288dc3cea4d105fce9ca53a6c06116671f4ab4d1b8","first_computed_at":"2026-05-18T00:19:55.966083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:55.966083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gSksi0qHrHoUrxHCWvhvxpClwiQGsrbMA20dVcCDA4aNFKNLAeA5WGUinsDDZBJORMppk1O4s3kN0CEAWX9jDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:55.966714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10274","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25103607444efb97738b99c6e3e57469360d1611dadaf82746c1d381c35c0d10","sha256:94f140d59722c75d515245fe7b21cf891d4636d90129a372de34d91bfdd9814c"],"state_sha256":"333d10a08e3751f12ffc99b53c0e813c22cedfd0c1bab67bcc7d4ce2bd3c4336"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07paaS6HrZypZz+OSVjURKkF5AlxW2MyOXsdJ6qaqO13lL2vJt2owbfOUWF6tJdMu/8Yq48jM6e8FW8kx9wsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T19:56:38.132182Z","bundle_sha256":"14982dea4809b84150f9791bfdc80addae171e2361cb1f4f4ed3678eaaad577f"}}