{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B37KFEXO2QUYGIIPPD2OL2N4QB","short_pith_number":"pith:B37KFEXO","schema_version":"1.0","canonical_sha256":"0efea292eed42983210f78f4e5e9bc80601f49a5efdf2bd0cd4b8ea3842aefef","source":{"kind":"arxiv","id":"1803.10846","version":2},"attestation_state":"computed","paper":{"title":"Non-Convex Matrix Completion Against a Semi-Random Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Rong Ge, Yu Cheng","submitted_at":"2018-03-28T20:46:27Z","abstract_excerpt":"Matrix completion is a well-studied problem with many machine learning applications. In practice, the problem is often solved by non-convex optimization algorithms. However, the current theoretical analysis for non-convex algorithms relies heavily on the assumption that every entry is observed with exactly the same probability $p$, which is not realistic in practice.\n  In this paper, we investigate a more realistic semi-random model, where the probability of observing each entry is at least $p$. Even with this mild semi-random perturbation, we can construct counter-examples where existing non-"},"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":"1803.10846","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-28T20:46:27Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"a4cebbf4da928515adf7c1ae3b81a58da7aeaebbbc0fd0a24643c208284bb107","abstract_canon_sha256":"42d2f1e15adf0137c1a7acedd4d7b354488f3bd0f7f5c42ef3f7d89471383b91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:16.095805Z","signature_b64":"Ng+BvSlWv2pDuxW5JtiNShGCp0s5FVvdxbXUPX6NDKlf6+QG2sqyP6mHokOhVH6EKNncF1dreWXobvYJuf2vDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0efea292eed42983210f78f4e5e9bc80601f49a5efdf2bd0cd4b8ea3842aefef","last_reissued_at":"2026-05-18T00:06:16.095204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:16.095204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Convex Matrix Completion Against a Semi-Random Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Rong Ge, Yu Cheng","submitted_at":"2018-03-28T20:46:27Z","abstract_excerpt":"Matrix completion is a well-studied problem with many machine learning applications. In practice, the problem is often solved by non-convex optimization algorithms. However, the current theoretical analysis for non-convex algorithms relies heavily on the assumption that every entry is observed with exactly the same probability $p$, which is not realistic in practice.\n  In this paper, we investigate a more realistic semi-random model, where the probability of observing each entry is at least $p$. Even with this mild semi-random perturbation, we can construct counter-examples where existing non-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10846","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":"1803.10846","created_at":"2026-05-18T00:06:16.095281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10846v2","created_at":"2026-05-18T00:06:16.095281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10846","created_at":"2026-05-18T00:06:16.095281+00:00"},{"alias_kind":"pith_short_12","alias_value":"B37KFEXO2QUY","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B37KFEXO2QUYGIIP","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B37KFEXO","created_at":"2026-05-18T12:32:13.499390+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/B37KFEXO2QUYGIIPPD2OL2N4QB","json":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB.json","graph_json":"https://pith.science/api/pith-number/B37KFEXO2QUYGIIPPD2OL2N4QB/graph.json","events_json":"https://pith.science/api/pith-number/B37KFEXO2QUYGIIPPD2OL2N4QB/events.json","paper":"https://pith.science/paper/B37KFEXO"},"agent_actions":{"view_html":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB","download_json":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB.json","view_paper":"https://pith.science/paper/B37KFEXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10846&json=true","fetch_graph":"https://pith.science/api/pith-number/B37KFEXO2QUYGIIPPD2OL2N4QB/graph.json","fetch_events":"https://pith.science/api/pith-number/B37KFEXO2QUYGIIPPD2OL2N4QB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB/action/storage_attestation","attest_author":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB/action/author_attestation","sign_citation":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB/action/citation_signature","submit_replication":"https://pith.science/pith/B37KFEXO2QUYGIIPPD2OL2N4QB/action/replication_record"}},"created_at":"2026-05-18T00:06:16.095281+00:00","updated_at":"2026-05-18T00:06:16.095281+00:00"}