{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5W3AKC3JRZXK2QHKNWQIUUW3UB","short_pith_number":"pith:5W3AKC3J","canonical_record":{"source":{"id":"1803.05657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-15T09:31:44Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"cb48bde7b11e19e109058574c3378eaa9be49556b6f04f5296c43a8a10de2521","abstract_canon_sha256":"d6ee6562772dd45b8db498d8bdabbb806e8f3a0a2c3d41c0b85ff7133c3fb7b8"},"schema_version":"1.0"},"canonical_sha256":"edb6050b698e6ead40ea6da08a52dba07a9daf6dbfeccf097c143e71cce9766c","source":{"kind":"arxiv","id":"1803.05657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05657","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05657v1","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05657","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"5W3AKC3JRZXK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5W3AKC3JRZXK2QHK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5W3AKC3J","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5W3AKC3JRZXK2QHKNWQIUUW3UB","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-15T09:31:44Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"cb48bde7b11e19e109058574c3378eaa9be49556b6f04f5296c43a8a10de2521","abstract_canon_sha256":"d6ee6562772dd45b8db498d8bdabbb806e8f3a0a2c3d41c0b85ff7133c3fb7b8"},"schema_version":"1.0"},"canonical_sha256":"edb6050b698e6ead40ea6da08a52dba07a9daf6dbfeccf097c143e71cce9766c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:54.969926Z","signature_b64":"VoTcdTeIKdezowJdKdvOCAq8HfgpNdlgVPDuhz7YU36ApKEBTgWTqCe6bdoypdEXVBI20fPdseQKV+e4dexmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb6050b698e6ead40ea6da08a52dba07a9daf6dbfeccf097c143e71cce9766c","last_reissued_at":"2026-05-18T00:20:54.969340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:54.969340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05657","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:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9q22hugq4q1JXn2qUjGvCXVfVAFiA5MgHLKZuypZgZ9NrpsaLnSh1EDK9rANzGI4SBp7zXyBdaAKywEp70TbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:26:00.834008Z"},"content_sha256":"bd01007a13ed3ddf6206d0d30b38bf3d8b54d8f9c0016bd8f6715a984a9356b7","schema_version":"1.0","event_id":"sha256:bd01007a13ed3ddf6206d0d30b38bf3d8b54d8f9c0016bd8f6715a984a9356b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5W3AKC3JRZXK2QHKNWQIUUW3UB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Subspace Clustering Based on the Kronecker Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hancock Edwin, Jun Zhou, Lei Zhou, Xianglong Liu, Xiao Bai","submitted_at":"2018-03-15T09:31:44Z","abstract_excerpt":"Subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is often smaller than the ambient dimension. Spectral clustering, as one of the main approaches to subspace clustering, often takes on a sparse representation or a low-rank representation to learn a block diagonal self-representation matrix for subspace generation. However, existing methods require solving a large scale convex optimization problem with a large set of data, with computational complexity reaches O(N^3) for N data points. Therefore, the efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05657","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:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkRGlKP72A+bAkGkKHLmGWG5cWggAVhQuEX1V1fXqhA2OhoJv1mhKXj3AWIsMz6LAJnTWTwzUVR9FcQmOZglAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:26:00.834370Z"},"content_sha256":"96a2360b78f90a8689b6811c2e5b034f80ae4be868215e9b8c2ea6010246b591","schema_version":"1.0","event_id":"sha256:96a2360b78f90a8689b6811c2e5b034f80ae4be868215e9b8c2ea6010246b591"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5W3AKC3JRZXK2QHKNWQIUUW3UB/bundle.json","state_url":"https://pith.science/pith/5W3AKC3JRZXK2QHKNWQIUUW3UB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5W3AKC3JRZXK2QHKNWQIUUW3UB/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-06-10T15:26:00Z","links":{"resolver":"https://pith.science/pith/5W3AKC3JRZXK2QHKNWQIUUW3UB","bundle":"https://pith.science/pith/5W3AKC3JRZXK2QHKNWQIUUW3UB/bundle.json","state":"https://pith.science/pith/5W3AKC3JRZXK2QHKNWQIUUW3UB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5W3AKC3JRZXK2QHKNWQIUUW3UB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5W3AKC3JRZXK2QHKNWQIUUW3UB","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":"d6ee6562772dd45b8db498d8bdabbb806e8f3a0a2c3d41c0b85ff7133c3fb7b8","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-15T09:31:44Z","title_canon_sha256":"cb48bde7b11e19e109058574c3378eaa9be49556b6f04f5296c43a8a10de2521"},"schema_version":"1.0","source":{"id":"1803.05657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05657","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05657v1","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05657","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"5W3AKC3JRZXK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5W3AKC3JRZXK2QHK","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5W3AKC3J","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:96a2360b78f90a8689b6811c2e5b034f80ae4be868215e9b8c2ea6010246b591","target":"graph","created_at":"2026-05-18T00:20:54Z","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 is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is often smaller than the ambient dimension. Spectral clustering, as one of the main approaches to subspace clustering, often takes on a sparse representation or a low-rank representation to learn a block diagonal self-representation matrix for subspace generation. However, existing methods require solving a large scale convex optimization problem with a large set of data, with computational complexity reaches O(N^3) for N data points. Therefore, the efficie","authors_text":"Hancock Edwin, Jun Zhou, Lei Zhou, Xianglong Liu, Xiao Bai","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-15T09:31:44Z","title":"Fast Subspace Clustering Based on the Kronecker Product"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05657","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:bd01007a13ed3ddf6206d0d30b38bf3d8b54d8f9c0016bd8f6715a984a9356b7","target":"record","created_at":"2026-05-18T00:20:54Z","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":"d6ee6562772dd45b8db498d8bdabbb806e8f3a0a2c3d41c0b85ff7133c3fb7b8","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-15T09:31:44Z","title_canon_sha256":"cb48bde7b11e19e109058574c3378eaa9be49556b6f04f5296c43a8a10de2521"},"schema_version":"1.0","source":{"id":"1803.05657","kind":"arxiv","version":1}},"canonical_sha256":"edb6050b698e6ead40ea6da08a52dba07a9daf6dbfeccf097c143e71cce9766c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edb6050b698e6ead40ea6da08a52dba07a9daf6dbfeccf097c143e71cce9766c","first_computed_at":"2026-05-18T00:20:54.969340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:54.969340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VoTcdTeIKdezowJdKdvOCAq8HfgpNdlgVPDuhz7YU36ApKEBTgWTqCe6bdoypdEXVBI20fPdseQKV+e4dexmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:54.969926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd01007a13ed3ddf6206d0d30b38bf3d8b54d8f9c0016bd8f6715a984a9356b7","sha256:96a2360b78f90a8689b6811c2e5b034f80ae4be868215e9b8c2ea6010246b591"],"state_sha256":"8ef70e1495e6d23f693fe9c7716a73f0d1856968c02411de6c5474414f34fb22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3D968vmHjQQMMZtShnTEKcLaXXGwWMRF47mgmrxrRUFkmzTRZzWuqhQIef8LDaLLjneRfpBTQvSCsLmSsRbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:26:00.836401Z","bundle_sha256":"22762dba3b622f07299a58a774d2461ffd180f236615cf44efc4b428e2db47af"}}