{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BO3HX2WPSNNDYVEG4YPDB7CEDR","short_pith_number":"pith:BO3HX2WP","schema_version":"1.0","canonical_sha256":"0bb67beacf935a3c5486e61e30fc441c4ca189098ece07b51c5aaecd98bb5c3a","source":{"kind":"arxiv","id":"1511.01562","version":8},"attestation_state":"computed","paper":{"title":"Guarantees of Riemannian Optimization for Low Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jian-Feng Cai, Ke Wei, Shingyu Leung, Tony F. Chan","submitted_at":"2015-11-05T00:46:14Z","abstract_excerpt":"We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an $m\\times n$ rank $r$ matrix from $p < mn$ number of linear measurements. The algorithms are first interpreted as iterative hard thresholding algorithms with subspace projections. Based on this connection, we show that provided the restricted isometry constant $R_{3r}$ of the sensing operator is less than $C_\\kappa /\\sqrt{r}$, the Riemannian gradient descent algorithm and a restarted variant of the Riemannian conjugate gradient algorithm are g"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.01562","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-05T00:46:14Z","cross_cats_sorted":[],"title_canon_sha256":"ff2bfcc5a50a62f69d6327f159b118a9316ff5e5847476dccb004359f311272c","abstract_canon_sha256":"24c867893c12f59263b2d3a6bd288c2a31fd117fdc220f689318f6ae7472276c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:25.115252Z","signature_b64":"ZOQlO9kirItbZOYVGhlBP9qLmmqqQ1ofMRejQS5MXxjAh7GRB1vRP3pIuBOI0yrpNBKhINT/eLUTDBncLZcPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bb67beacf935a3c5486e61e30fc441c4ca189098ece07b51c5aaecd98bb5c3a","last_reissued_at":"2026-05-18T01:17:25.114460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:25.114460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarantees of Riemannian Optimization for Low Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jian-Feng Cai, Ke Wei, Shingyu Leung, Tony F. Chan","submitted_at":"2015-11-05T00:46:14Z","abstract_excerpt":"We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an $m\\times n$ rank $r$ matrix from $p < mn$ number of linear measurements. The algorithms are first interpreted as iterative hard thresholding algorithms with subspace projections. Based on this connection, we show that provided the restricted isometry constant $R_{3r}$ of the sensing operator is less than $C_\\kappa /\\sqrt{r}$, the Riemannian gradient descent algorithm and a restarted variant of the Riemannian conjugate gradient algorithm are g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01562","kind":"arxiv","version":8},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.01562","created_at":"2026-05-18T01:17:25.114780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01562v8","created_at":"2026-05-18T01:17:25.114780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01562","created_at":"2026-05-18T01:17:25.114780+00:00"},{"alias_kind":"pith_short_12","alias_value":"BO3HX2WPSNND","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BO3HX2WPSNNDYVEG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BO3HX2WP","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR","json":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR.json","graph_json":"https://pith.science/api/pith-number/BO3HX2WPSNNDYVEG4YPDB7CEDR/graph.json","events_json":"https://pith.science/api/pith-number/BO3HX2WPSNNDYVEG4YPDB7CEDR/events.json","paper":"https://pith.science/paper/BO3HX2WP"},"agent_actions":{"view_html":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR","download_json":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR.json","view_paper":"https://pith.science/paper/BO3HX2WP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01562&json=true","fetch_graph":"https://pith.science/api/pith-number/BO3HX2WPSNNDYVEG4YPDB7CEDR/graph.json","fetch_events":"https://pith.science/api/pith-number/BO3HX2WPSNNDYVEG4YPDB7CEDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/action/storage_attestation","attest_author":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/action/author_attestation","sign_citation":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/action/citation_signature","submit_replication":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/action/replication_record"}},"created_at":"2026-05-18T01:17:25.114780+00:00","updated_at":"2026-05-18T01:17:25.114780+00:00"}