{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GUW67BQ5ILYUHM3ERQHEKWLIIO","short_pith_number":"pith:GUW67BQ5","canonical_record":{"source":{"id":"2207.12891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-26T13:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"3c0f7fdb6575a9655f496e87326712610fce28e53f7d702a1709ca6a4fd29625","abstract_canon_sha256":"0bc4a2dbd8f8d4bf99c43dfcef23094943ea21f70fac4f676b82e75efbfc0d62"},"schema_version":"1.0"},"canonical_sha256":"352def861d42f143b3648c0e455968439552c9f504674b4ccc49f58cf89da95a","source":{"kind":"arxiv","id":"2207.12891","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.12891","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"arxiv_version","alias_value":"2207.12891v3","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.12891","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"pith_short_12","alias_value":"GUW67BQ5ILYU","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"pith_short_16","alias_value":"GUW67BQ5ILYUHM3E","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"pith_short_8","alias_value":"GUW67BQ5","created_at":"2026-07-05T05:48:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GUW67BQ5ILYUHM3ERQHEKWLIIO","target":"record","payload":{"canonical_record":{"source":{"id":"2207.12891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-26T13:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"3c0f7fdb6575a9655f496e87326712610fce28e53f7d702a1709ca6a4fd29625","abstract_canon_sha256":"0bc4a2dbd8f8d4bf99c43dfcef23094943ea21f70fac4f676b82e75efbfc0d62"},"schema_version":"1.0"},"canonical_sha256":"352def861d42f143b3648c0e455968439552c9f504674b4ccc49f58cf89da95a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:48:36.083778Z","signature_b64":"V+/9QbDVlHnVhYxjsltOjHFw4fxwgf5kkA9GcZ5/EkUu79ZVD7RB44FkIxfNHw8F8n8J3HGiHR1f4QHOLf8PCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"352def861d42f143b3648c0e455968439552c9f504674b4ccc49f58cf89da95a","last_reissued_at":"2026-07-05T05:48:36.083072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:48:36.083072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.12891","source_version":3,"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:48:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ASlCImmgsZZummV5VOTLULMbZGg6D8Q+chtCUlFQC7sbq1jdqmpmEuMrVRra/AZcxhtSaiB5H+/DRZRU90XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:29:47.509099Z"},"content_sha256":"8f565659f5ffd722b6607755a44155a9992628843bdcc85fe92c0e39d93340e4","schema_version":"1.0","event_id":"sha256:8f565659f5ffd722b6607755a44155a9992628843bdcc85fe92c0e39d93340e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GUW67BQ5ILYUHM3ERQHEKWLIIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RandProx: Primal-Dual Optimization Algorithms with Randomized Proximal Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laurent Condat, Peter Richt\\'arik","submitted_at":"2022-07-26T13:37:21Z","abstract_excerpt":"Proximal splitting algorithms are well suited to solving large-scale nonsmooth optimization problems, in particular those arising in machine learning. We propose a new primal-dual algorithm, in which the dual update is randomized; equivalently, the proximity operator of one of the function in the problem is replaced by a stochastic oracle. For instance, some randomly chosen dual variables, instead of all, are updated at each iteration. Or, the proximity operator of a function is called with some small probability only. A nonsmooth variance-reduction technique is implemented so that the algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.12891","kind":"arxiv","version":3},"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/2207.12891/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:48:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBy1HhrECjHNQhSppZB0RAWPV4/iHbImE0fKNCIS1OyMVHKeywRQYnDlNJn55e1mjKz4/IoPH4K7WbXsv/kIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:29:47.509633Z"},"content_sha256":"74c66300b6a68a424434bdf8b375708dd9c7510e7d3f2614ad8d8d93d08590d8","schema_version":"1.0","event_id":"sha256:74c66300b6a68a424434bdf8b375708dd9c7510e7d3f2614ad8d8d93d08590d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUW67BQ5ILYUHM3ERQHEKWLIIO/bundle.json","state_url":"https://pith.science/pith/GUW67BQ5ILYUHM3ERQHEKWLIIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUW67BQ5ILYUHM3ERQHEKWLIIO/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-04T18:29:47Z","links":{"resolver":"https://pith.science/pith/GUW67BQ5ILYUHM3ERQHEKWLIIO","bundle":"https://pith.science/pith/GUW67BQ5ILYUHM3ERQHEKWLIIO/bundle.json","state":"https://pith.science/pith/GUW67BQ5ILYUHM3ERQHEKWLIIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUW67BQ5ILYUHM3ERQHEKWLIIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GUW67BQ5ILYUHM3ERQHEKWLIIO","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":"0bc4a2dbd8f8d4bf99c43dfcef23094943ea21f70fac4f676b82e75efbfc0d62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-26T13:37:21Z","title_canon_sha256":"3c0f7fdb6575a9655f496e87326712610fce28e53f7d702a1709ca6a4fd29625"},"schema_version":"1.0","source":{"id":"2207.12891","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.12891","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"arxiv_version","alias_value":"2207.12891v3","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.12891","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"pith_short_12","alias_value":"GUW67BQ5ILYU","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"pith_short_16","alias_value":"GUW67BQ5ILYUHM3E","created_at":"2026-07-05T05:48:36Z"},{"alias_kind":"pith_short_8","alias_value":"GUW67BQ5","created_at":"2026-07-05T05:48:36Z"}],"graph_snapshots":[{"event_id":"sha256:74c66300b6a68a424434bdf8b375708dd9c7510e7d3f2614ad8d8d93d08590d8","target":"graph","created_at":"2026-07-05T05:48:36Z","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/2207.12891/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Proximal splitting algorithms are well suited to solving large-scale nonsmooth optimization problems, in particular those arising in machine learning. We propose a new primal-dual algorithm, in which the dual update is randomized; equivalently, the proximity operator of one of the function in the problem is replaced by a stochastic oracle. For instance, some randomly chosen dual variables, instead of all, are updated at each iteration. Or, the proximity operator of a function is called with some small probability only. A nonsmooth variance-reduction technique is implemented so that the algorit","authors_text":"Laurent Condat, Peter Richt\\'arik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-26T13:37:21Z","title":"RandProx: Primal-Dual Optimization Algorithms with Randomized Proximal Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.12891","kind":"arxiv","version":3},"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:8f565659f5ffd722b6607755a44155a9992628843bdcc85fe92c0e39d93340e4","target":"record","created_at":"2026-07-05T05:48:36Z","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":"0bc4a2dbd8f8d4bf99c43dfcef23094943ea21f70fac4f676b82e75efbfc0d62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-07-26T13:37:21Z","title_canon_sha256":"3c0f7fdb6575a9655f496e87326712610fce28e53f7d702a1709ca6a4fd29625"},"schema_version":"1.0","source":{"id":"2207.12891","kind":"arxiv","version":3}},"canonical_sha256":"352def861d42f143b3648c0e455968439552c9f504674b4ccc49f58cf89da95a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"352def861d42f143b3648c0e455968439552c9f504674b4ccc49f58cf89da95a","first_computed_at":"2026-07-05T05:48:36.083072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:48:36.083072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+/9QbDVlHnVhYxjsltOjHFw4fxwgf5kkA9GcZ5/EkUu79ZVD7RB44FkIxfNHw8F8n8J3HGiHR1f4QHOLf8PCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:48:36.083778Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.12891","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f565659f5ffd722b6607755a44155a9992628843bdcc85fe92c0e39d93340e4","sha256:74c66300b6a68a424434bdf8b375708dd9c7510e7d3f2614ad8d8d93d08590d8"],"state_sha256":"8c97c814d5d51f0f67b107121fdfdd7e51b067a3e589636c806afcb953f3fa33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mirhiERTicdaMUGMtfsZEPX37oh3LtR6iwilwh9eWfR4gyEZHsV2RmiCoL8nSFrFBjdOhnldGZRMJJD0ghY1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T18:29:47.513893Z","bundle_sha256":"4ef92fd179441c37699e68a7fda5fcdb0b0fe73a3308ef11e3792268dda13eed"}}