{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QUJ55VLDMLQMRX5IURULXAVUZZ","short_pith_number":"pith:QUJ55VLD","canonical_record":{"source":{"id":"1603.06610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-21T20:51:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"43ab62b10931f94ee76b45e1f9b1da757adc11ae62785e951ea81a10a14102e1","abstract_canon_sha256":"990bcb2e2efdb947e2d9197b8469bf85d905611bbece0c9ca174a600705de286"},"schema_version":"1.0"},"canonical_sha256":"8513ded56362e0c8dfa8a468bb82b4ce62c322bc8bbc808d67f23914fcc610a1","source":{"kind":"arxiv","id":"1603.06610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06610","created_at":"2026-05-18T01:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06610v2","created_at":"2026-05-18T01:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06610","created_at":"2026-05-18T01:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"QUJ55VLDMLQM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QUJ55VLDMLQMRX5I","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QUJ55VLD","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QUJ55VLDMLQMRX5IURULXAVUZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-21T20:51:16Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"43ab62b10931f94ee76b45e1f9b1da757adc11ae62785e951ea81a10a14102e1","abstract_canon_sha256":"990bcb2e2efdb947e2d9197b8469bf85d905611bbece0c9ca174a600705de286"},"schema_version":"1.0"},"canonical_sha256":"8513ded56362e0c8dfa8a468bb82b4ce62c322bc8bbc808d67f23914fcc610a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:24.469238Z","signature_b64":"g1mLd51cebNF/AmJH6hmd+DXVso2dpmUeu70dLUgeMGTtA6H8aHGw8h7kVq/0ZDgXWRuJ4rAayCXrpGf8SUgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8513ded56362e0c8dfa8a468bb82b4ce62c322bc8bbc808d67f23914fcc610a1","last_reissued_at":"2026-05-18T01:17:24.468848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:24.468848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06610","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-18T01:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IMmRhZLCEOKB6EIUywetfypIqpawGrw/xQ2Hh1KGIf1y0jVM0EzyHB47jTsVvHVdByuvyDFIj4+BAfq5mRLMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:36:36.375243Z"},"content_sha256":"59e64322e0bc7799aa785d355b17aee1129208591c19c3cda3121bfee7a4d330","schema_version":"1.0","event_id":"sha256:59e64322e0bc7799aa785d355b17aee1129208591c19c3cda3121bfee7a4d330"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QUJ55VLDMLQMRX5IURULXAVUZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guarantees of Riemannian Optimization for Low Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Jian-Feng Cai, Ke Wei, Shingyu Leung, Tony F. Chan","submitted_at":"2016-03-21T20:51:16Z","abstract_excerpt":"We study the Riemannian optimization methods on the embedded manifold of low rank matrices for the problem of matrix completion, which is about recovering a low rank matrix from its partial entries. Assume $m$ entries of an $n\\times n$ rank $r$ matrix are sampled independently and uniformly with replacement. We first prove that with high probability the Riemannian gradient descent and conjugate gradient descent algorithms initialized by one step hard thresholding are guaranteed to converge linearly to the measured matrix provided \\begin{align*} m\\geq C_\\kappa n^{1.5}r\\log^{1.5}(n), \\end{align*"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06610","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-18T01:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xtTdtsZ0hhke+jr4KxbWhXzmW0A+p/zXEOQ1lmqA89kwASIg7t9J7Ef4PMmjo8F8oaSOtRQxef5orUC6mB8uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:36:36.375944Z"},"content_sha256":"5dac8b9ae99cd7028cae142c284c8bc95ab091f74fde9bcbf93b3f97176ac88a","schema_version":"1.0","event_id":"sha256:5dac8b9ae99cd7028cae142c284c8bc95ab091f74fde9bcbf93b3f97176ac88a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUJ55VLDMLQMRX5IURULXAVUZZ/bundle.json","state_url":"https://pith.science/pith/QUJ55VLDMLQMRX5IURULXAVUZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUJ55VLDMLQMRX5IURULXAVUZZ/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-27T06:36:36Z","links":{"resolver":"https://pith.science/pith/QUJ55VLDMLQMRX5IURULXAVUZZ","bundle":"https://pith.science/pith/QUJ55VLDMLQMRX5IURULXAVUZZ/bundle.json","state":"https://pith.science/pith/QUJ55VLDMLQMRX5IURULXAVUZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUJ55VLDMLQMRX5IURULXAVUZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QUJ55VLDMLQMRX5IURULXAVUZZ","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":"990bcb2e2efdb947e2d9197b8469bf85d905611bbece0c9ca174a600705de286","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-21T20:51:16Z","title_canon_sha256":"43ab62b10931f94ee76b45e1f9b1da757adc11ae62785e951ea81a10a14102e1"},"schema_version":"1.0","source":{"id":"1603.06610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06610","created_at":"2026-05-18T01:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06610v2","created_at":"2026-05-18T01:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06610","created_at":"2026-05-18T01:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"QUJ55VLDMLQM","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QUJ55VLDMLQMRX5I","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QUJ55VLD","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:5dac8b9ae99cd7028cae142c284c8bc95ab091f74fde9bcbf93b3f97176ac88a","target":"graph","created_at":"2026-05-18T01:17:24Z","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 study the Riemannian optimization methods on the embedded manifold of low rank matrices for the problem of matrix completion, which is about recovering a low rank matrix from its partial entries. Assume $m$ entries of an $n\\times n$ rank $r$ matrix are sampled independently and uniformly with replacement. We first prove that with high probability the Riemannian gradient descent and conjugate gradient descent algorithms initialized by one step hard thresholding are guaranteed to converge linearly to the measured matrix provided \\begin{align*} m\\geq C_\\kappa n^{1.5}r\\log^{1.5}(n), \\end{align*","authors_text":"Jian-Feng Cai, Ke Wei, Shingyu Leung, Tony F. Chan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-21T20:51:16Z","title":"Guarantees of Riemannian Optimization for Low Rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06610","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:59e64322e0bc7799aa785d355b17aee1129208591c19c3cda3121bfee7a4d330","target":"record","created_at":"2026-05-18T01:17:24Z","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":"990bcb2e2efdb947e2d9197b8469bf85d905611bbece0c9ca174a600705de286","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-03-21T20:51:16Z","title_canon_sha256":"43ab62b10931f94ee76b45e1f9b1da757adc11ae62785e951ea81a10a14102e1"},"schema_version":"1.0","source":{"id":"1603.06610","kind":"arxiv","version":2}},"canonical_sha256":"8513ded56362e0c8dfa8a468bb82b4ce62c322bc8bbc808d67f23914fcc610a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8513ded56362e0c8dfa8a468bb82b4ce62c322bc8bbc808d67f23914fcc610a1","first_computed_at":"2026-05-18T01:17:24.468848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:24.468848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1mLd51cebNF/AmJH6hmd+DXVso2dpmUeu70dLUgeMGTtA6H8aHGw8h7kVq/0ZDgXWRuJ4rAayCXrpGf8SUgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:24.469238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59e64322e0bc7799aa785d355b17aee1129208591c19c3cda3121bfee7a4d330","sha256:5dac8b9ae99cd7028cae142c284c8bc95ab091f74fde9bcbf93b3f97176ac88a"],"state_sha256":"08e027e6ff01d58c37275cc7d1746a19f73bd5fff79b7b766a743391875819a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxEwofhsmkYVAIUzkYVllUkX93I89iT1hLJ8nocb5Vas+H+Agk8obcBYkEGxY1lMsvu8rPFd3GfmJYxpAF3KBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:36:36.379763Z","bundle_sha256":"0b9f8ae66586b0d04779842174b60a471e13bcfc9c6f54d4d012e08361420fc6"}}