{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RIJLZ5JYALYSKXBNY2HTPW6OPP","short_pith_number":"pith:RIJLZ5JY","canonical_record":{"source":{"id":"1905.04537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T15:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"689539dd0443f70c51e27cfae86fcdf8c9e87588f399691ce058b9186fbd3244","abstract_canon_sha256":"41a78d8942c12ef6e0ca1f56349171d30f971edefb897b1e78e0fc683e0c6428"},"schema_version":"1.0"},"canonical_sha256":"8a12bcf53802f1255c2dc68f37dbce7bf8d3f13f07d269b592cf8eaf9b8b67d9","source":{"kind":"arxiv","id":"1905.04537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04537","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04537v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04537","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"RIJLZ5JYALYS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIJLZ5JYALYSKXBN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIJLZ5JY","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RIJLZ5JYALYSKXBNY2HTPW6OPP","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T15:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"689539dd0443f70c51e27cfae86fcdf8c9e87588f399691ce058b9186fbd3244","abstract_canon_sha256":"41a78d8942c12ef6e0ca1f56349171d30f971edefb897b1e78e0fc683e0c6428"},"schema_version":"1.0"},"canonical_sha256":"8a12bcf53802f1255c2dc68f37dbce7bf8d3f13f07d269b592cf8eaf9b8b67d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.484177Z","signature_b64":"y2OB2gWi3LSNUJ/bibHbbkeaR1GwozH67chjeh5I2yZUykfZT73UNBtk3VqJ7LgAAape/qfSqpP5OZvBZzhVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a12bcf53802f1255c2dc68f37dbce7bf8d3f13f07d269b592cf8eaf9b8b67d9","last_reissued_at":"2026-05-17T23:46:24.483475Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.483475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04537","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-05-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2vEOchg57UmDBJgI04A1Dfb9zbGOBAqj9rv5pYBqvTgrA/Dgk9cneKSzPUufOHKwZ3sLbUQologOr2mar9eCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:54:42.059305Z"},"content_sha256":"7d035bec22491e6c871d584a8e94b9b86372383bc7ce2a7b7966725f40d228e1","schema_version":"1.0","event_id":"sha256:7d035bec22491e6c871d584a8e94b9b86372383bc7ce2a7b7966725f40d228e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RIJLZ5JYALYSKXBNY2HTPW6OPP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the optimal linear convergence factor of the relaxed proximal point algorithm for monotone inclusion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guoyong Gu, Junfeng Yang","submitted_at":"2019-05-11T15:11:34Z","abstract_excerpt":"Finding a zero of a maximal monotone operator is fundamental in convex optimization and monotone operator theory, and \\emph{proximal point algorithm} (PPA) is a primary method for solving this problem. PPA converges not only globally under fairly mild conditions but also asymptotically at a fast linear rate provided that the underlying inverse operator is Lipschitz continuous at the origin. These nice convergence properties are preserved by a relaxed variant of PPA. Recently, a linear convergence bound was established in [M. Tao, and X. M. Yuan, J. Sci. Comput., 74 (2018), pp. 826-850] for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04537","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":""},"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-05-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7feXiYyqjaGl/0V/eftirs/YiiVmlUpfPSKSiU0muZzWhbVtVlrXxMLDkRuq+wuVS988WUbSoxSaych1XcJVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:54:42.059671Z"},"content_sha256":"53d5e763df4660500dae541799e6f3d8729e99c3fb7fc4b61c9ce463dac5083d","schema_version":"1.0","event_id":"sha256:53d5e763df4660500dae541799e6f3d8729e99c3fb7fc4b61c9ce463dac5083d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/bundle.json","state_url":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/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-06-04T03:54:42Z","links":{"resolver":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP","bundle":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/bundle.json","state":"https://pith.science/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIJLZ5JYALYSKXBNY2HTPW6OPP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RIJLZ5JYALYSKXBNY2HTPW6OPP","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":"41a78d8942c12ef6e0ca1f56349171d30f971edefb897b1e78e0fc683e0c6428","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T15:11:34Z","title_canon_sha256":"689539dd0443f70c51e27cfae86fcdf8c9e87588f399691ce058b9186fbd3244"},"schema_version":"1.0","source":{"id":"1905.04537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04537","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04537v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04537","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"RIJLZ5JYALYS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIJLZ5JYALYSKXBN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIJLZ5JY","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:53d5e763df4660500dae541799e6f3d8729e99c3fb7fc4b61c9ce463dac5083d","target":"graph","created_at":"2026-05-17T23:46:24Z","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"},"paper":{"abstract_excerpt":"Finding a zero of a maximal monotone operator is fundamental in convex optimization and monotone operator theory, and \\emph{proximal point algorithm} (PPA) is a primary method for solving this problem. PPA converges not only globally under fairly mild conditions but also asymptotically at a fast linear rate provided that the underlying inverse operator is Lipschitz continuous at the origin. These nice convergence properties are preserved by a relaxed variant of PPA. Recently, a linear convergence bound was established in [M. Tao, and X. M. Yuan, J. Sci. Comput., 74 (2018), pp. 826-850] for the","authors_text":"Guoyong Gu, Junfeng Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T15:11:34Z","title":"On the optimal linear convergence factor of the relaxed proximal point algorithm for monotone inclusion problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04537","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:7d035bec22491e6c871d584a8e94b9b86372383bc7ce2a7b7966725f40d228e1","target":"record","created_at":"2026-05-17T23:46:24Z","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":"41a78d8942c12ef6e0ca1f56349171d30f971edefb897b1e78e0fc683e0c6428","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-11T15:11:34Z","title_canon_sha256":"689539dd0443f70c51e27cfae86fcdf8c9e87588f399691ce058b9186fbd3244"},"schema_version":"1.0","source":{"id":"1905.04537","kind":"arxiv","version":1}},"canonical_sha256":"8a12bcf53802f1255c2dc68f37dbce7bf8d3f13f07d269b592cf8eaf9b8b67d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a12bcf53802f1255c2dc68f37dbce7bf8d3f13f07d269b592cf8eaf9b8b67d9","first_computed_at":"2026-05-17T23:46:24.483475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:24.483475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y2OB2gWi3LSNUJ/bibHbbkeaR1GwozH67chjeh5I2yZUykfZT73UNBtk3VqJ7LgAAape/qfSqpP5OZvBZzhVDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:24.484177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d035bec22491e6c871d584a8e94b9b86372383bc7ce2a7b7966725f40d228e1","sha256:53d5e763df4660500dae541799e6f3d8729e99c3fb7fc4b61c9ce463dac5083d"],"state_sha256":"402bbce401479a9e0fb8e462737b1000f1e182b9deec740c7abae9e75edafe78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zv/Nxl27uGkVt0fYwnp6TrQvN7lLJXbIhRWYIB/VJoNB9SYT0E4eElsEbJO3aTzlHRUMFyemWVt5b0TWJcuKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:54:42.061640Z","bundle_sha256":"83fffb31b0c810e298dee5385956de14ed68fb1c3fc77afa5aae4d745f804d31"}}