{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3AS7IXHYOHBLAT7WWK73H5W2EF","short_pith_number":"pith:3AS7IXHY","schema_version":"1.0","canonical_sha256":"d825f45cf871c2b04ff6b2bfb3f6da214a079661cb7a3d0fd8f50eeecf6671e6","source":{"kind":"arxiv","id":"1412.8132","version":2},"attestation_state":"computed","paper":{"title":"Robust Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre B. Tsybakov (CREST), CREST), Karim Lounici, Olga Klopp (MODAL'X","submitted_at":"2014-12-28T08:45:05Z","abstract_excerpt":"This paper considers the problem of recovery of a low-rank matrix in the situation when most of its entries are not observed and a fraction of observed entries are corrupted. The observations are noisy realizations of the sum of a low rank matrix, which we wish to recover, with a second matrix having  a complementary sparse structure such as element-wise or column-wise sparsity. We analyze a class of estimators obtained by solving a constrained convex optimization problem that combines the nuclear norm  and a convex relaxation for a sparse constraint.   Our results are obtained for the simulta"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.8132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-28T08:45:05Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"40867d22ea25aa68043db4d606107f28c90d69aad5559ccf2ab6a41b419b2c87","abstract_canon_sha256":"061d7bad7bda70d2f2a4856cdbf43c410aa75d0bf3994f29fda2c27f557276a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:35.382445Z","signature_b64":"jRBL4ixcwfU6StgMuJGuFWlrkylTVydX6uGCq5UolcyRy3DZI0ItCGUn5O82MysM9YhbkDMMCrU6PJkjpfTpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d825f45cf871c2b04ff6b2bfb3f6da214a079661cb7a3d0fd8f50eeecf6671e6","last_reissued_at":"2026-05-18T01:11:35.382044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:35.382044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandre B. Tsybakov (CREST), CREST), Karim Lounici, Olga Klopp (MODAL'X","submitted_at":"2014-12-28T08:45:05Z","abstract_excerpt":"This paper considers the problem of recovery of a low-rank matrix in the situation when most of its entries are not observed and a fraction of observed entries are corrupted. The observations are noisy realizations of the sum of a low rank matrix, which we wish to recover, with a second matrix having  a complementary sparse structure such as element-wise or column-wise sparsity. We analyze a class of estimators obtained by solving a constrained convex optimization problem that combines the nuclear norm  and a convex relaxation for a sparse constraint.   Our results are obtained for the simulta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8132","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.8132","created_at":"2026-05-18T01:11:35.382103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8132v2","created_at":"2026-05-18T01:11:35.382103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8132","created_at":"2026-05-18T01:11:35.382103+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AS7IXHYOHBL","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AS7IXHYOHBLAT7W","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AS7IXHY","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF","json":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF.json","graph_json":"https://pith.science/api/pith-number/3AS7IXHYOHBLAT7WWK73H5W2EF/graph.json","events_json":"https://pith.science/api/pith-number/3AS7IXHYOHBLAT7WWK73H5W2EF/events.json","paper":"https://pith.science/paper/3AS7IXHY"},"agent_actions":{"view_html":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF","download_json":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF.json","view_paper":"https://pith.science/paper/3AS7IXHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8132&json=true","fetch_graph":"https://pith.science/api/pith-number/3AS7IXHYOHBLAT7WWK73H5W2EF/graph.json","fetch_events":"https://pith.science/api/pith-number/3AS7IXHYOHBLAT7WWK73H5W2EF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF/action/storage_attestation","attest_author":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF/action/author_attestation","sign_citation":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF/action/citation_signature","submit_replication":"https://pith.science/pith/3AS7IXHYOHBLAT7WWK73H5W2EF/action/replication_record"}},"created_at":"2026-05-18T01:11:35.382103+00:00","updated_at":"2026-05-18T01:11:35.382103+00:00"}