{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L5CPSHVRTMCXCUGGSO3RMB72SF","short_pith_number":"pith:L5CPSHVR","schema_version":"1.0","canonical_sha256":"5f44f91eb19b057150c693b71607fa91664e6bd1056bb7d7144cee1cca293038","source":{"kind":"arxiv","id":"2509.08561","version":1},"attestation_state":"computed","paper":{"title":"An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Jiang, Meng Xu, Xingju Cai, Ya-Feng Liu","submitted_at":"2025-09-10T13:06:31Z","abstract_excerpt":"Nonsmooth Riemannian optimization has attracted increasing attention, especially in problems with sparse structures. While existing formulations typically involve convex nonsmooth terms, incorporating nonsmooth difference-of-convex (DC) penalties can enhance recovery accuracy. In this paper, we study a class of nonsmooth Riemannian optimization problems whose objective is the sum of a smooth function and a nonsmooth DC term. We establish, for the first time in the manifold setting, the equivalence between such DC formulations (with suitably chosen nonsmooth DC terms) and their $\\ell_0$-regular"},"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":"2509.08561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-09-10T13:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"6b05766c4751752efd1613e67e5485ec5a3b9803e7c940603cff0edb8f42fb79","abstract_canon_sha256":"3b581bd07b39d28d23ee5dc147df7ad63252a015768c9f59187f409e89479ed3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:32.187945Z","signature_b64":"mavOMAcK70AfARwQxqb5Jvu1zrIQiiLxseQow1+CjOuP2MTu+vNGbclaVQQmnpiSG9uIVZ0Fdji6q3p4x/CvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f44f91eb19b057150c693b71607fa91664e6bd1056bb7d7144cee1cca293038","last_reissued_at":"2026-07-05T12:08:32.187536Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:32.187536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bo Jiang, Meng Xu, Xingju Cai, Ya-Feng Liu","submitted_at":"2025-09-10T13:06:31Z","abstract_excerpt":"Nonsmooth Riemannian optimization has attracted increasing attention, especially in problems with sparse structures. While existing formulations typically involve convex nonsmooth terms, incorporating nonsmooth difference-of-convex (DC) penalties can enhance recovery accuracy. In this paper, we study a class of nonsmooth Riemannian optimization problems whose objective is the sum of a smooth function and a nonsmooth DC term. We establish, for the first time in the manifold setting, the equivalence between such DC formulations (with suitably chosen nonsmooth DC terms) and their $\\ell_0$-regular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08561","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/2509.08561/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":"2509.08561","created_at":"2026-07-05T12:08:32.187592+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08561v1","created_at":"2026-07-05T12:08:32.187592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08561","created_at":"2026-07-05T12:08:32.187592+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5CPSHVRTMCX","created_at":"2026-07-05T12:08:32.187592+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5CPSHVRTMCXCUGG","created_at":"2026-07-05T12:08:32.187592+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5CPSHVR","created_at":"2026-07-05T12:08:32.187592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24954","citing_title":"An Infeasible Method with Feasibility Safeguard for Nonsmooth Composite Optimization Over Manifolds","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29635","citing_title":"MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18325","citing_title":"An Adaptive Smoothing Algorithm for Non-Lipschitz Optimization on Manifolds with Complexity Guarantees","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF","json":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF.json","graph_json":"https://pith.science/api/pith-number/L5CPSHVRTMCXCUGGSO3RMB72SF/graph.json","events_json":"https://pith.science/api/pith-number/L5CPSHVRTMCXCUGGSO3RMB72SF/events.json","paper":"https://pith.science/paper/L5CPSHVR"},"agent_actions":{"view_html":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF","download_json":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF.json","view_paper":"https://pith.science/paper/L5CPSHVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08561&json=true","fetch_graph":"https://pith.science/api/pith-number/L5CPSHVRTMCXCUGGSO3RMB72SF/graph.json","fetch_events":"https://pith.science/api/pith-number/L5CPSHVRTMCXCUGGSO3RMB72SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF/action/storage_attestation","attest_author":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF/action/author_attestation","sign_citation":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF/action/citation_signature","submit_replication":"https://pith.science/pith/L5CPSHVRTMCXCUGGSO3RMB72SF/action/replication_record"}},"created_at":"2026-07-05T12:08:32.187592+00:00","updated_at":"2026-07-05T12:08:32.187592+00:00"}