{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QWDT2U4A4XLDUNTZWJTEVN5WYH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f8dfb28be9bf38a6106af82ccbf128fc1698bc068ba067720cf40ba6fb79bafd","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-11T19:56:35Z","title_canon_sha256":"ee3b14202d2ed45ba2c85c93d83d04b8ce1f44aeace7c063e3afd777a08db760"},"schema_version":"1.0","source":{"id":"2008.04988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.04988","created_at":"2026-07-05T01:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"2008.04988v1","created_at":"2026-07-05T01:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.04988","created_at":"2026-07-05T01:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"QWDT2U4A4XLD","created_at":"2026-07-05T01:26:31Z"},{"alias_kind":"pith_short_16","alias_value":"QWDT2U4A4XLDUNTZ","created_at":"2026-07-05T01:26:31Z"},{"alias_kind":"pith_short_8","alias_value":"QWDT2U4A","created_at":"2026-07-05T01:26:31Z"}],"graph_snapshots":[{"event_id":"sha256:cc3e4a52de52490f2ab693c3ddc00c6f9b74215ddc7281ec703e45997b60ebaa","target":"graph","created_at":"2026-07-05T01:26:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.04988/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Alex Olshevsky, Rui Liu","cross_cats":["cs.NA","math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-11T19:56:35Z","title":"Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.04988","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0c5ad82336e9363799f6d839639815d0171bdbd413768d0b9c58badadc1ae187","target":"record","created_at":"2026-07-05T01:26:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f8dfb28be9bf38a6106af82ccbf128fc1698bc068ba067720cf40ba6fb79bafd","cross_cats_sorted":["cs.NA","math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-11T19:56:35Z","title_canon_sha256":"ee3b14202d2ed45ba2c85c93d83d04b8ce1f44aeace7c063e3afd777a08db760"},"schema_version":"1.0","source":{"id":"2008.04988","kind":"arxiv","version":1}},"canonical_sha256":"85873d5380e5d63a3679b2664ab7b6c1de311dc2fa8951df46faa2fdadf18e7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85873d5380e5d63a3679b2664ab7b6c1de311dc2fa8951df46faa2fdadf18e7a","first_computed_at":"2026-07-05T01:26:31.759705Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:26:31.759705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HYdz+ibyLgytYwRCHmnPYlrucTzregIrjREKBMZlRyx5VJZ2evw339z8T7OL5vPqLi5KZk72dmO/2rHVPZhrCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:26:31.760131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.04988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c5ad82336e9363799f6d839639815d0171bdbd413768d0b9c58badadc1ae187","sha256:cc3e4a52de52490f2ab693c3ddc00c6f9b74215ddc7281ec703e45997b60ebaa"],"state_sha256":"d6d3cbc4c2ef2f0ac574a05c72ae06048d78e4581d5414e25bdebed01dfce694"}