{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EJFGS4SP6HEQUUWEVHMMIKEVMK","short_pith_number":"pith:EJFGS4SP","canonical_record":{"source":{"id":"2409.11181","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-17T13:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"53077c9a48d40017dfa350685308788986c0b4e30f358801c4356b4d16d4520d","abstract_canon_sha256":"7462782f2a58504efaf7b99e44cb93b8eceb968ba88aa0ae5dcd5614c291a24a"},"schema_version":"1.0"},"canonical_sha256":"224a69724ff1c90a52c4a9d8c4289562b5526fc8210971dd71933d90d97cd029","source":{"kind":"arxiv","id":"2409.11181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.11181","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"arxiv_version","alias_value":"2409.11181v1","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.11181","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"pith_short_12","alias_value":"EJFGS4SP6HEQ","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"pith_short_16","alias_value":"EJFGS4SP6HEQUUWE","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"pith_short_8","alias_value":"EJFGS4SP","created_at":"2026-07-05T09:08:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EJFGS4SP6HEQUUWEVHMMIKEVMK","target":"record","payload":{"canonical_record":{"source":{"id":"2409.11181","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-17T13:35:13Z","cross_cats_sorted":[],"title_canon_sha256":"53077c9a48d40017dfa350685308788986c0b4e30f358801c4356b4d16d4520d","abstract_canon_sha256":"7462782f2a58504efaf7b99e44cb93b8eceb968ba88aa0ae5dcd5614c291a24a"},"schema_version":"1.0"},"canonical_sha256":"224a69724ff1c90a52c4a9d8c4289562b5526fc8210971dd71933d90d97cd029","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:02.764994Z","signature_b64":"Oqjg+UEVO/TPyUAlEIzBlrJWVTk8gfuKvMPJ+Xp5rnUqt7BKzNrNprp4/+j8H05/zyfo5RvM0BC0+xwPlu9XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"224a69724ff1c90a52c4a9d8c4289562b5526fc8210971dd71933d90d97cd029","last_reissued_at":"2026-07-05T09:08:02.764534Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:02.764534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.11181","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-07-05T09:08:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHPbyBQULONNiPoJRhabDzXckmMJ/Essoi8k1mkbUFsjRqb/Lo40ZmkgAuOltcfcVLptdFl32zx8TvgUwtCrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:00:33.539025Z"},"content_sha256":"ae93a6fdbc00c406efb843ca88fe04a319716fb4da9af5178dcff3e0a47fa6ab","schema_version":"1.0","event_id":"sha256:ae93a6fdbc00c406efb843ca88fe04a319716fb4da9af5178dcff3e0a47fa6ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EJFGS4SP6HEQUUWEVHMMIKEVMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inexact Riemannian Gradient Descent Method for Nonconvex Optimization","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hongxia Wang, Juan Zhou, Kangkang Deng, Zheng Peng","submitted_at":"2024-09-17T13:35:13Z","abstract_excerpt":"Gradient descent methods are fundamental first-order optimization algorithms in both Euclidean spaces and Riemannian manifolds. However, the exact gradient is not readily available in many scenarios. This paper proposes a novel inexact Riemannian gradient descent algorithm for nonconvex problems, accompanied by a convergence guarantee. In particular, we establish two inexact gradient conditions on Riemannian manifolds for the first time, enabling precise gradient approximations. Our method demonstrates strong convergence results for both gradient sequences and function values. The global conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.11181","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.11181/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:08:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzdk1XoLbpd0LNuM3OLxJb40C5VH/oyLPYtm8+rf0v8/69W8z+xRPUjaOQLmIVEKMygpsoEHqODcV2RJxaN5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:00:33.539880Z"},"content_sha256":"8a0737713ca9d8cf2406879133260d3f1e746068ed07e7fc5b7b957cc41dffeb","schema_version":"1.0","event_id":"sha256:8a0737713ca9d8cf2406879133260d3f1e746068ed07e7fc5b7b957cc41dffeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJFGS4SP6HEQUUWEVHMMIKEVMK/bundle.json","state_url":"https://pith.science/pith/EJFGS4SP6HEQUUWEVHMMIKEVMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJFGS4SP6HEQUUWEVHMMIKEVMK/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-08T14:00:33Z","links":{"resolver":"https://pith.science/pith/EJFGS4SP6HEQUUWEVHMMIKEVMK","bundle":"https://pith.science/pith/EJFGS4SP6HEQUUWEVHMMIKEVMK/bundle.json","state":"https://pith.science/pith/EJFGS4SP6HEQUUWEVHMMIKEVMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJFGS4SP6HEQUUWEVHMMIKEVMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EJFGS4SP6HEQUUWEVHMMIKEVMK","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":"7462782f2a58504efaf7b99e44cb93b8eceb968ba88aa0ae5dcd5614c291a24a","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-17T13:35:13Z","title_canon_sha256":"53077c9a48d40017dfa350685308788986c0b4e30f358801c4356b4d16d4520d"},"schema_version":"1.0","source":{"id":"2409.11181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.11181","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"arxiv_version","alias_value":"2409.11181v1","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.11181","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"pith_short_12","alias_value":"EJFGS4SP6HEQ","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"pith_short_16","alias_value":"EJFGS4SP6HEQUUWE","created_at":"2026-07-05T09:08:02Z"},{"alias_kind":"pith_short_8","alias_value":"EJFGS4SP","created_at":"2026-07-05T09:08:02Z"}],"graph_snapshots":[{"event_id":"sha256:8a0737713ca9d8cf2406879133260d3f1e746068ed07e7fc5b7b957cc41dffeb","target":"graph","created_at":"2026-07-05T09:08:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.11181/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gradient descent methods are fundamental first-order optimization algorithms in both Euclidean spaces and Riemannian manifolds. However, the exact gradient is not readily available in many scenarios. This paper proposes a novel inexact Riemannian gradient descent algorithm for nonconvex problems, accompanied by a convergence guarantee. In particular, we establish two inexact gradient conditions on Riemannian manifolds for the first time, enabling precise gradient approximations. Our method demonstrates strong convergence results for both gradient sequences and function values. The global conve","authors_text":"Hongxia Wang, Juan Zhou, Kangkang Deng, Zheng Peng","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-17T13:35:13Z","title":"Inexact Riemannian Gradient Descent Method for Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.11181","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:ae93a6fdbc00c406efb843ca88fe04a319716fb4da9af5178dcff3e0a47fa6ab","target":"record","created_at":"2026-07-05T09:08:02Z","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":"7462782f2a58504efaf7b99e44cb93b8eceb968ba88aa0ae5dcd5614c291a24a","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-17T13:35:13Z","title_canon_sha256":"53077c9a48d40017dfa350685308788986c0b4e30f358801c4356b4d16d4520d"},"schema_version":"1.0","source":{"id":"2409.11181","kind":"arxiv","version":1}},"canonical_sha256":"224a69724ff1c90a52c4a9d8c4289562b5526fc8210971dd71933d90d97cd029","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"224a69724ff1c90a52c4a9d8c4289562b5526fc8210971dd71933d90d97cd029","first_computed_at":"2026-07-05T09:08:02.764534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:08:02.764534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oqjg+UEVO/TPyUAlEIzBlrJWVTk8gfuKvMPJ+Xp5rnUqt7BKzNrNprp4/+j8H05/zyfo5RvM0BC0+xwPlu9XCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:08:02.764994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.11181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae93a6fdbc00c406efb843ca88fe04a319716fb4da9af5178dcff3e0a47fa6ab","sha256:8a0737713ca9d8cf2406879133260d3f1e746068ed07e7fc5b7b957cc41dffeb"],"state_sha256":"d733f2e6dea6171a24a15438e41678dc4bb39182e684a61567da1e8c4767f6d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bqQEYpPzfdxP7L+7LZsfAeC/LO6mXfQnx+4KGIIf81iZwI5EnRWaU1ig5djmpYb+L7IQfVf78LAWvQXKUBJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T14:00:33.546327Z","bundle_sha256":"9bf298e170b7296b6a3e039e173868b51c65ff94127015aa48fb92721efda938"}}