{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7Z5NN2CYAMJ65NI435TVKHZ7KU","short_pith_number":"pith:7Z5NN2CY","schema_version":"1.0","canonical_sha256":"fe7ad6e8580313eeb51cdf67551f3f55158f93c048b720885e473a8be1bbae9f","source":{"kind":"arxiv","id":"1503.06379","version":3},"attestation_state":"computed","paper":{"title":"Relaxed Leverage Sampling for Low-rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Abhisek Kundu","submitted_at":"2015-03-22T03:27:15Z","abstract_excerpt":"We consider the problem of exact recovery of any $m\\times n$ matrix of rank $\\varrho$ from a small number of observed entries via the standard nuclear norm minimization framework. Such low-rank matrices have degrees of freedom $(m+n)\\varrho - \\varrho^2$. We show that any arbitrary low-rank matrices can be recovered exactly from a $\\Theta\\left(((m+n)\\varrho - \\varrho^2)\\log^2(m+n)\\right)$ randomly sampled entries, thus matching the lower bound on the required number of entries (in terms of degrees of freedom), with an additional factor of $O(\\log^2(m+n))$. To achieve this bound on sample size w"},"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":"1503.06379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-03-22T03:27:15Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"e8437a5db7e28a89efb50885f3fda3f4f8c0baf6f0a6bbefcb98a84b95bb8755","abstract_canon_sha256":"9299cd98d4f7304a9014d1be0b558619015450569894205a2e3004e54b128817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:33.195720Z","signature_b64":"ZQ8S/cNWatBp/jvJ6+Va8GnKVVyoFZ5tLrcpDSDYWBnLoB1DoLqzn4V0irzD2KHs3920nIQbUxup7evpXry8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe7ad6e8580313eeb51cdf67551f3f55158f93c048b720885e473a8be1bbae9f","last_reissued_at":"2026-05-18T01:17:33.195008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:33.195008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Leverage Sampling for Low-rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Abhisek Kundu","submitted_at":"2015-03-22T03:27:15Z","abstract_excerpt":"We consider the problem of exact recovery of any $m\\times n$ matrix of rank $\\varrho$ from a small number of observed entries via the standard nuclear norm minimization framework. Such low-rank matrices have degrees of freedom $(m+n)\\varrho - \\varrho^2$. We show that any arbitrary low-rank matrices can be recovered exactly from a $\\Theta\\left(((m+n)\\varrho - \\varrho^2)\\log^2(m+n)\\right)$ randomly sampled entries, thus matching the lower bound on the required number of entries (in terms of degrees of freedom), with an additional factor of $O(\\log^2(m+n))$. To achieve this bound on sample size w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06379","kind":"arxiv","version":3},"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":"1503.06379","created_at":"2026-05-18T01:17:33.195108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06379v3","created_at":"2026-05-18T01:17:33.195108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06379","created_at":"2026-05-18T01:17:33.195108+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Z5NN2CYAMJ6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Z5NN2CYAMJ65NI4","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Z5NN2CY","created_at":"2026-05-18T12:29:10.953037+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/7Z5NN2CYAMJ65NI435TVKHZ7KU","json":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU.json","graph_json":"https://pith.science/api/pith-number/7Z5NN2CYAMJ65NI435TVKHZ7KU/graph.json","events_json":"https://pith.science/api/pith-number/7Z5NN2CYAMJ65NI435TVKHZ7KU/events.json","paper":"https://pith.science/paper/7Z5NN2CY"},"agent_actions":{"view_html":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU","download_json":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU.json","view_paper":"https://pith.science/paper/7Z5NN2CY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06379&json=true","fetch_graph":"https://pith.science/api/pith-number/7Z5NN2CYAMJ65NI435TVKHZ7KU/graph.json","fetch_events":"https://pith.science/api/pith-number/7Z5NN2CYAMJ65NI435TVKHZ7KU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/action/storage_attestation","attest_author":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/action/author_attestation","sign_citation":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/action/citation_signature","submit_replication":"https://pith.science/pith/7Z5NN2CYAMJ65NI435TVKHZ7KU/action/replication_record"}},"created_at":"2026-05-18T01:17:33.195108+00:00","updated_at":"2026-05-18T01:17:33.195108+00:00"}