{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:6CDRWUHYIGJL7W7BXMTJSAVVMZ","short_pith_number":"pith:6CDRWUHY","canonical_record":{"source":{"id":"2306.09797","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-16T12:10:09Z","cross_cats_sorted":[],"title_canon_sha256":"43da8364aa8186fb02bb064e81fd870131c63ad7681e4737398b04822497be73","abstract_canon_sha256":"cc846734fa131aed7704cde2580e51503a9c2ea756530f3812709593574fd121"},"schema_version":"1.0"},"canonical_sha256":"f0871b50f84192bfdbe1bb269902b5666173e85806b8e32f12a5d49e8613d242","source":{"kind":"arxiv","id":"2306.09797","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.09797","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"arxiv_version","alias_value":"2306.09797v2","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09797","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"pith_short_12","alias_value":"6CDRWUHYIGJL","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"pith_short_16","alias_value":"6CDRWUHYIGJL7W7B","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"pith_short_8","alias_value":"6CDRWUHY","created_at":"2026-07-05T06:39:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:6CDRWUHYIGJL7W7BXMTJSAVVMZ","target":"record","payload":{"canonical_record":{"source":{"id":"2306.09797","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-16T12:10:09Z","cross_cats_sorted":[],"title_canon_sha256":"43da8364aa8186fb02bb064e81fd870131c63ad7681e4737398b04822497be73","abstract_canon_sha256":"cc846734fa131aed7704cde2580e51503a9c2ea756530f3812709593574fd121"},"schema_version":"1.0"},"canonical_sha256":"f0871b50f84192bfdbe1bb269902b5666173e85806b8e32f12a5d49e8613d242","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:35.939021Z","signature_b64":"yBYxwHNjZKyANWemYcwGaRoZExMgwSHURK+/hnGHSQRgv5lKGzRn9ZYK2nl8HVhl9ZN6nr8R/xTnQoA65rmpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0871b50f84192bfdbe1bb269902b5666173e85806b8e32f12a5d49e8613d242","last_reissued_at":"2026-07-05T06:39:35.938552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:35.938552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.09797","source_version":2,"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-05T06:39:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkOZM7naFipyDw7eXBm5IyZuwM/q6vm5c4lab5fVBDhWaFlsLXEabC5lOJZQTPgFTr86duubUO4YNOolf4xWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T20:00:58.404123Z"},"content_sha256":"245b88838b68cffe5d993588a76f5d50befa5104029ec1c6ce127281c63040c0","schema_version":"1.0","event_id":"sha256:245b88838b68cffe5d993588a76f5d50befa5104029ec1c6ce127281c63040c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:6CDRWUHYIGJL7W7BXMTJSAVVMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Barzilai-Borwein Proximal Gradient Methods for Multiobjective Composite Optimization Problems with Improved Linear Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jian Chen, Liping Tang, Xinmin Yang","submitted_at":"2023-06-16T12:10:09Z","abstract_excerpt":"When minimizing a multiobjective optimization problem (MOP) using multiobjective gradient descent methods, the imbalances among objective functions often decelerate the convergence. In response to this challenge, we propose two types of the Barzilai-Borwein proximal gradient method for multi-objective composite optimization problems (BBPGMO). We establish convergence rates for BBPGMO, demonstrating that it achieves rates of $O(\\frac{1}{\\sqrt{k}})$, $O(\\frac{1}{k})$, and $O(r^{k})(0<r<1)$ for non-convex, convex, and strongly convex problems, respectively. Furthermore, we show that BBPGMO exhibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09797","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/2306.09797/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-05T06:39:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbIsiqwotHlN2UJhbi0LDwYP6ldsc+AIQhb6K2UbeWpOUkzj3Upp6zLib5mw2P5q2ffrQHh8a8hwynSM7ZGDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T20:00:58.404503Z"},"content_sha256":"7d6232b7aaf22520ec6817c7ffc9e3a46abf74ff7f50a02f5c766c8a65c47d4c","schema_version":"1.0","event_id":"sha256:7d6232b7aaf22520ec6817c7ffc9e3a46abf74ff7f50a02f5c766c8a65c47d4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/bundle.json","state_url":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/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-07-26T20:00:58Z","links":{"resolver":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ","bundle":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/bundle.json","state":"https://pith.science/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CDRWUHYIGJL7W7BXMTJSAVVMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:6CDRWUHYIGJL7W7BXMTJSAVVMZ","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":"cc846734fa131aed7704cde2580e51503a9c2ea756530f3812709593574fd121","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-16T12:10:09Z","title_canon_sha256":"43da8364aa8186fb02bb064e81fd870131c63ad7681e4737398b04822497be73"},"schema_version":"1.0","source":{"id":"2306.09797","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.09797","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"arxiv_version","alias_value":"2306.09797v2","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.09797","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"pith_short_12","alias_value":"6CDRWUHYIGJL","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"pith_short_16","alias_value":"6CDRWUHYIGJL7W7B","created_at":"2026-07-05T06:39:35Z"},{"alias_kind":"pith_short_8","alias_value":"6CDRWUHY","created_at":"2026-07-05T06:39:35Z"}],"graph_snapshots":[{"event_id":"sha256:7d6232b7aaf22520ec6817c7ffc9e3a46abf74ff7f50a02f5c766c8a65c47d4c","target":"graph","created_at":"2026-07-05T06:39:35Z","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/2306.09797/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When minimizing a multiobjective optimization problem (MOP) using multiobjective gradient descent methods, the imbalances among objective functions often decelerate the convergence. In response to this challenge, we propose two types of the Barzilai-Borwein proximal gradient method for multi-objective composite optimization problems (BBPGMO). We establish convergence rates for BBPGMO, demonstrating that it achieves rates of $O(\\frac{1}{\\sqrt{k}})$, $O(\\frac{1}{k})$, and $O(r^{k})(0<r<1)$ for non-convex, convex, and strongly convex problems, respectively. Furthermore, we show that BBPGMO exhibi","authors_text":"Jian Chen, Liping Tang, Xinmin Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-16T12:10:09Z","title":"Barzilai-Borwein Proximal Gradient Methods for Multiobjective Composite Optimization Problems with Improved Linear Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.09797","kind":"arxiv","version":2},"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:245b88838b68cffe5d993588a76f5d50befa5104029ec1c6ce127281c63040c0","target":"record","created_at":"2026-07-05T06:39:35Z","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":"cc846734fa131aed7704cde2580e51503a9c2ea756530f3812709593574fd121","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-06-16T12:10:09Z","title_canon_sha256":"43da8364aa8186fb02bb064e81fd870131c63ad7681e4737398b04822497be73"},"schema_version":"1.0","source":{"id":"2306.09797","kind":"arxiv","version":2}},"canonical_sha256":"f0871b50f84192bfdbe1bb269902b5666173e85806b8e32f12a5d49e8613d242","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0871b50f84192bfdbe1bb269902b5666173e85806b8e32f12a5d49e8613d242","first_computed_at":"2026-07-05T06:39:35.938552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:39:35.938552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yBYxwHNjZKyANWemYcwGaRoZExMgwSHURK+/hnGHSQRgv5lKGzRn9ZYK2nl8HVhl9ZN6nr8R/xTnQoA65rmpBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:39:35.939021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.09797","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:245b88838b68cffe5d993588a76f5d50befa5104029ec1c6ce127281c63040c0","sha256:7d6232b7aaf22520ec6817c7ffc9e3a46abf74ff7f50a02f5c766c8a65c47d4c"],"state_sha256":"4badfbc0a81172e957d35e40a872b76ac6c5e6f104856378806b6658495f260c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PrZIoIoBORey4bumbnIy0081FgRC0Wmb+nrF/4BbQqFFxbYGj1miWHyVOeHew/OC62QuJU/rUYiE01FuQXNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T20:00:58.406859Z","bundle_sha256":"07068e6b4398f06d56a736902062056b57fe13c1af9cec2aca2292ed125f3994"}}