{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6RQDEFKMSDWIWL24KGP7GYSCSS","short_pith_number":"pith:6RQDEFKM","canonical_record":{"source":{"id":"1209.3834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-18T03:21:58Z","cross_cats_sorted":["math.DG","math.NA"],"title_canon_sha256":"cd44ef75337ac413fa3b93726fb6122b0ebc10c0794ca4ae7b82a6cd0bf79982","abstract_canon_sha256":"b313e541e7a098cba6cb52eb2a79640c7b7294f31279d98a97396bcacfad9591"},"schema_version":"1.0"},"canonical_sha256":"f46032154c90ec8b2f5c519ff3624294a8d1eb0c90b08f3fe75f4b6ec400cfbd","source":{"kind":"arxiv","id":"1209.3834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3834","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3834v1","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3834","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"6RQDEFKMSDWI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6RQDEFKMSDWIWL24","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6RQDEFKM","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6RQDEFKMSDWIWL24KGP7GYSCSS","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-18T03:21:58Z","cross_cats_sorted":["math.DG","math.NA"],"title_canon_sha256":"cd44ef75337ac413fa3b93726fb6122b0ebc10c0794ca4ae7b82a6cd0bf79982","abstract_canon_sha256":"b313e541e7a098cba6cb52eb2a79640c7b7294f31279d98a97396bcacfad9591"},"schema_version":"1.0"},"canonical_sha256":"f46032154c90ec8b2f5c519ff3624294a8d1eb0c90b08f3fe75f4b6ec400cfbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:22.401223Z","signature_b64":"XQjWJsU3GMTrB7dxTaBsqy59dxyPFBY/479VMM7qsGZB44Hy5O7ptH8YwGIT2fUUGrhnUFh1o9BKNQ99BFfBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f46032154c90ec8b2f5c519ff3624294a8d1eb0c90b08f3fe75f4b6ec400cfbd","last_reissued_at":"2026-05-18T03:45:22.400666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:22.400666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3834","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-18T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GE5Lz7R/+KaixGMp2Icxo5BvJn4Mup481n4ZyHHycr0gKH+H+xRkZIWXK9mEepotIZHyPgZnJ3iOIWiVH1jCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:39:17.304188Z"},"content_sha256":"9078515cf68172b5c12371d98cd5ef0f135fb92cd915f94658dcdfe993e54920","schema_version":"1.0","event_id":"sha256:9078515cf68172b5c12371d98cd5ef0f135fb92cd915f94658dcdfe993e54920"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6RQDEFKMSDWIWL24KGP7GYSCSS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank matrix completion by Riemannian optimization---extended version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","math.NA"],"primary_cat":"math.OC","authors_text":"Bart Vandereycken","submitted_at":"2012-09-18T03:21:58Z","abstract_excerpt":"The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical non-linear conjugate gradients, developed within the framework of retraction-based optimization on manifolds. We describe all the necessary objects from differential geometry necessary to perform optimization over this low-rank matrix manifold, seen as a submanifold em"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3834","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-18T03:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y825VNEjbaWyjpenyqEWM5cEB5/rc6ezOUYyKpTtsSytyKQQwINzk/5Z5Wr0EpcPJdEzQJm4BGf2eVVnI+mPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T23:39:17.304557Z"},"content_sha256":"48cbe23508b3c1a083c91d498fa8609ba394e207bdb33b073c5e3398ab372478","schema_version":"1.0","event_id":"sha256:48cbe23508b3c1a083c91d498fa8609ba394e207bdb33b073c5e3398ab372478"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/bundle.json","state_url":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/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-06-25T23:39:17Z","links":{"resolver":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS","bundle":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/bundle.json","state":"https://pith.science/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RQDEFKMSDWIWL24KGP7GYSCSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6RQDEFKMSDWIWL24KGP7GYSCSS","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":"b313e541e7a098cba6cb52eb2a79640c7b7294f31279d98a97396bcacfad9591","cross_cats_sorted":["math.DG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-18T03:21:58Z","title_canon_sha256":"cd44ef75337ac413fa3b93726fb6122b0ebc10c0794ca4ae7b82a6cd0bf79982"},"schema_version":"1.0","source":{"id":"1209.3834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3834","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3834v1","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3834","created_at":"2026-05-18T03:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"6RQDEFKMSDWI","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6RQDEFKMSDWIWL24","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6RQDEFKM","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:48cbe23508b3c1a083c91d498fa8609ba394e207bdb33b073c5e3398ab372478","target":"graph","created_at":"2026-05-18T03:45:22Z","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":"The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical non-linear conjugate gradients, developed within the framework of retraction-based optimization on manifolds. We describe all the necessary objects from differential geometry necessary to perform optimization over this low-rank matrix manifold, seen as a submanifold em","authors_text":"Bart Vandereycken","cross_cats":["math.DG","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-18T03:21:58Z","title":"Low-rank matrix completion by Riemannian optimization---extended version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3834","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:9078515cf68172b5c12371d98cd5ef0f135fb92cd915f94658dcdfe993e54920","target":"record","created_at":"2026-05-18T03:45:22Z","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":"b313e541e7a098cba6cb52eb2a79640c7b7294f31279d98a97396bcacfad9591","cross_cats_sorted":["math.DG","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-18T03:21:58Z","title_canon_sha256":"cd44ef75337ac413fa3b93726fb6122b0ebc10c0794ca4ae7b82a6cd0bf79982"},"schema_version":"1.0","source":{"id":"1209.3834","kind":"arxiv","version":1}},"canonical_sha256":"f46032154c90ec8b2f5c519ff3624294a8d1eb0c90b08f3fe75f4b6ec400cfbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f46032154c90ec8b2f5c519ff3624294a8d1eb0c90b08f3fe75f4b6ec400cfbd","first_computed_at":"2026-05-18T03:45:22.400666Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:22.400666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQjWJsU3GMTrB7dxTaBsqy59dxyPFBY/479VMM7qsGZB44Hy5O7ptH8YwGIT2fUUGrhnUFh1o9BKNQ99BFfBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:22.401223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9078515cf68172b5c12371d98cd5ef0f135fb92cd915f94658dcdfe993e54920","sha256:48cbe23508b3c1a083c91d498fa8609ba394e207bdb33b073c5e3398ab372478"],"state_sha256":"65b71d8211e19518c3d6ce00acf241282924f92d8f68495bbda5901d4fc130c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybuNqoulC8DKrBMEmEAkYH18s/OX7jDxy2fr48iQrzUZ6ewgLQdj5nvz4mXUYYYSLxUxJwRfslYalOjkg2uDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T23:39:17.306781Z","bundle_sha256":"25a11510bd35d1bb7c3fa49b74455a587bba9f709fb03077a862467917e6a44f"}}