{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4HXQAIUKSZE44ZPKXUAL6ONHUQ","short_pith_number":"pith:4HXQAIUK","canonical_record":{"source":{"id":"1908.00683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T02:39:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f5f86f6d107c17e039281b3c709ebd56a47fce6d91dfa775e8f48518582387f8","abstract_canon_sha256":"ce92095fa735744d664a558c652b24f395f5ce1e8a8f03194132aafe253e84b4"},"schema_version":"1.0"},"canonical_sha256":"e1ef00228a9649ce65eabd00bf39a7a424891d77fda929d1b6ea8350edf39b8c","source":{"kind":"arxiv","id":"1908.00683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00683","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00683v1","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00683","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"4HXQAIUKSZE4","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"4HXQAIUKSZE44ZPK","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"4HXQAIUK","created_at":"2026-07-04T23:51:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4HXQAIUKSZE44ZPKXUAL6ONHUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1908.00683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T02:39:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f5f86f6d107c17e039281b3c709ebd56a47fce6d91dfa775e8f48518582387f8","abstract_canon_sha256":"ce92095fa735744d664a558c652b24f395f5ce1e8a8f03194132aafe253e84b4"},"schema_version":"1.0"},"canonical_sha256":"e1ef00228a9649ce65eabd00bf39a7a424891d77fda929d1b6ea8350edf39b8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:08.314925Z","signature_b64":"wFkf/6rsm2TMcMropLTjcA+kHnN9/mPl+rXpax5XRVG0PkD6UrUqgBNdmhEuliDZyTFSe3L6Xy3W9J2Bsk9TBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1ef00228a9649ce65eabd00bf39a7a424891d77fda929d1b6ea8350edf39b8c","last_reissued_at":"2026-07-04T23:51:08.314498Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:08.314498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.00683","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-07-04T23:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cLja936lg5jJAuDh16Wix0wis21VAmPjt8oTi38q37AcLEx0f9DfzC7Jnsj/DwKGfdHHKtZ55WYi13iGrzXfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:48:04.998159Z"},"content_sha256":"67a569504350cbfc2691001a9d59f59b1e82c8b0219ad23845f1d20677fdf5bc","schema_version":"1.0","event_id":"sha256:67a569504350cbfc2691001a9d59f59b1e82c8b0219ad23845f1d20677fdf5bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4HXQAIUKSZE44ZPKXUAL6ONHUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-Scale Sparse Subspace Clustering Using Landmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Farhad Pourkamali-Anaraki","submitted_at":"2019-08-02T02:39:40Z","abstract_excerpt":"Subspace clustering methods based on expressing each data point as a linear combination of all other points in a dataset are popular unsupervised learning techniques. However, existing methods incur high computational complexity on large-scale datasets as they require solving an expensive optimization problem and performing spectral clustering on large affinity matrices. This paper presents an efficient approach to subspace clustering by selecting a small subset of the input data called landmarks. The resulting subspace clustering method in the reduced domain runs in linear time with respect t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00683","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.00683/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:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZaxk0ChakroIDycbOSvusJOQHMzS2fxopRG9+vReX/fNsUKgViMSlNf8XykBDHw4uCBRUzQ1WHbHnpZTomsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:48:04.999097Z"},"content_sha256":"7014cb095332ed571682b58bea879740d94d57b0c399b5cf74e35b71d147d995","schema_version":"1.0","event_id":"sha256:7014cb095332ed571682b58bea879740d94d57b0c399b5cf74e35b71d147d995"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4HXQAIUKSZE44ZPKXUAL6ONHUQ/bundle.json","state_url":"https://pith.science/pith/4HXQAIUKSZE44ZPKXUAL6ONHUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4HXQAIUKSZE44ZPKXUAL6ONHUQ/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-08-16T14:48:05Z","links":{"resolver":"https://pith.science/pith/4HXQAIUKSZE44ZPKXUAL6ONHUQ","bundle":"https://pith.science/pith/4HXQAIUKSZE44ZPKXUAL6ONHUQ/bundle.json","state":"https://pith.science/pith/4HXQAIUKSZE44ZPKXUAL6ONHUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4HXQAIUKSZE44ZPKXUAL6ONHUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4HXQAIUKSZE44ZPKXUAL6ONHUQ","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":"ce92095fa735744d664a558c652b24f395f5ce1e8a8f03194132aafe253e84b4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T02:39:40Z","title_canon_sha256":"f5f86f6d107c17e039281b3c709ebd56a47fce6d91dfa775e8f48518582387f8"},"schema_version":"1.0","source":{"id":"1908.00683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00683","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00683v1","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00683","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"4HXQAIUKSZE4","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"4HXQAIUKSZE44ZPK","created_at":"2026-07-04T23:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"4HXQAIUK","created_at":"2026-07-04T23:51:08Z"}],"graph_snapshots":[{"event_id":"sha256:7014cb095332ed571682b58bea879740d94d57b0c399b5cf74e35b71d147d995","target":"graph","created_at":"2026-07-04T23:51:08Z","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/1908.00683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subspace clustering methods based on expressing each data point as a linear combination of all other points in a dataset are popular unsupervised learning techniques. However, existing methods incur high computational complexity on large-scale datasets as they require solving an expensive optimization problem and performing spectral clustering on large affinity matrices. This paper presents an efficient approach to subspace clustering by selecting a small subset of the input data called landmarks. The resulting subspace clustering method in the reduced domain runs in linear time with respect t","authors_text":"Farhad Pourkamali-Anaraki","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T02:39:40Z","title":"Large-Scale Sparse Subspace Clustering Using Landmarks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00683","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:67a569504350cbfc2691001a9d59f59b1e82c8b0219ad23845f1d20677fdf5bc","target":"record","created_at":"2026-07-04T23:51:08Z","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":"ce92095fa735744d664a558c652b24f395f5ce1e8a8f03194132aafe253e84b4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-02T02:39:40Z","title_canon_sha256":"f5f86f6d107c17e039281b3c709ebd56a47fce6d91dfa775e8f48518582387f8"},"schema_version":"1.0","source":{"id":"1908.00683","kind":"arxiv","version":1}},"canonical_sha256":"e1ef00228a9649ce65eabd00bf39a7a424891d77fda929d1b6ea8350edf39b8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1ef00228a9649ce65eabd00bf39a7a424891d77fda929d1b6ea8350edf39b8c","first_computed_at":"2026-07-04T23:51:08.314498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:08.314498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFkf/6rsm2TMcMropLTjcA+kHnN9/mPl+rXpax5XRVG0PkD6UrUqgBNdmhEuliDZyTFSe3L6Xy3W9J2Bsk9TBg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:08.314925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67a569504350cbfc2691001a9d59f59b1e82c8b0219ad23845f1d20677fdf5bc","sha256:7014cb095332ed571682b58bea879740d94d57b0c399b5cf74e35b71d147d995"],"state_sha256":"8a58f52f7819cfbe4ec645bdfbe951feae1b60485b3e632007effa3bb5f0e80a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axUkwOFwvAf0na8+yvCzTBjq1VWvbvRa15BSy6vjrKRnDabj5I3Vfq/mmsZbsRWS5NEoBnU/FGOBQUHn+sf1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:48:05.004472Z","bundle_sha256":"328e04b56b29eb008a7bceaf8a4d1773c175f6f8628372ee63c37754c6651b1c"}}