{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TPPEDI2OOTMMOD5JV27ILYLLMM","short_pith_number":"pith:TPPEDI2O","schema_version":"1.0","canonical_sha256":"9bde41a34e74d8c70fa9aebe85e16b6330f4ace6fc81c9108fba1587987253c3","source":{"kind":"arxiv","id":"2405.08365","version":2},"attestation_state":"computed","paper":{"title":"A Riemannian Proximal Newton-CG Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wen Huang, Wutao Si","submitted_at":"2024-05-14T07:05:37Z","abstract_excerpt":"Recently, a Riemannian proximal Newton method has been developed for optimizing problems in the form of $\\min_{x\\in\\mathcal{M}} f(x) + \\mu \\|x\\|_1$, where $\\mathcal{M}$ is a compact embedded submanifold and $f(x)$ is smooth. Although this method converges superlinearly locally, global convergence is not guaranteed. The existing remedy relies on a hybrid approach: running a Riemannian proximal gradient method until the iterate is sufficiently accurate and switching to the Riemannian proximal Newton method. This existing approach is sensitive to the switching parameter. This paper proposes a Rie"},"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":"2405.08365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-14T07:05:37Z","cross_cats_sorted":[],"title_canon_sha256":"d58ac8ebf66fdc19517f1d9edf7077052497168c00749d90d57007dc345e96e3","abstract_canon_sha256":"b58039503b108dd6903389bac7556636ea4bd08ba4ff0d18f925a37b858c68cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:26.222810Z","signature_b64":"/EO3+ewLWuRgfmTWp/30noG5Ne3NT+IABsPckE+dc1ViP8MIoKfjfhd7mhTA1AQtnANdSnOT7nb3h8ovHqoRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bde41a34e74d8c70fa9aebe85e16b6330f4ace6fc81c9108fba1587987253c3","last_reissued_at":"2026-07-05T10:37:26.222185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:26.222185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Riemannian Proximal Newton-CG Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wen Huang, Wutao Si","submitted_at":"2024-05-14T07:05:37Z","abstract_excerpt":"Recently, a Riemannian proximal Newton method has been developed for optimizing problems in the form of $\\min_{x\\in\\mathcal{M}} f(x) + \\mu \\|x\\|_1$, where $\\mathcal{M}$ is a compact embedded submanifold and $f(x)$ is smooth. Although this method converges superlinearly locally, global convergence is not guaranteed. The existing remedy relies on a hybrid approach: running a Riemannian proximal gradient method until the iterate is sufficiently accurate and switching to the Riemannian proximal Newton method. This existing approach is sensitive to the switching parameter. This paper proposes a Rie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.08365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.08365/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":"2405.08365","created_at":"2026-07-05T10:37:26.222248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.08365v2","created_at":"2026-07-05T10:37:26.222248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.08365","created_at":"2026-07-05T10:37:26.222248+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPPEDI2OOTMM","created_at":"2026-07-05T10:37:26.222248+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPPEDI2OOTMMOD5J","created_at":"2026-07-05T10:37:26.222248+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPPEDI2O","created_at":"2026-07-05T10:37:26.222248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08561","citing_title":"An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM","json":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM.json","graph_json":"https://pith.science/api/pith-number/TPPEDI2OOTMMOD5JV27ILYLLMM/graph.json","events_json":"https://pith.science/api/pith-number/TPPEDI2OOTMMOD5JV27ILYLLMM/events.json","paper":"https://pith.science/paper/TPPEDI2O"},"agent_actions":{"view_html":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM","download_json":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM.json","view_paper":"https://pith.science/paper/TPPEDI2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.08365&json=true","fetch_graph":"https://pith.science/api/pith-number/TPPEDI2OOTMMOD5JV27ILYLLMM/graph.json","fetch_events":"https://pith.science/api/pith-number/TPPEDI2OOTMMOD5JV27ILYLLMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM/action/storage_attestation","attest_author":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM/action/author_attestation","sign_citation":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM/action/citation_signature","submit_replication":"https://pith.science/pith/TPPEDI2OOTMMOD5JV27ILYLLMM/action/replication_record"}},"created_at":"2026-07-05T10:37:26.222248+00:00","updated_at":"2026-07-05T10:37:26.222248+00:00"}