{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:VQ7YYY7UMMQKGFCPL65RH7X44W","short_pith_number":"pith:VQ7YYY7U","canonical_record":{"source":{"id":"2108.10969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-24T21:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"af688df4869d5239d7a08f126310ba90b65d268d2ec834d9596a21ad5fec6061","abstract_canon_sha256":"9d5705c0af80456c424883f486747b181a2f08a3989500457f864c2a1b3affa2"},"schema_version":"1.0"},"canonical_sha256":"ac3f8c63f46320a3144f5fbb13fefce59ba0d7ba0ef73fcd915d504e3a3a0cbb","source":{"kind":"arxiv","id":"2108.10969","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.10969","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"arxiv_version","alias_value":"2108.10969v3","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.10969","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"pith_short_12","alias_value":"VQ7YYY7UMMQK","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"pith_short_16","alias_value":"VQ7YYY7UMMQKGFCP","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"pith_short_8","alias_value":"VQ7YYY7U","created_at":"2026-07-05T04:22:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:VQ7YYY7UMMQKGFCPL65RH7X44W","target":"record","payload":{"canonical_record":{"source":{"id":"2108.10969","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-24T21:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"af688df4869d5239d7a08f126310ba90b65d268d2ec834d9596a21ad5fec6061","abstract_canon_sha256":"9d5705c0af80456c424883f486747b181a2f08a3989500457f864c2a1b3affa2"},"schema_version":"1.0"},"canonical_sha256":"ac3f8c63f46320a3144f5fbb13fefce59ba0d7ba0ef73fcd915d504e3a3a0cbb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:38.564153Z","signature_b64":"NZBiG1TMrgIesjY60CVPTR1sHS0VoQZ5TWKZrJDAsqp30UrO6KtVtJy9L3+oA1PSkZq288fQpIepV3zJGjbxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac3f8c63f46320a3144f5fbb13fefce59ba0d7ba0ef73fcd915d504e3a3a0cbb","last_reissued_at":"2026-07-05T04:22:38.563680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:38.563680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.10969","source_version":3,"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-07-05T04:22:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iH+oSreAnxGH1SrelzQrnvba7O0eV0lpitF50HBY6fO7H1cC65x6gLrDI2pTTUIOpkI0eg8+ba4MNM33YzzlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:28:38.943854Z"},"content_sha256":"21374bf1e7fd034bdd36acc14bdc784a08a621731a080350a61728c77d1079b9","schema_version":"1.0","event_id":"sha256:21374bf1e7fd034bdd36acc14bdc784a08a621731a080350a61728c77d1079b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:VQ7YYY7UMMQKGFCPL65RH7X44W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal error bounds for nonexpansive fixed-point iterations in normed spaces","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Juan Pablo Contreras, Roberto Cominetti","submitted_at":"2021-08-24T21:44:56Z","abstract_excerpt":"This paper investigates optimal error bounds and convergence rates for general Mann iterations for computing fixed-points of non-expansive maps. We look for iterations that achieve the smallest fixed-point residual after $n$ steps, by minimizing a worst-case bound $\\|x^n-Tx^n\\|\\le R_n$ derived from a nested family of optimal transport problems. We prove that this bound is tight so that minimizing $R_n$ yields optimal iterations. Inspired from numerical results we identify iterations that attain the rate $R_n=O(1/n)$, which we also show to be the best possible. In particular, we prove that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.10969","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.10969/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:22:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSr6dEbuZhaQaf9Zw+7lOLWdev8K72zjj7bdKFOg2Y8nlpzyZk1a7VnNN7+KpSX4GYuTzHsSJPqQOqF/P54bBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:28:38.944236Z"},"content_sha256":"82467cedb799cd49a0f1a91e98e24af4f2c2e4e603380d2e337180ad103a131f","schema_version":"1.0","event_id":"sha256:82467cedb799cd49a0f1a91e98e24af4f2c2e4e603380d2e337180ad103a131f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/bundle.json","state_url":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/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-07-07T06:28:38Z","links":{"resolver":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W","bundle":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/bundle.json","state":"https://pith.science/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQ7YYY7UMMQKGFCPL65RH7X44W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:VQ7YYY7UMMQKGFCPL65RH7X44W","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":"9d5705c0af80456c424883f486747b181a2f08a3989500457f864c2a1b3affa2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-24T21:44:56Z","title_canon_sha256":"af688df4869d5239d7a08f126310ba90b65d268d2ec834d9596a21ad5fec6061"},"schema_version":"1.0","source":{"id":"2108.10969","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.10969","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"arxiv_version","alias_value":"2108.10969v3","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.10969","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"pith_short_12","alias_value":"VQ7YYY7UMMQK","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"pith_short_16","alias_value":"VQ7YYY7UMMQKGFCP","created_at":"2026-07-05T04:22:38Z"},{"alias_kind":"pith_short_8","alias_value":"VQ7YYY7U","created_at":"2026-07-05T04:22:38Z"}],"graph_snapshots":[{"event_id":"sha256:82467cedb799cd49a0f1a91e98e24af4f2c2e4e603380d2e337180ad103a131f","target":"graph","created_at":"2026-07-05T04:22:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.10969/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates optimal error bounds and convergence rates for general Mann iterations for computing fixed-points of non-expansive maps. We look for iterations that achieve the smallest fixed-point residual after $n$ steps, by minimizing a worst-case bound $\\|x^n-Tx^n\\|\\le R_n$ derived from a nested family of optimal transport problems. We prove that this bound is tight so that minimizing $R_n$ yields optimal iterations. Inspired from numerical results we identify iterations that attain the rate $R_n=O(1/n)$, which we also show to be the best possible. In particular, we prove that the ","authors_text":"Juan Pablo Contreras, Roberto Cominetti","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-24T21:44:56Z","title":"Optimal error bounds for nonexpansive fixed-point iterations in normed spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.10969","kind":"arxiv","version":3},"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:21374bf1e7fd034bdd36acc14bdc784a08a621731a080350a61728c77d1079b9","target":"record","created_at":"2026-07-05T04:22:38Z","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":"9d5705c0af80456c424883f486747b181a2f08a3989500457f864c2a1b3affa2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2021-08-24T21:44:56Z","title_canon_sha256":"af688df4869d5239d7a08f126310ba90b65d268d2ec834d9596a21ad5fec6061"},"schema_version":"1.0","source":{"id":"2108.10969","kind":"arxiv","version":3}},"canonical_sha256":"ac3f8c63f46320a3144f5fbb13fefce59ba0d7ba0ef73fcd915d504e3a3a0cbb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac3f8c63f46320a3144f5fbb13fefce59ba0d7ba0ef73fcd915d504e3a3a0cbb","first_computed_at":"2026-07-05T04:22:38.563680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:22:38.563680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NZBiG1TMrgIesjY60CVPTR1sHS0VoQZ5TWKZrJDAsqp30UrO6KtVtJy9L3+oA1PSkZq288fQpIepV3zJGjbxDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:22:38.564153Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.10969","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21374bf1e7fd034bdd36acc14bdc784a08a621731a080350a61728c77d1079b9","sha256:82467cedb799cd49a0f1a91e98e24af4f2c2e4e603380d2e337180ad103a131f"],"state_sha256":"59b6121168989bcb3f342e43e44f3e4f03030c4cbea53e21f561868ad8403cd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEuNY952GXWXqF+fXE3W2N1CL0AO4vu89v/Sno0LyFQhgejmtRIVj29qlInzicdVqJomId6FwDKWpr+IkgE6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:28:38.947163Z","bundle_sha256":"d4ed1b78b9305d35f9b06dc824bfa68873b6f2f710f306ca087880c2ecbc82df"}}