{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3LEHYVQ57V5KQP4CXMDBYOP36Z","short_pith_number":"pith:3LEHYVQ5","schema_version":"1.0","canonical_sha256":"dac87c561dfd7aa83f82bb061c39fbf66f8591b7fd3059b2d33751f5ed0cdf43","source":{"kind":"arxiv","id":"1811.01045","version":1},"attestation_state":"computed","paper":{"title":"Scalable Deep $k$-Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ian Reid, Mehrtash Harandi, Pan Ji, Richard Hartley, Tong Zhang","submitted_at":"2018-11-02T18:54:10Z","abstract_excerpt":"Subspace clustering algorithms are notorious for their scalability issues because building and processing large affinity matrices are demanding. In this paper, we introduce a method that simultaneously learns an embedding space along subspaces within it to minimize a notion of reconstruction error, thus addressing the problem of subspace clustering in an end-to-end learning paradigm. To achieve our goal, we propose a scheme to update subspaces within a deep neural network. This in turn frees us from the need of having an affinity matrix to perform clustering. Unlike previous attempts, our meth"},"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":"1811.01045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-02T18:54:10Z","cross_cats_sorted":[],"title_canon_sha256":"4e16f51c0d8444b98acb18ac5067764e8298ffc74e614d1e7a2a8ab873744ddc","abstract_canon_sha256":"771db3c02f40721a264b0048f9ede05ce83bc00bd1b178a58937182754993cb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.207343Z","signature_b64":"vP/9l7dlJs84e8EgjJ0yrTCf9zmeZWsoMZP4kwXI1UVKSZzL3iAp0SZPguANoiBqkMC7xO1cB+sxPeDDo6InDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dac87c561dfd7aa83f82bb061c39fbf66f8591b7fd3059b2d33751f5ed0cdf43","last_reissued_at":"2026-05-18T00:01:37.206779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.206779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Deep $k$-Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ian Reid, Mehrtash Harandi, Pan Ji, Richard Hartley, Tong Zhang","submitted_at":"2018-11-02T18:54:10Z","abstract_excerpt":"Subspace clustering algorithms are notorious for their scalability issues because building and processing large affinity matrices are demanding. In this paper, we introduce a method that simultaneously learns an embedding space along subspaces within it to minimize a notion of reconstruction error, thus addressing the problem of subspace clustering in an end-to-end learning paradigm. To achieve our goal, we propose a scheme to update subspaces within a deep neural network. This in turn frees us from the need of having an affinity matrix to perform clustering. Unlike previous attempts, our meth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01045","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":"1811.01045","created_at":"2026-05-18T00:01:37.206879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01045v1","created_at":"2026-05-18T00:01:37.206879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01045","created_at":"2026-05-18T00:01:37.206879+00:00"},{"alias_kind":"pith_short_12","alias_value":"3LEHYVQ57V5K","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3LEHYVQ57V5KQP4C","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3LEHYVQ5","created_at":"2026-05-18T12:32:02.567920+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/3LEHYVQ57V5KQP4CXMDBYOP36Z","json":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z.json","graph_json":"https://pith.science/api/pith-number/3LEHYVQ57V5KQP4CXMDBYOP36Z/graph.json","events_json":"https://pith.science/api/pith-number/3LEHYVQ57V5KQP4CXMDBYOP36Z/events.json","paper":"https://pith.science/paper/3LEHYVQ5"},"agent_actions":{"view_html":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z","download_json":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z.json","view_paper":"https://pith.science/paper/3LEHYVQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01045&json=true","fetch_graph":"https://pith.science/api/pith-number/3LEHYVQ57V5KQP4CXMDBYOP36Z/graph.json","fetch_events":"https://pith.science/api/pith-number/3LEHYVQ57V5KQP4CXMDBYOP36Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/action/storage_attestation","attest_author":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/action/author_attestation","sign_citation":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/action/citation_signature","submit_replication":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/action/replication_record"}},"created_at":"2026-05-18T00:01:37.206879+00:00","updated_at":"2026-05-18T00:01:37.206879+00:00"}