{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HOAGXX62KCP372UX5BCG6HCF4K","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":"bdb4521be43260ba07d76880f5eeae3de21b19965ebef91d4cbbce75630d7ede","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-21T23:49:36Z","title_canon_sha256":"1070719c8c702ed8c6e89fb293d2a502b078292cf58d64d53b0c4a10d54b4f5f"},"schema_version":"1.0","source":{"id":"2302.11068","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.11068","created_at":"2026-07-05T08:03:05Z"},{"alias_kind":"arxiv_version","alias_value":"2302.11068v3","created_at":"2026-07-05T08:03:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11068","created_at":"2026-07-05T08:03:05Z"},{"alias_kind":"pith_short_12","alias_value":"HOAGXX62KCP3","created_at":"2026-07-05T08:03:05Z"},{"alias_kind":"pith_short_16","alias_value":"HOAGXX62KCP372UX","created_at":"2026-07-05T08:03:05Z"},{"alias_kind":"pith_short_8","alias_value":"HOAGXX62","created_at":"2026-07-05T08:03:05Z"}],"graph_snapshots":[{"event_id":"sha256:e40b9470dadd606f5eee6f59727a232af300d369dd4be9e0deba7b98579a28fa","target":"graph","created_at":"2026-07-05T08:03:05Z","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/2302.11068/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a matrix $M\\in \\mathbb{R}^{m\\times n}$, the low rank matrix completion problem asks us to find a rank-$k$ approximation of $M$ as $UV^\\top$ for $U\\in \\mathbb{R}^{m\\times k}$ and $V\\in \\mathbb{R}^{n\\times k}$ by only observing a few entries specified by a set of entries $\\Omega\\subseteq [m]\\times [n]$. In particular, we examine an approach that is widely used in practice -- the alternating minimization framework. Jain, Netrapalli, and Sanghavi [JNS13] showed that if $M$ has incoherent rows and columns, then alternating minimization provably recovers the matrix $M$ by observing a nearly li","authors_text":"Junze Yin, Lichen Zhang, Yuzhou Gu, Zhao Song","cross_cats":["cs.DS","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-21T23:49:36Z","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11068","kind":"arxiv","version":3},"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:9fccca3b114b74d79871308b41ccae4d4ad7407cfe285b6c8ca11e65b2e59188","target":"record","created_at":"2026-07-05T08:03:05Z","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":"bdb4521be43260ba07d76880f5eeae3de21b19965ebef91d4cbbce75630d7ede","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-21T23:49:36Z","title_canon_sha256":"1070719c8c702ed8c6e89fb293d2a502b078292cf58d64d53b0c4a10d54b4f5f"},"schema_version":"1.0","source":{"id":"2302.11068","kind":"arxiv","version":3}},"canonical_sha256":"3b806bdfda509fbfea97e8446f1c45e2bfcb94e598c617328bc61c77e72cf394","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b806bdfda509fbfea97e8446f1c45e2bfcb94e598c617328bc61c77e72cf394","first_computed_at":"2026-07-05T08:03:05.604209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:03:05.604209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uP++GN3/uWbpIZVwYXwPNHBqc0BuVPy/KvetVSmF1ju1whFrX6cD3AQyAMJbR/ItjFL8hcJMK2NrNX0rKNp2Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:03:05.604670Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.11068","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fccca3b114b74d79871308b41ccae4d4ad7407cfe285b6c8ca11e65b2e59188","sha256:e40b9470dadd606f5eee6f59727a232af300d369dd4be9e0deba7b98579a28fa"],"state_sha256":"5c63e8d1c2c30baf8438c9578d0e1ea5595487070fa9200167eabbcebf1f3ee4"}