{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2N4ZTMCLU46XRGS5JOT3N4IR3O","short_pith_number":"pith:2N4ZTMCL","canonical_record":{"source":{"id":"2110.05649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T23:37:55Z","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA"],"title_canon_sha256":"46fabc6fc2e7c1dd21e60e0d0f3cd4407ad8b2773d107a6eb0fed431047153c7","abstract_canon_sha256":"0c47b99608718a5a77c371f8ff075da88a74d64bc959b9be40d9a9ade546a08d"},"schema_version":"1.0"},"canonical_sha256":"d37999b04ba73d789a5d4ba7b6f111dbb231bdbee429bfce8c62fca8328fb08b","source":{"kind":"arxiv","id":"2110.05649","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.05649","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"2110.05649v1","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05649","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"2N4ZTMCLU46X","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_16","alias_value":"2N4ZTMCLU46XRGS5","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_8","alias_value":"2N4ZTMCL","created_at":"2026-07-05T05:45:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2N4ZTMCLU46XRGS5JOT3N4IR3O","target":"record","payload":{"canonical_record":{"source":{"id":"2110.05649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T23:37:55Z","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA"],"title_canon_sha256":"46fabc6fc2e7c1dd21e60e0d0f3cd4407ad8b2773d107a6eb0fed431047153c7","abstract_canon_sha256":"0c47b99608718a5a77c371f8ff075da88a74d64bc959b9be40d9a9ade546a08d"},"schema_version":"1.0"},"canonical_sha256":"d37999b04ba73d789a5d4ba7b6f111dbb231bdbee429bfce8c62fca8328fb08b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:25.335487Z","signature_b64":"wrCyrb+rIWph5go451uUSMq3/T6GE2D3UHX+7GwQd1Gn6aqrvk1tn3T1VpugB3jjh5JHg+ytJLFtFvzX6IV/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d37999b04ba73d789a5d4ba7b6f111dbb231bdbee429bfce8c62fca8328fb08b","last_reissued_at":"2026-07-05T05:45:25.335029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:25.335029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.05649","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-07-05T05:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWLtPzKOFId6CbH558wFEXJw6pf5ikhi0WqIBQIJfV3o9hnaZlAmjPSDTVMKVRcsbRljRyMb5uUjvhMYt4NLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T14:06:51.600155Z"},"content_sha256":"95b330e4442fee007ee81d7bb6591ff36b0464df6dd72087bb76d1a41a9b07e3","schema_version":"1.0","event_id":"sha256:95b330e4442fee007ee81d7bb6591ff36b0464df6dd72087bb76d1a41a9b07e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2N4ZTMCLU46XRGS5JOT3N4IR3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","cs.NA","math.IT","math.NA"],"primary_cat":"cs.LG","authors_text":"HanQin Cai, Jialin Liu, Wotao Yin","submitted_at":"2021-10-11T23:37:55Z","abstract_excerpt":"Robust principal component analysis (RPCA) is a critical tool in modern machine learning, which detects outliers in the task of low-rank matrix reconstruction. In this paper, we propose a scalable and learnable non-convex approach for high-dimensional RPCA problems, which we call Learned Robust PCA (LRPCA). LRPCA is highly efficient, and its free parameters can be effectively learned to optimize via deep unfolding. Moreover, we extend deep unfolding from finite iterations to infinite iterations via a novel feedforward-recurrent-mixed neural network model. We establish the recovery guarantee of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05649","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.05649/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2KWdk2w7c9F2k6ceo5KVCk7PJ5cPSH5lVXcEc0/iXmnEXjv3ccdysogMWTGKrxR/VCOkEt/GOOWyEdd9es2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-22T14:06:51.600595Z"},"content_sha256":"ab65073095afc6475e34f1cb7dae1583c571970f4209719ae7ed1ec8908f0519","schema_version":"1.0","event_id":"sha256:ab65073095afc6475e34f1cb7dae1583c571970f4209719ae7ed1ec8908f0519"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2N4ZTMCLU46XRGS5JOT3N4IR3O/bundle.json","state_url":"https://pith.science/pith/2N4ZTMCLU46XRGS5JOT3N4IR3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2N4ZTMCLU46XRGS5JOT3N4IR3O/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-07-22T14:06:51Z","links":{"resolver":"https://pith.science/pith/2N4ZTMCLU46XRGS5JOT3N4IR3O","bundle":"https://pith.science/pith/2N4ZTMCLU46XRGS5JOT3N4IR3O/bundle.json","state":"https://pith.science/pith/2N4ZTMCLU46XRGS5JOT3N4IR3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2N4ZTMCLU46XRGS5JOT3N4IR3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2N4ZTMCLU46XRGS5JOT3N4IR3O","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":"0c47b99608718a5a77c371f8ff075da88a74d64bc959b9be40d9a9ade546a08d","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T23:37:55Z","title_canon_sha256":"46fabc6fc2e7c1dd21e60e0d0f3cd4407ad8b2773d107a6eb0fed431047153c7"},"schema_version":"1.0","source":{"id":"2110.05649","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.05649","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"2110.05649v1","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05649","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"2N4ZTMCLU46X","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_16","alias_value":"2N4ZTMCLU46XRGS5","created_at":"2026-07-05T05:45:25Z"},{"alias_kind":"pith_short_8","alias_value":"2N4ZTMCL","created_at":"2026-07-05T05:45:25Z"}],"graph_snapshots":[{"event_id":"sha256:ab65073095afc6475e34f1cb7dae1583c571970f4209719ae7ed1ec8908f0519","target":"graph","created_at":"2026-07-05T05:45: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.05649/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Robust principal component analysis (RPCA) is a critical tool in modern machine learning, which detects outliers in the task of low-rank matrix reconstruction. In this paper, we propose a scalable and learnable non-convex approach for high-dimensional RPCA problems, which we call Learned Robust PCA (LRPCA). LRPCA is highly efficient, and its free parameters can be effectively learned to optimize via deep unfolding. Moreover, we extend deep unfolding from finite iterations to infinite iterations via a novel feedforward-recurrent-mixed neural network model. We establish the recovery guarantee of","authors_text":"HanQin Cai, Jialin Liu, Wotao Yin","cross_cats":["cs.CV","cs.IT","cs.NA","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T23:37:55Z","title":"Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05649","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:95b330e4442fee007ee81d7bb6591ff36b0464df6dd72087bb76d1a41a9b07e3","target":"record","created_at":"2026-07-05T05:45: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":"0c47b99608718a5a77c371f8ff075da88a74d64bc959b9be40d9a9ade546a08d","cross_cats_sorted":["cs.CV","cs.IT","cs.NA","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T23:37:55Z","title_canon_sha256":"46fabc6fc2e7c1dd21e60e0d0f3cd4407ad8b2773d107a6eb0fed431047153c7"},"schema_version":"1.0","source":{"id":"2110.05649","kind":"arxiv","version":1}},"canonical_sha256":"d37999b04ba73d789a5d4ba7b6f111dbb231bdbee429bfce8c62fca8328fb08b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d37999b04ba73d789a5d4ba7b6f111dbb231bdbee429bfce8c62fca8328fb08b","first_computed_at":"2026-07-05T05:45:25.335029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:25.335029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wrCyrb+rIWph5go451uUSMq3/T6GE2D3UHX+7GwQd1Gn6aqrvk1tn3T1VpugB3jjh5JHg+ytJLFtFvzX6IV/BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:25.335487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.05649","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95b330e4442fee007ee81d7bb6591ff36b0464df6dd72087bb76d1a41a9b07e3","sha256:ab65073095afc6475e34f1cb7dae1583c571970f4209719ae7ed1ec8908f0519"],"state_sha256":"29ab9d753b51a99b92bd3e9f72db2b5a3a661026cd6469eb81184c1d794fb7ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/wkibSnZvTlkaM+2tCN8ZKuDoYaWtOU80s/rcuIJUmYYH7f30IFinjPRnssGj5LUpZkT1HA29UizhfQ3QdhCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-22T14:06:51.608323Z","bundle_sha256":"69fa01313fb0e19fe72982b6d470fd6c52e882a9217147736fb7a5b384b081ef"}}