{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QWDT2U4A4XLDUNTZWJTEVN5WYH","short_pith_number":"pith:QWDT2U4A","schema_version":"1.0","canonical_sha256":"85873d5380e5d63a3679b2664ab7b6c1de311dc2fa8951df46faa2fdadf18e7a","source":{"kind":"arxiv","id":"2008.04988","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Olshevsky, Rui Liu","submitted_at":"2020-08-11T19:56:35Z","abstract_excerpt":"We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of eigenvalues of a reversible consensus problem. This leads to a polynomial upper bound on the asymptotic rate in terms of number of nodes as well as the largest degree of the graph of revealed entries."},"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":"2008.04988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-11T19:56:35Z","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"title_canon_sha256":"ee3b14202d2ed45ba2c85c93d83d04b8ce1f44aeace7c063e3afd777a08db760","abstract_canon_sha256":"f8dfb28be9bf38a6106af82ccbf128fc1698bc068ba067720cf40ba6fb79bafd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:31.760131Z","signature_b64":"HYdz+ibyLgytYwRCHmnPYlrucTzregIrjREKBMZlRyx5VJZ2evw339z8T7OL5vPqLi5KZk72dmO/2rHVPZhrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85873d5380e5d63a3679b2664ab7b6c1de311dc2fa8951df46faa2fdadf18e7a","last_reissued_at":"2026-07-05T01:26:31.759705Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:31.759705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Olshevsky, Rui Liu","submitted_at":"2020-08-11T19:56:35Z","abstract_excerpt":"We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of eigenvalues of a reversible consensus problem. This leads to a polynomial upper bound on the asymptotic rate in terms of number of nodes as well as the largest degree of the graph of revealed entries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.04988","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.04988/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.04988","created_at":"2026-07-05T01:26:31.759775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.04988v1","created_at":"2026-07-05T01:26:31.759775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.04988","created_at":"2026-07-05T01:26:31.759775+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWDT2U4A4XLD","created_at":"2026-07-05T01:26:31.759775+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWDT2U4A4XLDUNTZ","created_at":"2026-07-05T01:26:31.759775+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWDT2U4A","created_at":"2026-07-05T01:26:31.759775+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/QWDT2U4A4XLDUNTZWJTEVN5WYH","json":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH.json","graph_json":"https://pith.science/api/pith-number/QWDT2U4A4XLDUNTZWJTEVN5WYH/graph.json","events_json":"https://pith.science/api/pith-number/QWDT2U4A4XLDUNTZWJTEVN5WYH/events.json","paper":"https://pith.science/paper/QWDT2U4A"},"agent_actions":{"view_html":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH","download_json":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH.json","view_paper":"https://pith.science/paper/QWDT2U4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.04988&json=true","fetch_graph":"https://pith.science/api/pith-number/QWDT2U4A4XLDUNTZWJTEVN5WYH/graph.json","fetch_events":"https://pith.science/api/pith-number/QWDT2U4A4XLDUNTZWJTEVN5WYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH/action/storage_attestation","attest_author":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH/action/author_attestation","sign_citation":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH/action/citation_signature","submit_replication":"https://pith.science/pith/QWDT2U4A4XLDUNTZWJTEVN5WYH/action/replication_record"}},"created_at":"2026-07-05T01:26:31.759775+00:00","updated_at":"2026-07-05T01:26:31.759775+00:00"}