{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J2CXH6XTUNBYJDQ6RDC4T7GVZS","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":"918e587eb16e1ba527bdddff63d323f48506c3742355dbf0ac124fa363e14ebf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-07T19:43:54Z","title_canon_sha256":"1d172f6080f56e5548e2c06a90ff826b3c2902890784e303a74b8eae0476a51c"},"schema_version":"1.0","source":{"id":"1512.02188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02188","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02188v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02188","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"J2CXH6XTUNBY","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J2CXH6XTUNBYJDQ6","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J2CXH6XT","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:4b38f47f18dbaf2e5dfd3ace69ab902383989b96e09a8bd2a9b0334ac9c3c7d6","target":"graph","created_at":"2026-05-18T01:02:59Z","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":"Commonly used in computer vision and other applications, robust PCA represents an algorithmic attempt to reduce the sensitivity of classical PCA to outliers. The basic idea is to learn a decomposition of some data matrix of interest into low rank and sparse components, the latter representing unwanted outliers. Although the resulting optimization problem is typically NP-hard, convex relaxations provide a computationally-expedient alternative with theoretical support. However, in practical regimes performance guarantees break down and a variety of non-convex alternatives, including Bayesian-ins","authors_text":"David Wipf, In So Kweon, Tae-Hyun Oh, Yasuyuki Matsushita","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-07T19:43:54Z","title":"Pseudo-Bayesian Robust PCA: Algorithms and Analyses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02188","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:d65b6329c5ca49127c42f00d65e29764ed6a74cb135593daf2d0aec1d69aadde","target":"record","created_at":"2026-05-18T01:02:59Z","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":"918e587eb16e1ba527bdddff63d323f48506c3742355dbf0ac124fa363e14ebf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-07T19:43:54Z","title_canon_sha256":"1d172f6080f56e5548e2c06a90ff826b3c2902890784e303a74b8eae0476a51c"},"schema_version":"1.0","source":{"id":"1512.02188","kind":"arxiv","version":2}},"canonical_sha256":"4e8573faf3a343848e1e88c5c9fcd5cca9407c6bed5ba7df62e20d8d5e34f3d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e8573faf3a343848e1e88c5c9fcd5cca9407c6bed5ba7df62e20d8d5e34f3d4","first_computed_at":"2026-05-18T01:02:59.271628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:59.271628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ftTy8T36zynd8/ZSL44YswQuT3Dt83zaHEntOH1s9ti/kmJlrchxEkV0I26E72EQ8x8lIzHBUfWS3hLqWXImAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:59.272242Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d65b6329c5ca49127c42f00d65e29764ed6a74cb135593daf2d0aec1d69aadde","sha256:4b38f47f18dbaf2e5dfd3ace69ab902383989b96e09a8bd2a9b0334ac9c3c7d6"],"state_sha256":"c32fad819a7c5c77a7f203daa4d6944fb93436d56eab9db143fc6b2b66562012"}