{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NADR2SJJWWBIYWR5AW4Q7JQPSD","short_pith_number":"pith:NADR2SJJ","canonical_record":{"source":{"id":"1410.8864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-31T19:50:42Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f215dfb3736ea91213814cdfe1d8a5d8472be8787947344128976e388b1bd9a6","abstract_canon_sha256":"c88ee784d196f9ad28e88250fede080814064b8b3680ea4894c979f6e569d4be"},"schema_version":"1.0"},"canonical_sha256":"68071d4929b5828c5a3d05b90fa60f90e2276f3c225bb3dd1cf05d6ed319cfc2","source":{"kind":"arxiv","id":"1410.8864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8864","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8864v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8864","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"NADR2SJJWWBI","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NADR2SJJWWBIYWR5","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NADR2SJJ","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NADR2SJJWWBIYWR5AW4Q7JQPSD","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-31T19:50:42Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"f215dfb3736ea91213814cdfe1d8a5d8472be8787947344128976e388b1bd9a6","abstract_canon_sha256":"c88ee784d196f9ad28e88250fede080814064b8b3680ea4894c979f6e569d4be"},"schema_version":"1.0"},"canonical_sha256":"68071d4929b5828c5a3d05b90fa60f90e2276f3c225bb3dd1cf05d6ed319cfc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:53.547279Z","signature_b64":"3tihUKjC7aWq2hnVyxpE7MjOVyFBRP0wzCbS1wjO4enTGTWeW0yWdxhi7HXKa8NCbThyZnQHcXpEnhPTBkwpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68071d4929b5828c5a3d05b90fa60f90e2276f3c225bb3dd1cf05d6ed319cfc2","last_reissued_at":"2026-05-18T02:38:53.546853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:53.546853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8864","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-05-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XxNzSggu91eAu24IYdacXzavEBtNNmbO083eD7St+1RZBNOJ0RN6OhhzVdlyG47jgNh+yb9wf353jxtt/LKeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:45:21.284751Z"},"content_sha256":"d7dc504f54a128d0341f1ae540897f400726f13d5e54e704670f6a9142b7b952","schema_version":"1.0","event_id":"sha256:d7dc504f54a128d0341f1ae540897f400726f13d5e54e704670f6a9142b7b952"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NADR2SJJWWBIYWR5AW4Q7JQPSD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Constantine Caramanis, Dohyung Park, Sujay Sanghavi","submitted_at":"2014-10-31T19:50:42Z","abstract_excerpt":"We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses the sets to estimate the subspaces. As the geometric structure of the clusters (linear subspaces) forbids proper performance of general distance based approaches such as K-means, many model-specific methods have been proposed. In this paper, we provide new simple and efficient algorithms for this problem. Our statistical analysis shows that the algorithms a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8864","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"},"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-18T02:38:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRxyIiD7cauM+UTGqM6SxNx1rcKZEpvQMnZH9c2+3+xZ+lFCGPmfvhmDw2zLcuPzroMBf42Z9p6qPfm4KPhsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:45:21.285295Z"},"content_sha256":"d5103bbe99db2635ee581f23b3c49c1bcf9d56d0c20de268afa84cb5c2671489","schema_version":"1.0","event_id":"sha256:d5103bbe99db2635ee581f23b3c49c1bcf9d56d0c20de268afa84cb5c2671489"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NADR2SJJWWBIYWR5AW4Q7JQPSD/bundle.json","state_url":"https://pith.science/pith/NADR2SJJWWBIYWR5AW4Q7JQPSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NADR2SJJWWBIYWR5AW4Q7JQPSD/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-05-26T01:45:21Z","links":{"resolver":"https://pith.science/pith/NADR2SJJWWBIYWR5AW4Q7JQPSD","bundle":"https://pith.science/pith/NADR2SJJWWBIYWR5AW4Q7JQPSD/bundle.json","state":"https://pith.science/pith/NADR2SJJWWBIYWR5AW4Q7JQPSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NADR2SJJWWBIYWR5AW4Q7JQPSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NADR2SJJWWBIYWR5AW4Q7JQPSD","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":"c88ee784d196f9ad28e88250fede080814064b8b3680ea4894c979f6e569d4be","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-31T19:50:42Z","title_canon_sha256":"f215dfb3736ea91213814cdfe1d8a5d8472be8787947344128976e388b1bd9a6"},"schema_version":"1.0","source":{"id":"1410.8864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8864","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8864v1","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8864","created_at":"2026-05-18T02:38:53Z"},{"alias_kind":"pith_short_12","alias_value":"NADR2SJJWWBI","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NADR2SJJWWBIYWR5","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NADR2SJJ","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d5103bbe99db2635ee581f23b3c49c1bcf9d56d0c20de268afa84cb5c2671489","target":"graph","created_at":"2026-05-18T02:38:53Z","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":"We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses the sets to estimate the subspaces. As the geometric structure of the clusters (linear subspaces) forbids proper performance of general distance based approaches such as K-means, many model-specific methods have been proposed. In this paper, we provide new simple and efficient algorithms for this problem. Our statistical analysis shows that the algorithms a","authors_text":"Constantine Caramanis, Dohyung Park, Sujay Sanghavi","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-31T19:50:42Z","title":"Greedy Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8864","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:d7dc504f54a128d0341f1ae540897f400726f13d5e54e704670f6a9142b7b952","target":"record","created_at":"2026-05-18T02:38:53Z","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":"c88ee784d196f9ad28e88250fede080814064b8b3680ea4894c979f6e569d4be","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-31T19:50:42Z","title_canon_sha256":"f215dfb3736ea91213814cdfe1d8a5d8472be8787947344128976e388b1bd9a6"},"schema_version":"1.0","source":{"id":"1410.8864","kind":"arxiv","version":1}},"canonical_sha256":"68071d4929b5828c5a3d05b90fa60f90e2276f3c225bb3dd1cf05d6ed319cfc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68071d4929b5828c5a3d05b90fa60f90e2276f3c225bb3dd1cf05d6ed319cfc2","first_computed_at":"2026-05-18T02:38:53.546853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:53.546853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tihUKjC7aWq2hnVyxpE7MjOVyFBRP0wzCbS1wjO4enTGTWeW0yWdxhi7HXKa8NCbThyZnQHcXpEnhPTBkwpAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:53.547279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7dc504f54a128d0341f1ae540897f400726f13d5e54e704670f6a9142b7b952","sha256:d5103bbe99db2635ee581f23b3c49c1bcf9d56d0c20de268afa84cb5c2671489"],"state_sha256":"394d7cf197eee3b0787c13e001ad7f7cdb762f76de3c312a0673f8aca9a303d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3bvhTH1PgtcEhs2FbEIB5PYNnGvMIBhAVQQeg4rUL/JvszNUYMsfwnqjGLQM8HU2qJ6w828TEyfBa8C/HBDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:45:21.288248Z","bundle_sha256":"679036e11e272f3078602df54c2a59589cd3be635b1a79fe87ad9d1be627eb3f"}}