{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UEMK3VTOI5H4IUAE53II54PTOW","short_pith_number":"pith:UEMK3VTO","canonical_record":{"source":{"id":"1802.07648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T16:21:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1feaffc8ed861c0c731c304eab983f077de24764869c9ededdfae289a2f88dcf","abstract_canon_sha256":"244947eca4ef64c20b0efbc53cd963e94f6f0032b23fd7be4b6f9e06498c292f"},"schema_version":"1.0"},"canonical_sha256":"a118add66e474fc45004eed08ef1f375bc57ed19b862cf76bf1656323afbc30a","source":{"kind":"arxiv","id":"1802.07648","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07648","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07648v2","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07648","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"pith_short_12","alias_value":"UEMK3VTOI5H4","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"pith_short_16","alias_value":"UEMK3VTOI5H4IUAE","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"pith_short_8","alias_value":"UEMK3VTO","created_at":"2026-07-04T23:51:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UEMK3VTOI5H4IUAE53II54PTOW","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T16:21:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1feaffc8ed861c0c731c304eab983f077de24764869c9ededdfae289a2f88dcf","abstract_canon_sha256":"244947eca4ef64c20b0efbc53cd963e94f6f0032b23fd7be4b6f9e06498c292f"},"schema_version":"1.0"},"canonical_sha256":"a118add66e474fc45004eed08ef1f375bc57ed19b862cf76bf1656323afbc30a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:17.676849Z","signature_b64":"6m8mWdsZw4jVlQBdtLufrDq/JE/8v9olfPZ8rS1nHQNzyxbR1anmlvs36ZDly3/4Ome0jzY1+iupH0uUMnUwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a118add66e474fc45004eed08ef1f375bc57ed19b862cf76bf1656323afbc30a","last_reissued_at":"2026-07-04T23:51:17.676489Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:17.676489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07648","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-07-04T23:51:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoDw1namWin8zl6zjYYw59wqOqwyxLkDN0Bk8af0d7PsnJpAdAq5kswUdXaPfOWL9XRBbvHp3tNVIyGsCqSADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T19:28:29.327133Z"},"content_sha256":"5bb98df525434afd0f38dd355b23485f82164b2de12cd7eda7cc2488aae949c2","schema_version":"1.0","event_id":"sha256:5bb98df525434afd0f38dd355b23485f82164b2de12cd7eda7cc2488aae949c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UEMK3VTOI5H4IUAE53II54PTOW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CV","authors_text":"Maryam Abdolali, Mohammad Rahmati, Nicolas Gillis","submitted_at":"2018-02-21T16:21:42Z","abstract_excerpt":"Sparse subspace clustering (SSC) is one of the current state-of-the-art methods for partitioning data points into the union of subspaces, with strong theoretical guarantees. However, it is not practical for large data sets as it requires solving a LASSO problem for each data point, where the number of variables in each LASSO problem is the number of data points. To improve the scalability of SSC, we propose to select a few sets of anchor points using a randomized hierarchical clustering method, and, for each set of anchor points, solve the LASSO problems for each data point allowing only ancho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07648","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1802.07648/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:51:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wvmKyu+JOy6NBuvNLnPhbNmBe26VCffYQsHiJv2tyO+1VwpZoFFb3sWtqvg6KtthoU5k/8oRCAMmksY0vAzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-18T19:28:29.327515Z"},"content_sha256":"3ac9426a49ec066a26e2ac757669531ecbc3305d5ee8fb4c812cd4bb7a6a832d","schema_version":"1.0","event_id":"sha256:3ac9426a49ec066a26e2ac757669531ecbc3305d5ee8fb4c812cd4bb7a6a832d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEMK3VTOI5H4IUAE53II54PTOW/bundle.json","state_url":"https://pith.science/pith/UEMK3VTOI5H4IUAE53II54PTOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEMK3VTOI5H4IUAE53II54PTOW/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-07-18T19:28:29Z","links":{"resolver":"https://pith.science/pith/UEMK3VTOI5H4IUAE53II54PTOW","bundle":"https://pith.science/pith/UEMK3VTOI5H4IUAE53II54PTOW/bundle.json","state":"https://pith.science/pith/UEMK3VTOI5H4IUAE53II54PTOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEMK3VTOI5H4IUAE53II54PTOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UEMK3VTOI5H4IUAE53II54PTOW","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":"244947eca4ef64c20b0efbc53cd963e94f6f0032b23fd7be4b6f9e06498c292f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T16:21:42Z","title_canon_sha256":"1feaffc8ed861c0c731c304eab983f077de24764869c9ededdfae289a2f88dcf"},"schema_version":"1.0","source":{"id":"1802.07648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07648","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07648v2","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07648","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"pith_short_12","alias_value":"UEMK3VTOI5H4","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"pith_short_16","alias_value":"UEMK3VTOI5H4IUAE","created_at":"2026-07-04T23:51:17Z"},{"alias_kind":"pith_short_8","alias_value":"UEMK3VTO","created_at":"2026-07-04T23:51:17Z"}],"graph_snapshots":[{"event_id":"sha256:3ac9426a49ec066a26e2ac757669531ecbc3305d5ee8fb4c812cd4bb7a6a832d","target":"graph","created_at":"2026-07-04T23:51:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1802.07648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sparse subspace clustering (SSC) is one of the current state-of-the-art methods for partitioning data points into the union of subspaces, with strong theoretical guarantees. However, it is not practical for large data sets as it requires solving a LASSO problem for each data point, where the number of variables in each LASSO problem is the number of data points. To improve the scalability of SSC, we propose to select a few sets of anchor points using a randomized hierarchical clustering method, and, for each set of anchor points, solve the LASSO problems for each data point allowing only ancho","authors_text":"Maryam Abdolali, Mohammad Rahmati, Nicolas Gillis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T16:21:42Z","title":"Scalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07648","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:5bb98df525434afd0f38dd355b23485f82164b2de12cd7eda7cc2488aae949c2","target":"record","created_at":"2026-07-04T23:51:17Z","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":"244947eca4ef64c20b0efbc53cd963e94f6f0032b23fd7be4b6f9e06498c292f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T16:21:42Z","title_canon_sha256":"1feaffc8ed861c0c731c304eab983f077de24764869c9ededdfae289a2f88dcf"},"schema_version":"1.0","source":{"id":"1802.07648","kind":"arxiv","version":2}},"canonical_sha256":"a118add66e474fc45004eed08ef1f375bc57ed19b862cf76bf1656323afbc30a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a118add66e474fc45004eed08ef1f375bc57ed19b862cf76bf1656323afbc30a","first_computed_at":"2026-07-04T23:51:17.676489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:17.676489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6m8mWdsZw4jVlQBdtLufrDq/JE/8v9olfPZ8rS1nHQNzyxbR1anmlvs36ZDly3/4Ome0jzY1+iupH0uUMnUwBA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:17.676849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bb98df525434afd0f38dd355b23485f82164b2de12cd7eda7cc2488aae949c2","sha256:3ac9426a49ec066a26e2ac757669531ecbc3305d5ee8fb4c812cd4bb7a6a832d"],"state_sha256":"d756e21a912ea32b617415941b793107a0131cf093c1e4a7665609fcd3114f30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQUp2egKiGZYcZXAZYt/fe/WjgWSRNnSIw+Hm0YBaTiVSE9ak3La7IKEdWR24v9dKQV15OCYE41in+gMgb6PCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-18T19:28:29.329870Z","bundle_sha256":"f4c3322b8f23f66b91becd38e0d9f221ec39c6d7e6527997d0a6333e7cee6f45"}}