{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NIF43E6VHUNWYYQSYUG7S4B2NI","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":"443a8536d10152d409108876d0121c61bcfeed1f95e28db18a09b99a4a0c6950","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-19T11:17:40Z","title_canon_sha256":"ba09de75913eb924ad16a434192f7ad78636f15e6765c7350e81f8741e112505"},"schema_version":"1.0","source":{"id":"1904.09148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09148","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09148v1","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09148","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"NIF43E6VHUNW","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NIF43E6VHUNWYYQS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NIF43E6V","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:147181fc77f7df85baade7d469af7fd434c41835596edeb14fc481b62ce48df7","target":"graph","created_at":"2026-05-17T23:48:08Z","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 method, a projection algorithm designed to solve continuous optimization problems, forms the basis of a useful heuristic for solving combinatorial optimization problems. In order to successfully use the method, it is necessary to formulate the problem at hand as a feasibility problem with constraint sets having efficiently computable nearest points. In this self-contained tutorial, we develop the convergence theory of projection algorithms within the framework of fixed point iterations, explain how to devise useful feasibility problem formulations, and demonstrate the appl","authors_text":"Francisco J. Arag\\'on Artacho, Matthew K. Tam, Rub\\'en Campoy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-19T11:17:40Z","title":"The Douglas-Rachford Algorithm for Convex and Nonconvex Feasibility Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09148","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:505de75b5cf27d2c1290b3b35726144fc91da0433f904be9badd38deb32eb299","target":"record","created_at":"2026-05-17T23:48:08Z","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":"443a8536d10152d409108876d0121c61bcfeed1f95e28db18a09b99a4a0c6950","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-19T11:17:40Z","title_canon_sha256":"ba09de75913eb924ad16a434192f7ad78636f15e6765c7350e81f8741e112505"},"schema_version":"1.0","source":{"id":"1904.09148","kind":"arxiv","version":1}},"canonical_sha256":"6a0bcd93d53d1b6c6212c50df9703a6a2c40c4724fabbe4a19dd65c58a476f2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a0bcd93d53d1b6c6212c50df9703a6a2c40c4724fabbe4a19dd65c58a476f2b","first_computed_at":"2026-05-17T23:48:08.193087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:08.193087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OfEVnicVDV0B2l30Vtp2aurMTlsYP7BJ8BGd1/K/4LAH+bJiIY2o0Pt0KRZdT4fPT0/RI/2v49hxeaCyfz43AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:08.193736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:505de75b5cf27d2c1290b3b35726144fc91da0433f904be9badd38deb32eb299","sha256:147181fc77f7df85baade7d469af7fd434c41835596edeb14fc481b62ce48df7"],"state_sha256":"3fed1280411489fa3bd3d544807fa34b50e3a2200a87bb0b5cf4370bdf955c63"}