{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YQQDHRKVTIJT22JZLUWNXCTNFE","short_pith_number":"pith:YQQDHRKV","canonical_record":{"source":{"id":"1704.03925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-12T20:45:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"797fec1e3b42f679a56c2c33cbf8e996c0b14525237018112f19214c28d80994","abstract_canon_sha256":"3cff77d5dde45909d804011118d487e52d87edb6bd197fab60b2c4ebaa631883"},"schema_version":"1.0"},"canonical_sha256":"c42033c5559a133d69395d2cdb8a6d29282eba78a796100ca6f32a850ba44b69","source":{"kind":"arxiv","id":"1704.03925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03925","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03925v1","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03925","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"YQQDHRKVTIJT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQQDHRKVTIJT22JZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQQDHRKV","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YQQDHRKVTIJT22JZLUWNXCTNFE","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-12T20:45:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"797fec1e3b42f679a56c2c33cbf8e996c0b14525237018112f19214c28d80994","abstract_canon_sha256":"3cff77d5dde45909d804011118d487e52d87edb6bd197fab60b2c4ebaa631883"},"schema_version":"1.0"},"canonical_sha256":"c42033c5559a133d69395d2cdb8a6d29282eba78a796100ca6f32a850ba44b69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:25.869475Z","signature_b64":"wp45DSzUDSRk9PFUlf+d78Uh5UTRLhP8BBntSMW+YNK+Mr87ghr8Cm797C9jcpwJwvXcc0AH2vbZRSQTJ2a8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c42033c5559a133d69395d2cdb8a6d29282eba78a796100ca6f32a850ba44b69","last_reissued_at":"2026-05-18T00:46:25.868881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:25.868881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03925","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-18T00:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0azIqffQHF/d0MYH/5K/VvVsq1XGWNbgKiz7Y0CeUSaIRLQA+e2JyBwINGoS3aO4NO1e+5Ln2cmuleqMUuzFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:20:46.100473Z"},"content_sha256":"f4c777c8788e3a29e5744693a9e55458510101db6995a86b6147798e08db6e47","schema_version":"1.0","event_id":"sha256:f4c777c8788e3a29e5744693a9e55458510101db6995a86b6147798e08db6e47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YQQDHRKVTIJT22JZLUWNXCTNFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Self-Representation Based Outlier Detection in a Union of Subspaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CV","authors_text":"Chong You, Daniel P. Robinson, Ren\\'e Vidal","submitted_at":"2017-04-12T20:45:48Z","abstract_excerpt":"Many computer vision tasks involve processing large amounts of data contaminated by outliers, which need to be detected and rejected. While outlier detection methods based on robust statistics have existed for decades, only recently have methods based on sparse and low-rank representation been developed along with guarantees of correct outlier detection when the inliers lie in one or more low-dimensional subspaces. This paper proposes a new outlier detection method that combines tools from sparse representation with random walks on a graph. By exploiting the property that data points can be ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03925","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-18T00:46:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfhVkYfJUNC+n0gyBIi7EfOcCIWslibVfZBJ7aWMPpQo0kyttvfwbs3GrExs1NrYBCk4fjJXEjGSTZGRIYvvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:20:46.101144Z"},"content_sha256":"257c2a7113e13fe99a408a460d68c0e6f5ae9a72318d6490faa8cfaed06cdfe7","schema_version":"1.0","event_id":"sha256:257c2a7113e13fe99a408a460d68c0e6f5ae9a72318d6490faa8cfaed06cdfe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQQDHRKVTIJT22JZLUWNXCTNFE/bundle.json","state_url":"https://pith.science/pith/YQQDHRKVTIJT22JZLUWNXCTNFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQQDHRKVTIJT22JZLUWNXCTNFE/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-06T16:20:46Z","links":{"resolver":"https://pith.science/pith/YQQDHRKVTIJT22JZLUWNXCTNFE","bundle":"https://pith.science/pith/YQQDHRKVTIJT22JZLUWNXCTNFE/bundle.json","state":"https://pith.science/pith/YQQDHRKVTIJT22JZLUWNXCTNFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQQDHRKVTIJT22JZLUWNXCTNFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YQQDHRKVTIJT22JZLUWNXCTNFE","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":"3cff77d5dde45909d804011118d487e52d87edb6bd197fab60b2c4ebaa631883","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-12T20:45:48Z","title_canon_sha256":"797fec1e3b42f679a56c2c33cbf8e996c0b14525237018112f19214c28d80994"},"schema_version":"1.0","source":{"id":"1704.03925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03925","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03925v1","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03925","created_at":"2026-05-18T00:46:25Z"},{"alias_kind":"pith_short_12","alias_value":"YQQDHRKVTIJT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YQQDHRKVTIJT22JZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YQQDHRKV","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:257c2a7113e13fe99a408a460d68c0e6f5ae9a72318d6490faa8cfaed06cdfe7","target":"graph","created_at":"2026-05-18T00:46:25Z","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":"Many computer vision tasks involve processing large amounts of data contaminated by outliers, which need to be detected and rejected. While outlier detection methods based on robust statistics have existed for decades, only recently have methods based on sparse and low-rank representation been developed along with guarantees of correct outlier detection when the inliers lie in one or more low-dimensional subspaces. This paper proposes a new outlier detection method that combines tools from sparse representation with random walks on a graph. By exploiting the property that data points can be ex","authors_text":"Chong You, Daniel P. Robinson, Ren\\'e Vidal","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-12T20:45:48Z","title":"Provable Self-Representation Based Outlier Detection in a Union of Subspaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03925","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:f4c777c8788e3a29e5744693a9e55458510101db6995a86b6147798e08db6e47","target":"record","created_at":"2026-05-18T00:46:25Z","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":"3cff77d5dde45909d804011118d487e52d87edb6bd197fab60b2c4ebaa631883","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-12T20:45:48Z","title_canon_sha256":"797fec1e3b42f679a56c2c33cbf8e996c0b14525237018112f19214c28d80994"},"schema_version":"1.0","source":{"id":"1704.03925","kind":"arxiv","version":1}},"canonical_sha256":"c42033c5559a133d69395d2cdb8a6d29282eba78a796100ca6f32a850ba44b69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c42033c5559a133d69395d2cdb8a6d29282eba78a796100ca6f32a850ba44b69","first_computed_at":"2026-05-18T00:46:25.868881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:25.868881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wp45DSzUDSRk9PFUlf+d78Uh5UTRLhP8BBntSMW+YNK+Mr87ghr8Cm797C9jcpwJwvXcc0AH2vbZRSQTJ2a8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:25.869475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4c777c8788e3a29e5744693a9e55458510101db6995a86b6147798e08db6e47","sha256:257c2a7113e13fe99a408a460d68c0e6f5ae9a72318d6490faa8cfaed06cdfe7"],"state_sha256":"42e0226944a5c6f5579a1196fffb81d1e30170d05f074d15a4cceaeaa013d84c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imWgc60O6NUMLIM1D8AYgiVp7Ry8M6nbvzs51IoDBId5kz+vD1rDEoHnvbku9/tZJVmICIyO08IcuQKsROzYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:20:46.104555Z","bundle_sha256":"4f5511d70fe8bdb4bcdc8ed1c75c4dbdbe945c5f5ffbd533a2635e4cdbcc0582"}}