{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WAEINMPAHLR6D352F5HMDYFYIV","short_pith_number":"pith:WAEINMPA","schema_version":"1.0","canonical_sha256":"b00886b1e03ae3e1efba2f4ec1e0b84554a9a183eb9ff87a0a1bdd9fa6cc8175","source":{"kind":"arxiv","id":"1711.00439","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.00439","created_at":"2026-05-18T00:04:23.934327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00439v2","created_at":"2026-05-18T00:04:23.934327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00439","created_at":"2026-05-18T00:04:23.934327+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAEINMPAHLR6","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAEINMPAHLR6D352","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAEINMPA","created_at":"2026-05-18T12:31:53.515858+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/WAEINMPAHLR6D352F5HMDYFYIV","json":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV.json","graph_json":"https://pith.science/api/pith-number/WAEINMPAHLR6D352F5HMDYFYIV/graph.json","events_json":"https://pith.science/api/pith-number/WAEINMPAHLR6D352F5HMDYFYIV/events.json","paper":"https://pith.science/paper/WAEINMPA"},"agent_actions":{"view_html":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV","download_json":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV.json","view_paper":"https://pith.science/paper/WAEINMPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00439&json=true","fetch_graph":"https://pith.science/api/pith-number/WAEINMPAHLR6D352F5HMDYFYIV/graph.json","fetch_events":"https://pith.science/api/pith-number/WAEINMPAHLR6D352F5HMDYFYIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/action/storage_attestation","attest_author":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/action/author_attestation","sign_citation":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/action/citation_signature","submit_replication":"https://pith.science/pith/WAEINMPAHLR6D352F5HMDYFYIV/action/replication_record"}},"created_at":"2026-05-18T00:04:23.934327+00:00","updated_at":"2026-05-18T00:04:23.934327+00:00"}