{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DWSHSEHRS5CGKOVZ2XCBUS7ZVS","short_pith_number":"pith:DWSHSEHR","canonical_record":{"source":{"id":"1812.03763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-10T12:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"aa8ff062c337f3b21e00659443cb9157955e5adde40ccba57dc909b7f111f71b","abstract_canon_sha256":"83dff397769d92d3d622166d705e474ba81b4bb5d1f9f22746dc9c527678a660"},"schema_version":"1.0"},"canonical_sha256":"1da47910f19744653ab9d5c41a4bf9acae919a8db76689aa619fcb0b61de35ff","source":{"kind":"arxiv","id":"1812.03763","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03763","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03763v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03763","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"DWSHSEHRS5CG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DWSHSEHRS5CGKOVZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DWSHSEHR","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DWSHSEHRS5CGKOVZ2XCBUS7ZVS","target":"record","payload":{"canonical_record":{"source":{"id":"1812.03763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-10T12:42:44Z","cross_cats_sorted":[],"title_canon_sha256":"aa8ff062c337f3b21e00659443cb9157955e5adde40ccba57dc909b7f111f71b","abstract_canon_sha256":"83dff397769d92d3d622166d705e474ba81b4bb5d1f9f22746dc9c527678a660"},"schema_version":"1.0"},"canonical_sha256":"1da47910f19744653ab9d5c41a4bf9acae919a8db76689aa619fcb0b61de35ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:43.923850Z","signature_b64":"RiHi86LkYw/7AJS7dkk0u00RCAZbQ6YRxtKVsfvlfUva+sMUSvfwHGaAArONWH+U8+m3fQda5CXC1CSGDsUoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1da47910f19744653ab9d5c41a4bf9acae919a8db76689aa619fcb0b61de35ff","last_reissued_at":"2026-05-17T23:58:43.923287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:43.923287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.03763","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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRN1lhBHEwTbqvIhcdyEx1bnobaHYmels+GVTqHtvXN8xAGlCACvG5DnVdFQRRhZT1SfGRQ5PMZs12DYmzPUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:36:34.808246Z"},"content_sha256":"6cf36fb03acbe59babb548034db9761512a44db1fb88e6ee56a66ba201bcf802","schema_version":"1.0","event_id":"sha256:6cf36fb03acbe59babb548034db9761512a44db1fb88e6ee56a66ba201bcf802"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DWSHSEHRS5CGKOVZ2XCBUS7ZVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General parameterized proximal point algorithm with applications in statistical learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jianchao Bai, Jiaofen Li, Jicheng Li, Pingfan Dai","submitted_at":"2018-12-10T12:42:44Z","abstract_excerpt":"In the literature, there are a few researches to design some parameters in the Proximal Point Algorithm (PPA), especially for the multi-objective convex optimizations. Introducing some parameters to PPA can make it more flexible and attractive. Mainly motivated by our recent work (Bai et al., A parameterized proximal point algorithm for separable convex optimization, Optim. Lett. (2017) doi: 10.1007/s11590-017-1195-9), in this paper we develop a general parameterized PPA with a relaxation step for solving the multi-block separable structured convex programming. By making use of the variational"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03763","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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnWaFUGyCfFyCIZrljIS6F0HHYpUKEfw0lzxUE5RDfMUwwo3hA3xQEdCYgiJ/9BarWXUhB6LS2GKCIZurOx8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T22:36:34.808601Z"},"content_sha256":"c8c2bad57a6099fa87d91cc780907eb44f0d1ef60ae394908c8f39016e451277","schema_version":"1.0","event_id":"sha256:c8c2bad57a6099fa87d91cc780907eb44f0d1ef60ae394908c8f39016e451277"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/bundle.json","state_url":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/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-30T22:36:34Z","links":{"resolver":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS","bundle":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/bundle.json","state":"https://pith.science/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWSHSEHRS5CGKOVZ2XCBUS7ZVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DWSHSEHRS5CGKOVZ2XCBUS7ZVS","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":"83dff397769d92d3d622166d705e474ba81b4bb5d1f9f22746dc9c527678a660","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-10T12:42:44Z","title_canon_sha256":"aa8ff062c337f3b21e00659443cb9157955e5adde40ccba57dc909b7f111f71b"},"schema_version":"1.0","source":{"id":"1812.03763","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.03763","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1812.03763v1","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03763","created_at":"2026-05-17T23:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"DWSHSEHRS5CG","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DWSHSEHRS5CGKOVZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DWSHSEHR","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:c8c2bad57a6099fa87d91cc780907eb44f0d1ef60ae394908c8f39016e451277","target":"graph","created_at":"2026-05-17T23:58:43Z","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":"In the literature, there are a few researches to design some parameters in the Proximal Point Algorithm (PPA), especially for the multi-objective convex optimizations. Introducing some parameters to PPA can make it more flexible and attractive. Mainly motivated by our recent work (Bai et al., A parameterized proximal point algorithm for separable convex optimization, Optim. Lett. (2017) doi: 10.1007/s11590-017-1195-9), in this paper we develop a general parameterized PPA with a relaxation step for solving the multi-block separable structured convex programming. By making use of the variational","authors_text":"Jianchao Bai, Jiaofen Li, Jicheng Li, Pingfan Dai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-10T12:42:44Z","title":"General parameterized proximal point algorithm with applications in statistical learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03763","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:6cf36fb03acbe59babb548034db9761512a44db1fb88e6ee56a66ba201bcf802","target":"record","created_at":"2026-05-17T23:58:43Z","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":"83dff397769d92d3d622166d705e474ba81b4bb5d1f9f22746dc9c527678a660","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-10T12:42:44Z","title_canon_sha256":"aa8ff062c337f3b21e00659443cb9157955e5adde40ccba57dc909b7f111f71b"},"schema_version":"1.0","source":{"id":"1812.03763","kind":"arxiv","version":1}},"canonical_sha256":"1da47910f19744653ab9d5c41a4bf9acae919a8db76689aa619fcb0b61de35ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1da47910f19744653ab9d5c41a4bf9acae919a8db76689aa619fcb0b61de35ff","first_computed_at":"2026-05-17T23:58:43.923287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:43.923287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RiHi86LkYw/7AJS7dkk0u00RCAZbQ6YRxtKVsfvlfUva+sMUSvfwHGaAArONWH+U8+m3fQda5CXC1CSGDsUoAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:43.923850Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.03763","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cf36fb03acbe59babb548034db9761512a44db1fb88e6ee56a66ba201bcf802","sha256:c8c2bad57a6099fa87d91cc780907eb44f0d1ef60ae394908c8f39016e451277"],"state_sha256":"24a07e4ad0fa8280ef0c9cfc4124e4d53a0480e81bd46a0e5a7c493fb794a6c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"llEZSebfXeZFvxh+eVVZBlRnCI7UvvPc/YS0rWYtyAnVg+cxEcIag4obKi6DG7fxCyqGj8Jt/nv7gJOqUyNxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T22:36:34.810547Z","bundle_sha256":"66d44b7d59d564b3e7285f1f421c3030f74bca07ddb63ed5d563d6d4ef2e8866"}}