{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VWFRRNIXZ376DZYD3Z7AYELH2A","short_pith_number":"pith:VWFRRNIX","canonical_record":{"source":{"id":"1411.1087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-11-04T21:16:23Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"cb05530dcce48de3619bed85cb841c4ca4543ad95aa736c2fae3db70ff4dbeb6","abstract_canon_sha256":"c2398c5815e53f8b3bbb9a7a1139240f96163714d6afbd42043d745ba565b179"},"schema_version":"1.0"},"canonical_sha256":"ad8b18b517ceffe1e703de7e0c1167d035392ddc6d9a6ebc8ee8c43081137291","source":{"kind":"arxiv","id":"1411.1087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1087","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1087v1","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1087","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"VWFRRNIXZ376","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VWFRRNIXZ376DZYD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VWFRRNIX","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VWFRRNIXZ376DZYD3Z7AYELH2A","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-11-04T21:16:23Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"title_canon_sha256":"cb05530dcce48de3619bed85cb841c4ca4543ad95aa736c2fae3db70ff4dbeb6","abstract_canon_sha256":"c2398c5815e53f8b3bbb9a7a1139240f96163714d6afbd42043d745ba565b179"},"schema_version":"1.0"},"canonical_sha256":"ad8b18b517ceffe1e703de7e0c1167d035392ddc6d9a6ebc8ee8c43081137291","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:36.351205Z","signature_b64":"alQHs7qgYe9gkflWga1z0YgCZYFutOuoubmp623dGccNBGAfZshF6ljcYevyGmwkDwmJ0gExtV2TMkhtRknMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad8b18b517ceffe1e703de7e0c1167d035392ddc6d9a6ebc8ee8c43081137291","last_reissued_at":"2026-05-18T02:38:36.350644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:36.350644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1087","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SSlKjdwx8jZzSDuHTBmQ9hoMowmsbgLjkUBsPfiLmoIeLbcwk43oLD6A5lXDUWDJRnQ/dPPXvCEyXccGrEPMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:57:33.985344Z"},"content_sha256":"0480db6d5c6bdb07c09b5ea765b885afdea993eb672da15331bcbf54e7218a54","schema_version":"1.0","event_id":"sha256:0480db6d5c6bdb07c09b5ea765b885afdea993eb672da15331bcbf54e7218a54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VWFRRNIXZ376DZYD3Z7AYELH2A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Exact Matrix Completion with Finite Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"primary_cat":"cs.NA","authors_text":"Praneeth Netrapalli, Prateek Jain","submitted_at":"2014-11-04T21:16:23Z","abstract_excerpt":"Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works [KOM12,JNS13,HW14] have proposed fast non-convex optimization based iterative algorithms to solve this problem. However, the sample complexity in all these results is sub-optimal in its dependence on the rank, condition number and the desired accuracy.\n  In this paper, we present a fast iterative algorithm that solves the matrix completion problem by observing $O(nr^5 \\log^3 n)$ entries, which is independent of the condition number and the desired accuracy. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1087","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8c09cytCpMvA3vZ8yIZdkkiXhNNJleWXkARoClvlzd0ZfsDBS20sqEQi4yBcDqrU9og5je6E9dBQN9E4mAIfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:57:33.986080Z"},"content_sha256":"cec60008c9fee42f29cd495dd67de7ce7927ee770cc05b50226fb46cf5924ca9","schema_version":"1.0","event_id":"sha256:cec60008c9fee42f29cd495dd67de7ce7927ee770cc05b50226fb46cf5924ca9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/bundle.json","state_url":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T05:57:33Z","links":{"resolver":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A","bundle":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/bundle.json","state":"https://pith.science/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWFRRNIXZ376DZYD3Z7AYELH2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VWFRRNIXZ376DZYD3Z7AYELH2A","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":"c2398c5815e53f8b3bbb9a7a1139240f96163714d6afbd42043d745ba565b179","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-11-04T21:16:23Z","title_canon_sha256":"cb05530dcce48de3619bed85cb841c4ca4543ad95aa736c2fae3db70ff4dbeb6"},"schema_version":"1.0","source":{"id":"1411.1087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1087","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1087v1","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1087","created_at":"2026-05-18T02:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"VWFRRNIXZ376","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VWFRRNIXZ376DZYD","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VWFRRNIX","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:cec60008c9fee42f29cd495dd67de7ce7927ee770cc05b50226fb46cf5924ca9","target":"graph","created_at":"2026-05-18T02:38:36Z","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"},"paper":{"abstract_excerpt":"Matrix completion is the problem of recovering a low rank matrix by observing a small fraction of its entries. A series of recent works [KOM12,JNS13,HW14] have proposed fast non-convex optimization based iterative algorithms to solve this problem. However, the sample complexity in all these results is sub-optimal in its dependence on the rank, condition number and the desired accuracy.\n  In this paper, we present a fast iterative algorithm that solves the matrix completion problem by observing $O(nr^5 \\log^3 n)$ entries, which is independent of the condition number and the desired accuracy. Th","authors_text":"Praneeth Netrapalli, Prateek Jain","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-11-04T21:16:23Z","title":"Fast Exact Matrix Completion with Finite Samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1087","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:0480db6d5c6bdb07c09b5ea765b885afdea993eb672da15331bcbf54e7218a54","target":"record","created_at":"2026-05-18T02:38:36Z","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":"c2398c5815e53f8b3bbb9a7a1139240f96163714d6afbd42043d745ba565b179","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2014-11-04T21:16:23Z","title_canon_sha256":"cb05530dcce48de3619bed85cb841c4ca4543ad95aa736c2fae3db70ff4dbeb6"},"schema_version":"1.0","source":{"id":"1411.1087","kind":"arxiv","version":1}},"canonical_sha256":"ad8b18b517ceffe1e703de7e0c1167d035392ddc6d9a6ebc8ee8c43081137291","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad8b18b517ceffe1e703de7e0c1167d035392ddc6d9a6ebc8ee8c43081137291","first_computed_at":"2026-05-18T02:38:36.350644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:36.350644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"alQHs7qgYe9gkflWga1z0YgCZYFutOuoubmp623dGccNBGAfZshF6ljcYevyGmwkDwmJ0gExtV2TMkhtRknMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:36.351205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0480db6d5c6bdb07c09b5ea765b885afdea993eb672da15331bcbf54e7218a54","sha256:cec60008c9fee42f29cd495dd67de7ce7927ee770cc05b50226fb46cf5924ca9"],"state_sha256":"d13d105a964822f7ceca16e7068677d8a32db9fed107119f9a8a28fc2f2ccc6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TsRTIqdh74X5mpCqZho7lTqwshvjW1XIBi1wVFpfjkiksRHzbc6OuEJtg/2TiEdsO3a2bkj5kWIr2B72WD8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:57:33.990024Z","bundle_sha256":"d0e9689a1c6f18dff1f5d93b523c64fefcfa838875fe189b352a65d5fa0d3746"}}