{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DB7FJ7KQ2CYABYPLZOFLJQWLOA","short_pith_number":"pith:DB7FJ7KQ","schema_version":"1.0","canonical_sha256":"187e54fd50d0b000e1ebcb8ab4c2cb70133573a1c5ceda4857f0b935ee36a491","source":{"kind":"arxiv","id":"1810.02463","version":1},"attestation_state":"computed","paper":{"title":"Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"R. D\\'iaz Mill\\'an, Scott B. Lindstrom, Vera Roshchina","submitted_at":"2018-10-04T23:55:25Z","abstract_excerpt":"We focus on the convergence analysis of averaged relaxations of cutters, specifically for variants that---depending upon how parameters are chosen---resemble \\emph{alternating projections}, the \\emph{Douglas--Rachford method}, \\emph{relaxed reflect-reflect}, or the \\emph{Peaceman--Rachford} method. Such methods are frequently used to solve convex feasibility problems. The standard convergence analyses of projection algorithms are based on the \\emph{firm nonexpansivity} property of the relevant operators. However if the projections onto the constraint sets are replaced by cutters (projections o"},"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":"1810.02463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T23:55:25Z","cross_cats_sorted":[],"title_canon_sha256":"8e5883ba4ec078c951f99f7575ab178befeeb16a106f7bcd8f6d18eed60faf30","abstract_canon_sha256":"a5af3cf68324a9fba988d53f3d62cb7ac3d0bc393fb66f6a0a8250379676554c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:01.821730Z","signature_b64":"hvxpcXvX96kI6vTsxKS7XZ7MG52690G1GcUldpkh1cp78rAbShdVz5ptv9RAoXIkNBLZzBO+2jVL/1WP8rfZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"187e54fd50d0b000e1ebcb8ab4c2cb70133573a1c5ceda4857f0b935ee36a491","last_reissued_at":"2026-05-18T00:04:01.821112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:01.821112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"R. D\\'iaz Mill\\'an, Scott B. Lindstrom, Vera Roshchina","submitted_at":"2018-10-04T23:55:25Z","abstract_excerpt":"We focus on the convergence analysis of averaged relaxations of cutters, specifically for variants that---depending upon how parameters are chosen---resemble \\emph{alternating projections}, the \\emph{Douglas--Rachford method}, \\emph{relaxed reflect-reflect}, or the \\emph{Peaceman--Rachford} method. Such methods are frequently used to solve convex feasibility problems. The standard convergence analyses of projection algorithms are based on the \\emph{firm nonexpansivity} property of the relevant operators. However if the projections onto the constraint sets are replaced by cutters (projections o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02463","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.02463","created_at":"2026-05-18T00:04:01.821203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02463v1","created_at":"2026-05-18T00:04:01.821203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02463","created_at":"2026-05-18T00:04:01.821203+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB7FJ7KQ2CYA","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB7FJ7KQ2CYABYPL","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB7FJ7KQ","created_at":"2026-05-18T12:32:19.392346+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/DB7FJ7KQ2CYABYPLZOFLJQWLOA","json":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA.json","graph_json":"https://pith.science/api/pith-number/DB7FJ7KQ2CYABYPLZOFLJQWLOA/graph.json","events_json":"https://pith.science/api/pith-number/DB7FJ7KQ2CYABYPLZOFLJQWLOA/events.json","paper":"https://pith.science/paper/DB7FJ7KQ"},"agent_actions":{"view_html":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA","download_json":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA.json","view_paper":"https://pith.science/paper/DB7FJ7KQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02463&json=true","fetch_graph":"https://pith.science/api/pith-number/DB7FJ7KQ2CYABYPLZOFLJQWLOA/graph.json","fetch_events":"https://pith.science/api/pith-number/DB7FJ7KQ2CYABYPLZOFLJQWLOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA/action/storage_attestation","attest_author":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA/action/author_attestation","sign_citation":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA/action/citation_signature","submit_replication":"https://pith.science/pith/DB7FJ7KQ2CYABYPLZOFLJQWLOA/action/replication_record"}},"created_at":"2026-05-18T00:04:01.821203+00:00","updated_at":"2026-05-18T00:04:01.821203+00:00"}