{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PIZ3MRL3LPJYTLKT6QSTUXA7LS","short_pith_number":"pith:PIZ3MRL3","schema_version":"1.0","canonical_sha256":"7a33b6457b5bd389ad53f4253a5c1f5c85b582c5ce74965e2993402418f5c32f","source":{"kind":"arxiv","id":"2503.17288","version":1},"attestation_state":"computed","paper":{"title":"Exploring a Principled Framework for Deep Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chun-Guang Li, Rong Xiao, Wei He, Xianbiao Qi, Xianghan Meng, Zhiyuan Huang","submitted_at":"2025-03-21T16:38:37Z","abstract_excerpt":"Subspace clustering is a classical unsupervised learning task, built on a basic assumption that high-dimensional data can be approximated by a union of subspaces (UoS). Nevertheless, the real-world data are often deviating from the UoS assumption. To address this challenge, state-of-the-art deep subspace clustering algorithms attempt to jointly learn UoS representations and self-expressive coefficients. However, the general framework of the existing algorithms suffers from a catastrophic feature collapse and lacks a theoretical guarantee to learn desired UoS representation. In this paper, we p"},"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":"2503.17288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-03-21T16:38:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4279ff273ec8eac22a403755dc8aae2e7808c493bd65ccbe180b2aa8ca88df46","abstract_canon_sha256":"e02e3afe9c4e9930a506183171ff9bb31c92f090cded40a146782e52d407eb1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:02.910278Z","signature_b64":"5WZ1O7HEVDIeCFyT3BJ1jIVM+7jSj/ICeM5N+uwJJqKVI261P+F8ZPN/lJAEbjmqNYpac5+ZF7pN+QkTe0KGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a33b6457b5bd389ad53f4253a5c1f5c85b582c5ce74965e2993402418f5c32f","last_reissued_at":"2026-07-05T10:37:02.909797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:02.909797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring a Principled Framework for Deep Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chun-Guang Li, Rong Xiao, Wei He, Xianbiao Qi, Xianghan Meng, Zhiyuan Huang","submitted_at":"2025-03-21T16:38:37Z","abstract_excerpt":"Subspace clustering is a classical unsupervised learning task, built on a basic assumption that high-dimensional data can be approximated by a union of subspaces (UoS). Nevertheless, the real-world data are often deviating from the UoS assumption. To address this challenge, state-of-the-art deep subspace clustering algorithms attempt to jointly learn UoS representations and self-expressive coefficients. However, the general framework of the existing algorithms suffers from a catastrophic feature collapse and lacks a theoretical guarantee to learn desired UoS representation. In this paper, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.17288","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.17288/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.17288","created_at":"2026-07-05T10:37:02.909855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.17288v1","created_at":"2026-07-05T10:37:02.909855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.17288","created_at":"2026-07-05T10:37:02.909855+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIZ3MRL3LPJY","created_at":"2026-07-05T10:37:02.909855+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIZ3MRL3LPJYTLKT","created_at":"2026-07-05T10:37:02.909855+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIZ3MRL3","created_at":"2026-07-05T10:37:02.909855+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07184","citing_title":"Dimensionally Reduced Open-World Clustering: DROWCULA","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS","json":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS.json","graph_json":"https://pith.science/api/pith-number/PIZ3MRL3LPJYTLKT6QSTUXA7LS/graph.json","events_json":"https://pith.science/api/pith-number/PIZ3MRL3LPJYTLKT6QSTUXA7LS/events.json","paper":"https://pith.science/paper/PIZ3MRL3"},"agent_actions":{"view_html":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS","download_json":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS.json","view_paper":"https://pith.science/paper/PIZ3MRL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.17288&json=true","fetch_graph":"https://pith.science/api/pith-number/PIZ3MRL3LPJYTLKT6QSTUXA7LS/graph.json","fetch_events":"https://pith.science/api/pith-number/PIZ3MRL3LPJYTLKT6QSTUXA7LS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS/action/storage_attestation","attest_author":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS/action/author_attestation","sign_citation":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS/action/citation_signature","submit_replication":"https://pith.science/pith/PIZ3MRL3LPJYTLKT6QSTUXA7LS/action/replication_record"}},"created_at":"2026-07-05T10:37:02.909855+00:00","updated_at":"2026-07-05T10:37:02.909855+00:00"}