{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3KHF6HMCGZMEPR3A2YWSZSLRNK","short_pith_number":"pith:3KHF6HMC","schema_version":"1.0","canonical_sha256":"da8e5f1d82365847c760d62d2cc9716a8fa026fe13d09dd72d03d12662c7b15d","source":{"kind":"arxiv","id":"1306.2979","version":4},"attestation_state":"computed","paper":{"title":"Completing Any Low-rank Matrix, Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Rachel Ward, Srinadh Bhojanapalli, Sujay Sanghavi, Yudong Chen","submitted_at":"2013-06-12T21:26:00Z","abstract_excerpt":"Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\\em incoherence}---on its row and column spaces. In these cases, the subset of elements is sampled uniformly at random.\n  In this paper, we show that {\\em any} rank-$ r $ $ n$-by-$ n $ matrix can be exactly recovered from as few as $O(nr \\log^2 n)$ randomly chosen elements, provided this random choice is made according to a {\\em specific biased distribution}: the probabil"},"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":"1306.2979","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-06-12T21:26:00Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"0baaacc19275b862cd72cc18cdb68de2869543dec15b7817af9efc9d52e85490","abstract_canon_sha256":"798af1b4b1b51dcdbb1f43c1b70c9102d1abd512ec900992c87f1584d8c18a49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:16.110288Z","signature_b64":"WtpLxl7Fq163BWXvBYIY9h/V9J8Ms4Q/xl7BcRotp64ir8kRm9kR08B+5IKO8BF4LwXZ75o+z+3C74huAlbHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da8e5f1d82365847c760d62d2cc9716a8fa026fe13d09dd72d03d12662c7b15d","last_reissued_at":"2026-05-18T02:47:16.109738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:16.109738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completing Any Low-rank Matrix, Provably","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Rachel Ward, Srinadh Bhojanapalli, Sujay Sanghavi, Yudong Chen","submitted_at":"2013-06-12T21:26:00Z","abstract_excerpt":"Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\\em incoherence}---on its row and column spaces. In these cases, the subset of elements is sampled uniformly at random.\n  In this paper, we show that {\\em any} rank-$ r $ $ n$-by-$ n $ matrix can be exactly recovered from as few as $O(nr \\log^2 n)$ randomly chosen elements, provided this random choice is made according to a {\\em specific biased distribution}: the probabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2979","kind":"arxiv","version":4},"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":"1306.2979","created_at":"2026-05-18T02:47:16.109836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2979v4","created_at":"2026-05-18T02:47:16.109836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2979","created_at":"2026-05-18T02:47:16.109836+00:00"},{"alias_kind":"pith_short_12","alias_value":"3KHF6HMCGZME","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3KHF6HMCGZMEPR3A","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3KHF6HMC","created_at":"2026-05-18T12:27:32.513160+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/3KHF6HMCGZMEPR3A2YWSZSLRNK","json":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK.json","graph_json":"https://pith.science/api/pith-number/3KHF6HMCGZMEPR3A2YWSZSLRNK/graph.json","events_json":"https://pith.science/api/pith-number/3KHF6HMCGZMEPR3A2YWSZSLRNK/events.json","paper":"https://pith.science/paper/3KHF6HMC"},"agent_actions":{"view_html":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK","download_json":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK.json","view_paper":"https://pith.science/paper/3KHF6HMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2979&json=true","fetch_graph":"https://pith.science/api/pith-number/3KHF6HMCGZMEPR3A2YWSZSLRNK/graph.json","fetch_events":"https://pith.science/api/pith-number/3KHF6HMCGZMEPR3A2YWSZSLRNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/action/storage_attestation","attest_author":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/action/author_attestation","sign_citation":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/action/citation_signature","submit_replication":"https://pith.science/pith/3KHF6HMCGZMEPR3A2YWSZSLRNK/action/replication_record"}},"created_at":"2026-05-18T02:47:16.109836+00:00","updated_at":"2026-05-18T02:47:16.109836+00:00"}