{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VKEMIY3H3L27GRHUJTDVC4KTLI","short_pith_number":"pith:VKEMIY3H","schema_version":"1.0","canonical_sha256":"aa88c46367daf5f344f44cc75171535a03e9f1566c5d5987a03d79f4a0bc7fc7","source":{"kind":"arxiv","id":"1504.01046","version":2},"attestation_state":"computed","paper":{"title":"Graph Connectivity in Noisy Sparse Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Yining Wang, Yu-Xiang Wang","submitted_at":"2015-04-04T20:05:17Z","abstract_excerpt":"Subspace clustering is the problem of clustering data points into a union of low-dimensional linear/affine subspaces. It is the mathematical abstraction of many important problems in computer vision, image processing and machine learning. A line of recent work (4, 19, 24, 20) provided strong theoretical guarantee for sparse subspace clustering (4), the state-of-the-art algorithm for subspace clustering, on both noiseless and noisy data sets. It was shown that under mild conditions, with high probability no two points from different subspaces are clustered together. Such guarantee, however, is "},"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":"1504.01046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-04T20:05:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fc07f4b33caca4bc4fbabf91ecf6ae571e57775c77cf3526846dda65804ff2a5","abstract_canon_sha256":"0671e62cc3de268a2fd4d9ee187c57f35121fcf87a7c34fcd141d833faf402c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:25.806467Z","signature_b64":"GbJa38Wq8Ng5pz0azG6m+q9k/V+9ORmZ7recBa3ZckkJjOVVuwP4nBVK5kUDvZNxZmQv6P15tRhUa90x5mj0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa88c46367daf5f344f44cc75171535a03e9f1566c5d5987a03d79f4a0bc7fc7","last_reissued_at":"2026-05-18T01:17:25.805857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:25.805857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Connectivity in Noisy Sparse Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Aarti Singh, Yining Wang, Yu-Xiang Wang","submitted_at":"2015-04-04T20:05:17Z","abstract_excerpt":"Subspace clustering is the problem of clustering data points into a union of low-dimensional linear/affine subspaces. It is the mathematical abstraction of many important problems in computer vision, image processing and machine learning. A line of recent work (4, 19, 24, 20) provided strong theoretical guarantee for sparse subspace clustering (4), the state-of-the-art algorithm for subspace clustering, on both noiseless and noisy data sets. It was shown that under mild conditions, with high probability no two points from different subspaces are clustered together. Such guarantee, however, is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01046","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.01046","created_at":"2026-05-18T01:17:25.805957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01046v2","created_at":"2026-05-18T01:17:25.805957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01046","created_at":"2026-05-18T01:17:25.805957+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKEMIY3H3L27","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKEMIY3H3L27GRHU","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKEMIY3H","created_at":"2026-05-18T12:29:44.643036+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/VKEMIY3H3L27GRHUJTDVC4KTLI","json":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI.json","graph_json":"https://pith.science/api/pith-number/VKEMIY3H3L27GRHUJTDVC4KTLI/graph.json","events_json":"https://pith.science/api/pith-number/VKEMIY3H3L27GRHUJTDVC4KTLI/events.json","paper":"https://pith.science/paper/VKEMIY3H"},"agent_actions":{"view_html":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI","download_json":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI.json","view_paper":"https://pith.science/paper/VKEMIY3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01046&json=true","fetch_graph":"https://pith.science/api/pith-number/VKEMIY3H3L27GRHUJTDVC4KTLI/graph.json","fetch_events":"https://pith.science/api/pith-number/VKEMIY3H3L27GRHUJTDVC4KTLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI/action/storage_attestation","attest_author":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI/action/author_attestation","sign_citation":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI/action/citation_signature","submit_replication":"https://pith.science/pith/VKEMIY3H3L27GRHUJTDVC4KTLI/action/replication_record"}},"created_at":"2026-05-18T01:17:25.805957+00:00","updated_at":"2026-05-18T01:17:25.805957+00:00"}