{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VMK7PU73DXTKWKYHZGNZ6YJT72","short_pith_number":"pith:VMK7PU73","schema_version":"1.0","canonical_sha256":"ab15f7d3fb1de6ab2b07c99b9f6133feaae06e5a0ac06c910dcbea65d9d66225","source":{"kind":"arxiv","id":"1303.1859","version":4},"attestation_state":"computed","paper":{"title":"A Cyclic Douglas-Rachford Iteration Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Jonathan M. Borwein, Matthew K. Tam","submitted_at":"2013-03-08T00:13:48Z","abstract_excerpt":"In this paper we present two Douglas-Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our methods to the classical (product-space) Douglas-Rachford scheme, are promising."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1303.1859","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-08T00:13:48Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"bbb1abd3ec973c2ea2bc3a0e8560eb909b6c434089a5718700779b131b31cbbc","abstract_canon_sha256":"ae3202e1197d546a714a9b125862dfaca78c0cf4078f46c7fb3884579732e6e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:02.693191Z","signature_b64":"EDUafl9Fhxx3Wq+ZAIf+oGTspANFgVZnv4HVQgUhlqqNzjuBp+yOMkxLEn5I0iyiXuMGO+olV1NouFLJpCJMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab15f7d3fb1de6ab2b07c99b9f6133feaae06e5a0ac06c910dcbea65d9d66225","last_reissued_at":"2026-05-18T00:15:02.692323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:02.692323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Cyclic Douglas-Rachford Iteration Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Jonathan M. Borwein, Matthew K. Tam","submitted_at":"2013-03-08T00:13:48Z","abstract_excerpt":"In this paper we present two Douglas-Rachford inspired iteration schemes which can be applied directly to N-set convex feasibility problems in Hilbert space. Our main results are weak convergence of the methods to a point whose nearest point projections onto each of the N sets coincide. For affine subspaces, convergence is in norm. Initial results from numerical experiments, comparing our methods to the classical (product-space) Douglas-Rachford scheme, are promising."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1859","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.1859","created_at":"2026-05-18T00:15:02.692469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1859v4","created_at":"2026-05-18T00:15:02.692469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1859","created_at":"2026-05-18T00:15:02.692469+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMK7PU73DXTK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMK7PU73DXTKWKYH","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMK7PU73","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72","json":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72.json","graph_json":"https://pith.science/api/pith-number/VMK7PU73DXTKWKYHZGNZ6YJT72/graph.json","events_json":"https://pith.science/api/pith-number/VMK7PU73DXTKWKYHZGNZ6YJT72/events.json","paper":"https://pith.science/paper/VMK7PU73"},"agent_actions":{"view_html":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72","download_json":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72.json","view_paper":"https://pith.science/paper/VMK7PU73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1859&json=true","fetch_graph":"https://pith.science/api/pith-number/VMK7PU73DXTKWKYHZGNZ6YJT72/graph.json","fetch_events":"https://pith.science/api/pith-number/VMK7PU73DXTKWKYHZGNZ6YJT72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72/action/storage_attestation","attest_author":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72/action/author_attestation","sign_citation":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72/action/citation_signature","submit_replication":"https://pith.science/pith/VMK7PU73DXTKWKYHZGNZ6YJT72/action/replication_record"}},"created_at":"2026-05-18T00:15:02.692469+00:00","updated_at":"2026-05-18T00:15:02.692469+00:00"}