{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J2CXH6XTUNBYJDQ6RDC4T7GVZS","short_pith_number":"pith:J2CXH6XT","canonical_record":{"source":{"id":"1512.02188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-07T19:43:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1d172f6080f56e5548e2c06a90ff826b3c2902890784e303a74b8eae0476a51c","abstract_canon_sha256":"918e587eb16e1ba527bdddff63d323f48506c3742355dbf0ac124fa363e14ebf"},"schema_version":"1.0"},"canonical_sha256":"4e8573faf3a343848e1e88c5c9fcd5cca9407c6bed5ba7df62e20d8d5e34f3d4","source":{"kind":"arxiv","id":"1512.02188","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J2CXH6XTUNBYJDQ6RDC4T7GVZS","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-12-07T19:43:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"1d172f6080f56e5548e2c06a90ff826b3c2902890784e303a74b8eae0476a51c","abstract_canon_sha256":"918e587eb16e1ba527bdddff63d323f48506c3742355dbf0ac124fa363e14ebf"},"schema_version":"1.0"},"canonical_sha256":"4e8573faf3a343848e1e88c5c9fcd5cca9407c6bed5ba7df62e20d8d5e34f3d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:59.272242Z","signature_b64":"ftTy8T36zynd8/ZSL44YswQuT3Dt83zaHEntOH1s9ti/kmJlrchxEkV0I26E72EQ8x8lIzHBUfWS3hLqWXImAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e8573faf3a343848e1e88c5c9fcd5cca9407c6bed5ba7df62e20d8d5e34f3d4","last_reissued_at":"2026-05-18T01:02:59.271628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:59.271628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02188","source_version":2,"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-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIesahq1/LJWjLTqyc3UYKARvM0ER/swTLkWJZsnhLtheheMygKg6pF80Iv4XeYnpV1ZAyXINQ+KEOeMzk+WCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:41:09.277744Z"},"content_sha256":"d65b6329c5ca49127c42f00d65e29764ed6a74cb135593daf2d0aec1d69aadde","schema_version":"1.0","event_id":"sha256:d65b6329c5ca49127c42f00d65e29764ed6a74cb135593daf2d0aec1d69aadde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J2CXH6XTUNBYJDQ6RDC4T7GVZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudo-Bayesian Robust PCA: Algorithms and Analyses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"David Wipf, In So Kweon, Tae-Hyun Oh, Yasuyuki Matsushita","submitted_at":"2015-12-07T19:43:54Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02188","kind":"arxiv","version":2},"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-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1sOxrcIMXGcuNS4L3q2Ys1wFh38euqBp+xGGRuuBCMLha2rg7Cm4S5vv0ySQsVEqzFlfXWGriTsz1OnwfZ8hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:41:09.278399Z"},"content_sha256":"4b38f47f18dbaf2e5dfd3ace69ab902383989b96e09a8bd2a9b0334ac9c3c7d6","schema_version":"1.0","event_id":"sha256:4b38f47f18dbaf2e5dfd3ace69ab902383989b96e09a8bd2a9b0334ac9c3c7d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2CXH6XTUNBYJDQ6RDC4T7GVZS/bundle.json","state_url":"https://pith.science/pith/J2CXH6XTUNBYJDQ6RDC4T7GVZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2CXH6XTUNBYJDQ6RDC4T7GVZS/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-26T14:41:09Z","links":{"resolver":"https://pith.science/pith/J2CXH6XTUNBYJDQ6RDC4T7GVZS","bundle":"https://pith.science/pith/J2CXH6XTUNBYJDQ6RDC4T7GVZS/bundle.json","state":"https://pith.science/pith/J2CXH6XTUNBYJDQ6RDC4T7GVZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2CXH6XTUNBYJDQ6RDC4T7GVZS/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lV+hbBGvJ7RJ10gS8muIPDMugxp9rcbWnNYJE55a1lMxnXtFYlIY+DFusP4cEuHQUKjzow4uuHXr6Bwkmpw2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:41:09.281672Z","bundle_sha256":"2e6231cdf29ce6a80dba45b50561f25e72da0ef3ca0ed320dc69b351f6a66a26"}}