{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TMN4RSYEGRH5L2WKNYP2IC3HPF","short_pith_number":"pith:TMN4RSYE","schema_version":"1.0","canonical_sha256":"9b1bc8cb04344fd5eaca6e1fa40b67796bcc576d81ca06e38020866927b8cdff","source":{"kind":"arxiv","id":"1501.04277","version":1},"attestation_state":"computed","paper":{"title":"Correntropy Induced L2 Graph for Robust Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Canyi Lu, Jinhui Tang, Liang Lin, Min Lin, Shuicheng Yan, Zhouchen Lin","submitted_at":"2015-01-18T10:06:55Z","abstract_excerpt":"In this paper, we study the robust subspace clustering problem, which aims to cluster the given possibly noisy data points into their underlying subspaces. A large pool of previous subspace clustering methods focus on the graph construction by different regularization of the representation coefficient. We instead focus on the robustness of the model to non-Gaussian noises. We propose a new robust clustering method by using the correntropy induced metric, which is robust for handling the non-Gaussian and impulsive noises. Also we further extend the method for handling the data with outlier rows"},"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":"1501.04277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-01-18T10:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"23f8eeed1e87b5d9d9ddf91c517d37ade8359e0fc2cce04078befd4088f35c6e","abstract_canon_sha256":"5320fbb801c39df19d7a0ccf6d489d746a51e0093b4b852b886aa53909bbfaee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:09.518134Z","signature_b64":"Hgbah021xb8R6HNP8LgHgK0kkoqWe80oCS0EYMg4dRM858p8A3muZkAU77CsebJ2eyCLbqeUw6GMPpxnlKKCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b1bc8cb04344fd5eaca6e1fa40b67796bcc576d81ca06e38020866927b8cdff","last_reissued_at":"2026-05-18T02:29:09.517489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:09.517489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correntropy Induced L2 Graph for Robust Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Canyi Lu, Jinhui Tang, Liang Lin, Min Lin, Shuicheng Yan, Zhouchen Lin","submitted_at":"2015-01-18T10:06:55Z","abstract_excerpt":"In this paper, we study the robust subspace clustering problem, which aims to cluster the given possibly noisy data points into their underlying subspaces. A large pool of previous subspace clustering methods focus on the graph construction by different regularization of the representation coefficient. We instead focus on the robustness of the model to non-Gaussian noises. We propose a new robust clustering method by using the correntropy induced metric, which is robust for handling the non-Gaussian and impulsive noises. Also we further extend the method for handling the data with outlier rows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04277","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.04277","created_at":"2026-05-18T02:29:09.517599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04277v1","created_at":"2026-05-18T02:29:09.517599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04277","created_at":"2026-05-18T02:29:09.517599+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMN4RSYEGRH5","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMN4RSYEGRH5L2WK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMN4RSYE","created_at":"2026-05-18T12:29:42.218222+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/TMN4RSYEGRH5L2WKNYP2IC3HPF","json":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF.json","graph_json":"https://pith.science/api/pith-number/TMN4RSYEGRH5L2WKNYP2IC3HPF/graph.json","events_json":"https://pith.science/api/pith-number/TMN4RSYEGRH5L2WKNYP2IC3HPF/events.json","paper":"https://pith.science/paper/TMN4RSYE"},"agent_actions":{"view_html":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF","download_json":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF.json","view_paper":"https://pith.science/paper/TMN4RSYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04277&json=true","fetch_graph":"https://pith.science/api/pith-number/TMN4RSYEGRH5L2WKNYP2IC3HPF/graph.json","fetch_events":"https://pith.science/api/pith-number/TMN4RSYEGRH5L2WKNYP2IC3HPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/action/storage_attestation","attest_author":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/action/author_attestation","sign_citation":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/action/citation_signature","submit_replication":"https://pith.science/pith/TMN4RSYEGRH5L2WKNYP2IC3HPF/action/replication_record"}},"created_at":"2026-05-18T02:29:09.517599+00:00","updated_at":"2026-05-18T02:29:09.517599+00:00"}