{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:X4IXBBFF72CW2UTTXOKO7V4WRT","short_pith_number":"pith:X4IXBBFF","schema_version":"1.0","canonical_sha256":"bf117084a5fe856d5273bb94efd7968cee81a112dc4f15ef3fe9c0f269ede0fd","source":{"kind":"arxiv","id":"1805.03932","version":1},"attestation_state":"computed","paper":{"title":"Linear Convergence Rates for Extrapolated Fixed Point Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christian Bargetz, Rafa{\\l} Zalas, Simeon Reich, Victor I. Kolobov","submitted_at":"2018-05-10T12:10:51Z","abstract_excerpt":"We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This applies, in particular, to the extrapolated simultaneous and cyclic cutter methods. Our analysis covers the cases of both metric and subgradient projections."},"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":"1805.03932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-10T12:10:51Z","cross_cats_sorted":[],"title_canon_sha256":"a66435552ebb07b54a033c15663d94b77f99fa74d543dde4e0645515b63d4376","abstract_canon_sha256":"6392fd9b5cb58647d1a46f0fd51f868e28920ea0632e309964adff92d6776cd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:15.738452Z","signature_b64":"HE6MhYkkG9Lpt9Rgs+kxwHd8cfLlak3zRZscwk6t4WLQmA9n9xU1PIQMP9U/5rXg352GawauPPdGitRgTm9GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf117084a5fe856d5273bb94efd7968cee81a112dc4f15ef3fe9c0f269ede0fd","last_reissued_at":"2026-05-18T00:16:15.737731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:15.737731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Convergence Rates for Extrapolated Fixed Point Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christian Bargetz, Rafa{\\l} Zalas, Simeon Reich, Victor I. Kolobov","submitted_at":"2018-05-10T12:10:51Z","abstract_excerpt":"We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This applies, in particular, to the extrapolated simultaneous and cyclic cutter methods. Our analysis covers the cases of both metric and subgradient projections."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03932","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":"1805.03932","created_at":"2026-05-18T00:16:15.737864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03932v1","created_at":"2026-05-18T00:16:15.737864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03932","created_at":"2026-05-18T00:16:15.737864+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4IXBBFF72CW","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4IXBBFF72CW2UTT","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4IXBBFF","created_at":"2026-05-18T12:33:01.666342+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/X4IXBBFF72CW2UTTXOKO7V4WRT","json":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT.json","graph_json":"https://pith.science/api/pith-number/X4IXBBFF72CW2UTTXOKO7V4WRT/graph.json","events_json":"https://pith.science/api/pith-number/X4IXBBFF72CW2UTTXOKO7V4WRT/events.json","paper":"https://pith.science/paper/X4IXBBFF"},"agent_actions":{"view_html":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT","download_json":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT.json","view_paper":"https://pith.science/paper/X4IXBBFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03932&json=true","fetch_graph":"https://pith.science/api/pith-number/X4IXBBFF72CW2UTTXOKO7V4WRT/graph.json","fetch_events":"https://pith.science/api/pith-number/X4IXBBFF72CW2UTTXOKO7V4WRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT/action/storage_attestation","attest_author":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT/action/author_attestation","sign_citation":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT/action/citation_signature","submit_replication":"https://pith.science/pith/X4IXBBFF72CW2UTTXOKO7V4WRT/action/replication_record"}},"created_at":"2026-05-18T00:16:15.737864+00:00","updated_at":"2026-05-18T00:16:15.737864+00:00"}