{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3OGGY3LIDMXWGWZHGMDHB5EHZY","short_pith_number":"pith:3OGGY3LI","schema_version":"1.0","canonical_sha256":"db8c6c6d681b2f635b27330670f487ce1e699d877d9c318785a59f916c77670b","source":{"kind":"arxiv","id":"1904.12274","version":1},"attestation_state":"computed","paper":{"title":"Robust subspace clustering by Cauchy loss function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dacheng Tao, Quanmao Lu, Xuelong Li, Yongsheng Dong","submitted_at":"2019-04-28T07:58:27Z","abstract_excerpt":"Subspace clustering is a problem of exploring the low-dimensional subspaces of high-dimensional data. State-of-the-arts approaches are designed by following the model of spectral clustering based method. These methods pay much attention to learn the representation matrix to construct a suitable similarity matrix and overlook the influence of the noise term on subspace clustering. However, the real data are always contaminated by the noise and the noise usually has a complicated statistical distribution. To alleviate this problem, we in this paper propose a subspace clustering method based on C"},"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":"1904.12274","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-28T07:58:27Z","cross_cats_sorted":[],"title_canon_sha256":"219da4c97bf55b6dbe08949d27ca23727e8ab44ee3a58201f5fe635d71e4ebcb","abstract_canon_sha256":"2935c5a528c88c8be134492c5ed6773efd42edeaaca4038168c2dc127a1e5ec9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:36.900477Z","signature_b64":"4fHMv5vePEqUWHWdVR4fSthA2NLbygQ3r1s/9jsLLxfwwpS7MHTaH8rE0UmwpAIfK1jjUH0kxTS1kHc5G4w1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db8c6c6d681b2f635b27330670f487ce1e699d877d9c318785a59f916c77670b","last_reissued_at":"2026-05-17T23:47:36.899851Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:36.899851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust subspace clustering by Cauchy loss function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dacheng Tao, Quanmao Lu, Xuelong Li, Yongsheng Dong","submitted_at":"2019-04-28T07:58:27Z","abstract_excerpt":"Subspace clustering is a problem of exploring the low-dimensional subspaces of high-dimensional data. State-of-the-arts approaches are designed by following the model of spectral clustering based method. These methods pay much attention to learn the representation matrix to construct a suitable similarity matrix and overlook the influence of the noise term on subspace clustering. However, the real data are always contaminated by the noise and the noise usually has a complicated statistical distribution. To alleviate this problem, we in this paper propose a subspace clustering method based on C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12274","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":"1904.12274","created_at":"2026-05-17T23:47:36.899965+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12274v1","created_at":"2026-05-17T23:47:36.899965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12274","created_at":"2026-05-17T23:47:36.899965+00:00"},{"alias_kind":"pith_short_12","alias_value":"3OGGY3LIDMXW","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3OGGY3LIDMXWGWZH","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3OGGY3LI","created_at":"2026-05-18T12:33:07.085635+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/3OGGY3LIDMXWGWZHGMDHB5EHZY","json":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY.json","graph_json":"https://pith.science/api/pith-number/3OGGY3LIDMXWGWZHGMDHB5EHZY/graph.json","events_json":"https://pith.science/api/pith-number/3OGGY3LIDMXWGWZHGMDHB5EHZY/events.json","paper":"https://pith.science/paper/3OGGY3LI"},"agent_actions":{"view_html":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY","download_json":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY.json","view_paper":"https://pith.science/paper/3OGGY3LI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12274&json=true","fetch_graph":"https://pith.science/api/pith-number/3OGGY3LIDMXWGWZHGMDHB5EHZY/graph.json","fetch_events":"https://pith.science/api/pith-number/3OGGY3LIDMXWGWZHGMDHB5EHZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY/action/storage_attestation","attest_author":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY/action/author_attestation","sign_citation":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY/action/citation_signature","submit_replication":"https://pith.science/pith/3OGGY3LIDMXWGWZHGMDHB5EHZY/action/replication_record"}},"created_at":"2026-05-17T23:47:36.899965+00:00","updated_at":"2026-05-17T23:47:36.899965+00:00"}