{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SOIO6Z3KTBTUNDNY5UGCZYXJ65","short_pith_number":"pith:SOIO6Z3K","canonical_record":{"source":{"id":"1410.8479","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-30T18:11:47Z","cross_cats_sorted":[],"title_canon_sha256":"1a52232c736cbebbffe78815bc14db2e33d417dab5163c647692d1c0724c17fc","abstract_canon_sha256":"b456fd324e48b119c35447a86d30770df5e1a8afdc75c487d5e4bc02e8aaddc7"},"schema_version":"1.0"},"canonical_sha256":"9390ef676a9867468db8ed0c2ce2e9f740627b919606838acdd9c1a101d32fde","source":{"kind":"arxiv","id":"1410.8479","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8479","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8479v5","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8479","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"SOIO6Z3KTBTU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SOIO6Z3KTBTUNDNY","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SOIO6Z3K","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SOIO6Z3KTBTUNDNY5UGCZYXJ65","target":"record","payload":{"canonical_record":{"source":{"id":"1410.8479","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-30T18:11:47Z","cross_cats_sorted":[],"title_canon_sha256":"1a52232c736cbebbffe78815bc14db2e33d417dab5163c647692d1c0724c17fc","abstract_canon_sha256":"b456fd324e48b119c35447a86d30770df5e1a8afdc75c487d5e4bc02e8aaddc7"},"schema_version":"1.0"},"canonical_sha256":"9390ef676a9867468db8ed0c2ce2e9f740627b919606838acdd9c1a101d32fde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:20.786139Z","signature_b64":"jFTcpEaRX7JtrMT7Y7JoODSODiHha0JOhNmRkTlUb52nlsi9F6h5YH8yaqpAWf4bC1gDKQtgkPdP3t+MJd8PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9390ef676a9867468db8ed0c2ce2e9f740627b919606838acdd9c1a101d32fde","last_reissued_at":"2026-05-18T01:17:20.785473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:20.785473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.8479","source_version":5,"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:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vk+b2SCmDlg4182q9ptXUeJGj4SyWPcgXRyWstpHAswvp/0nGuwHAI3+TJKYaaWARec4vCgGpNnDiiTAkkOOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:55:48.539688Z"},"content_sha256":"6cff1662bb8ee7366b983f7cd12f2ffa2d5c3882e9fab638a6dfec5add4a2c23","schema_version":"1.0","event_id":"sha256:6cff1662bb8ee7366b983f7cd12f2ffa2d5c3882e9fab638a6dfec5add4a2c23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SOIO6Z3KTBTUNDNY5UGCZYXJ65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pontus Giselsson, Stephen Boyd","submitted_at":"2014-10-30T18:11:47Z","abstract_excerpt":"Recently, several convergence rate results for Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) have been presented in the literature. In this paper, we show global linear convergence rate bounds for Douglas-Rachford splitting and ADMM under strong convexity and smoothness assumptions. We further show that the rate bounds are tight for the class of problems under consideration for all feasible algorithm parameters. For problems that satisfy the assumptions, we show how to select step-size and metric for the algorithm that optimize the derived convergence ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8479","kind":"arxiv","version":5},"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:17:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JextE2E76U6hM4oop6seytozcLSE5gFv0be3ToEgsq2Rc+D7z7gNV6mEGnlSIodxDTsP+aBcqrsf3XHbrQ4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:55:48.540092Z"},"content_sha256":"07ad5def18d3429e456d4cadc150274895eecf4e3e52fcd086b0f0772996de6e","schema_version":"1.0","event_id":"sha256:07ad5def18d3429e456d4cadc150274895eecf4e3e52fcd086b0f0772996de6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOIO6Z3KTBTUNDNY5UGCZYXJ65/bundle.json","state_url":"https://pith.science/pith/SOIO6Z3KTBTUNDNY5UGCZYXJ65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOIO6Z3KTBTUNDNY5UGCZYXJ65/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-05-30T23:55:48Z","links":{"resolver":"https://pith.science/pith/SOIO6Z3KTBTUNDNY5UGCZYXJ65","bundle":"https://pith.science/pith/SOIO6Z3KTBTUNDNY5UGCZYXJ65/bundle.json","state":"https://pith.science/pith/SOIO6Z3KTBTUNDNY5UGCZYXJ65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOIO6Z3KTBTUNDNY5UGCZYXJ65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SOIO6Z3KTBTUNDNY5UGCZYXJ65","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":"b456fd324e48b119c35447a86d30770df5e1a8afdc75c487d5e4bc02e8aaddc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-30T18:11:47Z","title_canon_sha256":"1a52232c736cbebbffe78815bc14db2e33d417dab5163c647692d1c0724c17fc"},"schema_version":"1.0","source":{"id":"1410.8479","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8479","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8479v5","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8479","created_at":"2026-05-18T01:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"SOIO6Z3KTBTU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SOIO6Z3KTBTUNDNY","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SOIO6Z3K","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:07ad5def18d3429e456d4cadc150274895eecf4e3e52fcd086b0f0772996de6e","target":"graph","created_at":"2026-05-18T01:17:20Z","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":"Recently, several convergence rate results for Douglas-Rachford splitting and the alternating direction method of multipliers (ADMM) have been presented in the literature. In this paper, we show global linear convergence rate bounds for Douglas-Rachford splitting and ADMM under strong convexity and smoothness assumptions. We further show that the rate bounds are tight for the class of problems under consideration for all feasible algorithm parameters. For problems that satisfy the assumptions, we show how to select step-size and metric for the algorithm that optimize the derived convergence ra","authors_text":"Pontus Giselsson, Stephen Boyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-30T18:11:47Z","title":"Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8479","kind":"arxiv","version":5},"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:6cff1662bb8ee7366b983f7cd12f2ffa2d5c3882e9fab638a6dfec5add4a2c23","target":"record","created_at":"2026-05-18T01:17:20Z","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":"b456fd324e48b119c35447a86d30770df5e1a8afdc75c487d5e4bc02e8aaddc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-10-30T18:11:47Z","title_canon_sha256":"1a52232c736cbebbffe78815bc14db2e33d417dab5163c647692d1c0724c17fc"},"schema_version":"1.0","source":{"id":"1410.8479","kind":"arxiv","version":5}},"canonical_sha256":"9390ef676a9867468db8ed0c2ce2e9f740627b919606838acdd9c1a101d32fde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9390ef676a9867468db8ed0c2ce2e9f740627b919606838acdd9c1a101d32fde","first_computed_at":"2026-05-18T01:17:20.785473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:20.785473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jFTcpEaRX7JtrMT7Y7JoODSODiHha0JOhNmRkTlUb52nlsi9F6h5YH8yaqpAWf4bC1gDKQtgkPdP3t+MJd8PAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:20.786139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8479","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cff1662bb8ee7366b983f7cd12f2ffa2d5c3882e9fab638a6dfec5add4a2c23","sha256:07ad5def18d3429e456d4cadc150274895eecf4e3e52fcd086b0f0772996de6e"],"state_sha256":"f631320033e3ebac12ac4d3d8f7d805eadac8f2a61b1fb2c1eeeb529b23fcf74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kS6lUpaFs8DMakBurNh18OkeP7cL8BkDnqgoFmADEfsYWVFNpiGh1HY/lKFPQIgMhX26IMPIUzotQwZw3Tp1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:55:48.542801Z","bundle_sha256":"c255d995929a1e6490e4b18adea01650ddcc71f33bad5c514cc07eddb2773855"}}