{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LSAFKM4YPZ64UGW33UIIXPAFVF","short_pith_number":"pith:LSAFKM4Y","schema_version":"1.0","canonical_sha256":"5c805533987e7dca1adbdd108bbc05a9732da20cbd77287ef6b724009aaff460","source":{"kind":"arxiv","id":"2402.12464","version":1},"attestation_state":"computed","paper":{"title":"An Adaptive Cubic Regularization quasi-Newton Method on Riemannian Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daoping Zhang, Gilson N. Silva, Jinyun Yuan, Mauricio S. Louzeiro","submitted_at":"2024-02-19T19:10:23Z","abstract_excerpt":"A quasi-Newton method with cubic regularization is designed for solving Riemannian unconstrained nonconvex optimization problems. The proposed algorithm is fully adaptive with at most ${\\cal O} (\\epsilon_g^{-3/2})$ iterations to achieve a gradient smaller than $\\epsilon_g$ for given $\\epsilon_g$, and at most $\\mathcal O(\\max\\{ \\epsilon_g^{-\\frac{3}{2}}, \\epsilon_H^{-3} \\})$ iterations to reach a second-order stationary point respectively. Notably, the proposed algorithm remains applicable even in cases of the gradient and Hessian of the objective function unknown. Numerical experiments are per"},"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":"2402.12464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-19T19:10:23Z","cross_cats_sorted":[],"title_canon_sha256":"4b756b04e6980316ed52ff6ce930578edc8279d5b505563bf7b19d4a99a41c73","abstract_canon_sha256":"046010e590e5b2b62aa4afe00ca73fc74f9788b738b72412664571ee011d2d67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:11.616897Z","signature_b64":"Qfy87VBsuK1TA3xGYoa6OiqDH1xeAkIzkPvmJt9sWlzW7PrNp9A0jW5s7h8i3rXMco/f3dfug+Bb2klUQPPzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c805533987e7dca1adbdd108bbc05a9732da20cbd77287ef6b724009aaff460","last_reissued_at":"2026-07-05T07:47:11.616428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:11.616428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive Cubic Regularization quasi-Newton Method on Riemannian Manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daoping Zhang, Gilson N. Silva, Jinyun Yuan, Mauricio S. Louzeiro","submitted_at":"2024-02-19T19:10:23Z","abstract_excerpt":"A quasi-Newton method with cubic regularization is designed for solving Riemannian unconstrained nonconvex optimization problems. The proposed algorithm is fully adaptive with at most ${\\cal O} (\\epsilon_g^{-3/2})$ iterations to achieve a gradient smaller than $\\epsilon_g$ for given $\\epsilon_g$, and at most $\\mathcal O(\\max\\{ \\epsilon_g^{-\\frac{3}{2}}, \\epsilon_H^{-3} \\})$ iterations to reach a second-order stationary point respectively. Notably, the proposed algorithm remains applicable even in cases of the gradient and Hessian of the objective function unknown. Numerical experiments are per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.12464","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/2402.12464/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.12464","created_at":"2026-07-05T07:47:11.616486+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.12464v1","created_at":"2026-07-05T07:47:11.616486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.12464","created_at":"2026-07-05T07:47:11.616486+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSAFKM4YPZ64","created_at":"2026-07-05T07:47:11.616486+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSAFKM4YPZ64UGW3","created_at":"2026-07-05T07:47:11.616486+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSAFKM4Y","created_at":"2026-07-05T07:47:11.616486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08181","citing_title":"A Cubic Regularization Method for Multiobjective Optimization","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF","json":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF.json","graph_json":"https://pith.science/api/pith-number/LSAFKM4YPZ64UGW33UIIXPAFVF/graph.json","events_json":"https://pith.science/api/pith-number/LSAFKM4YPZ64UGW33UIIXPAFVF/events.json","paper":"https://pith.science/paper/LSAFKM4Y"},"agent_actions":{"view_html":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF","download_json":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF.json","view_paper":"https://pith.science/paper/LSAFKM4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.12464&json=true","fetch_graph":"https://pith.science/api/pith-number/LSAFKM4YPZ64UGW33UIIXPAFVF/graph.json","fetch_events":"https://pith.science/api/pith-number/LSAFKM4YPZ64UGW33UIIXPAFVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF/action/storage_attestation","attest_author":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF/action/author_attestation","sign_citation":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF/action/citation_signature","submit_replication":"https://pith.science/pith/LSAFKM4YPZ64UGW33UIIXPAFVF/action/replication_record"}},"created_at":"2026-07-05T07:47:11.616486+00:00","updated_at":"2026-07-05T07:47:11.616486+00:00"}