{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CCI7D7YUIIOVNMZH6JZT552J7Y","short_pith_number":"pith:CCI7D7YU","schema_version":"1.0","canonical_sha256":"1091f1ff14421d56b327f2733ef749fe2b0e8dd0202b414760814f8373963c2a","source":{"kind":"arxiv","id":"1212.0467","version":1},"attestation_state":"computed","paper":{"title":"Low-rank Matrix Completion using Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi","submitted_at":"2012-12-03T17:57:50Z","abstract_excerpt":"Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to be one of the most accurate and efficient, and formed a major component of the winning entry in the Netflix Challenge.\n  In the alternating minimization approach, the low-rank target matrix is written in a bi-linear form, i.e. $X = UV^\\dag$; the algorithm then alternates between finding the best $U$ and the best $V$. Typically, each alternating step in isolat"},"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":"1212.0467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-12-03T17:57:50Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"9e8fb245e0c1bbc4d0f2d248fe1b9425846fd78bfe2eb55f13e02160bedf3ec8","abstract_canon_sha256":"0d07eab4ff0bf4b90bc0315b05525d3bca04cb1f9c6a9675a9bcde989c0801f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:17.413540Z","signature_b64":"6/pF5EaebOWvD6KudaamRs6SKnAM/CTRGNuXS+wBmRqCOkH+UI42Ynqnj3VT/AMU3bB2P3rMi+evYyqFH7ZqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1091f1ff14421d56b327f2733ef749fe2b0e8dd0202b414760814f8373963c2a","last_reissued_at":"2026-05-18T03:39:17.412813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:17.412813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank Matrix Completion using Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi","submitted_at":"2012-12-03T17:57:50Z","abstract_excerpt":"Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to be one of the most accurate and efficient, and formed a major component of the winning entry in the Netflix Challenge.\n  In the alternating minimization approach, the low-rank target matrix is written in a bi-linear form, i.e. $X = UV^\\dag$; the algorithm then alternates between finding the best $U$ and the best $V$. Typically, each alternating step in isolat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0467","kind":"arxiv","version":1},"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":"1212.0467","created_at":"2026-05-18T03:39:17.412921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0467v1","created_at":"2026-05-18T03:39:17.412921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0467","created_at":"2026-05-18T03:39:17.412921+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCI7D7YUIIOV","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCI7D7YUIIOVNMZH","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCI7D7YU","created_at":"2026-05-18T12:27:01.376967+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/CCI7D7YUIIOVNMZH6JZT552J7Y","json":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y.json","graph_json":"https://pith.science/api/pith-number/CCI7D7YUIIOVNMZH6JZT552J7Y/graph.json","events_json":"https://pith.science/api/pith-number/CCI7D7YUIIOVNMZH6JZT552J7Y/events.json","paper":"https://pith.science/paper/CCI7D7YU"},"agent_actions":{"view_html":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y","download_json":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y.json","view_paper":"https://pith.science/paper/CCI7D7YU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0467&json=true","fetch_graph":"https://pith.science/api/pith-number/CCI7D7YUIIOVNMZH6JZT552J7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/CCI7D7YUIIOVNMZH6JZT552J7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/action/storage_attestation","attest_author":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/action/author_attestation","sign_citation":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/action/citation_signature","submit_replication":"https://pith.science/pith/CCI7D7YUIIOVNMZH6JZT552J7Y/action/replication_record"}},"created_at":"2026-05-18T03:39:17.412921+00:00","updated_at":"2026-05-18T03:39:17.412921+00:00"}