{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6X762CU3SJ23E5LHHYYGRUECCC","short_pith_number":"pith:6X762CU3","canonical_record":{"source":{"id":"1803.00651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-01T22:48:53Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"656e8b3aa50ca2dee45ec86ad775ef7831a5b7402ea17d27328f361776158eaf","abstract_canon_sha256":"649ef5a646b6e7449cb888efaf8857712a771afca62423f791ef5c768eddf30a"},"schema_version":"1.0"},"canonical_sha256":"f5ffed0a9b9275b275673e3068d08210b3545a9888f7cf545fc302eba9ea1e5f","source":{"kind":"arxiv","id":"1803.00651","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00651","created_at":"2026-05-18T00:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00651v2","created_at":"2026-05-18T00:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00651","created_at":"2026-05-18T00:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"6X762CU3SJ23","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6X762CU3SJ23E5LH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6X762CU3","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6X762CU3SJ23E5LHHYYGRUECCC","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-01T22:48:53Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"656e8b3aa50ca2dee45ec86ad775ef7831a5b7402ea17d27328f361776158eaf","abstract_canon_sha256":"649ef5a646b6e7449cb888efaf8857712a771afca62423f791ef5c768eddf30a"},"schema_version":"1.0"},"canonical_sha256":"f5ffed0a9b9275b275673e3068d08210b3545a9888f7cf545fc302eba9ea1e5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:21.057100Z","signature_b64":"vYFbQhH5DRsm4uM5m8MIvbW402KeBGXRK/CelqnhvTNMnp7N/xwxvRcIE7/vYeATC6X3QIbNRpCLWb95UXx7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5ffed0a9b9275b275673e3068d08210b3545a9888f7cf545fc302eba9ea1e5f","last_reissued_at":"2026-05-18T00:08:21.056571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:21.056571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00651","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-18T00:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8By14Jmerbw5LhgX9EfiDb5CMc4LJYxlbeI0eCNv8RhlNh1QxxOEcjzfm08QHTH2tLwHshLO2o/IqTGK7px0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:36:06.267392Z"},"content_sha256":"5111687b8960e1c3af77a886e159538e52eea79237d154aa385510b3d60be46c","schema_version":"1.0","event_id":"sha256:5111687b8960e1c3af77a886e159538e52eea79237d154aa385510b3d60be46c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6X762CU3SJ23E5LHHYYGRUECCC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Static and Dynamic Robust PCA and Matrix Completion: A Review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","submitted_at":"2018-03-01T22:48:53Z","abstract_excerpt":"Principal Components Analysis (PCA) is one of the most widely used dimension reduction techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be corrupted by outliers. Recent work by Cand{\\`e}s, Wright, Li, and Ma defined RPCA as a problem of decomposing a given data matrix into the sum of a low-rank matrix (true data) and a sparse matrix (outliers). The column space of the low-rank matrix then gives the PCA solution. This simple definition has lead to a large amount of interesting new work on provably correct, fast, and practical solutions to RPCA. More recently, the dyn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00651","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-18T00:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBp0c3/cGYfOkrZeO81DJms3iFklw32xX5b3ngCy4fKgPxxh9Oo6o56H4v70Qy389fipOCCZ4guLpxw/3Sq5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:36:06.268040Z"},"content_sha256":"8e748a9c05492e7ae9289ab5e69024d38141b537cbc6fe535831b0d9ab8cd4c2","schema_version":"1.0","event_id":"sha256:8e748a9c05492e7ae9289ab5e69024d38141b537cbc6fe535831b0d9ab8cd4c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6X762CU3SJ23E5LHHYYGRUECCC/bundle.json","state_url":"https://pith.science/pith/6X762CU3SJ23E5LHHYYGRUECCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6X762CU3SJ23E5LHHYYGRUECCC/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-30T06:36:06Z","links":{"resolver":"https://pith.science/pith/6X762CU3SJ23E5LHHYYGRUECCC","bundle":"https://pith.science/pith/6X762CU3SJ23E5LHHYYGRUECCC/bundle.json","state":"https://pith.science/pith/6X762CU3SJ23E5LHHYYGRUECCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6X762CU3SJ23E5LHHYYGRUECCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6X762CU3SJ23E5LHHYYGRUECCC","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":"649ef5a646b6e7449cb888efaf8857712a771afca62423f791ef5c768eddf30a","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-01T22:48:53Z","title_canon_sha256":"656e8b3aa50ca2dee45ec86ad775ef7831a5b7402ea17d27328f361776158eaf"},"schema_version":"1.0","source":{"id":"1803.00651","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00651","created_at":"2026-05-18T00:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00651v2","created_at":"2026-05-18T00:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00651","created_at":"2026-05-18T00:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"6X762CU3SJ23","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6X762CU3SJ23E5LH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6X762CU3","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:8e748a9c05492e7ae9289ab5e69024d38141b537cbc6fe535831b0d9ab8cd4c2","target":"graph","created_at":"2026-05-18T00:08:21Z","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":"Principal Components Analysis (PCA) is one of the most widely used dimension reduction techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be corrupted by outliers. Recent work by Cand{\\`e}s, Wright, Li, and Ma defined RPCA as a problem of decomposing a given data matrix into the sum of a low-rank matrix (true data) and a sparse matrix (outliers). The column space of the low-rank matrix then gives the PCA solution. This simple definition has lead to a large amount of interesting new work on provably correct, fast, and practical solutions to RPCA. More recently, the dyn","authors_text":"Namrata Vaswani, Praneeth Narayanamurthy","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-01T22:48:53Z","title":"Static and Dynamic Robust PCA and Matrix Completion: A Review"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00651","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:5111687b8960e1c3af77a886e159538e52eea79237d154aa385510b3d60be46c","target":"record","created_at":"2026-05-18T00:08:21Z","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":"649ef5a646b6e7449cb888efaf8857712a771afca62423f791ef5c768eddf30a","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-01T22:48:53Z","title_canon_sha256":"656e8b3aa50ca2dee45ec86ad775ef7831a5b7402ea17d27328f361776158eaf"},"schema_version":"1.0","source":{"id":"1803.00651","kind":"arxiv","version":2}},"canonical_sha256":"f5ffed0a9b9275b275673e3068d08210b3545a9888f7cf545fc302eba9ea1e5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5ffed0a9b9275b275673e3068d08210b3545a9888f7cf545fc302eba9ea1e5f","first_computed_at":"2026-05-18T00:08:21.056571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:21.056571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vYFbQhH5DRsm4uM5m8MIvbW402KeBGXRK/CelqnhvTNMnp7N/xwxvRcIE7/vYeATC6X3QIbNRpCLWb95UXx7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:21.057100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00651","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5111687b8960e1c3af77a886e159538e52eea79237d154aa385510b3d60be46c","sha256:8e748a9c05492e7ae9289ab5e69024d38141b537cbc6fe535831b0d9ab8cd4c2"],"state_sha256":"f8e823798058008b6b3d13432cdf59cf3d5c2098eb4799710dcb6e545832ea46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aMnTqzOJ2+l/fJ9EAPYAM4yKlWIsP0t001cKL3Drf1kaP3AqPZjn/gwjUGXnZ34T6NNUykorTKp+rh0g9myjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:36:06.271682Z","bundle_sha256":"b5cc4244747f02f68ae9f732869d57dbe4014a9e157921cd4ebc450a883f7a35"}}