{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3LEHYVQ57V5KQP4CXMDBYOP36Z","short_pith_number":"pith:3LEHYVQ5","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"},"canonical_sha256":"dac87c561dfd7aa83f82bb061c39fbf66f8591b7fd3059b2d33751f5ed0cdf43","source":{"kind":"arxiv","id":"1811.01045","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01045","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01045v1","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01045","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"3LEHYVQ57V5K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3LEHYVQ57V5KQP4C","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3LEHYVQ5","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3LEHYVQ57V5KQP4CXMDBYOP36Z","target":"record","payload":{"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"},"canonical_sha256":"dac87c561dfd7aa83f82bb061c39fbf66f8591b7fd3059b2d33751f5ed0cdf43","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"},"source_kind":"arxiv","source_id":"1811.01045","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXyuvmuBxv829PDWIIXc8llFXb5Zw1ba+uI0qOac4Dxlyh4Ch63+NAzoJVGLxk2aUWxPesG7WpZBvv+Jvx5eCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:17:22.958361Z"},"content_sha256":"f0c05acabc3d677051550f9c9756a63815153342acc74d8941da2d8f0b137af0","schema_version":"1.0","event_id":"sha256:f0c05acabc3d677051550f9c9756a63815153342acc74d8941da2d8f0b137af0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3LEHYVQ57V5KQP4CXMDBYOP36Z","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YG+cwPDO7CrLdQOeJkNQRD10JX84K9CAo/idx8vTK2qzgtzr7NcXHk/ajrWqSSMxgGzw41x04Piq4zuwAiY8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:17:22.959049Z"},"content_sha256":"08a12ac8f55c9634d1ddf2720247b1449139d421ee39042ab60c7d5fedf3239d","schema_version":"1.0","event_id":"sha256:08a12ac8f55c9634d1ddf2720247b1449139d421ee39042ab60c7d5fedf3239d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/bundle.json","state_url":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T17:17:22Z","links":{"resolver":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z","bundle":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/bundle.json","state":"https://pith.science/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3LEHYVQ57V5KQP4CXMDBYOP36Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3LEHYVQ57V5KQP4CXMDBYOP36Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"771db3c02f40721a264b0048f9ede05ce83bc00bd1b178a58937182754993cb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-02T18:54:10Z","title_canon_sha256":"4e16f51c0d8444b98acb18ac5067764e8298ffc74e614d1e7a2a8ab873744ddc"},"schema_version":"1.0","source":{"id":"1811.01045","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01045","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01045v1","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01045","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"3LEHYVQ57V5K","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3LEHYVQ57V5KQP4C","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3LEHYVQ5","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:08a12ac8f55c9634d1ddf2720247b1449139d421ee39042ab60c7d5fedf3239d","target":"graph","created_at":"2026-05-18T00:01:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ian Reid, Mehrtash Harandi, Pan Ji, Richard Hartley, Tong Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-02T18:54:10Z","title":"Scalable Deep $k$-Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01045","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f0c05acabc3d677051550f9c9756a63815153342acc74d8941da2d8f0b137af0","target":"record","created_at":"2026-05-18T00:01:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"771db3c02f40721a264b0048f9ede05ce83bc00bd1b178a58937182754993cb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-02T18:54:10Z","title_canon_sha256":"4e16f51c0d8444b98acb18ac5067764e8298ffc74e614d1e7a2a8ab873744ddc"},"schema_version":"1.0","source":{"id":"1811.01045","kind":"arxiv","version":1}},"canonical_sha256":"dac87c561dfd7aa83f82bb061c39fbf66f8591b7fd3059b2d33751f5ed0cdf43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dac87c561dfd7aa83f82bb061c39fbf66f8591b7fd3059b2d33751f5ed0cdf43","first_computed_at":"2026-05-18T00:01:37.206779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:37.206779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vP/9l7dlJs84e8EgjJ0yrTCf9zmeZWsoMZP4kwXI1UVKSZzL3iAp0SZPguANoiBqkMC7xO1cB+sxPeDDo6InDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:37.207343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01045","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c05acabc3d677051550f9c9756a63815153342acc74d8941da2d8f0b137af0","sha256:08a12ac8f55c9634d1ddf2720247b1449139d421ee39042ab60c7d5fedf3239d"],"state_sha256":"1557007eb423d4e2e1b3f615a470dc2a1182a14b81686ee277d49334fdbcb9cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhddLP0jPFy+GiIJnGmSHtyS2JlEsfqASZGoioq2Nat2FYkJxvzXYXL79ykdLt8sr3pjM5aHsombCVe6aHJKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:17:22.962752Z","bundle_sha256":"4d7228d3f030d8d12f605d1585e8a478548648347499a7d4df6df5b05b81f4be"}}