{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4JPJG6QT345PSULC7IREMU6KA6","short_pith_number":"pith:4JPJG6QT","canonical_record":{"source":{"id":"1301.0542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-01-03T20:28:20Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"76eb0d98d1b44f611b83c96f4f98e93e837dec5cb0b79d2666bc95db80ef1f56","abstract_canon_sha256":"ff8b2bab6bba5e7eebc483450dc391e64ac3391a8afe54437959ed0ec7fb455f"},"schema_version":"1.0"},"canonical_sha256":"e25e937a13df3af95162fa224653ca07b29de4f02f2c5df5f8672b80120202e7","source":{"kind":"arxiv","id":"1301.0542","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0542","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0542v3","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0542","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"4JPJG6QT345P","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4JPJG6QT345PSULC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4JPJG6QT","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4JPJG6QT345PSULC7IREMU6KA6","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-01-03T20:28:20Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"76eb0d98d1b44f611b83c96f4f98e93e837dec5cb0b79d2666bc95db80ef1f56","abstract_canon_sha256":"ff8b2bab6bba5e7eebc483450dc391e64ac3391a8afe54437959ed0ec7fb455f"},"schema_version":"1.0"},"canonical_sha256":"e25e937a13df3af95162fa224653ca07b29de4f02f2c5df5f8672b80120202e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:18.572690Z","signature_b64":"2mQb1YB09dcMQSRPTbZaQdVGVduYopz4rsrzuyDcCVjLPaE5KpoQ905uQj8RFCm3qa4Q0PMQlt0g9e2qkllGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25e937a13df3af95162fa224653ca07b29de4f02f2c5df5f8672b80120202e7","last_reissued_at":"2026-05-18T03:22:18.571951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:18.571951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0542","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-18T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pbQhGYTMbvk05XWxRVPsSHdhPEoOGxdaWvunO/ZGirMreECc42vyoRJMuaxnhGF0JiCUalrSqrx+tZ0XK4WhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:07:07.307706Z"},"content_sha256":"94ff9bf01e82b6484f14889fb68c127f3d332ac378d1ed76cb4fd282923286a3","schema_version":"1.0","event_id":"sha256:94ff9bf01e82b6484f14889fb68c127f3d332ac378d1ed76cb4fd282923286a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4JPJG6QT345PSULC7IREMU6KA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Eventual linear convergence of the Douglas Rachford iteration for basis pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.NA","authors_text":"Laurent Demanet, Xiangxiong Zhang","submitted_at":"2013-01-03T20:28:20Z","abstract_excerpt":"We provide a simple analysis of the Douglas-Rachford splitting algorithm in the context of $\\ell^1$ minimization with linear constraints, and quantify the asymptotic linear convergence rate in terms of principal angles between relevant vector spaces. In the compressed sensing setting, we show how to bound this rate in terms of the restricted isometry constant. More general iterative schemes obtained by $\\ell^2$-regularization and over-relaxation including the dual split Bregman method are also treated, which answers the question how to choose the relaxation and soft-thresholding parameters to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0542","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-18T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0S/hVmvGGhR9I4yOPC4KN0mg5l1/nLWBQ2t5qINjzx8LT5hdjJGjPh2fxSbdfDsIaUABUyJab34YDzhgHSvBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:07:07.308055Z"},"content_sha256":"421a6746971773d531f51b3c657183f5240b3c80e6a4c28be5fc67ad03fc59bd","schema_version":"1.0","event_id":"sha256:421a6746971773d531f51b3c657183f5240b3c80e6a4c28be5fc67ad03fc59bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JPJG6QT345PSULC7IREMU6KA6/bundle.json","state_url":"https://pith.science/pith/4JPJG6QT345PSULC7IREMU6KA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JPJG6QT345PSULC7IREMU6KA6/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-01T12:07:07Z","links":{"resolver":"https://pith.science/pith/4JPJG6QT345PSULC7IREMU6KA6","bundle":"https://pith.science/pith/4JPJG6QT345PSULC7IREMU6KA6/bundle.json","state":"https://pith.science/pith/4JPJG6QT345PSULC7IREMU6KA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JPJG6QT345PSULC7IREMU6KA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4JPJG6QT345PSULC7IREMU6KA6","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":"ff8b2bab6bba5e7eebc483450dc391e64ac3391a8afe54437959ed0ec7fb455f","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-01-03T20:28:20Z","title_canon_sha256":"76eb0d98d1b44f611b83c96f4f98e93e837dec5cb0b79d2666bc95db80ef1f56"},"schema_version":"1.0","source":{"id":"1301.0542","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0542","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0542v3","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0542","created_at":"2026-05-18T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"4JPJG6QT345P","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4JPJG6QT345PSULC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4JPJG6QT","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:421a6746971773d531f51b3c657183f5240b3c80e6a4c28be5fc67ad03fc59bd","target":"graph","created_at":"2026-05-18T03:22:18Z","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":"We provide a simple analysis of the Douglas-Rachford splitting algorithm in the context of $\\ell^1$ minimization with linear constraints, and quantify the asymptotic linear convergence rate in terms of principal angles between relevant vector spaces. In the compressed sensing setting, we show how to bound this rate in terms of the restricted isometry constant. More general iterative schemes obtained by $\\ell^2$-regularization and over-relaxation including the dual split Bregman method are also treated, which answers the question how to choose the relaxation and soft-thresholding parameters to ","authors_text":"Laurent Demanet, Xiangxiong Zhang","cross_cats":["cs.IT","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-01-03T20:28:20Z","title":"Eventual linear convergence of the Douglas Rachford iteration for basis pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0542","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:94ff9bf01e82b6484f14889fb68c127f3d332ac378d1ed76cb4fd282923286a3","target":"record","created_at":"2026-05-18T03:22:18Z","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":"ff8b2bab6bba5e7eebc483450dc391e64ac3391a8afe54437959ed0ec7fb455f","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-01-03T20:28:20Z","title_canon_sha256":"76eb0d98d1b44f611b83c96f4f98e93e837dec5cb0b79d2666bc95db80ef1f56"},"schema_version":"1.0","source":{"id":"1301.0542","kind":"arxiv","version":3}},"canonical_sha256":"e25e937a13df3af95162fa224653ca07b29de4f02f2c5df5f8672b80120202e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e25e937a13df3af95162fa224653ca07b29de4f02f2c5df5f8672b80120202e7","first_computed_at":"2026-05-18T03:22:18.571951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:18.571951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2mQb1YB09dcMQSRPTbZaQdVGVduYopz4rsrzuyDcCVjLPaE5KpoQ905uQj8RFCm3qa4Q0PMQlt0g9e2qkllGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:18.572690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0542","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94ff9bf01e82b6484f14889fb68c127f3d332ac378d1ed76cb4fd282923286a3","sha256:421a6746971773d531f51b3c657183f5240b3c80e6a4c28be5fc67ad03fc59bd"],"state_sha256":"e4541207eba7f20c3023480ed759bd974e2e8d7db961905a48be3346abd853ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FefnQrBZFn2maOqVTdZWEyzqKTqd3zNs+zdLkBS+C92guRh0QD/8AiIey58bVauE/TAosZu7A6bh2nQZVmlpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:07:07.310376Z","bundle_sha256":"704705b12382d0837ee0df32e77517af5afdca5717cb6c6373374290ec49321c"}}