{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IMCQNPGGADCUEMOER6HHIE23YU","short_pith_number":"pith:IMCQNPGG","canonical_record":{"source":{"id":"1904.07497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T07:07:44Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"64536f29080f3c1fb86353dce052436a62f47d8622299c4fcce72fc441cc804a","abstract_canon_sha256":"890b923daca3aa1a54917956c27f21164008ad6079de7d2e11ef212a28f5ef36"},"schema_version":"1.0"},"canonical_sha256":"430506bcc600c54231c48f8e74135bc5264bb8122399ca804e0323c580497ea2","source":{"kind":"arxiv","id":"1904.07497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07497","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07497v1","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07497","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"IMCQNPGGADCU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IMCQNPGGADCUEMOE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IMCQNPGG","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IMCQNPGGADCUEMOER6HHIE23YU","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T07:07:44Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"64536f29080f3c1fb86353dce052436a62f47d8622299c4fcce72fc441cc804a","abstract_canon_sha256":"890b923daca3aa1a54917956c27f21164008ad6079de7d2e11ef212a28f5ef36"},"schema_version":"1.0"},"canonical_sha256":"430506bcc600c54231c48f8e74135bc5264bb8122399ca804e0323c580497ea2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:25.056933Z","signature_b64":"F95Xzcc4XOKJa3tpggTY94XoM2WgTEBnqjVAL85jEpmJ2eEIYoTkl1o7YDXafCI9P4uYHVPmM6Gk8ZU8+ntLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"430506bcc600c54231c48f8e74135bc5264bb8122399ca804e0323c580497ea2","last_reissued_at":"2026-05-17T23:48:25.056359Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:25.056359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07497","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-17T23:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rUKEBQnPM1WGQDi0X1rIN29rTLaeM3dVIr/yFu8+QTYRhqwd8PFJhAzU4S7sUcklQ/1n6iTOsaV8UgQc5tNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:13:20.098871Z"},"content_sha256":"ff6b5f8000d1d3a10eef95502edfd121b2b36712e385492ccda8d8ba28bf349d","schema_version":"1.0","event_id":"sha256:ff6b5f8000d1d3a10eef95502edfd121b2b36712e385492ccda8d8ba28bf349d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IMCQNPGGADCUEMOER6HHIE23YU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RES-PCA: A Scalable Approach to Recovering Low-rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chenglizhao Chen, Chong Peng, Jianbo Li, Qiang Cheng, Zhao Kang","submitted_at":"2019-04-16T07:07:44Z","abstract_excerpt":"Robust principal component analysis (RPCA) has drawn significant attentions due to its powerful capability in recovering low-rank matrices as well as successful appplications in various real world problems. The current state-of-the-art algorithms usually need to solve singular value decomposition of large matrices, which generally has at least a quadratic or even cubic complexity. This drawback has limited the application of RPCA in solving real world problems. To combat this drawback, in this paper we propose a new type of RPCA method, RES-PCA, which is linearly efficient and scalable in both"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07497","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-17T23:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtN487IV/dzrQM7eIjEhDhgmSrr6XKbSexnDkBUD/Z4skmewHj2rpjuX6Y8udwihYGRHBa5U4kM49ZEzwqTvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:13:20.099212Z"},"content_sha256":"ae41426ff6ef5016ed044342af30c17abac8c2260fdc4d5089496b482d75f5a4","schema_version":"1.0","event_id":"sha256:ae41426ff6ef5016ed044342af30c17abac8c2260fdc4d5089496b482d75f5a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMCQNPGGADCUEMOER6HHIE23YU/bundle.json","state_url":"https://pith.science/pith/IMCQNPGGADCUEMOER6HHIE23YU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMCQNPGGADCUEMOER6HHIE23YU/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-03T16:13:20Z","links":{"resolver":"https://pith.science/pith/IMCQNPGGADCUEMOER6HHIE23YU","bundle":"https://pith.science/pith/IMCQNPGGADCUEMOER6HHIE23YU/bundle.json","state":"https://pith.science/pith/IMCQNPGGADCUEMOER6HHIE23YU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMCQNPGGADCUEMOER6HHIE23YU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IMCQNPGGADCUEMOER6HHIE23YU","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":"890b923daca3aa1a54917956c27f21164008ad6079de7d2e11ef212a28f5ef36","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T07:07:44Z","title_canon_sha256":"64536f29080f3c1fb86353dce052436a62f47d8622299c4fcce72fc441cc804a"},"schema_version":"1.0","source":{"id":"1904.07497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07497","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07497v1","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07497","created_at":"2026-05-17T23:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"IMCQNPGGADCU","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IMCQNPGGADCUEMOE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IMCQNPGG","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:ae41426ff6ef5016ed044342af30c17abac8c2260fdc4d5089496b482d75f5a4","target":"graph","created_at":"2026-05-17T23:48: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":"Robust principal component analysis (RPCA) has drawn significant attentions due to its powerful capability in recovering low-rank matrices as well as successful appplications in various real world problems. The current state-of-the-art algorithms usually need to solve singular value decomposition of large matrices, which generally has at least a quadratic or even cubic complexity. This drawback has limited the application of RPCA in solving real world problems. To combat this drawback, in this paper we propose a new type of RPCA method, RES-PCA, which is linearly efficient and scalable in both","authors_text":"Chenglizhao Chen, Chong Peng, Jianbo Li, Qiang Cheng, Zhao Kang","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T07:07:44Z","title":"RES-PCA: A Scalable Approach to Recovering Low-rank Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07497","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:ff6b5f8000d1d3a10eef95502edfd121b2b36712e385492ccda8d8ba28bf349d","target":"record","created_at":"2026-05-17T23:48: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":"890b923daca3aa1a54917956c27f21164008ad6079de7d2e11ef212a28f5ef36","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-16T07:07:44Z","title_canon_sha256":"64536f29080f3c1fb86353dce052436a62f47d8622299c4fcce72fc441cc804a"},"schema_version":"1.0","source":{"id":"1904.07497","kind":"arxiv","version":1}},"canonical_sha256":"430506bcc600c54231c48f8e74135bc5264bb8122399ca804e0323c580497ea2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"430506bcc600c54231c48f8e74135bc5264bb8122399ca804e0323c580497ea2","first_computed_at":"2026-05-17T23:48:25.056359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:25.056359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F95Xzcc4XOKJa3tpggTY94XoM2WgTEBnqjVAL85jEpmJ2eEIYoTkl1o7YDXafCI9P4uYHVPmM6Gk8ZU8+ntLAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:25.056933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff6b5f8000d1d3a10eef95502edfd121b2b36712e385492ccda8d8ba28bf349d","sha256:ae41426ff6ef5016ed044342af30c17abac8c2260fdc4d5089496b482d75f5a4"],"state_sha256":"97b3544bc6c7b6c96c56bba84a9a69e35ba3919c12b81827e3b711df766b679f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQcAfJRNsuT7/v8oGIEU1hVodTaa63FZXdN2g0Ti+weXDFIQrW8UqdddLIptC+NuMG/PfkNegKXkf310mnuRDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:13:20.101140Z","bundle_sha256":"4e28abc276f36fedcf089bec69f23915dc758717a5f07578dbb732567ea4f505"}}