{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PWDWUBU63MBMVAZ4BGHWM7CHL2","short_pith_number":"pith:PWDWUBU6","canonical_record":{"source":{"id":"1112.3946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-16T20:40:23Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"502b2a29be9aa725337ea20138e5242f07096ab2db70091cd208bbc9e596a37f","abstract_canon_sha256":"27b8bea876f7154be40a3aced12b00531210b01767836eeb2f993a9e41d09c95"},"schema_version":"1.0"},"canonical_sha256":"7d876a069edb02ca833c098f667c475e8163113368de4105f685574a5ee3a60c","source":{"kind":"arxiv","id":"1112.3946","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3946","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3946v2","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3946","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"PWDWUBU63MBM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PWDWUBU63MBMVAZ4","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PWDWUBU6","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PWDWUBU63MBMVAZ4BGHWM7CHL2","target":"record","payload":{"canonical_record":{"source":{"id":"1112.3946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-16T20:40:23Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"502b2a29be9aa725337ea20138e5242f07096ab2db70091cd208bbc9e596a37f","abstract_canon_sha256":"27b8bea876f7154be40a3aced12b00531210b01767836eeb2f993a9e41d09c95"},"schema_version":"1.0"},"canonical_sha256":"7d876a069edb02ca833c098f667c475e8163113368de4105f685574a5ee3a60c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:14.624710Z","signature_b64":"dxsrFxr5FVIPZu1e7VChqbVRvz8Be/J2EZAbI/lRm8ZXKkJmXGzxWQevI9gnPWBKBkpmdG1fh/bO5Ww0W0OoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d876a069edb02ca833c098f667c475e8163113368de4105f685574a5ee3a60c","last_reissued_at":"2026-05-18T04:05:14.624124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:14.624124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.3946","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-18T04:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cm7BivXnDI99Nz+b41BJr2ctKYj/pw6oG70GQovmVwZtFsZFBw+jExE44FWsR1SUnn9FylAuu9OriQspX6nBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:50:01.183054Z"},"content_sha256":"960f97b9a497e4f2ee22310d46aa27a866827f694c38a46d293d9d5a524cd178","schema_version":"1.0","event_id":"sha256:960f97b9a497e4f2ee22310d46aa27a866827f694c38a46d293d9d5a524cd178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PWDWUBU63MBMVAZ4BGHWM7CHL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Zhang, Jian-Feng Cai, Jubo Zhu, Lizhi Cheng","submitted_at":"2011-12-16T20:40:23Z","abstract_excerpt":"The common task in matrix completion (MC) and robust principle component analysis (RPCA) is to recover a low-rank matrix from a given data matrix. These problems gained great attention from various areas in applied sciences recently, especially after the publication of the pioneering works of Cand`es et al.. One fundamental result in MC and RPCA is that nuclear norm based convex optimizations lead to the exact low-rank matrix recovery under suitable conditions. In this paper, we extend this result by showing that strongly convex optimizations can guarantee the exact low-rank matrix recovery as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3946","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-18T04:05:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naB2ZoGkDGFzRfHUMxSTpHuhCuyH1tJ05bvoJ1e3Fia5c4T8NmC1w1ye6YXUZ7fYlDljW0bvrHBKNW1LDy3SBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:50:01.183608Z"},"content_sha256":"6f51bd1c4deff7b0f24b281b177957355e3de6c41987a2df94d77388dcc45bd7","schema_version":"1.0","event_id":"sha256:6f51bd1c4deff7b0f24b281b177957355e3de6c41987a2df94d77388dcc45bd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/bundle.json","state_url":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/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-26T11:50:01Z","links":{"resolver":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2","bundle":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/bundle.json","state":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PWDWUBU63MBMVAZ4BGHWM7CHL2","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":"27b8bea876f7154be40a3aced12b00531210b01767836eeb2f993a9e41d09c95","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-16T20:40:23Z","title_canon_sha256":"502b2a29be9aa725337ea20138e5242f07096ab2db70091cd208bbc9e596a37f"},"schema_version":"1.0","source":{"id":"1112.3946","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3946","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3946v2","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3946","created_at":"2026-05-18T04:05:14Z"},{"alias_kind":"pith_short_12","alias_value":"PWDWUBU63MBM","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PWDWUBU63MBMVAZ4","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PWDWUBU6","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:6f51bd1c4deff7b0f24b281b177957355e3de6c41987a2df94d77388dcc45bd7","target":"graph","created_at":"2026-05-18T04:05:14Z","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":"The common task in matrix completion (MC) and robust principle component analysis (RPCA) is to recover a low-rank matrix from a given data matrix. These problems gained great attention from various areas in applied sciences recently, especially after the publication of the pioneering works of Cand`es et al.. One fundamental result in MC and RPCA is that nuclear norm based convex optimizations lead to the exact low-rank matrix recovery under suitable conditions. In this paper, we extend this result by showing that strongly convex optimizations can guarantee the exact low-rank matrix recovery as","authors_text":"Hui Zhang, Jian-Feng Cai, Jubo Zhu, Lizhi Cheng","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-16T20:40:23Z","title":"Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3946","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:960f97b9a497e4f2ee22310d46aa27a866827f694c38a46d293d9d5a524cd178","target":"record","created_at":"2026-05-18T04:05:14Z","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":"27b8bea876f7154be40a3aced12b00531210b01767836eeb2f993a9e41d09c95","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-16T20:40:23Z","title_canon_sha256":"502b2a29be9aa725337ea20138e5242f07096ab2db70091cd208bbc9e596a37f"},"schema_version":"1.0","source":{"id":"1112.3946","kind":"arxiv","version":2}},"canonical_sha256":"7d876a069edb02ca833c098f667c475e8163113368de4105f685574a5ee3a60c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d876a069edb02ca833c098f667c475e8163113368de4105f685574a5ee3a60c","first_computed_at":"2026-05-18T04:05:14.624124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:14.624124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dxsrFxr5FVIPZu1e7VChqbVRvz8Be/J2EZAbI/lRm8ZXKkJmXGzxWQevI9gnPWBKBkpmdG1fh/bO5Ww0W0OoBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:14.624710Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3946","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:960f97b9a497e4f2ee22310d46aa27a866827f694c38a46d293d9d5a524cd178","sha256:6f51bd1c4deff7b0f24b281b177957355e3de6c41987a2df94d77388dcc45bd7"],"state_sha256":"15130e87592801b5ab8c8d6246aefe8a2c22f1ecf8b8b5d5f1738c993e483739"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BU8g5fWEi2elQ4tUBsCJfF3WNmgFCdGwi2OIGgqzeM+ZsDBopy1sSu7DJFldRYbNwSIrGDKsbboV6YAHjrwBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:50:01.186879Z","bundle_sha256":"b954124a5bc66d53d55d519cf34e105311615d8e62024917605a96706ca79184"}}