{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2QX3KMUU3ZKTUVCTHX3LJYVCJR","short_pith_number":"pith:2QX3KMUU","canonical_record":{"source":{"id":"1512.00907","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-02T23:52:43Z","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"0e1f8bb59fab18d72617d7fdeb783cb6e78183f6b021de9fc03bf954950f1d8f","abstract_canon_sha256":"0c80d365b2d720c8d3c1f1bec731ff59a2a46af4a728b4f9ecc9a18a3874133c"},"schema_version":"1.0"},"canonical_sha256":"d42fb53294de553a54533df6b4e2a24c4107bf96af31d0270be6cd982c86a419","source":{"kind":"arxiv","id":"1512.00907","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00907","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00907v5","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00907","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"2QX3KMUU3ZKT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2QX3KMUU3ZKTUVCT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2QX3KMUU","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2QX3KMUU3ZKTUVCTHX3LJYVCJR","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00907","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-02T23:52:43Z","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"0e1f8bb59fab18d72617d7fdeb783cb6e78183f6b021de9fc03bf954950f1d8f","abstract_canon_sha256":"0c80d365b2d720c8d3c1f1bec731ff59a2a46af4a728b4f9ecc9a18a3874133c"},"schema_version":"1.0"},"canonical_sha256":"d42fb53294de553a54533df6b4e2a24c4107bf96af31d0270be6cd982c86a419","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:39.692886Z","signature_b64":"MOFEzUFdv2gjiX6lk/XEwzWcYlrxrdHQUP+4oC8TeuvB1L4o8sOEMEuQWDOX8+H3vOqbhGxQWBUCqxuT3eCBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d42fb53294de553a54533df6b4e2a24c4107bf96af31d0270be6cd982c86a419","last_reissued_at":"2026-05-18T00:29:39.692270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:39.692270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00907","source_version":5,"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLrWhd9Vbj9uuicG82CsCllDdYkuamFIZkkLaP7f4WsUknTnDIJoTOzVUFOkcpiArowg66Vg0at+pXsfxLpUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:33:18.479634Z"},"content_sha256":"024ec015ca1b41ce35f5ed64e2c0ea2bf8c0960de7d35168cbe1b79ea4405712","schema_version":"1.0","event_id":"sha256:024ec015ca1b41ce35f5ed64e2c0ea2bf8c0960de7d35168cbe1b79ea4405712"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2QX3KMUU3ZKTUVCTHX3LJYVCJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Innovation Pursuit: A New Approach to Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.CV","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2015-12-02T23:52:43Z","abstract_excerpt":"In subspace clustering, a group of data points belonging to a union of subspaces are assigned membership to their respective subspaces. This paper presents a new approach dubbed Innovation Pursuit (iPursuit) to the problem of subspace clustering using a new geometrical idea whereby subspaces are identified based on their relative novelties. We present two frameworks in which the idea of innovation pursuit is used to distinguish the subspaces. Underlying the first framework is an iterative method that finds the subspaces consecutively by solving a series of simple linear optimization problems, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00907","kind":"arxiv","version":5},"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2JXbJx+CnF6yB6MEQg18rU0bZ7LXKpdPZlSv4s7TfrfCjJpTIlhnF2C5eloAWLP36aCkPnPKkUFWN6RdjrmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:33:18.479991Z"},"content_sha256":"62765f548612770c32c8ba26ced2c28804f513b9f3628f7a162a6ac6318a6f68","schema_version":"1.0","event_id":"sha256:62765f548612770c32c8ba26ced2c28804f513b9f3628f7a162a6ac6318a6f68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2QX3KMUU3ZKTUVCTHX3LJYVCJR/bundle.json","state_url":"https://pith.science/pith/2QX3KMUU3ZKTUVCTHX3LJYVCJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2QX3KMUU3ZKTUVCTHX3LJYVCJR/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-01T17:33:18Z","links":{"resolver":"https://pith.science/pith/2QX3KMUU3ZKTUVCTHX3LJYVCJR","bundle":"https://pith.science/pith/2QX3KMUU3ZKTUVCTHX3LJYVCJR/bundle.json","state":"https://pith.science/pith/2QX3KMUU3ZKTUVCTHX3LJYVCJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2QX3KMUU3ZKTUVCTHX3LJYVCJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2QX3KMUU3ZKTUVCTHX3LJYVCJR","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":"0c80d365b2d720c8d3c1f1bec731ff59a2a46af4a728b4f9ecc9a18a3874133c","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-02T23:52:43Z","title_canon_sha256":"0e1f8bb59fab18d72617d7fdeb783cb6e78183f6b021de9fc03bf954950f1d8f"},"schema_version":"1.0","source":{"id":"1512.00907","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00907","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00907v5","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00907","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"2QX3KMUU3ZKT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2QX3KMUU3ZKTUVCT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2QX3KMUU","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:62765f548612770c32c8ba26ced2c28804f513b9f3628f7a162a6ac6318a6f68","target":"graph","created_at":"2026-05-18T00:29:39Z","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":"In subspace clustering, a group of data points belonging to a union of subspaces are assigned membership to their respective subspaces. This paper presents a new approach dubbed Innovation Pursuit (iPursuit) to the problem of subspace clustering using a new geometrical idea whereby subspaces are identified based on their relative novelties. We present two frameworks in which the idea of innovation pursuit is used to distinguish the subspaces. Underlying the first framework is an iterative method that finds the subspaces consecutively by solving a series of simple linear optimization problems, ","authors_text":"George Atia, Mostafa Rahmani","cross_cats":["cs.IR","cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-02T23:52:43Z","title":"Innovation Pursuit: A New Approach to Subspace Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00907","kind":"arxiv","version":5},"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:024ec015ca1b41ce35f5ed64e2c0ea2bf8c0960de7d35168cbe1b79ea4405712","target":"record","created_at":"2026-05-18T00:29:39Z","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":"0c80d365b2d720c8d3c1f1bec731ff59a2a46af4a728b4f9ecc9a18a3874133c","cross_cats_sorted":["cs.IR","cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-02T23:52:43Z","title_canon_sha256":"0e1f8bb59fab18d72617d7fdeb783cb6e78183f6b021de9fc03bf954950f1d8f"},"schema_version":"1.0","source":{"id":"1512.00907","kind":"arxiv","version":5}},"canonical_sha256":"d42fb53294de553a54533df6b4e2a24c4107bf96af31d0270be6cd982c86a419","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d42fb53294de553a54533df6b4e2a24c4107bf96af31d0270be6cd982c86a419","first_computed_at":"2026-05-18T00:29:39.692270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:39.692270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MOFEzUFdv2gjiX6lk/XEwzWcYlrxrdHQUP+4oC8TeuvB1L4o8sOEMEuQWDOX8+H3vOqbhGxQWBUCqxuT3eCBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:39.692886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00907","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:024ec015ca1b41ce35f5ed64e2c0ea2bf8c0960de7d35168cbe1b79ea4405712","sha256:62765f548612770c32c8ba26ced2c28804f513b9f3628f7a162a6ac6318a6f68"],"state_sha256":"5f97b8ff0886465c7d79a86d75679adbfb2a3db68f6761f1344c07e418a9911e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oOCN50eF0N2a5FifNKqJ5PVtC4yEHtwjGGyAooxXm/JPWnxWJaDeT0tA5vzqgXtDBPBaUoH2ZmmM9/kD8rBDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:33:18.481960Z","bundle_sha256":"85149cdd08e6f95bf94fc0729ca347e7578174e68cc8c512d2d0549864330fe2"}}