{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MOO4MKQIUSN32SSHEIOVRHCLAT","short_pith_number":"pith:MOO4MKQI","schema_version":"1.0","canonical_sha256":"639dc62a08a49bbd4a47221d589c4b04cec3a533ef308d4100195f5821e87aae","source":{"kind":"arxiv","id":"1303.0362","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.0362","created_at":"2026-05-18T02:43:09.483429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0362v1","created_at":"2026-05-18T02:43:09.483429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0362","created_at":"2026-05-18T02:43:09.483429+00:00"},{"alias_kind":"pith_short_12","alias_value":"MOO4MKQIUSN3","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MOO4MKQIUSN32SSH","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MOO4MKQI","created_at":"2026-05-18T12:27:52.871228+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/MOO4MKQIUSN32SSHEIOVRHCLAT","json":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT.json","graph_json":"https://pith.science/api/pith-number/MOO4MKQIUSN32SSHEIOVRHCLAT/graph.json","events_json":"https://pith.science/api/pith-number/MOO4MKQIUSN32SSHEIOVRHCLAT/events.json","paper":"https://pith.science/paper/MOO4MKQI"},"agent_actions":{"view_html":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT","download_json":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT.json","view_paper":"https://pith.science/paper/MOO4MKQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0362&json=true","fetch_graph":"https://pith.science/api/pith-number/MOO4MKQIUSN32SSHEIOVRHCLAT/graph.json","fetch_events":"https://pith.science/api/pith-number/MOO4MKQIUSN32SSHEIOVRHCLAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/action/storage_attestation","attest_author":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/action/author_attestation","sign_citation":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/action/citation_signature","submit_replication":"https://pith.science/pith/MOO4MKQIUSN32SSHEIOVRHCLAT/action/replication_record"}},"created_at":"2026-05-18T02:43:09.483429+00:00","updated_at":"2026-05-18T02:43:09.483429+00:00"}