{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6TWU7XGDA3B7PVEKVTDIXD6F6S","short_pith_number":"pith:6TWU7XGD","schema_version":"1.0","canonical_sha256":"f4ed4fdcc306c3f7d48aacc68b8fc5f4a8f0d8dd88f10f0036275485f639c362","source":{"kind":"arxiv","id":"2605.16731","version":1},"attestation_state":"computed","paper":{"title":"A Proximal Gradient Framework for Composite Multiobjective Optimization on Riemannian Manifolds","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"A proximal gradient method converges composite multiobjective optimization problems on Riemannian manifolds to Pareto stationary points at an O(1/k) rate.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kangming Chen","submitted_at":"2026-05-16T00:47:45Z","abstract_excerpt":"This paper proposes a Riemannian Multiobjective Proximal Gradient Method (RMPGM) for composite optimization problems on manifolds. Unlike scalarization-based approaches, the proposed framework directly handles vector-valued objectives and establishes global convergence to Pareto stationary points, together with an $\\mathcal{O}(1/k)$ convergence rate. We further develop two variants to enhance practicality and performance: an inexact RMPGM that allows controlled inexactness in solving subproblems, and a trust-region RMPGM that adaptively adjusts the penalty parameter and achieves an $\\mathcal{O"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16731","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T00:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"e1209c6b9dd5c09013587d47e1aa968b29be1456161fbd584cdc80bcbe90fb68","abstract_canon_sha256":"cf7d1a6be0e76f18244fd6de915ede10ff8d2bc167a0aeb58d45e0e492279425"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:38.831581Z","signature_b64":"aaXWB3wI7QSfhXpk8lEuzSSHOWyI24bIVm0yOySbR+5rHb+h7Havw4tyfLTB/MgZ+cLbhPZKJcPSFZUZ2HQWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4ed4fdcc306c3f7d48aacc68b8fc5f4a8f0d8dd88f10f0036275485f639c362","last_reissued_at":"2026-05-20T00:02:38.830668Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:38.830668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proximal Gradient Framework for Composite Multiobjective Optimization on Riemannian Manifolds","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"A proximal gradient method converges composite multiobjective optimization problems on Riemannian manifolds to Pareto stationary points at an O(1/k) rate.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kangming Chen","submitted_at":"2026-05-16T00:47:45Z","abstract_excerpt":"This paper proposes a Riemannian Multiobjective Proximal Gradient Method (RMPGM) for composite optimization problems on manifolds. Unlike scalarization-based approaches, the proposed framework directly handles vector-valued objectives and establishes global convergence to Pareto stationary points, together with an $\\mathcal{O}(1/k)$ convergence rate. We further develop two variants to enhance practicality and performance: an inexact RMPGM that allows controlled inexactness in solving subproblems, and a trust-region RMPGM that adaptively adjusts the penalty parameter and achieves an $\\mathcal{O"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"establishes global convergence to Pareto stationary points, together with an O(1/k) convergence rate","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The composite structure of the vector-valued objective functions and the Riemannian manifold admit well-defined proximal mappings and retraction operations that preserve the necessary descent properties (implicit in the framework description for composite optimization problems on manifolds).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The Riemannian Multiobjective Proximal Gradient Method (RMPGM) directly optimizes vector-valued composite objectives on Riemannian manifolds and converges globally to Pareto stationary points with an O(1/k) rate.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A proximal gradient method converges composite multiobjective optimization problems on Riemannian manifolds to Pareto stationary points at an O(1/k) rate.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8dec5983df02c036e594b4783aa37bfa7c41ff0b4e3c83b3f821f2f7740fd6d0"},"source":{"id":"2605.16731","kind":"arxiv","version":1},"verdict":{"id":"62480791-9750-4774-9dd1-64d8cc8b554b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:34:48.109882Z","strongest_claim":"establishes global convergence to Pareto stationary points, together with an O(1/k) convergence rate","one_line_summary":"The Riemannian Multiobjective Proximal Gradient Method (RMPGM) directly optimizes vector-valued composite objectives on Riemannian manifolds and converges globally to Pareto stationary points with an O(1/k) rate.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The composite structure of the vector-valued objective functions and the Riemannian manifold admit well-defined proximal mappings and retraction operations that preserve the necessary descent properties (implicit in the framework description for composite optimization problems on manifolds).","pith_extraction_headline":"A proximal gradient method converges composite multiobjective optimization problems on Riemannian manifolds to Pareto stationary points at an O(1/k) rate."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16731/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:23.068936Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:40:57.053372Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.343140Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.469390Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9f7f5c2d3287eb7a4a655ecbb1387f566d561a32ebc8d3509eb149c9ce374af3"},"references":{"count":31,"sample":[{"doi":"","year":2008,"title":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds, p. 224. Princeton University Press, Princeton, NJ (2008)","work_id":"94f00fbc-53e6-4683-9c36-baba1611dd99","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1017/9781009166164","year":2023,"title":"Cambridge University Press","work_id":"6eef43d6-d9f7-42da-90a7-d535e797f287","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2007,"title":"Foundations of Computational Mathematics7, 303–330 (2007)","work_id":"fd589b3f-3a64-4e0e-b7b4-bcff6b8a51c5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Computational and Applied Mathematics45(4), 151 (2026)","work_id":"e60e0d02-955e-4331-8f1c-0647dff19011","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"SIAM Journal on Optimization32(4), 2690–2717 (2022)","work_id":"a6063fd6-f954-4b7f-884a-fbd6a9c6d766","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"b7dd3f5e4c8dd7447805cee1ebc4c29bb630a19e77bd5dea085c85431e24f281","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8f670ae5be6ebf8d0faba559d6bb79386b2aebdd498b8aed89a99c4c359b88e8"},"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":"2605.16731","created_at":"2026-05-20T00:02:38.830837+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16731v1","created_at":"2026-05-20T00:02:38.830837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16731","created_at":"2026-05-20T00:02:38.830837+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TWU7XGDA3B7","created_at":"2026-05-20T00:02:38.830837+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TWU7XGDA3B7PVEK","created_at":"2026-05-20T00:02:38.830837+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TWU7XGD","created_at":"2026-05-20T00:02:38.830837+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S","json":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S.json","graph_json":"https://pith.science/api/pith-number/6TWU7XGDA3B7PVEKVTDIXD6F6S/graph.json","events_json":"https://pith.science/api/pith-number/6TWU7XGDA3B7PVEKVTDIXD6F6S/events.json","paper":"https://pith.science/paper/6TWU7XGD"},"agent_actions":{"view_html":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S","download_json":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S.json","view_paper":"https://pith.science/paper/6TWU7XGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16731&json=true","fetch_graph":"https://pith.science/api/pith-number/6TWU7XGDA3B7PVEKVTDIXD6F6S/graph.json","fetch_events":"https://pith.science/api/pith-number/6TWU7XGDA3B7PVEKVTDIXD6F6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S/action/storage_attestation","attest_author":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S/action/author_attestation","sign_citation":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S/action/citation_signature","submit_replication":"https://pith.science/pith/6TWU7XGDA3B7PVEKVTDIXD6F6S/action/replication_record"}},"created_at":"2026-05-20T00:02:38.830837+00:00","updated_at":"2026-05-20T00:02:38.830837+00:00"}