{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BO3HX2WPSNNDYVEG4YPDB7CEDR","short_pith_number":"pith:BO3HX2WP","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"},"canonical_sha256":"0bb67beacf935a3c5486e61e30fc441c4ca189098ece07b51c5aaecd98bb5c3a","source":{"kind":"arxiv","id":"1511.01562","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01562","created_at":"2026-05-18T01:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01562v8","created_at":"2026-05-18T01:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01562","created_at":"2026-05-18T01:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"BO3HX2WPSNND","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BO3HX2WPSNNDYVEG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BO3HX2WP","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BO3HX2WPSNNDYVEG4YPDB7CEDR","target":"record","payload":{"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"},"canonical_sha256":"0bb67beacf935a3c5486e61e30fc441c4ca189098ece07b51c5aaecd98bb5c3a","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"},"source_kind":"arxiv","source_id":"1511.01562","source_version":8,"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Q0KFfRUXbSpkZVp0fgV+jJJWpEgGw6hHhYvwz4J5eXhgZ9ma436aHRlF8VglHpAZpOMrGdg0R/o6CiO6oxEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:20:32.757862Z"},"content_sha256":"8011124ef08aa8f37fddacbba9a8ada36e0281707ee31ea73c967f434f966840","schema_version":"1.0","event_id":"sha256:8011124ef08aa8f37fddacbba9a8ada36e0281707ee31ea73c967f434f966840"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BO3HX2WPSNNDYVEG4YPDB7CEDR","target":"graph","payload":{"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"},"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SlMWulAisbY4aQhFTy6RS6W5bkoRnan8K/7CKdfuYFuNnyG/W/rVkEWvHp4q+K4sohztKaQoYDnX8/1O60GWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:20:32.758506Z"},"content_sha256":"7c45f9bb6c542aabc438874ad22e360a0d5fb102d28be8ab6dc9bfbcd8c08019","schema_version":"1.0","event_id":"sha256:7c45f9bb6c542aabc438874ad22e360a0d5fb102d28be8ab6dc9bfbcd8c08019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/bundle.json","state_url":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/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-26T08:20:32Z","links":{"resolver":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR","bundle":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/bundle.json","state":"https://pith.science/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BO3HX2WPSNNDYVEG4YPDB7CEDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BO3HX2WPSNNDYVEG4YPDB7CEDR","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":"24c867893c12f59263b2d3a6bd288c2a31fd117fdc220f689318f6ae7472276c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-05T00:46:14Z","title_canon_sha256":"ff2bfcc5a50a62f69d6327f159b118a9316ff5e5847476dccb004359f311272c"},"schema_version":"1.0","source":{"id":"1511.01562","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01562","created_at":"2026-05-18T01:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01562v8","created_at":"2026-05-18T01:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01562","created_at":"2026-05-18T01:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"BO3HX2WPSNND","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BO3HX2WPSNNDYVEG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BO3HX2WP","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:7c45f9bb6c542aabc438874ad22e360a0d5fb102d28be8ab6dc9bfbcd8c08019","target":"graph","created_at":"2026-05-18T01:17:25Z","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 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","authors_text":"Jian-Feng Cai, Ke Wei, Shingyu Leung, Tony F. Chan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-05T00:46:14Z","title":"Guarantees of Riemannian Optimization for Low Rank Matrix Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01562","kind":"arxiv","version":8},"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:8011124ef08aa8f37fddacbba9a8ada36e0281707ee31ea73c967f434f966840","target":"record","created_at":"2026-05-18T01:17:25Z","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":"24c867893c12f59263b2d3a6bd288c2a31fd117fdc220f689318f6ae7472276c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-11-05T00:46:14Z","title_canon_sha256":"ff2bfcc5a50a62f69d6327f159b118a9316ff5e5847476dccb004359f311272c"},"schema_version":"1.0","source":{"id":"1511.01562","kind":"arxiv","version":8}},"canonical_sha256":"0bb67beacf935a3c5486e61e30fc441c4ca189098ece07b51c5aaecd98bb5c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0bb67beacf935a3c5486e61e30fc441c4ca189098ece07b51c5aaecd98bb5c3a","first_computed_at":"2026-05-18T01:17:25.114460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:25.114460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZOQlO9kirItbZOYVGhlBP9qLmmqqQ1ofMRejQS5MXxjAh7GRB1vRP3pIuBOI0yrpNBKhINT/eLUTDBncLZcPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:25.115252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01562","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8011124ef08aa8f37fddacbba9a8ada36e0281707ee31ea73c967f434f966840","sha256:7c45f9bb6c542aabc438874ad22e360a0d5fb102d28be8ab6dc9bfbcd8c08019"],"state_sha256":"210c0d2f47408fb7086efd916253ee2c28d42719e25391d5b398f8216480cfbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c1C0ENXN2onfsaSz1l8O7AuVD2NVJyTwxxY2179AubaMSbaR8VKWLECnmkw3hWcDulWXEVuPFSCqWltMAfn+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:20:32.761830Z","bundle_sha256":"96b613fb28bd2baf06f8e5c6f24a75b15a0796ef4d3c3ca27e6d20e09507491e"}}