{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WAEINMPAHLR6D352F5HMDYFYIV","short_pith_number":"pith:WAEINMPA","canonical_record":{"source":{"id":"1711.00439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-01T16:57:51Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"5ffce55efae9588f90f866fc6755868db526e301d84ecf28736c4fbb0a6b97d0","abstract_canon_sha256":"5e67fb257e086468865f01c4b8944a9f321ab516200a2a0a80620b509102342c"},"schema_version":"1.0"},"canonical_sha256":"b00886b1e03ae3e1efba2f4ec1e0b84554a9a183eb9ff87a0a1bdd9fa6cc8175","source":{"kind":"arxiv","id":"1711.00439","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00439","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00439v2","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00439","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"WAEINMPAHLR6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAEINMPAHLR6D352","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAEINMPA","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WAEINMPAHLR6D352F5HMDYFYIV","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00439","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-01T16:57:51Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"5ffce55efae9588f90f866fc6755868db526e301d84ecf28736c4fbb0a6b97d0","abstract_canon_sha256":"5e67fb257e086468865f01c4b8944a9f321ab516200a2a0a80620b509102342c"},"schema_version":"1.0"},"canonical_sha256":"b00886b1e03ae3e1efba2f4ec1e0b84554a9a183eb9ff87a0a1bdd9fa6cc8175","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:23.934858Z","signature_b64":"ACHrExbvd1aU8M9s9N3KjJbeXEVB/pogqrYPjgTXfeGTzNM3ODC+5VIBpyTHCfVSw+ONHNnX9uRcC/efRI++Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b00886b1e03ae3e1efba2f4ec1e0b84554a9a183eb9ff87a0a1bdd9fa6cc8175","last_reissued_at":"2026-05-18T00:04:23.934219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:23.934219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00439","source_version":2,"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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nspVkzYR1FKZ9o9b7G3/v2N79NRnvNxCYLo60gpc+RTty+LrNMkuybGc2oc8VFVdPto3wsokjo9kk5x/eHYwDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:02:05.497730Z"},"content_sha256":"24b893646bab6e5df60610f469f5e5f5b9db281621125c1fc031741543c8955f","schema_version":"1.0","event_id":"sha256:24b893646bab6e5df60610f469f5e5f5b9db281621125c1fc031741543c8955f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WAEINMPAHLR6D352F5HMDYFYIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling and multilevel coarsening algorithms for fast matrix approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.NA","authors_text":"Shashanka Ubaru, Yousef Saad","submitted_at":"2017-11-01T16:57:51Z","abstract_excerpt":"This paper addresses matrix approximation problems for matrices that are large, sparse and/or that are representations of large graphs. To tackle these problems, we consider algorithms that are based primarily on coarsening techniques, possibly combined with random sampling. A multilevel coarsening technique is proposed which utilizes a hypergraph associated with the data matrix and a graph coarsening strategy based on column matching. Theoretical results are established that characterize the quality of the dimension reduction achieved by a coarsening step, when a proper column matching strate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00439","kind":"arxiv","version":2},"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:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wd1lZD5edd8rjxkRYWR65oFAtQ44/i2Xf53BKFZP/7nVVuZZ3qx49T/YEXecRqQN8szPmSorcCp8dC3rwLI8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:02:05.498289Z"},"content_sha256":"6eaa0d5a0e341cb3a8b527d7a5f2f52465d4415dea500700710bb1fc06a71e09","schema_version":"1.0","event_id":"sha256:6eaa0d5a0e341cb3a8b527d7a5f2f52465d4415dea500700710bb1fc06a71e09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/bundle.json","state_url":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAEINMPAHLR6D352F5HMDYFYIV/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-26T05:02:05Z","links":{"resolver":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV","bundle":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/bundle.json","state":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAEINMPAHLR6D352F5HMDYFYIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WAEINMPAHLR6D352F5HMDYFYIV","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":"5e67fb257e086468865f01c4b8944a9f321ab516200a2a0a80620b509102342c","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-01T16:57:51Z","title_canon_sha256":"5ffce55efae9588f90f866fc6755868db526e301d84ecf28736c4fbb0a6b97d0"},"schema_version":"1.0","source":{"id":"1711.00439","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00439","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00439v2","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00439","created_at":"2026-05-18T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"WAEINMPAHLR6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAEINMPAHLR6D352","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAEINMPA","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:6eaa0d5a0e341cb3a8b527d7a5f2f52465d4415dea500700710bb1fc06a71e09","target":"graph","created_at":"2026-05-18T00:04:23Z","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":"This paper addresses matrix approximation problems for matrices that are large, sparse and/or that are representations of large graphs. To tackle these problems, we consider algorithms that are based primarily on coarsening techniques, possibly combined with random sampling. A multilevel coarsening technique is proposed which utilizes a hypergraph associated with the data matrix and a graph coarsening strategy based on column matching. Theoretical results are established that characterize the quality of the dimension reduction achieved by a coarsening step, when a proper column matching strate","authors_text":"Shashanka Ubaru, Yousef Saad","cross_cats":["cs.LG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-01T16:57:51Z","title":"Sampling and multilevel coarsening algorithms for fast matrix approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00439","kind":"arxiv","version":2},"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:24b893646bab6e5df60610f469f5e5f5b9db281621125c1fc031741543c8955f","target":"record","created_at":"2026-05-18T00:04:23Z","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":"5e67fb257e086468865f01c4b8944a9f321ab516200a2a0a80620b509102342c","cross_cats_sorted":["cs.LG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-01T16:57:51Z","title_canon_sha256":"5ffce55efae9588f90f866fc6755868db526e301d84ecf28736c4fbb0a6b97d0"},"schema_version":"1.0","source":{"id":"1711.00439","kind":"arxiv","version":2}},"canonical_sha256":"b00886b1e03ae3e1efba2f4ec1e0b84554a9a183eb9ff87a0a1bdd9fa6cc8175","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b00886b1e03ae3e1efba2f4ec1e0b84554a9a183eb9ff87a0a1bdd9fa6cc8175","first_computed_at":"2026-05-18T00:04:23.934219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:23.934219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ACHrExbvd1aU8M9s9N3KjJbeXEVB/pogqrYPjgTXfeGTzNM3ODC+5VIBpyTHCfVSw+ONHNnX9uRcC/efRI++Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:23.934858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00439","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24b893646bab6e5df60610f469f5e5f5b9db281621125c1fc031741543c8955f","sha256:6eaa0d5a0e341cb3a8b527d7a5f2f52465d4415dea500700710bb1fc06a71e09"],"state_sha256":"c5c3099e1c4851793ea6f322abc3aa4000e146a91078d9fe2724910ae64e38ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KPWCVPwe4A1B7ddvHN+BYw5xnj74sJVjpU3lvKWejt7an8jI7DonOqZy9mACWZp01H1Yxbvt69EUm8CGx6tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:02:05.501653Z","bundle_sha256":"3f9216b8105de8e52375176ad1700b31a7b77fb01ae17df881cfb21557aba32e"}}