{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6TWU7XGDA3B7PVEKVTDIXD6F6S","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":"cf7d1a6be0e76f18244fd6de915ede10ff8d2bc167a0aeb58d45e0e492279425","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T00:47:45Z","title_canon_sha256":"e1209c6b9dd5c09013587d47e1aa968b29be1456161fbd584cdc80bcbe90fb68"},"schema_version":"1.0","source":{"id":"2605.16731","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16731","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16731v1","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16731","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_12","alias_value":"6TWU7XGDA3B7","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_16","alias_value":"6TWU7XGDA3B7PVEK","created_at":"2026-05-20T00:02:38Z"},{"alias_kind":"pith_short_8","alias_value":"6TWU7XGD","created_at":"2026-05-20T00:02:38Z"}],"graph_snapshots":[{"event_id":"sha256:59bec05e747c25c8fe71369eb972e67dfd462e837f8084eead60c9a153139b7b","target":"graph","created_at":"2026-05-20T00:02:38Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"establishes global convergence to Pareto stationary points, together with an O(1/k) convergence rate"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A proximal gradient method converges composite multiobjective optimization problems on Riemannian manifolds to Pareto stationary points at an O(1/k) rate."}],"snapshot_sha256":"8dec5983df02c036e594b4783aa37bfa7c41ff0b4e3c83b3f821f2f7740fd6d0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8f670ae5be6ebf8d0faba559d6bb79386b2aebdd498b8aed89a99c4c359b88e8"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.16731/integrity.json","findings":[],"snapshot_sha256":"9f7f5c2d3287eb7a4a655ecbb1387f566d561a32ebc8d3509eb149c9ce374af3","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Kangming Chen","cross_cats":[],"headline":"A proximal gradient method converges composite multiobjective optimization problems on Riemannian manifolds to Pareto stationary points at an O(1/k) rate.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T00:47:45Z","title":"A Proximal Gradient Framework for Composite Multiobjective Optimization on Riemannian Manifolds"},"references":{"count":31,"internal_anchors":0,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"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","year":2008},{"cited_arxiv_id":"","doi":"10.1017/9781009166164","is_internal_anchor":false,"ref_index":2,"title":"Cambridge University Press","work_id":"6eef43d6-d9f7-42da-90a7-d535e797f287","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Foundations of Computational Mathematics7, 303–330 (2007)","work_id":"fd589b3f-3a64-4e0e-b7b4-bcff6b8a51c5","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Computational and Applied Mathematics45(4), 151 (2026)","work_id":"e60e0d02-955e-4331-8f1c-0647dff19011","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"SIAM Journal on Optimization32(4), 2690–2717 (2022)","work_id":"a6063fd6-f954-4b7f-884a-fbd6a9c6d766","year":2022}],"snapshot_sha256":"b7dd3f5e4c8dd7447805cee1ebc4c29bb630a19e77bd5dea085c85431e24f281"},"source":{"id":"2605.16731","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:34:48.109882Z","id":"62480791-9750-4774-9dd1-64d8cc8b554b","model_set":{"reader":"grok-4.3"},"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","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.","strongest_claim":"establishes global convergence to Pareto stationary points, together with an O(1/k) convergence rate","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)."}},"verdict_id":"62480791-9750-4774-9dd1-64d8cc8b554b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b46db9aa22c4da8e57f566ae8b54d04d7ea64114975a4904d2ae0948275208d9","target":"record","created_at":"2026-05-20T00:02:38Z","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":"cf7d1a6be0e76f18244fd6de915ede10ff8d2bc167a0aeb58d45e0e492279425","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T00:47:45Z","title_canon_sha256":"e1209c6b9dd5c09013587d47e1aa968b29be1456161fbd584cdc80bcbe90fb68"},"schema_version":"1.0","source":{"id":"2605.16731","kind":"arxiv","version":1}},"canonical_sha256":"f4ed4fdcc306c3f7d48aacc68b8fc5f4a8f0d8dd88f10f0036275485f639c362","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4ed4fdcc306c3f7d48aacc68b8fc5f4a8f0d8dd88f10f0036275485f639c362","first_computed_at":"2026-05-20T00:02:38.830668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:38.830668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aaXWB3wI7QSfhXpk8lEuzSSHOWyI24bIVm0yOySbR+5rHb+h7Havw4tyfLTB/MgZ+cLbhPZKJcPSFZUZ2HQWBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:38.831581Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16731","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b46db9aa22c4da8e57f566ae8b54d04d7ea64114975a4904d2ae0948275208d9","sha256:59bec05e747c25c8fe71369eb972e67dfd462e837f8084eead60c9a153139b7b"],"state_sha256":"a5967a70ba31a5858d6efb508511f4cf76dad3a2187006723d5a5594133dac5a"}