{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LQPLSVYARKTVFSLBEAEXM57QDK","short_pith_number":"pith:LQPLSVYA","schema_version":"1.0","canonical_sha256":"5c1eb957008aa752c96120097677f01aa416ac5bd359ebf8c59ef5f312dcdd1a","source":{"kind":"arxiv","id":"1009.2118","version":2},"attestation_state":"computed","paper":{"title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Martin J. Wainwright, Sahand Negahban","submitted_at":"2010-09-10T23:08:58Z","abstract_excerpt":"We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with high probability, it satisfies a form of restricted strong convexity with respect to weighted Frobenius norm. Using this property, we obtain as corollaries a number of error bounds on matrix completion in the weighted Frobenius norm under noisy sampling and for both exact and near low-rank matrices. Our results are based on measures of the \"spikiness\" and \""},"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":"1009.2118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-10T23:08:58Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"8a5587312f7fd6f0f1bc05a0a2179a7d66421cef296e3bd0927dea708bdc5eb2","abstract_canon_sha256":"5ec45bc2769004110588a922136f15ffce5fe3317cd896173b7c3e440bc79a9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:02.301216Z","signature_b64":"rF6NdFQ7ieWkJvfoqQPkfpBQxfr72/JRER7GSzXdynkbOJQILWWVJP/oKEGM8NudvR/sxbcYYa6KaWIb8w+lDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c1eb957008aa752c96120097677f01aa416ac5bd359ebf8c59ef5f312dcdd1a","last_reissued_at":"2026-05-18T04:22:02.300822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:02.300822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Martin J. Wainwright, Sahand Negahban","submitted_at":"2010-09-10T23:08:58Z","abstract_excerpt":"We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with high probability, it satisfies a form of restricted strong convexity with respect to weighted Frobenius norm. Using this property, we obtain as corollaries a number of error bounds on matrix completion in the weighted Frobenius norm under noisy sampling and for both exact and near low-rank matrices. Our results are based on measures of the \"spikiness\" and \""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2118","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":"1009.2118","created_at":"2026-05-18T04:22:02.300882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2118v2","created_at":"2026-05-18T04:22:02.300882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2118","created_at":"2026-05-18T04:22:02.300882+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQPLSVYARKTV","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQPLSVYARKTVFSLB","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQPLSVYA","created_at":"2026-05-18T12:26:10.704358+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/LQPLSVYARKTVFSLBEAEXM57QDK","json":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK.json","graph_json":"https://pith.science/api/pith-number/LQPLSVYARKTVFSLBEAEXM57QDK/graph.json","events_json":"https://pith.science/api/pith-number/LQPLSVYARKTVFSLBEAEXM57QDK/events.json","paper":"https://pith.science/paper/LQPLSVYA"},"agent_actions":{"view_html":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK","download_json":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK.json","view_paper":"https://pith.science/paper/LQPLSVYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2118&json=true","fetch_graph":"https://pith.science/api/pith-number/LQPLSVYARKTVFSLBEAEXM57QDK/graph.json","fetch_events":"https://pith.science/api/pith-number/LQPLSVYARKTVFSLBEAEXM57QDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK/action/storage_attestation","attest_author":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK/action/author_attestation","sign_citation":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK/action/citation_signature","submit_replication":"https://pith.science/pith/LQPLSVYARKTVFSLBEAEXM57QDK/action/replication_record"}},"created_at":"2026-05-18T04:22:02.300882+00:00","updated_at":"2026-05-18T04:22:02.300882+00:00"}