{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6Z3E6XZM36DKBKAW3ETQ6SIHUW","short_pith_number":"pith:6Z3E6XZM","canonical_record":{"source":{"id":"1604.04603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-15T19:02:07Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"75680bff728d88f96640c88bc95f823e977ed5633c6b7b9a6218767ad0944c21","abstract_canon_sha256":"b8433110768e462e9d8aa3ba2bb4aa437033b5e40e2078b33fef91614c8baee7"},"schema_version":"1.0"},"canonical_sha256":"f6764f5f2cdf86a0a816d9270f4907a5b6c22b1b1c324cb8a5cd709b72238123","source":{"kind":"arxiv","id":"1604.04603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04603","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04603v1","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04603","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"6Z3E6XZM36DK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6Z3E6XZM36DKBKAW","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6Z3E6XZM","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6Z3E6XZM36DKBKAW3ETQ6SIHUW","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-15T19:02:07Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"75680bff728d88f96640c88bc95f823e977ed5633c6b7b9a6218767ad0944c21","abstract_canon_sha256":"b8433110768e462e9d8aa3ba2bb4aa437033b5e40e2078b33fef91614c8baee7"},"schema_version":"1.0"},"canonical_sha256":"f6764f5f2cdf86a0a816d9270f4907a5b6c22b1b1c324cb8a5cd709b72238123","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:34.526101Z","signature_b64":"b7UQNFaHjRo7K8/2F1ZPQDrmaIXUHofWiv3lrLXjiTYxplBApMOgvuLOF/2WVGDSNnAySXJkRrf5iGlPpd25Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6764f5f2cdf86a0a816d9270f4907a5b6c22b1b1c324cb8a5cd709b72238123","last_reissued_at":"2026-05-18T01:16:34.525510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:34.525510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04603","source_version":1,"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:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AM/YiH59ekH8xGfzCDtq1XOd9+kvMO5i7YZAcHq7Rmx9hJJp1LqwG4zw/AKbp9Q1OwC2+eB5i7D/yeZ99ZJDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:32:50.183080Z"},"content_sha256":"bc8e2009b5db69bd29c5843793fcef91f713f33efa017506da82afe8b09c63ec","schema_version":"1.0","event_id":"sha256:bc8e2009b5db69bd29c5843793fcef91f713f33efa017506da82afe8b09c63ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6Z3E6XZM36DKBKAW3ETQ6SIHUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Douglas-Rachford algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.NA"],"primary_cat":"math.OC","authors_text":"Heinz H. Bauschke, Walaa M. Moursi","submitted_at":"2016-04-15T19:02:07Z","abstract_excerpt":"The Douglas-Rachford algorithm is a very popular splitting technique for finding a zero of the sum of two maximally monotone operators. However, the behaviour of the algorithm remains mysterious in the general inconsistent case, i.e., when the sum problem has no zeros. More than a decade ago, however, it was shown that in the (possibly inconsistent) convex feasibility setting, the shadow sequence remains bounded and it is weak cluster points solve a best approximation problem.\n  In this paper, we advance the understanding of the inconsistent case significantly by providing a complete proof of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04603","kind":"arxiv","version":1},"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:16:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vX4KNThTMqoTo4vadZlHmjPVfnCxs6JQJ6hCEQrnth950dwE+B5dUgTb1MpKiTznCSqmUxycRysmxRnCEn6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:32:50.183693Z"},"content_sha256":"88a5dca495cf64cad10707fcce4e9e468aea9a01bfc5bdc22d9cd0414415c9a1","schema_version":"1.0","event_id":"sha256:88a5dca495cf64cad10707fcce4e9e468aea9a01bfc5bdc22d9cd0414415c9a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Z3E6XZM36DKBKAW3ETQ6SIHUW/bundle.json","state_url":"https://pith.science/pith/6Z3E6XZM36DKBKAW3ETQ6SIHUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Z3E6XZM36DKBKAW3ETQ6SIHUW/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-09T13:32:50Z","links":{"resolver":"https://pith.science/pith/6Z3E6XZM36DKBKAW3ETQ6SIHUW","bundle":"https://pith.science/pith/6Z3E6XZM36DKBKAW3ETQ6SIHUW/bundle.json","state":"https://pith.science/pith/6Z3E6XZM36DKBKAW3ETQ6SIHUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Z3E6XZM36DKBKAW3ETQ6SIHUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6Z3E6XZM36DKBKAW3ETQ6SIHUW","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":"b8433110768e462e9d8aa3ba2bb4aa437033b5e40e2078b33fef91614c8baee7","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-15T19:02:07Z","title_canon_sha256":"75680bff728d88f96640c88bc95f823e977ed5633c6b7b9a6218767ad0944c21"},"schema_version":"1.0","source":{"id":"1604.04603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04603","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04603v1","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04603","created_at":"2026-05-18T01:16:34Z"},{"alias_kind":"pith_short_12","alias_value":"6Z3E6XZM36DK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6Z3E6XZM36DKBKAW","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6Z3E6XZM","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:88a5dca495cf64cad10707fcce4e9e468aea9a01bfc5bdc22d9cd0414415c9a1","target":"graph","created_at":"2026-05-18T01:16:34Z","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":"The Douglas-Rachford algorithm is a very popular splitting technique for finding a zero of the sum of two maximally monotone operators. However, the behaviour of the algorithm remains mysterious in the general inconsistent case, i.e., when the sum problem has no zeros. More than a decade ago, however, it was shown that in the (possibly inconsistent) convex feasibility setting, the shadow sequence remains bounded and it is weak cluster points solve a best approximation problem.\n  In this paper, we advance the understanding of the inconsistent case significantly by providing a complete proof of ","authors_text":"Heinz H. Bauschke, Walaa M. Moursi","cross_cats":["math.FA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-15T19:02:07Z","title":"On the Douglas-Rachford algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04603","kind":"arxiv","version":1},"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:bc8e2009b5db69bd29c5843793fcef91f713f33efa017506da82afe8b09c63ec","target":"record","created_at":"2026-05-18T01:16:34Z","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":"b8433110768e462e9d8aa3ba2bb4aa437033b5e40e2078b33fef91614c8baee7","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-15T19:02:07Z","title_canon_sha256":"75680bff728d88f96640c88bc95f823e977ed5633c6b7b9a6218767ad0944c21"},"schema_version":"1.0","source":{"id":"1604.04603","kind":"arxiv","version":1}},"canonical_sha256":"f6764f5f2cdf86a0a816d9270f4907a5b6c22b1b1c324cb8a5cd709b72238123","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6764f5f2cdf86a0a816d9270f4907a5b6c22b1b1c324cb8a5cd709b72238123","first_computed_at":"2026-05-18T01:16:34.525510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:34.525510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b7UQNFaHjRo7K8/2F1ZPQDrmaIXUHofWiv3lrLXjiTYxplBApMOgvuLOF/2WVGDSNnAySXJkRrf5iGlPpd25Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:34.526101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc8e2009b5db69bd29c5843793fcef91f713f33efa017506da82afe8b09c63ec","sha256:88a5dca495cf64cad10707fcce4e9e468aea9a01bfc5bdc22d9cd0414415c9a1"],"state_sha256":"96633105a29fdcdbfb2e5e6a6b2557794bfc3f977d09e24f931c824bd6bd29dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"810mGFNa/Y+IyKjYmHeqzysRchcmT0mNVZo33wdfz8CmFfVa/d9yrK/fUovnWnsq04f26Ze1cutuFuhQYR4QDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:32:50.186331Z","bundle_sha256":"49e60edeaffd9e63b447f0486c63a8422b35e2a407763e1268769976ced6c5e6"}}