{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PXERLM5ZPLQSTLE3DEW7SWGTUJ","short_pith_number":"pith:PXERLM5Z","canonical_record":{"source":{"id":"1408.4419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T18:32:30Z","cross_cats_sorted":[],"title_canon_sha256":"e8a5f455701b5c10972beaf8f22213abc5cf4c2412fe32bd110f909053589818","abstract_canon_sha256":"dd2c0c251d48451509c3c7f0f8de840368c9bca381120f1277dc9ffed7b80ec5"},"schema_version":"1.0"},"canonical_sha256":"7dc915b3b97ae129ac9b192df958d3a256fe173aed1e0e41d5a661ec3851d00e","source":{"kind":"arxiv","id":"1408.4419","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4419","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4419v3","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4419","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"PXERLM5ZPLQS","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PXERLM5ZPLQSTLE3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PXERLM5Z","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PXERLM5ZPLQSTLE3DEW7SWGTUJ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4419","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T18:32:30Z","cross_cats_sorted":[],"title_canon_sha256":"e8a5f455701b5c10972beaf8f22213abc5cf4c2412fe32bd110f909053589818","abstract_canon_sha256":"dd2c0c251d48451509c3c7f0f8de840368c9bca381120f1277dc9ffed7b80ec5"},"schema_version":"1.0"},"canonical_sha256":"7dc915b3b97ae129ac9b192df958d3a256fe173aed1e0e41d5a661ec3851d00e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:07.218180Z","signature_b64":"jdf4cXN82RoWKCsuOVytalUMnVcW03At7KPCRX50MoazAi0BJ6XAE5QF3bSMsQ4dmhwFxOx06B+NfOTnBrKVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dc915b3b97ae129ac9b192df958d3a256fe173aed1e0e41d5a661ec3851d00e","last_reissued_at":"2026-05-18T01:36:07.217643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:07.217643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4419","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-05-18T01:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ol12ZoLujTDZPW/lrGCYdWm990H+fjB86RUcum9axUPWmSl5Haxn7tQ3tlDocL47zIm4eQLojSL/bIbj2YqrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:47:05.191590Z"},"content_sha256":"fbf0dd45dde5cf88ae31ce98f329c6d31699d18748ab585f6cbec85ee093a5ff","schema_version":"1.0","event_id":"sha256:fbf0dd45dde5cf88ae31ce98f329c6d31699d18748ab585f6cbec85ee093a5ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PXERLM5ZPLQSTLE3DEW7SWGTUJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence rate analysis of primal-dual splitting schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Damek Davis","submitted_at":"2014-08-19T18:32:30Z","abstract_excerpt":"Primal-dual splitting schemes are a class of powerful algorithms that solve complicated monotone inclusions and convex optimization problems that are built from many simpler pieces. They decompose problems that are built from sums, linear compositions, and infimal convolutions of simple functions so that each simple term is processed individually via proximal mappings, gradient mappings, and multiplications by the linear maps. This leads to easily implementable and highly parallelizable or distributed algorithms, which often obtain nearly state-of-the-art performance. In this paper, we analyze"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4419","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":""},"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-18T01:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldGIBTNg6sWQ2roR4wdNOJns6tJuLEWgkKpSo58TVzvv4u5lKRF5RAEyGtcOqs3Enjo5zdcHbHWLFK4H7ACHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:47:05.191934Z"},"content_sha256":"9b890bb2b1ee09dad6b4c76a0decb007ff5610ce7d9af5b16ee3c787ab55105a","schema_version":"1.0","event_id":"sha256:9b890bb2b1ee09dad6b4c76a0decb007ff5610ce7d9af5b16ee3c787ab55105a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXERLM5ZPLQSTLE3DEW7SWGTUJ/bundle.json","state_url":"https://pith.science/pith/PXERLM5ZPLQSTLE3DEW7SWGTUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXERLM5ZPLQSTLE3DEW7SWGTUJ/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-27T16:47:05Z","links":{"resolver":"https://pith.science/pith/PXERLM5ZPLQSTLE3DEW7SWGTUJ","bundle":"https://pith.science/pith/PXERLM5ZPLQSTLE3DEW7SWGTUJ/bundle.json","state":"https://pith.science/pith/PXERLM5ZPLQSTLE3DEW7SWGTUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXERLM5ZPLQSTLE3DEW7SWGTUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PXERLM5ZPLQSTLE3DEW7SWGTUJ","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":"dd2c0c251d48451509c3c7f0f8de840368c9bca381120f1277dc9ffed7b80ec5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T18:32:30Z","title_canon_sha256":"e8a5f455701b5c10972beaf8f22213abc5cf4c2412fe32bd110f909053589818"},"schema_version":"1.0","source":{"id":"1408.4419","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4419","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4419v3","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4419","created_at":"2026-05-18T01:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"PXERLM5ZPLQS","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PXERLM5ZPLQSTLE3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PXERLM5Z","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:9b890bb2b1ee09dad6b4c76a0decb007ff5610ce7d9af5b16ee3c787ab55105a","target":"graph","created_at":"2026-05-18T01:36:07Z","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":"Primal-dual splitting schemes are a class of powerful algorithms that solve complicated monotone inclusions and convex optimization problems that are built from many simpler pieces. They decompose problems that are built from sums, linear compositions, and infimal convolutions of simple functions so that each simple term is processed individually via proximal mappings, gradient mappings, and multiplications by the linear maps. This leads to easily implementable and highly parallelizable or distributed algorithms, which often obtain nearly state-of-the-art performance. In this paper, we analyze","authors_text":"Damek Davis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T18:32:30Z","title":"Convergence rate analysis of primal-dual splitting schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4419","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:fbf0dd45dde5cf88ae31ce98f329c6d31699d18748ab585f6cbec85ee093a5ff","target":"record","created_at":"2026-05-18T01:36:07Z","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":"dd2c0c251d48451509c3c7f0f8de840368c9bca381120f1277dc9ffed7b80ec5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-19T18:32:30Z","title_canon_sha256":"e8a5f455701b5c10972beaf8f22213abc5cf4c2412fe32bd110f909053589818"},"schema_version":"1.0","source":{"id":"1408.4419","kind":"arxiv","version":3}},"canonical_sha256":"7dc915b3b97ae129ac9b192df958d3a256fe173aed1e0e41d5a661ec3851d00e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dc915b3b97ae129ac9b192df958d3a256fe173aed1e0e41d5a661ec3851d00e","first_computed_at":"2026-05-18T01:36:07.217643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:07.217643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jdf4cXN82RoWKCsuOVytalUMnVcW03At7KPCRX50MoazAi0BJ6XAE5QF3bSMsQ4dmhwFxOx06B+NfOTnBrKVDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:07.218180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4419","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbf0dd45dde5cf88ae31ce98f329c6d31699d18748ab585f6cbec85ee093a5ff","sha256:9b890bb2b1ee09dad6b4c76a0decb007ff5610ce7d9af5b16ee3c787ab55105a"],"state_sha256":"ab8f8f2de215689a56ab7b1527bf8ef03afd81e048accb3bd92ef3ce3a6a073f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xgcTp/S2UEZS+E4JNzTzenaCt7SQC7Gj7An+br1QlU39aG/JpjKlXTaqHKjvfrlZsWUI9Zcj7tJ9f883w86AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:47:05.193809Z","bundle_sha256":"557b685f134e4c374f6fc62777620d24ca6be49ee7d2e63a72624d11ab3f9874"}}