{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MOO4MKQIUSN32SSHEIOVRHCLAT","short_pith_number":"pith:MOO4MKQI","canonical_record":{"source":{"id":"1303.0362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T07:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"28039c81b94d07f29b1542835efa52b268911d4fcedde152ff3f6d6278ad1cb0","abstract_canon_sha256":"10d8e9361de4d23ba1483dc3a32f2caf8952cbcb2bfb4bccd43e693da0a244cf"},"schema_version":"1.0"},"canonical_sha256":"639dc62a08a49bbd4a47221d589c4b04cec3a533ef308d4100195f5821e87aae","source":{"kind":"arxiv","id":"1303.0362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0362","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0362v1","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0362","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"MOO4MKQIUSN3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOO4MKQIUSN32SSH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOO4MKQI","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MOO4MKQIUSN32SSHEIOVRHCLAT","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T07:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"28039c81b94d07f29b1542835efa52b268911d4fcedde152ff3f6d6278ad1cb0","abstract_canon_sha256":"10d8e9361de4d23ba1483dc3a32f2caf8952cbcb2bfb4bccd43e693da0a244cf"},"schema_version":"1.0"},"canonical_sha256":"639dc62a08a49bbd4a47221d589c4b04cec3a533ef308d4100195f5821e87aae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:09.483820Z","signature_b64":"5V84DBuadoFeG4gnsY0qzfbs5Awefjs7reX3jt5LHprvJXN4f9/zEKysCXVrdk8MQf6TSkaOXZcWzoO3Q2qZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"639dc62a08a49bbd4a47221d589c4b04cec3a533ef308d4100195f5821e87aae","last_reissued_at":"2026-05-18T02:43:09.483361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:09.483361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0362","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-18T02:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IjWcJmjDLMeexw8jEwSqTun87Aaw96AqcNGA5Op8ZE3U3lAf/k522j38F5Nvnvp/H9RK44QxmsWtofwrPMFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:35:06.792885Z"},"content_sha256":"9f4e6d1781e4563648b5517c81e47930f65e8db184e504efff4349bd21b61006","schema_version":"1.0","event_id":"sha256:9f4e6d1781e4563648b5517c81e47930f65e8db184e504efff4349bd21b61006"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MOO4MKQIUSN32SSHEIOVRHCLAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inductive Sparse Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lei Zhang, Xi Peng, Zhang Yi","submitted_at":"2013-03-02T07:47:21Z","abstract_excerpt":"Sparse Subspace Clustering (SSC) has achieved state-of-the-art clustering quality by performing spectral clustering over a $\\ell^{1}$-norm based similarity graph. However, SSC is a transductive method which does not handle with the data not used to construct the graph (out-of-sample data). For each new datum, SSC requires solving $n$ optimization problems in O(n) variables for performing the algorithm over the whole data set, where $n$ is the number of data points. Therefore, it is inefficient to apply SSC in fast online clustering and scalable graphing. In this letter, we propose an inductive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0362","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-18T02:43:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fy4qRqiLVN/7P4H1Sik1HYD15tAU9UJMoEvd1NBU73ymhL3SQOLriHYwl4mBpK3yV/zZAwJAK2sQnAwPdgoyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:35:06.793231Z"},"content_sha256":"d3b089c66a94e875d9980ef1129f6ee742e25ae17ace7fa916ad0ed03fe7d8a0","schema_version":"1.0","event_id":"sha256:d3b089c66a94e875d9980ef1129f6ee742e25ae17ace7fa916ad0ed03fe7d8a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/bundle.json","state_url":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/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-03T05:35:06Z","links":{"resolver":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT","bundle":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/bundle.json","state":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MOO4MKQIUSN32SSHEIOVRHCLAT","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":"10d8e9361de4d23ba1483dc3a32f2caf8952cbcb2bfb4bccd43e693da0a244cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T07:47:21Z","title_canon_sha256":"28039c81b94d07f29b1542835efa52b268911d4fcedde152ff3f6d6278ad1cb0"},"schema_version":"1.0","source":{"id":"1303.0362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0362","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0362v1","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0362","created_at":"2026-05-18T02:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"MOO4MKQIUSN3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOO4MKQIUSN32SSH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOO4MKQI","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:d3b089c66a94e875d9980ef1129f6ee742e25ae17ace7fa916ad0ed03fe7d8a0","target":"graph","created_at":"2026-05-18T02:43:09Z","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":"Sparse Subspace Clustering (SSC) has achieved state-of-the-art clustering quality by performing spectral clustering over a $\\ell^{1}$-norm based similarity graph. However, SSC is a transductive method which does not handle with the data not used to construct the graph (out-of-sample data). For each new datum, SSC requires solving $n$ optimization problems in O(n) variables for performing the algorithm over the whole data set, where $n$ is the number of data points. Therefore, it is inefficient to apply SSC in fast online clustering and scalable graphing. In this letter, we propose an inductive","authors_text":"Lei Zhang, Xi Peng, Zhang Yi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T07:47:21Z","title":"Inductive Sparse Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0362","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:9f4e6d1781e4563648b5517c81e47930f65e8db184e504efff4349bd21b61006","target":"record","created_at":"2026-05-18T02:43:09Z","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":"10d8e9361de4d23ba1483dc3a32f2caf8952cbcb2bfb4bccd43e693da0a244cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T07:47:21Z","title_canon_sha256":"28039c81b94d07f29b1542835efa52b268911d4fcedde152ff3f6d6278ad1cb0"},"schema_version":"1.0","source":{"id":"1303.0362","kind":"arxiv","version":1}},"canonical_sha256":"639dc62a08a49bbd4a47221d589c4b04cec3a533ef308d4100195f5821e87aae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"639dc62a08a49bbd4a47221d589c4b04cec3a533ef308d4100195f5821e87aae","first_computed_at":"2026-05-18T02:43:09.483361Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:09.483361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5V84DBuadoFeG4gnsY0qzfbs5Awefjs7reX3jt5LHprvJXN4f9/zEKysCXVrdk8MQf6TSkaOXZcWzoO3Q2qZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:09.483820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f4e6d1781e4563648b5517c81e47930f65e8db184e504efff4349bd21b61006","sha256:d3b089c66a94e875d9980ef1129f6ee742e25ae17ace7fa916ad0ed03fe7d8a0"],"state_sha256":"bba214a34e98244c46310c4408da08f799da63177ba90ef06776f41cf005cd19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sl3+WIUBYsPtdM59UII6wAVOQNUf+w3q3j/KOE0X0zzD9kd0SEpXHstTOI2CGh1+lhq+qcRAXvZO9xVQx1ShAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:35:06.795198Z","bundle_sha256":"c73062e2544b1ad4ff1b79d82c88eb5959ab64996d5ce868fa4eb8ae6e8933a3"}}