{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PAUHP7DKGHXBURZCRFI6WYZ7H3","short_pith_number":"pith:PAUHP7DK","canonical_record":{"source":{"id":"1707.02461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-08T16:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"ccb61906b933a706b01149f52f88c9a0e8bbdc338a31149592745d9b424d1fa8","abstract_canon_sha256":"df7110bb29627f667e6fd14c951c66259811038eddcafc8516939e477d79fc3d"},"schema_version":"1.0"},"canonical_sha256":"782877fc6a31ee1a47228951eb633f3eea440236e2fe82a33bd4ee4cdf043d0b","source":{"kind":"arxiv","id":"1707.02461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02461","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02461v2","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02461","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"pith_short_12","alias_value":"PAUHP7DKGHXB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PAUHP7DKGHXBURZC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PAUHP7DK","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PAUHP7DKGHXBURZCRFI6WYZ7H3","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-08T16:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"ccb61906b933a706b01149f52f88c9a0e8bbdc338a31149592745d9b424d1fa8","abstract_canon_sha256":"df7110bb29627f667e6fd14c951c66259811038eddcafc8516939e477d79fc3d"},"schema_version":"1.0"},"canonical_sha256":"782877fc6a31ee1a47228951eb633f3eea440236e2fe82a33bd4ee4cdf043d0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:07.897832Z","signature_b64":"+FPsdVOaZJlAdM5ajggNNlFGQ6QowK86ID/ruXGYjoxUeR8ThnPtdrJcDoaqrRnlDnG7GGZj4q1ELf9w3V12AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"782877fc6a31ee1a47228951eb633f3eea440236e2fe82a33bd4ee4cdf043d0b","last_reissued_at":"2026-05-18T00:26:07.897048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:07.897048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02461","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:26:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FasYTDz6eAZft/z1ieUYR2yve6voYwEKBbigX8+Xw2uBQ2hUfEfDz3CKdX5yNnoez8RDFCmf0ZozKWgRY50CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:55:00.767136Z"},"content_sha256":"8d508586309374f818eb42ee6c6f4cde2a766489291d6427c976e417be523640","schema_version":"1.0","event_id":"sha256:8d508586309374f818eb42ee6c6f4cde2a766489291d6427c976e417be523640"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PAUHP7DKGHXBURZCRFI6WYZ7H3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subspace Clustering with Missing and Corrupted Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Amin Jalali, Rebecca Willett, Zachary Charles","submitted_at":"2017-07-08T16:24:11Z","abstract_excerpt":"Given full or partial information about a collection of points that lie close to a union of several subspaces, subspace clustering refers to the process of clustering the points according to their subspace and identifying the subspaces. One popular approach, sparse subspace clustering (SSC), represents each sample as a weighted combination of the other samples, with weights of minimal $\\ell_1$ norm, and then uses those learned weights to cluster the samples. SSC is stable in settings where each sample is contaminated by a relatively small amount of noise. However, when there is a significant a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02461","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:26:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VmyeS/om3o+7PcksR37HD/ws2/lA8VI32PxZKLolKjn0wFCHhHTsq6wu4YbZWyGTaq6eiEUs/LSBZqJL07bbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:55:00.767793Z"},"content_sha256":"7ecf299a59787fef7fab7e24e43d006784f87c9284290d1cf85c2f8a71325ffa","schema_version":"1.0","event_id":"sha256:7ecf299a59787fef7fab7e24e43d006784f87c9284290d1cf85c2f8a71325ffa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAUHP7DKGHXBURZCRFI6WYZ7H3/bundle.json","state_url":"https://pith.science/pith/PAUHP7DKGHXBURZCRFI6WYZ7H3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAUHP7DKGHXBURZCRFI6WYZ7H3/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-10T18:55:00Z","links":{"resolver":"https://pith.science/pith/PAUHP7DKGHXBURZCRFI6WYZ7H3","bundle":"https://pith.science/pith/PAUHP7DKGHXBURZCRFI6WYZ7H3/bundle.json","state":"https://pith.science/pith/PAUHP7DKGHXBURZCRFI6WYZ7H3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAUHP7DKGHXBURZCRFI6WYZ7H3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PAUHP7DKGHXBURZCRFI6WYZ7H3","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":"df7110bb29627f667e6fd14c951c66259811038eddcafc8516939e477d79fc3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-08T16:24:11Z","title_canon_sha256":"ccb61906b933a706b01149f52f88c9a0e8bbdc338a31149592745d9b424d1fa8"},"schema_version":"1.0","source":{"id":"1707.02461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02461","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02461v2","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02461","created_at":"2026-05-18T00:26:07Z"},{"alias_kind":"pith_short_12","alias_value":"PAUHP7DKGHXB","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PAUHP7DKGHXBURZC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PAUHP7DK","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:7ecf299a59787fef7fab7e24e43d006784f87c9284290d1cf85c2f8a71325ffa","target":"graph","created_at":"2026-05-18T00:26:07Z","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":"Given full or partial information about a collection of points that lie close to a union of several subspaces, subspace clustering refers to the process of clustering the points according to their subspace and identifying the subspaces. One popular approach, sparse subspace clustering (SSC), represents each sample as a weighted combination of the other samples, with weights of minimal $\\ell_1$ norm, and then uses those learned weights to cluster the samples. SSC is stable in settings where each sample is contaminated by a relatively small amount of noise. However, when there is a significant a","authors_text":"Amin Jalali, Rebecca Willett, Zachary Charles","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-08T16:24:11Z","title":"Subspace Clustering with Missing and Corrupted Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02461","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:8d508586309374f818eb42ee6c6f4cde2a766489291d6427c976e417be523640","target":"record","created_at":"2026-05-18T00:26:07Z","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":"df7110bb29627f667e6fd14c951c66259811038eddcafc8516939e477d79fc3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-08T16:24:11Z","title_canon_sha256":"ccb61906b933a706b01149f52f88c9a0e8bbdc338a31149592745d9b424d1fa8"},"schema_version":"1.0","source":{"id":"1707.02461","kind":"arxiv","version":2}},"canonical_sha256":"782877fc6a31ee1a47228951eb633f3eea440236e2fe82a33bd4ee4cdf043d0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"782877fc6a31ee1a47228951eb633f3eea440236e2fe82a33bd4ee4cdf043d0b","first_computed_at":"2026-05-18T00:26:07.897048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:07.897048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+FPsdVOaZJlAdM5ajggNNlFGQ6QowK86ID/ruXGYjoxUeR8ThnPtdrJcDoaqrRnlDnG7GGZj4q1ELf9w3V12AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:07.897832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d508586309374f818eb42ee6c6f4cde2a766489291d6427c976e417be523640","sha256:7ecf299a59787fef7fab7e24e43d006784f87c9284290d1cf85c2f8a71325ffa"],"state_sha256":"5e71b5b5563453cc681513873d39be95e530561e857f062c9eb058ae45385ada"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3c6VAnMBYmnfWIuUsbuJwL0cGVSHCxPHHw16loDSnSL8zrAUkTqOldga4AwM9wbGbkvntCrNhOZMkNnilbv4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:55:00.771806Z","bundle_sha256":"5d12116c5a2a42cc29ba176843d58b3119ee27c9bd4676371c5b7908f52356f2"}}