{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:22DX75XESK5VBEKKEKTLOE3G3A","short_pith_number":"pith:22DX75XE","canonical_record":{"source":{"id":"1803.05050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-13T21:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"b4aeec259d562d282fc49d962ce04ba51fb3ef07b479e28c2c013040a4a53c32","abstract_canon_sha256":"4ea3a20f30af64221d0853c87cf871071f849b1d73b4dbd1025129dfffbb2245"},"schema_version":"1.0"},"canonical_sha256":"d6877ff6e492bb50914a22a6b71366d8069618f667f82b0426ae98d2935cca55","source":{"kind":"arxiv","id":"1803.05050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05050","created_at":"2026-05-18T00:21:02Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05050v1","created_at":"2026-05-18T00:21:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05050","created_at":"2026-05-18T00:21:02Z"},{"alias_kind":"pith_short_12","alias_value":"22DX75XESK5V","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"22DX75XESK5VBEKK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"22DX75XE","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:22DX75XESK5VBEKKEKTLOE3G3A","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-13T21:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"b4aeec259d562d282fc49d962ce04ba51fb3ef07b479e28c2c013040a4a53c32","abstract_canon_sha256":"4ea3a20f30af64221d0853c87cf871071f849b1d73b4dbd1025129dfffbb2245"},"schema_version":"1.0"},"canonical_sha256":"d6877ff6e492bb50914a22a6b71366d8069618f667f82b0426ae98d2935cca55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:02.205406Z","signature_b64":"tCxcjGdYRHB+sB7fT/Dit+2teSs3v8CwuV8dZmT6W2Yl6+1SxaYKgoLFVU7bM2iziD0reFnU9w6Y5VZj+9qrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6877ff6e492bb50914a22a6b71366d8069618f667f82b0426ae98d2935cca55","last_reissued_at":"2026-05-18T00:21:02.204943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:02.204943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05050","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:21:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3zqA2YJNIVx4yz1CyNm/FVolUCdVcOw0M0/FAbqn431oWAxkH1R/RqjtBnMiq6tLSFx6LBARV8FgcqAPhV0tDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:00:47.068843Z"},"content_sha256":"ce2d7dc6285e9ecff718804bcc0730bad3e021b958cfd3989ca287d181a7cedd","schema_version":"1.0","event_id":"sha256:ce2d7dc6285e9ecff718804bcc0730bad3e021b958cfd3989ca287d181a7cedd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:22DX75XESK5VBEKKEKTLOE3G3A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A hierarchical random compression method for kernel matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Duan Chen, Wei Cai","submitted_at":"2018-03-13T21:17:28Z","abstract_excerpt":"In this paper, we propose a hierarchical random compression method (HRCM) for kernel matrices in fast kernel summations. The HRCM combines the hierarchical framework of the H-matrix and a randomized sampling technique of the column and row spaces for far-field interaction kernel matrices. We show that a uniform column/row sampling (with a given sample size) of a far-field kernel matrix, with- out the need and associated cost to pre-compute a costly sampling distribution, will give a low-rank compression of such low-rank matrices, independent of the matrix sizes and only dependent on the separa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05050","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:21:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ofgVAXMRwezIMYR0r9dOiXrZxwzbvv8xM5IJfoFA2xHcsEOU57SHRdRsPW4dmUc/vU5og5jLzbAk9OnOE9aCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:00:47.069186Z"},"content_sha256":"c20e8d62d5923dbedb8f12162161d9083f1e65b8d96c2afeb6b72962e1b48f0c","schema_version":"1.0","event_id":"sha256:c20e8d62d5923dbedb8f12162161d9083f1e65b8d96c2afeb6b72962e1b48f0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22DX75XESK5VBEKKEKTLOE3G3A/bundle.json","state_url":"https://pith.science/pith/22DX75XESK5VBEKKEKTLOE3G3A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22DX75XESK5VBEKKEKTLOE3G3A/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-07T07:00:47Z","links":{"resolver":"https://pith.science/pith/22DX75XESK5VBEKKEKTLOE3G3A","bundle":"https://pith.science/pith/22DX75XESK5VBEKKEKTLOE3G3A/bundle.json","state":"https://pith.science/pith/22DX75XESK5VBEKKEKTLOE3G3A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22DX75XESK5VBEKKEKTLOE3G3A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:22DX75XESK5VBEKKEKTLOE3G3A","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":"4ea3a20f30af64221d0853c87cf871071f849b1d73b4dbd1025129dfffbb2245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-13T21:17:28Z","title_canon_sha256":"b4aeec259d562d282fc49d962ce04ba51fb3ef07b479e28c2c013040a4a53c32"},"schema_version":"1.0","source":{"id":"1803.05050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05050","created_at":"2026-05-18T00:21:02Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05050v1","created_at":"2026-05-18T00:21:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05050","created_at":"2026-05-18T00:21:02Z"},{"alias_kind":"pith_short_12","alias_value":"22DX75XESK5V","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"22DX75XESK5VBEKK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"22DX75XE","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c20e8d62d5923dbedb8f12162161d9083f1e65b8d96c2afeb6b72962e1b48f0c","target":"graph","created_at":"2026-05-18T00:21:02Z","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 paper, we propose a hierarchical random compression method (HRCM) for kernel matrices in fast kernel summations. The HRCM combines the hierarchical framework of the H-matrix and a randomized sampling technique of the column and row spaces for far-field interaction kernel matrices. We show that a uniform column/row sampling (with a given sample size) of a far-field kernel matrix, with- out the need and associated cost to pre-compute a costly sampling distribution, will give a low-rank compression of such low-rank matrices, independent of the matrix sizes and only dependent on the separa","authors_text":"Duan Chen, Wei Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-13T21:17:28Z","title":"A hierarchical random compression method for kernel matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05050","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:ce2d7dc6285e9ecff718804bcc0730bad3e021b958cfd3989ca287d181a7cedd","target":"record","created_at":"2026-05-18T00:21:02Z","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":"4ea3a20f30af64221d0853c87cf871071f849b1d73b4dbd1025129dfffbb2245","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-13T21:17:28Z","title_canon_sha256":"b4aeec259d562d282fc49d962ce04ba51fb3ef07b479e28c2c013040a4a53c32"},"schema_version":"1.0","source":{"id":"1803.05050","kind":"arxiv","version":1}},"canonical_sha256":"d6877ff6e492bb50914a22a6b71366d8069618f667f82b0426ae98d2935cca55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6877ff6e492bb50914a22a6b71366d8069618f667f82b0426ae98d2935cca55","first_computed_at":"2026-05-18T00:21:02.204943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:02.204943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tCxcjGdYRHB+sB7fT/Dit+2teSs3v8CwuV8dZmT6W2Yl6+1SxaYKgoLFVU7bM2iziD0reFnU9w6Y5VZj+9qrCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:02.205406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce2d7dc6285e9ecff718804bcc0730bad3e021b958cfd3989ca287d181a7cedd","sha256:c20e8d62d5923dbedb8f12162161d9083f1e65b8d96c2afeb6b72962e1b48f0c"],"state_sha256":"b003d1c38ab81c53f63f4df290eadda56722588606acbfbbec71414589de1425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GzZtAfs+I0aw9w8qV191grMrnMkrUZyXQEPwhUOblo7odqgLhkaodMr4W4n7CcPfPKO/uKb3n+uKWc1ddfztAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:00:47.071448Z","bundle_sha256":"73f45220cc1f25b10f97eba4d0589ecc409ebabd5e84b7246434350d620d8d59"}}