{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ESMJLLLQM7K4YKKOQS7NHSLMHZ","short_pith_number":"pith:ESMJLLLQ","schema_version":"1.0","canonical_sha256":"249895ad7067d5cc294e84bed3c96c3e41730e832ddbd01f46315a9d05dcdbb8","source":{"kind":"arxiv","id":"1903.09698","version":2},"attestation_state":"computed","paper":{"title":"CUR Decompositions, Approximations, and Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.NA","authors_text":"Keaton Hamm, Longxiu Huang","submitted_at":"2019-03-22T20:26:03Z","abstract_excerpt":"This article discusses a useful tool in dimensionality reduction and low-rank matrix approximation called the CUR decomposition. Various viewpoints of this method in the literature are synergized and are compared and contrasted; included in this is a new characterization of exact CUR decompositions. A novel perturbation analysis is performed on CUR approximations of noisy versions of low-rank matrices, which compares them with the putative CUR decomposition of the underlying low-rank part. Additionally, we give new column and row sampling results which allow one to conclude that a CUR decompos"},"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":"1903.09698","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-22T20:26:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d472cbc7c9955c09db68b5159b07d1346068a9625c9a28efc097550d981fbce2","abstract_canon_sha256":"6252bb0369d17a4079b9342fc0c3419aac77e57081eb0a516f52254f246b11dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:28.625195Z","signature_b64":"AVTyTX5p1hiHs+iQ9LArlY5EqTgPcmiqzT/grwT7mumrrGb2X0U59wJ2jls6jJciaPeYQ1eh7MjmzVHXzfwDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249895ad7067d5cc294e84bed3c96c3e41730e832ddbd01f46315a9d05dcdbb8","last_reissued_at":"2026-05-17T23:49:28.624575Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:28.624575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CUR Decompositions, Approximations, and Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.NA","authors_text":"Keaton Hamm, Longxiu Huang","submitted_at":"2019-03-22T20:26:03Z","abstract_excerpt":"This article discusses a useful tool in dimensionality reduction and low-rank matrix approximation called the CUR decomposition. Various viewpoints of this method in the literature are synergized and are compared and contrasted; included in this is a new characterization of exact CUR decompositions. A novel perturbation analysis is performed on CUR approximations of noisy versions of low-rank matrices, which compares them with the putative CUR decomposition of the underlying low-rank part. Additionally, we give new column and row sampling results which allow one to conclude that a CUR decompos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09698","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":"1903.09698","created_at":"2026-05-17T23:49:28.624678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09698v2","created_at":"2026-05-17T23:49:28.624678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09698","created_at":"2026-05-17T23:49:28.624678+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESMJLLLQM7K4","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESMJLLLQM7K4YKKO","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESMJLLLQ","created_at":"2026-05-18T12:33:15.570797+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/ESMJLLLQM7K4YKKOQS7NHSLMHZ","json":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ.json","graph_json":"https://pith.science/api/pith-number/ESMJLLLQM7K4YKKOQS7NHSLMHZ/graph.json","events_json":"https://pith.science/api/pith-number/ESMJLLLQM7K4YKKOQS7NHSLMHZ/events.json","paper":"https://pith.science/paper/ESMJLLLQ"},"agent_actions":{"view_html":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ","download_json":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ.json","view_paper":"https://pith.science/paper/ESMJLLLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09698&json=true","fetch_graph":"https://pith.science/api/pith-number/ESMJLLLQM7K4YKKOQS7NHSLMHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ESMJLLLQM7K4YKKOQS7NHSLMHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ/action/storage_attestation","attest_author":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ/action/author_attestation","sign_citation":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ/action/citation_signature","submit_replication":"https://pith.science/pith/ESMJLLLQM7K4YKKOQS7NHSLMHZ/action/replication_record"}},"created_at":"2026-05-17T23:49:28.624678+00:00","updated_at":"2026-05-17T23:49:28.624678+00:00"}