{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UJIJQCHUO6PWRQNGUKOHGHPZOG","short_pith_number":"pith:UJIJQCHU","canonical_record":{"source":{"id":"1908.11482","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-29T23:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"7f6df5eba642f9b219009a9d864448c010b35acf4ef20fe390b1811d23cd289c","abstract_canon_sha256":"c1aba893b4c494894fe67ff5178f0b7019a8f3d2c03365caf709ed50b9b46dc7"},"schema_version":"1.0"},"canonical_sha256":"a2509808f4779f68c1a6a29c731df97185f2c4066c912a117930bcdc5eb9a8fb","source":{"kind":"arxiv","id":"1908.11482","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11482","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11482v4","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11482","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"UJIJQCHUO6PW","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"pith_short_16","alias_value":"UJIJQCHUO6PWRQNG","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"pith_short_8","alias_value":"UJIJQCHU","created_at":"2026-07-05T01:51:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UJIJQCHUO6PWRQNGUKOHGHPZOG","target":"record","payload":{"canonical_record":{"source":{"id":"1908.11482","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-29T23:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"7f6df5eba642f9b219009a9d864448c010b35acf4ef20fe390b1811d23cd289c","abstract_canon_sha256":"c1aba893b4c494894fe67ff5178f0b7019a8f3d2c03365caf709ed50b9b46dc7"},"schema_version":"1.0"},"canonical_sha256":"a2509808f4779f68c1a6a29c731df97185f2c4066c912a117930bcdc5eb9a8fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:59.114912Z","signature_b64":"/btQnQbyjzgKBNgqbLVLgOCi0om6+z1/OKuHnpHALXSwM+/L5PGffoShH/+AZNo13NGWzKdcoE7Lc/11E6ruCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2509808f4779f68c1a6a29c731df97185f2c4066c912a117930bcdc5eb9a8fb","last_reissued_at":"2026-07-05T01:51:59.114475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:59.114475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.11482","source_version":4,"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-05T01:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsTcoreO36YWSREssI2O6Ery8Wv2Y8AHj35YyOvtStgRecg1C7Pi01YqcCBBGzlyJyZ4gBR27jA+2DhL6iL5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:08:07.714166Z"},"content_sha256":"33610ebe421240c516664198e4c65463bc6493cd007263ea5ce82ee2c681238a","schema_version":"1.0","event_id":"sha256:33610ebe421240c516664198e4c65463bc6493cd007263ea5ce82ee2c681238a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UJIJQCHUO6PWRQNGUKOHGHPZOG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anderson Accelerated Douglas-Rachford Splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anqi Fu, Junzi Zhang, Stephen Boyd","submitted_at":"2019-08-29T23:47:38Z","abstract_excerpt":"We consider the problem of non-smooth convex optimization with linear equality constraints, where the objective function is only accessible through its proximal operator. This problem arises in many different fields such as statistical learning, computational imaging, telecommunications, and optimal control. To solve it, we propose an Anderson accelerated Douglas-Rachford splitting (A2DR) algorithm, which we show either globally converges or provides a certificate of infeasibility/unboundedness under very mild conditions. Applied to a block separable objective, A2DR partially decouples so that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11482","kind":"arxiv","version":4},"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/1908.11482/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-05T01:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaHYEmuEBXs8m+9jQ0tmZPGsNJTQm8AF529BuwnRQUJaJBPgGrbid7w8iENWgg5Fw9UyWPMfob82H/vosHFVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T05:08:07.715195Z"},"content_sha256":"c1dcd34bd96c53360492c2f5b9cf67b74f9c2ea1f7af1dfd77235462ffb67310","schema_version":"1.0","event_id":"sha256:c1dcd34bd96c53360492c2f5b9cf67b74f9c2ea1f7af1dfd77235462ffb67310"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJIJQCHUO6PWRQNGUKOHGHPZOG/bundle.json","state_url":"https://pith.science/pith/UJIJQCHUO6PWRQNGUKOHGHPZOG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJIJQCHUO6PWRQNGUKOHGHPZOG/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-23T05:08:07Z","links":{"resolver":"https://pith.science/pith/UJIJQCHUO6PWRQNGUKOHGHPZOG","bundle":"https://pith.science/pith/UJIJQCHUO6PWRQNGUKOHGHPZOG/bundle.json","state":"https://pith.science/pith/UJIJQCHUO6PWRQNGUKOHGHPZOG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJIJQCHUO6PWRQNGUKOHGHPZOG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UJIJQCHUO6PWRQNGUKOHGHPZOG","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":"c1aba893b4c494894fe67ff5178f0b7019a8f3d2c03365caf709ed50b9b46dc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-29T23:47:38Z","title_canon_sha256":"7f6df5eba642f9b219009a9d864448c010b35acf4ef20fe390b1811d23cd289c"},"schema_version":"1.0","source":{"id":"1908.11482","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11482","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11482v4","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11482","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"UJIJQCHUO6PW","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"pith_short_16","alias_value":"UJIJQCHUO6PWRQNG","created_at":"2026-07-05T01:51:59Z"},{"alias_kind":"pith_short_8","alias_value":"UJIJQCHU","created_at":"2026-07-05T01:51:59Z"}],"graph_snapshots":[{"event_id":"sha256:c1dcd34bd96c53360492c2f5b9cf67b74f9c2ea1f7af1dfd77235462ffb67310","target":"graph","created_at":"2026-07-05T01:51:59Z","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/1908.11482/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of non-smooth convex optimization with linear equality constraints, where the objective function is only accessible through its proximal operator. This problem arises in many different fields such as statistical learning, computational imaging, telecommunications, and optimal control. To solve it, we propose an Anderson accelerated Douglas-Rachford splitting (A2DR) algorithm, which we show either globally converges or provides a certificate of infeasibility/unboundedness under very mild conditions. Applied to a block separable objective, A2DR partially decouples so that","authors_text":"Anqi Fu, Junzi Zhang, Stephen Boyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-29T23:47:38Z","title":"Anderson Accelerated Douglas-Rachford Splitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11482","kind":"arxiv","version":4},"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:33610ebe421240c516664198e4c65463bc6493cd007263ea5ce82ee2c681238a","target":"record","created_at":"2026-07-05T01:51:59Z","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":"c1aba893b4c494894fe67ff5178f0b7019a8f3d2c03365caf709ed50b9b46dc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-29T23:47:38Z","title_canon_sha256":"7f6df5eba642f9b219009a9d864448c010b35acf4ef20fe390b1811d23cd289c"},"schema_version":"1.0","source":{"id":"1908.11482","kind":"arxiv","version":4}},"canonical_sha256":"a2509808f4779f68c1a6a29c731df97185f2c4066c912a117930bcdc5eb9a8fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2509808f4779f68c1a6a29c731df97185f2c4066c912a117930bcdc5eb9a8fb","first_computed_at":"2026-07-05T01:51:59.114475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:59.114475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/btQnQbyjzgKBNgqbLVLgOCi0om6+z1/OKuHnpHALXSwM+/L5PGffoShH/+AZNo13NGWzKdcoE7Lc/11E6ruCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:59.114912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.11482","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33610ebe421240c516664198e4c65463bc6493cd007263ea5ce82ee2c681238a","sha256:c1dcd34bd96c53360492c2f5b9cf67b74f9c2ea1f7af1dfd77235462ffb67310"],"state_sha256":"d381c4459015462dd6e5e8c13ee08e04e72cce02581a4d480f9e7aab069c6eb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqMIZxySqxjdnCJ/5ll2Igo3/G/Bl1Nuw1QWqjxnmP0Xz5gj8+HmgvAvvVMzHweqP+uGQeWxiRRnseH4k4S3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T05:08:07.720202Z","bundle_sha256":"aae0e6414e6d1459c63a7b3a13da8dc6041f94f98c10efbee0f998a9beddc05c"}}