{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YFP3OTSPZVBCE5UTXB2XTGTW7E","short_pith_number":"pith:YFP3OTSP","canonical_record":{"source":{"id":"1711.09455","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-26T20:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"fd568ab532aa7efc6676ff8fcef7ab64d1c11b6badc9ffef718a5c730cbccfb9","abstract_canon_sha256":"bb6e8cc3b1b1dc6423aae863ea62de3ed5bb544b1113b5804b893d9fee6b2a5b"},"schema_version":"1.0"},"canonical_sha256":"c15fb74e4fcd42227693b875799a76f901e67452ad1ffa4c299ecf33b2885faf","source":{"kind":"arxiv","id":"1711.09455","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09455","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09455v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09455","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"YFP3OTSPZVBC","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YFP3OTSPZVBCE5UT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YFP3OTSP","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YFP3OTSPZVBCE5UTXB2XTGTW7E","target":"record","payload":{"canonical_record":{"source":{"id":"1711.09455","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-26T20:45:51Z","cross_cats_sorted":[],"title_canon_sha256":"fd568ab532aa7efc6676ff8fcef7ab64d1c11b6badc9ffef718a5c730cbccfb9","abstract_canon_sha256":"bb6e8cc3b1b1dc6423aae863ea62de3ed5bb544b1113b5804b893d9fee6b2a5b"},"schema_version":"1.0"},"canonical_sha256":"c15fb74e4fcd42227693b875799a76f901e67452ad1ffa4c299ecf33b2885faf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.324105Z","signature_b64":"SRsjXOcFkg1TT8WueJM1NJVYapH54R4Xb1cT+6wgi243XqkvOEoch4NveF4up8dQcd5XeTzka0mtu7ZoQ729Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c15fb74e4fcd42227693b875799a76f901e67452ad1ffa4c299ecf33b2885faf","last_reissued_at":"2026-05-18T00:18:09.323479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.323479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.09455","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-05-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iq9vHJXw/s+CC8SqcfPT4DkP85kTDvO+chdWv0YIl7D1nMllDHyxme3+AFn9KOTZQas/or/glIMDIKrtkk/VBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:24:06.390937Z"},"content_sha256":"a4fc9ed20f16e7d56e4402539a0d297be9c79d6e87d944cc72b68f4e0dd74bf7","schema_version":"1.0","event_id":"sha256:a4fc9ed20f16e7d56e4402539a0d297be9c79d6e87d944cc72b68f4e0dd74bf7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YFP3OTSPZVBCE5UTXB2XTGTW7E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An abstract proximal point algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adriana Nicolae, Andrei Sipos, Laurentiu Leustean","submitted_at":"2017-11-26T20:45:51Z","abstract_excerpt":"The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions. The algorithm works by applying successively so-called \"resolvent\" mappings associated to the original object that one aims to optimize. In this paper we abstract from the corresponding resolvents employed in these problems the natural notion of jointly firmly nonexpansive families of mappings. This leads to a streamlined method of proving weak convergence of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09455","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":""},"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-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxRUaoVdOx8aqccXCRO3HdP15Y9FnTLQyd5f2QEH6ehVciXenh1BO/18C9I4qk/1zC0pC2mmDEiA3lgikMeEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:24:06.391283Z"},"content_sha256":"bcd6b663e7012c05b2deb0431e5525aff26d4516cbabb6cc0579afe739b53d68","schema_version":"1.0","event_id":"sha256:bcd6b663e7012c05b2deb0431e5525aff26d4516cbabb6cc0579afe739b53d68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFP3OTSPZVBCE5UTXB2XTGTW7E/bundle.json","state_url":"https://pith.science/pith/YFP3OTSPZVBCE5UTXB2XTGTW7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFP3OTSPZVBCE5UTXB2XTGTW7E/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-01T09:24:06Z","links":{"resolver":"https://pith.science/pith/YFP3OTSPZVBCE5UTXB2XTGTW7E","bundle":"https://pith.science/pith/YFP3OTSPZVBCE5UTXB2XTGTW7E/bundle.json","state":"https://pith.science/pith/YFP3OTSPZVBCE5UTXB2XTGTW7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFP3OTSPZVBCE5UTXB2XTGTW7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YFP3OTSPZVBCE5UTXB2XTGTW7E","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":"bb6e8cc3b1b1dc6423aae863ea62de3ed5bb544b1113b5804b893d9fee6b2a5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-26T20:45:51Z","title_canon_sha256":"fd568ab532aa7efc6676ff8fcef7ab64d1c11b6badc9ffef718a5c730cbccfb9"},"schema_version":"1.0","source":{"id":"1711.09455","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.09455","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1711.09455v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.09455","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"YFP3OTSPZVBC","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YFP3OTSPZVBCE5UT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YFP3OTSP","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:bcd6b663e7012c05b2deb0431e5525aff26d4516cbabb6cc0579afe739b53d68","target":"graph","created_at":"2026-05-18T00:18:09Z","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":"The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions. The algorithm works by applying successively so-called \"resolvent\" mappings associated to the original object that one aims to optimize. In this paper we abstract from the corresponding resolvents employed in these problems the natural notion of jointly firmly nonexpansive families of mappings. This leads to a streamlined method of proving weak convergence of","authors_text":"Adriana Nicolae, Andrei Sipos, Laurentiu Leustean","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-26T20:45:51Z","title":"An abstract proximal point algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.09455","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:a4fc9ed20f16e7d56e4402539a0d297be9c79d6e87d944cc72b68f4e0dd74bf7","target":"record","created_at":"2026-05-18T00:18:09Z","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":"bb6e8cc3b1b1dc6423aae863ea62de3ed5bb544b1113b5804b893d9fee6b2a5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-26T20:45:51Z","title_canon_sha256":"fd568ab532aa7efc6676ff8fcef7ab64d1c11b6badc9ffef718a5c730cbccfb9"},"schema_version":"1.0","source":{"id":"1711.09455","kind":"arxiv","version":2}},"canonical_sha256":"c15fb74e4fcd42227693b875799a76f901e67452ad1ffa4c299ecf33b2885faf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c15fb74e4fcd42227693b875799a76f901e67452ad1ffa4c299ecf33b2885faf","first_computed_at":"2026-05-18T00:18:09.323479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:09.323479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SRsjXOcFkg1TT8WueJM1NJVYapH54R4Xb1cT+6wgi243XqkvOEoch4NveF4up8dQcd5XeTzka0mtu7ZoQ729Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:09.324105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.09455","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4fc9ed20f16e7d56e4402539a0d297be9c79d6e87d944cc72b68f4e0dd74bf7","sha256:bcd6b663e7012c05b2deb0431e5525aff26d4516cbabb6cc0579afe739b53d68"],"state_sha256":"d9b71265bdd11828d16e8b2b47cd5ed408d6e792f9a8213203a39ce66e57d926"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IT8xiTwDJi7CO1inrpyWgosdMMMT0wliuqbG6dpN63FXOdAuJ20in87yPfaanSQAH529V8oZNxzAyQCF6jbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:24:06.393189Z","bundle_sha256":"9c0be73a87207356b3eeabb2d87d3e1cad2425b046eae0914b2dd8e97d78a949"}}