{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MX4R6QG244G4ZHMJPT3425XQVN","short_pith_number":"pith:MX4R6QG2","canonical_record":{"source":{"id":"2312.06913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-12T00:52:22Z","cross_cats_sorted":[],"title_canon_sha256":"fff060306acc1bb3b2f931eacb131eb568aa0bd77f2e402f1c53d42ab3ff74af","abstract_canon_sha256":"b8d5ddfb659be982534a8adc8c07456337c02427ca6cc6ad13224241e2f20fc9"},"schema_version":"1.0"},"canonical_sha256":"65f91f40dae70dcc9d897cf7cd76f0ab6e7221a91803e39beb656e495853fa79","source":{"kind":"arxiv","id":"2312.06913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.06913","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"2312.06913v1","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.06913","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"MX4R6QG244G4","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"pith_short_16","alias_value":"MX4R6QG244G4ZHMJ","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"pith_short_8","alias_value":"MX4R6QG2","created_at":"2026-07-05T07:23:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MX4R6QG244G4ZHMJPT3425XQVN","target":"record","payload":{"canonical_record":{"source":{"id":"2312.06913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-12T00:52:22Z","cross_cats_sorted":[],"title_canon_sha256":"fff060306acc1bb3b2f931eacb131eb568aa0bd77f2e402f1c53d42ab3ff74af","abstract_canon_sha256":"b8d5ddfb659be982534a8adc8c07456337c02427ca6cc6ad13224241e2f20fc9"},"schema_version":"1.0"},"canonical_sha256":"65f91f40dae70dcc9d897cf7cd76f0ab6e7221a91803e39beb656e495853fa79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:11.662491Z","signature_b64":"Kk14v3FSK2ylPiP7ToQH/3MiNRJeGo7H8kt+hnLZ0VJitE/Sfai4SAXO7sGJkX/Ud2ZYHwNf/I0xsx0J36v1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f91f40dae70dcc9d897cf7cd76f0ab6e7221a91803e39beb656e495853fa79","last_reissued_at":"2026-07-05T07:23:11.662052Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:11.662052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.06913","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mm89GN/CT0njGuF65UUxDBM1kzBYUDSNLKMsnhwg+TBqF9lHhe8NbHcPy5ewhnRj/6xcpOJUNOymqtokeJ/2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:25:48.094591Z"},"content_sha256":"a2665571aafd71f21f9bae4b807b56b055640e517533f2981822825ebe9db6bf","schema_version":"1.0","event_id":"sha256:a2665571aafd71f21f9bae4b807b56b055640e517533f2981822825ebe9db6bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MX4R6QG244G4ZHMJPT3425XQVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The convergence rate of the accelerated proximal gradient algorithm for Multiobjective Optimization is faster than $O(1/k^2)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Zhang, Xinmin Yang","submitted_at":"2023-12-12T00:52:22Z","abstract_excerpt":"In this paper, we propose a fast proximal gradient algorithm for multiobjective optimization, it is proved that the convergence rate of the accelerated algorithm for multiobjective optimization developed by Tanabe et al. can be improved from $O(1/k^2)$ to $o(1/k^2)$ by introducing different extrapolation term $\\frac{k-1}{k+\\alpha-1}$ with $\\alpha>3$. Further, we establish the inexact version of the proposed algorithm when the error term is additive, which owns the same convergence rate.\n  At last, the efficiency of the proposed algorithm is verified on some numerical experiments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.06913","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/2312.06913/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6MgPzwA6GrL0QAXJmjvIJ7NtHPlnjb3eNaU4OUIUKytqnHJZn0lLYL4bsw8L83AG9bhDFArgZnYAE6glEzQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T15:25:48.095590Z"},"content_sha256":"8916752531d383eae7e51ca6b02b2daecb3ea8c836274e911229bed052334211","schema_version":"1.0","event_id":"sha256:8916752531d383eae7e51ca6b02b2daecb3ea8c836274e911229bed052334211"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MX4R6QG244G4ZHMJPT3425XQVN/bundle.json","state_url":"https://pith.science/pith/MX4R6QG244G4ZHMJPT3425XQVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MX4R6QG244G4ZHMJPT3425XQVN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T15:25:48Z","links":{"resolver":"https://pith.science/pith/MX4R6QG244G4ZHMJPT3425XQVN","bundle":"https://pith.science/pith/MX4R6QG244G4ZHMJPT3425XQVN/bundle.json","state":"https://pith.science/pith/MX4R6QG244G4ZHMJPT3425XQVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MX4R6QG244G4ZHMJPT3425XQVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MX4R6QG244G4ZHMJPT3425XQVN","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":"b8d5ddfb659be982534a8adc8c07456337c02427ca6cc6ad13224241e2f20fc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-12T00:52:22Z","title_canon_sha256":"fff060306acc1bb3b2f931eacb131eb568aa0bd77f2e402f1c53d42ab3ff74af"},"schema_version":"1.0","source":{"id":"2312.06913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.06913","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"2312.06913v1","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.06913","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"MX4R6QG244G4","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"pith_short_16","alias_value":"MX4R6QG244G4ZHMJ","created_at":"2026-07-05T07:23:11Z"},{"alias_kind":"pith_short_8","alias_value":"MX4R6QG2","created_at":"2026-07-05T07:23:11Z"}],"graph_snapshots":[{"event_id":"sha256:8916752531d383eae7e51ca6b02b2daecb3ea8c836274e911229bed052334211","target":"graph","created_at":"2026-07-05T07:23:11Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.06913/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a fast proximal gradient algorithm for multiobjective optimization, it is proved that the convergence rate of the accelerated algorithm for multiobjective optimization developed by Tanabe et al. can be improved from $O(1/k^2)$ to $o(1/k^2)$ by introducing different extrapolation term $\\frac{k-1}{k+\\alpha-1}$ with $\\alpha>3$. Further, we establish the inexact version of the proposed algorithm when the error term is additive, which owns the same convergence rate.\n  At last, the efficiency of the proposed algorithm is verified on some numerical experiments.","authors_text":"Jie Zhang, Xinmin Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-12T00:52:22Z","title":"The convergence rate of the accelerated proximal gradient algorithm for Multiobjective Optimization is faster than $O(1/k^2)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.06913","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a2665571aafd71f21f9bae4b807b56b055640e517533f2981822825ebe9db6bf","target":"record","created_at":"2026-07-05T07:23:11Z","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":"b8d5ddfb659be982534a8adc8c07456337c02427ca6cc6ad13224241e2f20fc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-12-12T00:52:22Z","title_canon_sha256":"fff060306acc1bb3b2f931eacb131eb568aa0bd77f2e402f1c53d42ab3ff74af"},"schema_version":"1.0","source":{"id":"2312.06913","kind":"arxiv","version":1}},"canonical_sha256":"65f91f40dae70dcc9d897cf7cd76f0ab6e7221a91803e39beb656e495853fa79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65f91f40dae70dcc9d897cf7cd76f0ab6e7221a91803e39beb656e495853fa79","first_computed_at":"2026-07-05T07:23:11.662052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:23:11.662052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kk14v3FSK2ylPiP7ToQH/3MiNRJeGo7H8kt+hnLZ0VJitE/Sfai4SAXO7sGJkX/Ud2ZYHwNf/I0xsx0J36v1Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:23:11.662491Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.06913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2665571aafd71f21f9bae4b807b56b055640e517533f2981822825ebe9db6bf","sha256:8916752531d383eae7e51ca6b02b2daecb3ea8c836274e911229bed052334211"],"state_sha256":"19c01d0f70b46bbde15cb10ef7f27b254815984b2e0d9b7d184cdda6044ff0b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VnIoeckR4ntB/8++RbyAOZRMhxcgHqvBiPeTKADeO8OfuD5PIaCJBXm22mL3Orp7LBP+3SuKWVfqkFAOJuQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T15:25:48.103810Z","bundle_sha256":"645369ae1a578b64d5b26ca5b6dc7ea4a2ce5583369febf44ab41dcaff9a6d67"}}