{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:JOBANEIP54TD4NCGG7754QPWZX","short_pith_number":"pith:JOBANEIP","canonical_record":{"source":{"id":"0910.5260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-10-27T22:19:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"57aff70c31ab380e649aaea82a70e2484102b6e878a7dfd4ac6bb24328b15d7e","abstract_canon_sha256":"6dad01e79d15c090de4aefa51ee057dd2b791de07d3a9f5b79793dec80724d39"},"schema_version":"1.0"},"canonical_sha256":"4b8206910fef263e344637ffde41f6cdeec26506fbeccf38966127640eda3205","source":{"kind":"arxiv","id":"0910.5260","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5260","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5260v2","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5260","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"JOBANEIP54TD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JOBANEIP54TD4NCG","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JOBANEIP","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:JOBANEIP54TD4NCGG7754QPWZX","target":"record","payload":{"canonical_record":{"source":{"id":"0910.5260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-10-27T22:19:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"57aff70c31ab380e649aaea82a70e2484102b6e878a7dfd4ac6bb24328b15d7e","abstract_canon_sha256":"6dad01e79d15c090de4aefa51ee057dd2b791de07d3a9f5b79793dec80724d39"},"schema_version":"1.0"},"canonical_sha256":"4b8206910fef263e344637ffde41f6cdeec26506fbeccf38966127640eda3205","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:14.539386Z","signature_b64":"lwmFxu58bCD1vOkp8hhfnmyGMmTuqiKdC++bYaKAg142ZC/Wbh0p60gS7u4Klz2dFT0O+Ntk/ojtGKjk2DUFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b8206910fef263e344637ffde41f6cdeec26506fbeccf38966127640eda3205","last_reissued_at":"2026-05-18T03:35:14.538792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:14.538792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.5260","source_version":2,"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-18T03:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlVOciqql/FqLELIDJS5H+4RjR6WIqEO5s/Xw2syXP66gYXpnra4YsqpLcSoUpbw6ywN9SLpJYQRyqzN+tkKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:53:04.736587Z"},"content_sha256":"e33531cd3f6d605e22f27164d66e163f393fb158f3a4896945385eef6c59dd58","schema_version":"1.0","event_id":"sha256:e33531cd3f6d605e22f27164d66e163f393fb158f3a4896945385eef6c59dd58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:JOBANEIP54TD4NCGG7754QPWZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Raghunandan H. Keshavan, Sewoong Oh","submitted_at":"2009-10-27T22:19:31Z","abstract_excerpt":"We consider the problem of reconstructing a low-rank matrix from a small subset of its entries. In this paper, we describe the implementation of an efficient algorithm called OptSpace, based on singular value decomposition followed by local manifold optimization, for solving the low-rank matrix completion problem. It has been shown that if the number of revealed entries is large enough, the output of singular value decomposition gives a good estimate for the original matrix, so that local optimization reconstructs the correct matrix with high probability. We present numerical results which sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5260","kind":"arxiv","version":2},"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-18T03:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySVIi/qC0Qi0v+9mK2rDLbfP5ZbDs/VBRRTOL6OGgV+166AhFJbzldkHUoTKghLmNyBu7iIit4yV4sMZl8Z9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:53:04.737060Z"},"content_sha256":"043a711974cfa3d41c7c2cd4df98cb8a3f4e550d0ae71a16465379bdfa9ae7ef","schema_version":"1.0","event_id":"sha256:043a711974cfa3d41c7c2cd4df98cb8a3f4e550d0ae71a16465379bdfa9ae7ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOBANEIP54TD4NCGG7754QPWZX/bundle.json","state_url":"https://pith.science/pith/JOBANEIP54TD4NCGG7754QPWZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOBANEIP54TD4NCGG7754QPWZX/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-08-10T05:53:04Z","links":{"resolver":"https://pith.science/pith/JOBANEIP54TD4NCGG7754QPWZX","bundle":"https://pith.science/pith/JOBANEIP54TD4NCGG7754QPWZX/bundle.json","state":"https://pith.science/pith/JOBANEIP54TD4NCGG7754QPWZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOBANEIP54TD4NCGG7754QPWZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:JOBANEIP54TD4NCGG7754QPWZX","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":"6dad01e79d15c090de4aefa51ee057dd2b791de07d3a9f5b79793dec80724d39","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-10-27T22:19:31Z","title_canon_sha256":"57aff70c31ab380e649aaea82a70e2484102b6e878a7dfd4ac6bb24328b15d7e"},"schema_version":"1.0","source":{"id":"0910.5260","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5260","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5260v2","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5260","created_at":"2026-05-18T03:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"JOBANEIP54TD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JOBANEIP54TD4NCG","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JOBANEIP","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:043a711974cfa3d41c7c2cd4df98cb8a3f4e550d0ae71a16465379bdfa9ae7ef","target":"graph","created_at":"2026-05-18T03:35:14Z","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":"We consider the problem of reconstructing a low-rank matrix from a small subset of its entries. In this paper, we describe the implementation of an efficient algorithm called OptSpace, based on singular value decomposition followed by local manifold optimization, for solving the low-rank matrix completion problem. It has been shown that if the number of revealed entries is large enough, the output of singular value decomposition gives a good estimate for the original matrix, so that local optimization reconstructs the correct matrix with high probability. We present numerical results which sho","authors_text":"Raghunandan H. Keshavan, Sewoong Oh","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-10-27T22:19:31Z","title":"A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5260","kind":"arxiv","version":2},"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:e33531cd3f6d605e22f27164d66e163f393fb158f3a4896945385eef6c59dd58","target":"record","created_at":"2026-05-18T03:35:14Z","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":"6dad01e79d15c090de4aefa51ee057dd2b791de07d3a9f5b79793dec80724d39","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2009-10-27T22:19:31Z","title_canon_sha256":"57aff70c31ab380e649aaea82a70e2484102b6e878a7dfd4ac6bb24328b15d7e"},"schema_version":"1.0","source":{"id":"0910.5260","kind":"arxiv","version":2}},"canonical_sha256":"4b8206910fef263e344637ffde41f6cdeec26506fbeccf38966127640eda3205","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b8206910fef263e344637ffde41f6cdeec26506fbeccf38966127640eda3205","first_computed_at":"2026-05-18T03:35:14.538792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:14.538792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwmFxu58bCD1vOkp8hhfnmyGMmTuqiKdC++bYaKAg142ZC/Wbh0p60gS7u4Klz2dFT0O+Ntk/ojtGKjk2DUFBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:14.539386Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.5260","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e33531cd3f6d605e22f27164d66e163f393fb158f3a4896945385eef6c59dd58","sha256:043a711974cfa3d41c7c2cd4df98cb8a3f4e550d0ae71a16465379bdfa9ae7ef"],"state_sha256":"07513386ae06101c1756db4ece3fbae6f4a02144f9d82fd534bd40d7610538c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVP3G0QnwVzSZhoASQ6A0tfotCyZKT1i/OxP4+z5AA2v1Xr9ZtMPosyD/xrIVc4YykmOIGJUhQk47slwqtrWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:53:04.744767Z","bundle_sha256":"2e57d56a3c45cb2cda01208f26f8916080daf80e2e057e5cb0a6eae441ae8121"}}