{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:J7U7IL5HPBOHMYPG6QGIPHES6A","short_pith_number":"pith:J7U7IL5H","canonical_record":{"source":{"id":"1908.05406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T03:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"44f8517e1ba93ccaf97388a551c8ce000daab8e13c100e089adbb42abe6f0572","abstract_canon_sha256":"544f342d5731c9a333b7f648915516da04e1efa82f27c45d3b98b7491a951277"},"schema_version":"1.0"},"canonical_sha256":"4fe9f42fa7785c7661e6f40c879c92f024e1bebce4d8775354fb60d88f9d2f3d","source":{"kind":"arxiv","id":"1908.05406","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05406","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05406v2","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05406","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"J7U7IL5HPBOH","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"pith_short_16","alias_value":"J7U7IL5HPBOHMYPG","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"pith_short_8","alias_value":"J7U7IL5H","created_at":"2026-07-05T01:17:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:J7U7IL5HPBOHMYPG6QGIPHES6A","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T03:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"44f8517e1ba93ccaf97388a551c8ce000daab8e13c100e089adbb42abe6f0572","abstract_canon_sha256":"544f342d5731c9a333b7f648915516da04e1efa82f27c45d3b98b7491a951277"},"schema_version":"1.0"},"canonical_sha256":"4fe9f42fa7785c7661e6f40c879c92f024e1bebce4d8775354fb60d88f9d2f3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:24.670140Z","signature_b64":"60bg4F0okV09YGr/5bwSohagLg7jIZkNEl/RzNiJsozMoXnOutySb6B4CIDmpsq8Wezu5BwWaImPrQGeMhVeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fe9f42fa7785c7661e6f40c879c92f024e1bebce4d8775354fb60d88f9d2f3d","last_reissued_at":"2026-07-05T01:17:24.669650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:24.669650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05406","source_version":2,"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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5XfTPU96KvUW6JGr2hYXCLG+sQP9onTqUj1RblU2cK5b2hXHWp56vnkc9R63xwe+3zCceepefqmW6YrmgzqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:52:16.476489Z"},"content_sha256":"bab73956e63ae10ed2dbe38728444b02a83cc1d6ea3da5418608376c80afed94","schema_version":"1.0","event_id":"sha256:bab73956e63ae10ed2dbe38728444b02a83cc1d6ea3da5418608376c80afed94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:J7U7IL5HPBOHMYPG6QGIPHES6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Heinz H. Bauschke, Walaa M. Moursi","submitted_at":"2019-08-15T03:41:06Z","abstract_excerpt":"The Douglas-Rachford algorithm (DRA) is a powerful optimization method for minimizing the sum of two convex (not necessarily smooth) functions. The vast majority of previous research dealt with the case when the sum has at least one minimizer. In the absence of minimizers, it was recently shown that for the case of two indicator functions, the DRA converges to a best approximation solution. In this paper, we present a new convergence result on the the DRA applied to the problem of minimizing a convex function subject to a linear constraint. Indeed, a normal solution may be found even when the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05406","kind":"arxiv","version":2},"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.05406/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:17:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5aRe5r8mEyztVnWMRzUnWlfT0XcvOGU19wxFYqooeB8shyaY3jHCEKiBNILffR861AIXOU6F+qt/drcz1gvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:52:16.477125Z"},"content_sha256":"6cf3ddeab41448da8735ee0c7489871bba0456a9aee5f1ba539114fa5aea0368","schema_version":"1.0","event_id":"sha256:6cf3ddeab41448da8735ee0c7489871bba0456a9aee5f1ba539114fa5aea0368"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7U7IL5HPBOHMYPG6QGIPHES6A/bundle.json","state_url":"https://pith.science/pith/J7U7IL5HPBOHMYPG6QGIPHES6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7U7IL5HPBOHMYPG6QGIPHES6A/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-16T14:52:16Z","links":{"resolver":"https://pith.science/pith/J7U7IL5HPBOHMYPG6QGIPHES6A","bundle":"https://pith.science/pith/J7U7IL5HPBOHMYPG6QGIPHES6A/bundle.json","state":"https://pith.science/pith/J7U7IL5HPBOHMYPG6QGIPHES6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7U7IL5HPBOHMYPG6QGIPHES6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:J7U7IL5HPBOHMYPG6QGIPHES6A","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":"544f342d5731c9a333b7f648915516da04e1efa82f27c45d3b98b7491a951277","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T03:41:06Z","title_canon_sha256":"44f8517e1ba93ccaf97388a551c8ce000daab8e13c100e089adbb42abe6f0572"},"schema_version":"1.0","source":{"id":"1908.05406","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05406","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05406v2","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05406","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"J7U7IL5HPBOH","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"pith_short_16","alias_value":"J7U7IL5HPBOHMYPG","created_at":"2026-07-05T01:17:24Z"},{"alias_kind":"pith_short_8","alias_value":"J7U7IL5H","created_at":"2026-07-05T01:17:24Z"}],"graph_snapshots":[{"event_id":"sha256:6cf3ddeab41448da8735ee0c7489871bba0456a9aee5f1ba539114fa5aea0368","target":"graph","created_at":"2026-07-05T01:17:24Z","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.05406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Douglas-Rachford algorithm (DRA) is a powerful optimization method for minimizing the sum of two convex (not necessarily smooth) functions. The vast majority of previous research dealt with the case when the sum has at least one minimizer. In the absence of minimizers, it was recently shown that for the case of two indicator functions, the DRA converges to a best approximation solution. In this paper, we present a new convergence result on the the DRA applied to the problem of minimizing a convex function subject to a linear constraint. Indeed, a normal solution may be found even when the ","authors_text":"Heinz H. Bauschke, Walaa M. Moursi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T03:41:06Z","title":"On the behaviour of the Douglas-Rachford algorithm for minimizing a convex function subject to a linear constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05406","kind":"arxiv","version":2},"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:bab73956e63ae10ed2dbe38728444b02a83cc1d6ea3da5418608376c80afed94","target":"record","created_at":"2026-07-05T01:17:24Z","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":"544f342d5731c9a333b7f648915516da04e1efa82f27c45d3b98b7491a951277","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-15T03:41:06Z","title_canon_sha256":"44f8517e1ba93ccaf97388a551c8ce000daab8e13c100e089adbb42abe6f0572"},"schema_version":"1.0","source":{"id":"1908.05406","kind":"arxiv","version":2}},"canonical_sha256":"4fe9f42fa7785c7661e6f40c879c92f024e1bebce4d8775354fb60d88f9d2f3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fe9f42fa7785c7661e6f40c879c92f024e1bebce4d8775354fb60d88f9d2f3d","first_computed_at":"2026-07-05T01:17:24.669650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:24.669650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"60bg4F0okV09YGr/5bwSohagLg7jIZkNEl/RzNiJsozMoXnOutySb6B4CIDmpsq8Wezu5BwWaImPrQGeMhVeCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:24.670140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05406","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bab73956e63ae10ed2dbe38728444b02a83cc1d6ea3da5418608376c80afed94","sha256:6cf3ddeab41448da8735ee0c7489871bba0456a9aee5f1ba539114fa5aea0368"],"state_sha256":"018792e53dea6be0fa16a4e25e09f278c8aeb50bb34d3a037773b7bccfcc8555"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fFP4p4kLi+GUIQW+yt3AOsSIP28/2brJy+XgyDtKiITdq1rCgsHSvXCyfNl9zkioAu9aKXdNlhirln10OEuVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:52:16.480595Z","bundle_sha256":"a7dc1720a16786dd632e9335d869f65f8f490d38ea6f1c3fcdc9348d8a98537f"}}