{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EUIY7HXUACMNFXI66PRDQGR744","short_pith_number":"pith:EUIY7HXU","canonical_record":{"source":{"id":"1912.00137","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-30T06:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"5b36af15444183a3ac74e2b5023b49edb6cabffe4694fd6454efccc963f938a4","abstract_canon_sha256":"b118ab96336e5336508c38775183f6f92c69b56efdc73c889e3486c076afd5b8"},"schema_version":"1.0"},"canonical_sha256":"25118f9ef40098d2dd1ef3e2381a3fe709804c159a3eaa810e597afc8f560271","source":{"kind":"arxiv","id":"1912.00137","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.00137","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1912.00137v8","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00137","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"EUIY7HXUACMN","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"pith_short_16","alias_value":"EUIY7HXUACMNFXI6","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"pith_short_8","alias_value":"EUIY7HXU","created_at":"2026-07-05T05:45:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EUIY7HXUACMNFXI66PRDQGR744","target":"record","payload":{"canonical_record":{"source":{"id":"1912.00137","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-30T06:06:08Z","cross_cats_sorted":[],"title_canon_sha256":"5b36af15444183a3ac74e2b5023b49edb6cabffe4694fd6454efccc963f938a4","abstract_canon_sha256":"b118ab96336e5336508c38775183f6f92c69b56efdc73c889e3486c076afd5b8"},"schema_version":"1.0"},"canonical_sha256":"25118f9ef40098d2dd1ef3e2381a3fe709804c159a3eaa810e597afc8f560271","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:02.138527Z","signature_b64":"lgh7DsGmQI65W8APPSSwMpZ/reOSS81LzLCmcBQ2lv6Zt43llbaZsT1+clLpw590rQXqxzT8u3XhPm/8pa9ICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25118f9ef40098d2dd1ef3e2381a3fe709804c159a3eaa810e597afc8f560271","last_reissued_at":"2026-07-05T05:45:02.138059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:02.138059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1912.00137","source_version":8,"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-05T05:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9v9C9wx9Q+IXivCNKhMErQUHkjSlZokPfZcszjmpbOsCMJS1LfEgHHQdDNMJHhJyZhd2LvDKaXd2qv4g3QIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:37:54.181990Z"},"content_sha256":"12b56433893a80a1f9b89e3796e7465dac3f01aed34fb8cde530e4c609aeaf82","schema_version":"1.0","event_id":"sha256:12b56433893a80a1f9b89e3796e7465dac3f01aed34fb8cde530e4c609aeaf82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EUIY7HXUACMNFXI66PRDQGR744","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akira Hirabayashi, Andr\\'es Contreras, Daichi Kitahara, Laurent Condat","submitted_at":"2019-11-30T06:06:08Z","abstract_excerpt":"Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they consist of simple operations, handling the terms in the objective function separately. In this overview, we demystify a selection of recent proximal splitting algorithms: we present them within a unified framework, which consists in applying splitting methods for monotone inclusions in primal-dual product spaces, with well-chosen metrics. Along the way, we ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00137","kind":"arxiv","version":8},"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/1912.00137/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-05T05:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xpl+UXbvFrdSbn/i2Rju0ukjGltOPmu9/Dcpn6kOvAXVX5SBztI9qmVyVe+UoaWWXjDyP+91v53QkhYfLtIGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:37:54.182559Z"},"content_sha256":"4abe82dcb66aacab8cd3077f8a8b2fb47901cfc9ed59c57143d7010ce357c304","schema_version":"1.0","event_id":"sha256:4abe82dcb66aacab8cd3077f8a8b2fb47901cfc9ed59c57143d7010ce357c304"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EUIY7HXUACMNFXI66PRDQGR744/bundle.json","state_url":"https://pith.science/pith/EUIY7HXUACMNFXI66PRDQGR744/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EUIY7HXUACMNFXI66PRDQGR744/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-16T12:37:54Z","links":{"resolver":"https://pith.science/pith/EUIY7HXUACMNFXI66PRDQGR744","bundle":"https://pith.science/pith/EUIY7HXUACMNFXI66PRDQGR744/bundle.json","state":"https://pith.science/pith/EUIY7HXUACMNFXI66PRDQGR744/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EUIY7HXUACMNFXI66PRDQGR744/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EUIY7HXUACMNFXI66PRDQGR744","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":"b118ab96336e5336508c38775183f6f92c69b56efdc73c889e3486c076afd5b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-30T06:06:08Z","title_canon_sha256":"5b36af15444183a3ac74e2b5023b49edb6cabffe4694fd6454efccc963f938a4"},"schema_version":"1.0","source":{"id":"1912.00137","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.00137","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1912.00137v8","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.00137","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"EUIY7HXUACMN","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"pith_short_16","alias_value":"EUIY7HXUACMNFXI6","created_at":"2026-07-05T05:45:02Z"},{"alias_kind":"pith_short_8","alias_value":"EUIY7HXU","created_at":"2026-07-05T05:45:02Z"}],"graph_snapshots":[{"event_id":"sha256:4abe82dcb66aacab8cd3077f8a8b2fb47901cfc9ed59c57143d7010ce357c304","target":"graph","created_at":"2026-07-05T05:45:02Z","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/1912.00137/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they consist of simple operations, handling the terms in the objective function separately. In this overview, we demystify a selection of recent proximal splitting algorithms: we present them within a unified framework, which consists in applying splitting methods for monotone inclusions in primal-dual product spaces, with well-chosen metrics. Along the way, we ea","authors_text":"Akira Hirabayashi, Andr\\'es Contreras, Daichi Kitahara, Laurent Condat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-30T06:06:08Z","title":"Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.00137","kind":"arxiv","version":8},"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:12b56433893a80a1f9b89e3796e7465dac3f01aed34fb8cde530e4c609aeaf82","target":"record","created_at":"2026-07-05T05:45:02Z","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":"b118ab96336e5336508c38775183f6f92c69b56efdc73c889e3486c076afd5b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-30T06:06:08Z","title_canon_sha256":"5b36af15444183a3ac74e2b5023b49edb6cabffe4694fd6454efccc963f938a4"},"schema_version":"1.0","source":{"id":"1912.00137","kind":"arxiv","version":8}},"canonical_sha256":"25118f9ef40098d2dd1ef3e2381a3fe709804c159a3eaa810e597afc8f560271","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25118f9ef40098d2dd1ef3e2381a3fe709804c159a3eaa810e597afc8f560271","first_computed_at":"2026-07-05T05:45:02.138059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:02.138059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lgh7DsGmQI65W8APPSSwMpZ/reOSS81LzLCmcBQ2lv6Zt43llbaZsT1+clLpw590rQXqxzT8u3XhPm/8pa9ICA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:02.138527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.00137","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12b56433893a80a1f9b89e3796e7465dac3f01aed34fb8cde530e4c609aeaf82","sha256:4abe82dcb66aacab8cd3077f8a8b2fb47901cfc9ed59c57143d7010ce357c304"],"state_sha256":"7f54c8c50da9faeb8843b44194622f748bcba9b05ba5d22f65763eb6782642a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4aFjP08iJQ8K6keohSCadBzPhVniAl2gha3eZg3OyIWjMXChLvnPsvsY6ynDxSWmMKxl7JO/TYjTqCXI0coAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:37:54.186741Z","bundle_sha256":"3d120b5577d27f0e54665c8410f9f2f5e3303044d9200de1241109e309ddd78c"}}