{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VIET2QJZCCA7ZJAHWLMWZJPDPM","short_pith_number":"pith:VIET2QJZ","canonical_record":{"source":{"id":"1309.6487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-25T12:53:13Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"868b277c080b8e7eb9bc8fe7521c5ef4089a8adb9713c6f63f33705048d649f2","abstract_canon_sha256":"3d7d65de14d68436e0b6d8a69473ab1f8939619de7423c4d67d08f04d031f035"},"schema_version":"1.0"},"canonical_sha256":"aa093d41391081fca407b2d96ca5e37b267a3d20d321c6208b2b40f4bccdc118","source":{"kind":"arxiv","id":"1309.6487","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6487","created_at":"2026-05-18T00:44:29Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6487v2","created_at":"2026-05-18T00:44:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6487","created_at":"2026-05-18T00:44:29Z"},{"alias_kind":"pith_short_12","alias_value":"VIET2QJZCCA7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VIET2QJZCCA7ZJAH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VIET2QJZ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VIET2QJZCCA7ZJAHWLMWZJPDPM","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-25T12:53:13Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"868b277c080b8e7eb9bc8fe7521c5ef4089a8adb9713c6f63f33705048d649f2","abstract_canon_sha256":"3d7d65de14d68436e0b6d8a69473ab1f8939619de7423c4d67d08f04d031f035"},"schema_version":"1.0"},"canonical_sha256":"aa093d41391081fca407b2d96ca5e37b267a3d20d321c6208b2b40f4bccdc118","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:29.492863Z","signature_b64":"EIAYm1ISaRkdKEStld/T6BC5mDblzUfIJMKwc0He2MV4eLM1OCO0TEGaIllr+Aai5O715e9ojRrChNKAS0cTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa093d41391081fca407b2d96ca5e37b267a3d20d321c6208b2b40f4bccdc118","last_reissued_at":"2026-05-18T00:44:29.492307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:29.492307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6487","source_version":2,"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:44:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tj4KhyjXeDe+MIFjtUB+UF2aDPLCZ5MnArdcujSq1R7LTlMLXOn5X+yLFgZTyTdi7/WVtwAgoVUqzd/9MWgtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:26:34.952592Z"},"content_sha256":"11a89481a78a793fb58a27606b20d50b8d8d3d07234c1fe352fdcf2f60166738","schema_version":"1.0","event_id":"sha256:11a89481a78a793fb58a27606b20d50b8d8d3d07234c1fe352fdcf2f60166738"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VIET2QJZCCA7ZJAHWLMWZJPDPM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Framework for Representation-based Subspace Clustering of Out-of-sample and Large-scale Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Huajin Tang, Lei Zhang, Shijie Xiao, Xi Peng, Zhang Yi","submitted_at":"2013-09-25T12:53:13Z","abstract_excerpt":"Under the framework of spectral clustering, the key of subspace clustering is building a similarity graph which describes the neighborhood relations among data points. Some recent works build the graph using sparse, low-rank, and $\\ell_2$-norm-based representation, and have achieved state-of-the-art performance. However, these methods have suffered from the following two limitations. First, the time complexities of these methods are at least proportional to the cube of the data size, which make those methods inefficient for solving large-scale problems. Second, they cannot cope with out-of-sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6487","kind":"arxiv","version":2},"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:44:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZNYQiMlAC69A+16sUtVdMisxjn1n+GJiobjXTVFn7NfuHKbc2je+86Xj34YLtEw8Kcu8E/QvQIWBmp9S/jZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:26:34.952946Z"},"content_sha256":"241f541172493312200fc8f0ae50d8c7e46c71be484802393889c57edd96a58b","schema_version":"1.0","event_id":"sha256:241f541172493312200fc8f0ae50d8c7e46c71be484802393889c57edd96a58b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIET2QJZCCA7ZJAHWLMWZJPDPM/bundle.json","state_url":"https://pith.science/pith/VIET2QJZCCA7ZJAHWLMWZJPDPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIET2QJZCCA7ZJAHWLMWZJPDPM/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-03T09:26:34Z","links":{"resolver":"https://pith.science/pith/VIET2QJZCCA7ZJAHWLMWZJPDPM","bundle":"https://pith.science/pith/VIET2QJZCCA7ZJAHWLMWZJPDPM/bundle.json","state":"https://pith.science/pith/VIET2QJZCCA7ZJAHWLMWZJPDPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIET2QJZCCA7ZJAHWLMWZJPDPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VIET2QJZCCA7ZJAHWLMWZJPDPM","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":"3d7d65de14d68436e0b6d8a69473ab1f8939619de7423c4d67d08f04d031f035","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-25T12:53:13Z","title_canon_sha256":"868b277c080b8e7eb9bc8fe7521c5ef4089a8adb9713c6f63f33705048d649f2"},"schema_version":"1.0","source":{"id":"1309.6487","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6487","created_at":"2026-05-18T00:44:29Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6487v2","created_at":"2026-05-18T00:44:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6487","created_at":"2026-05-18T00:44:29Z"},{"alias_kind":"pith_short_12","alias_value":"VIET2QJZCCA7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VIET2QJZCCA7ZJAH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VIET2QJZ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:241f541172493312200fc8f0ae50d8c7e46c71be484802393889c57edd96a58b","target":"graph","created_at":"2026-05-18T00:44:29Z","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":"Under the framework of spectral clustering, the key of subspace clustering is building a similarity graph which describes the neighborhood relations among data points. Some recent works build the graph using sparse, low-rank, and $\\ell_2$-norm-based representation, and have achieved state-of-the-art performance. However, these methods have suffered from the following two limitations. First, the time complexities of these methods are at least proportional to the cube of the data size, which make those methods inefficient for solving large-scale problems. Second, they cannot cope with out-of-sam","authors_text":"Huajin Tang, Lei Zhang, Shijie Xiao, Xi Peng, Zhang Yi","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-25T12:53:13Z","title":"A Unified Framework for Representation-based Subspace Clustering of Out-of-sample and Large-scale Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6487","kind":"arxiv","version":2},"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:11a89481a78a793fb58a27606b20d50b8d8d3d07234c1fe352fdcf2f60166738","target":"record","created_at":"2026-05-18T00:44:29Z","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":"3d7d65de14d68436e0b6d8a69473ab1f8939619de7423c4d67d08f04d031f035","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-25T12:53:13Z","title_canon_sha256":"868b277c080b8e7eb9bc8fe7521c5ef4089a8adb9713c6f63f33705048d649f2"},"schema_version":"1.0","source":{"id":"1309.6487","kind":"arxiv","version":2}},"canonical_sha256":"aa093d41391081fca407b2d96ca5e37b267a3d20d321c6208b2b40f4bccdc118","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa093d41391081fca407b2d96ca5e37b267a3d20d321c6208b2b40f4bccdc118","first_computed_at":"2026-05-18T00:44:29.492307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:29.492307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EIAYm1ISaRkdKEStld/T6BC5mDblzUfIJMKwc0He2MV4eLM1OCO0TEGaIllr+Aai5O715e9ojRrChNKAS0cTDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:29.492863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6487","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11a89481a78a793fb58a27606b20d50b8d8d3d07234c1fe352fdcf2f60166738","sha256:241f541172493312200fc8f0ae50d8c7e46c71be484802393889c57edd96a58b"],"state_sha256":"d054037d81b0e2683d3e57020107a027c339dfba872d81cb8ae4b0aada28e9f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ha5R0nmrpnynHbvTSqUrNW/Zf7HftpFyZyy8VZhTUg68bOpwWrmsxeb1n9RzL/OjGWnzoqzhvhsx+Qangr6vCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:26:34.954944Z","bundle_sha256":"adb13e4205efa58b1b0252cbf197cf0aa31e067f11052bf239e8278ecef5d681"}}