{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DIXSVKTE46M4KTZEVOSMYE2APQ","short_pith_number":"pith:DIXSVKTE","canonical_record":{"source":{"id":"1309.4709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-18T17:14:30Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"4d1e9a58d1a17edacb8bb5c48763277ebb9c4d6d8f3d069a1addb0530afd5671","abstract_canon_sha256":"921eb6bc10c40882317a291216108740d5752fe8336d180ff80541e8169248cb"},"schema_version":"1.0"},"canonical_sha256":"1a2f2aaa64e799c54f24aba4cc13407c391b66762992c8657e99796ce5a5f1c5","source":{"kind":"arxiv","id":"1309.4709","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4709","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4709v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4709","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"DIXSVKTE46M4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DIXSVKTE46M4KTZE","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DIXSVKTE","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DIXSVKTE46M4KTZEVOSMYE2APQ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.4709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-18T17:14:30Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"4d1e9a58d1a17edacb8bb5c48763277ebb9c4d6d8f3d069a1addb0530afd5671","abstract_canon_sha256":"921eb6bc10c40882317a291216108740d5752fe8336d180ff80541e8169248cb"},"schema_version":"1.0"},"canonical_sha256":"1a2f2aaa64e799c54f24aba4cc13407c391b66762992c8657e99796ce5a5f1c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:06.296092Z","signature_b64":"C0ROMrtGSxn+nJGhoaqoVz9UUuB5pejABLoOoOxni2pHHbw72iDxKLnLwJOZr13kp3XbJt+8fccVidK7WyamBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a2f2aaa64e799c54f24aba4cc13407c391b66762992c8657e99796ce5a5f1c5","last_reissued_at":"2026-05-18T03:04:06.295497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:06.295497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.4709","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-05-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hr/mIXIHfSnaQQJ/bkLZ38vhxK0GEaaEcAPIXoTB03uZQ+nk9v1UVusZCHelTG0Zyqp98egEnDTSZJ837k38BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:39:46.414354Z"},"content_sha256":"5e37682afbf8b17fe3d3d3e887e0e569acd244346810ccd4fb7621063939eba2","schema_version":"1.0","event_id":"sha256:5e37682afbf8b17fe3d3d3e887e0e569acd244346810ccd4fb7621063939eba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DIXSVKTE46M4KTZEVOSMYE2APQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle","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, Hung M. Phan, J.Y. Bello Cruz, Tran T.A. Nghia, Xianfu Wang","submitted_at":"2013-09-18T17:14:30Z","abstract_excerpt":"The Douglas-Rachford splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm for finding a point in the intersection of two convex sets. This method for solving feasibility problems has attracted a lot of attention due to its good performance even in nonconvex settings.\n  In this paper, we consider the Douglas-Rachford algorithm for finding a point in the intersection of two subspaces. We prove that the method converges strongly to the projection of the starting point onto the intersection. M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4709","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":""},"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlW1qS8wvatmXxUApH9HooLsXhWFVyKTpV1a5th/lsrKt0aa7sqhoaKHq8MDQTohUk5l0ta9tk/3MUmXYLR/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T10:39:46.414706Z"},"content_sha256":"b7f6f6d20907feb62fd7999c22cb1a101f1df5eac03378b59857ed7e5dfa3efc","schema_version":"1.0","event_id":"sha256:b7f6f6d20907feb62fd7999c22cb1a101f1df5eac03378b59857ed7e5dfa3efc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DIXSVKTE46M4KTZEVOSMYE2APQ/bundle.json","state_url":"https://pith.science/pith/DIXSVKTE46M4KTZEVOSMYE2APQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DIXSVKTE46M4KTZEVOSMYE2APQ/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-26T10:39:46Z","links":{"resolver":"https://pith.science/pith/DIXSVKTE46M4KTZEVOSMYE2APQ","bundle":"https://pith.science/pith/DIXSVKTE46M4KTZEVOSMYE2APQ/bundle.json","state":"https://pith.science/pith/DIXSVKTE46M4KTZEVOSMYE2APQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DIXSVKTE46M4KTZEVOSMYE2APQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DIXSVKTE46M4KTZEVOSMYE2APQ","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":"921eb6bc10c40882317a291216108740d5752fe8336d180ff80541e8169248cb","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-18T17:14:30Z","title_canon_sha256":"4d1e9a58d1a17edacb8bb5c48763277ebb9c4d6d8f3d069a1addb0530afd5671"},"schema_version":"1.0","source":{"id":"1309.4709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4709","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4709v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4709","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"DIXSVKTE46M4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DIXSVKTE46M4KTZE","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DIXSVKTE","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:b7f6f6d20907feb62fd7999c22cb1a101f1df5eac03378b59857ed7e5dfa3efc","target":"graph","created_at":"2026-05-18T03:04:06Z","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 splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm for finding a point in the intersection of two convex sets. This method for solving feasibility problems has attracted a lot of attention due to its good performance even in nonconvex settings.\n  In this paper, we consider the Douglas-Rachford algorithm for finding a point in the intersection of two subspaces. We prove that the method converges strongly to the projection of the starting point onto the intersection. M","authors_text":"Heinz H. Bauschke, Hung M. Phan, J.Y. Bello Cruz, Tran T.A. Nghia, Xianfu Wang","cross_cats":["math.FA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-18T17:14:30Z","title":"The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4709","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:5e37682afbf8b17fe3d3d3e887e0e569acd244346810ccd4fb7621063939eba2","target":"record","created_at":"2026-05-18T03:04:06Z","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":"921eb6bc10c40882317a291216108740d5752fe8336d180ff80541e8169248cb","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-18T17:14:30Z","title_canon_sha256":"4d1e9a58d1a17edacb8bb5c48763277ebb9c4d6d8f3d069a1addb0530afd5671"},"schema_version":"1.0","source":{"id":"1309.4709","kind":"arxiv","version":2}},"canonical_sha256":"1a2f2aaa64e799c54f24aba4cc13407c391b66762992c8657e99796ce5a5f1c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a2f2aaa64e799c54f24aba4cc13407c391b66762992c8657e99796ce5a5f1c5","first_computed_at":"2026-05-18T03:04:06.295497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:06.295497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C0ROMrtGSxn+nJGhoaqoVz9UUuB5pejABLoOoOxni2pHHbw72iDxKLnLwJOZr13kp3XbJt+8fccVidK7WyamBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:06.296092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e37682afbf8b17fe3d3d3e887e0e569acd244346810ccd4fb7621063939eba2","sha256:b7f6f6d20907feb62fd7999c22cb1a101f1df5eac03378b59857ed7e5dfa3efc"],"state_sha256":"16c910c422a57d2fb669cbd0b0bf954ca5bcf10b71665e7afbd0309a2b4987dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F2cS/jelfdn2hjqdQDv77W3rnTk7NwId2uTIKVHscKdM0H4/Vj45jIp8LWzLDN7s9gYA7/804DIaMqUSXVj4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T10:39:46.416608Z","bundle_sha256":"c26b2ff05b51f4d9151361e6397fdd19b79353abe3355506af0e025d39856874"}}