{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FEYUSNG76HDR3V6EPYLKXLTH3J","short_pith_number":"pith:FEYUSNG7","schema_version":"1.0","canonical_sha256":"29314934dff1c71dd7c47e16abae67da506c11e0caaa3550958e57b856c7d905","source":{"kind":"arxiv","id":"1711.04178","version":3},"attestation_state":"computed","paper":{"title":"CUR Decompositions, Similarity Matrices, and Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmet Bugra Koku, Akram Aldroubi, Ali Sekmen, Keaton Hamm","submitted_at":"2017-11-11T18:34:34Z","abstract_excerpt":"A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces $\\mathscr{U}=\\underset{i=1}{\\overset{M}\\bigcup}S_i$. The similarity matrices thus constructed give the exact clustering in the noise-free case. Additionally, this decomposition gives rise to many distinct similarity matrices from a given set of data, which allow enough flexibility to perform accurate clustering of noisy data. We also show that two known methods"},"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.04178","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-11T18:34:34Z","cross_cats_sorted":["cs.CV","math.NA","stat.ML"],"title_canon_sha256":"0366ba59bb663570bbee2e1bfd4cc5956bd145ba06ddec77d9ed1ee436c6a57a","abstract_canon_sha256":"4d88198343aea147584fdd768bb49beeed74893da8c4a6110281786600883029"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.114373Z","signature_b64":"ubVIMcndyj5MIOSoOMQqGnAjtCsjmJuDoRf7nKW/QnwV2aQ0Ubylu1BPa0zV3afvJYQsh1T6JIhslL2o3s77Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29314934dff1c71dd7c47e16abae67da506c11e0caaa3550958e57b856c7d905","last_reissued_at":"2026-05-17T23:58:31.113721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.113721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CUR Decompositions, Similarity Matrices, and Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmet Bugra Koku, Akram Aldroubi, Ali Sekmen, Keaton Hamm","submitted_at":"2017-11-11T18:34:34Z","abstract_excerpt":"A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces $\\mathscr{U}=\\underset{i=1}{\\overset{M}\\bigcup}S_i$. The similarity matrices thus constructed give the exact clustering in the noise-free case. Additionally, this decomposition gives rise to many distinct similarity matrices from a given set of data, which allow enough flexibility to perform accurate clustering of noisy data. We also show that two known methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04178","kind":"arxiv","version":3},"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.04178","created_at":"2026-05-17T23:58:31.113826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04178v3","created_at":"2026-05-17T23:58:31.113826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04178","created_at":"2026-05-17T23:58:31.113826+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEYUSNG76HDR","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEYUSNG76HDR3V6E","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEYUSNG7","created_at":"2026-05-18T12:31:15.632608+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/FEYUSNG76HDR3V6EPYLKXLTH3J","json":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J.json","graph_json":"https://pith.science/api/pith-number/FEYUSNG76HDR3V6EPYLKXLTH3J/graph.json","events_json":"https://pith.science/api/pith-number/FEYUSNG76HDR3V6EPYLKXLTH3J/events.json","paper":"https://pith.science/paper/FEYUSNG7"},"agent_actions":{"view_html":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J","download_json":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J.json","view_paper":"https://pith.science/paper/FEYUSNG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04178&json=true","fetch_graph":"https://pith.science/api/pith-number/FEYUSNG76HDR3V6EPYLKXLTH3J/graph.json","fetch_events":"https://pith.science/api/pith-number/FEYUSNG76HDR3V6EPYLKXLTH3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/action/storage_attestation","attest_author":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/action/author_attestation","sign_citation":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/action/citation_signature","submit_replication":"https://pith.science/pith/FEYUSNG76HDR3V6EPYLKXLTH3J/action/replication_record"}},"created_at":"2026-05-17T23:58:31.113826+00:00","updated_at":"2026-05-17T23:58:31.113826+00:00"}