{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TXM7N2EF3WAWP7YKRZ44YTZAUQ","short_pith_number":"pith:TXM7N2EF","canonical_record":{"source":{"id":"1703.09426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-28T07:26:31Z","cross_cats_sorted":[],"title_canon_sha256":"d6737254bc2d24c7334272e25dae9fcabb9f64b90fa3c0595d8528bfb7d538db","abstract_canon_sha256":"c98b632f3615df9197db7db411f9a56d4c4728d94244e0e4e4d3081b7e09cea5"},"schema_version":"1.0"},"canonical_sha256":"9dd9f6e885dd8167ff0a8e79cc4f20a43e7e6948a953b785f9b4685eed0d3d01","source":{"kind":"arxiv","id":"1703.09426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09426","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09426v1","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09426","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"TXM7N2EF3WAW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TXM7N2EF3WAWP7YK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TXM7N2EF","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TXM7N2EF3WAWP7YKRZ44YTZAUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-28T07:26:31Z","cross_cats_sorted":[],"title_canon_sha256":"d6737254bc2d24c7334272e25dae9fcabb9f64b90fa3c0595d8528bfb7d538db","abstract_canon_sha256":"c98b632f3615df9197db7db411f9a56d4c4728d94244e0e4e4d3081b7e09cea5"},"schema_version":"1.0"},"canonical_sha256":"9dd9f6e885dd8167ff0a8e79cc4f20a43e7e6948a953b785f9b4685eed0d3d01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:44.575612Z","signature_b64":"SVPRHSRxKDPJcy+Qton/BQIkX1Hi6R9bj+dWfrNDbl7JT7pVblM8whb9tAPa4tvEwHafKBJJn7TLDjeV2kDDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd9f6e885dd8167ff0a8e79cc4f20a43e7e6948a953b785f9b4685eed0d3d01","last_reissued_at":"2026-05-18T00:47:44.574968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:44.574968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09426","source_version":1,"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-05-18T00:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"riaEpWehmAa73UZxoVSuYtGq1KLPkiJuFcwNf17M991DusJfIooayB+1Odab5kwN7+nwVfEbI9hYMPbvM7YdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:20:03.808811Z"},"content_sha256":"1f9a389d9297a3f11d96b4c6a05b255d46ee020d20664cc6bd98e0056b670f52","schema_version":"1.0","event_id":"sha256:1f9a389d9297a3f11d96b4c6a05b255d46ee020d20664cc6bd98e0056b670f52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TXM7N2EF3WAWP7YKRZ44YTZAUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weak, Strong and Linear Convergence of a Double-Layer Fixed Point Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Rafa{\\l} Zalas, Simeon Reich, Victor I. Kolobov","submitted_at":"2017-03-28T07:26:31Z","abstract_excerpt":"In this article we consider a consistent convex feasibility problem in a real Hilbert space defined by a finite family of sets $C_i$. We are interested, in particular, in the case where for each $i$, $C_i=Fix (U_i)=\\{z\\in \\mathcal H\\mid p_i(z)=0\\}$, $U_i\\colon\\mathcal H\\rightarrow \\mathcal H$ is a cutter and $p_i\\colon\\mathcal H\\rightarrow [0,\\infty)$ is a proximity function. Moreover, we make the following assumption: the computation of $p_i$ is at most as difficult as the evaluation of $U_i$ and this is at most as difficult as projecting onto $C_i$. We study a double-layer fixed point algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09426","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"},"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-05-18T00:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaiMok9Pj+uZzuF2koHy5ea0LolA3+kee22oGXooZTJDKp5q0wfQLhehbCQ/jeloQAhJjMML0gf1mg2EMc/RBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T11:20:03.809156Z"},"content_sha256":"7db1aabbe577cd0d731d946b884cea6746180c8d5266d576a5f32b577d78e054","schema_version":"1.0","event_id":"sha256:7db1aabbe577cd0d731d946b884cea6746180c8d5266d576a5f32b577d78e054"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXM7N2EF3WAWP7YKRZ44YTZAUQ/bundle.json","state_url":"https://pith.science/pith/TXM7N2EF3WAWP7YKRZ44YTZAUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXM7N2EF3WAWP7YKRZ44YTZAUQ/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-06-04T11:20:03Z","links":{"resolver":"https://pith.science/pith/TXM7N2EF3WAWP7YKRZ44YTZAUQ","bundle":"https://pith.science/pith/TXM7N2EF3WAWP7YKRZ44YTZAUQ/bundle.json","state":"https://pith.science/pith/TXM7N2EF3WAWP7YKRZ44YTZAUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXM7N2EF3WAWP7YKRZ44YTZAUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TXM7N2EF3WAWP7YKRZ44YTZAUQ","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":"c98b632f3615df9197db7db411f9a56d4c4728d94244e0e4e4d3081b7e09cea5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-28T07:26:31Z","title_canon_sha256":"d6737254bc2d24c7334272e25dae9fcabb9f64b90fa3c0595d8528bfb7d538db"},"schema_version":"1.0","source":{"id":"1703.09426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09426","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09426v1","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09426","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"TXM7N2EF3WAW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TXM7N2EF3WAWP7YK","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TXM7N2EF","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:7db1aabbe577cd0d731d946b884cea6746180c8d5266d576a5f32b577d78e054","target":"graph","created_at":"2026-05-18T00:47:44Z","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":"In this article we consider a consistent convex feasibility problem in a real Hilbert space defined by a finite family of sets $C_i$. We are interested, in particular, in the case where for each $i$, $C_i=Fix (U_i)=\\{z\\in \\mathcal H\\mid p_i(z)=0\\}$, $U_i\\colon\\mathcal H\\rightarrow \\mathcal H$ is a cutter and $p_i\\colon\\mathcal H\\rightarrow [0,\\infty)$ is a proximity function. Moreover, we make the following assumption: the computation of $p_i$ is at most as difficult as the evaluation of $U_i$ and this is at most as difficult as projecting onto $C_i$. We study a double-layer fixed point algori","authors_text":"Rafa{\\l} Zalas, Simeon Reich, Victor I. Kolobov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-28T07:26:31Z","title":"Weak, Strong and Linear Convergence of a Double-Layer Fixed Point Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09426","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:1f9a389d9297a3f11d96b4c6a05b255d46ee020d20664cc6bd98e0056b670f52","target":"record","created_at":"2026-05-18T00:47:44Z","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":"c98b632f3615df9197db7db411f9a56d4c4728d94244e0e4e4d3081b7e09cea5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-28T07:26:31Z","title_canon_sha256":"d6737254bc2d24c7334272e25dae9fcabb9f64b90fa3c0595d8528bfb7d538db"},"schema_version":"1.0","source":{"id":"1703.09426","kind":"arxiv","version":1}},"canonical_sha256":"9dd9f6e885dd8167ff0a8e79cc4f20a43e7e6948a953b785f9b4685eed0d3d01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9dd9f6e885dd8167ff0a8e79cc4f20a43e7e6948a953b785f9b4685eed0d3d01","first_computed_at":"2026-05-18T00:47:44.574968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:44.574968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SVPRHSRxKDPJcy+Qton/BQIkX1Hi6R9bj+dWfrNDbl7JT7pVblM8whb9tAPa4tvEwHafKBJJn7TLDjeV2kDDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:44.575612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f9a389d9297a3f11d96b4c6a05b255d46ee020d20664cc6bd98e0056b670f52","sha256:7db1aabbe577cd0d731d946b884cea6746180c8d5266d576a5f32b577d78e054"],"state_sha256":"49ff666c99fd83368b81d14085854594ff526e2fb4f7ef286f045a7c78f15242"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOZ8S0AxiofRMqMBTAJ6RSub1Ui4nk3UxGXYaYxQ9sLuc8oNR9R+ntA7zC/VJ79oMzTAoRruS1eUHUcPO/HrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T11:20:03.811097Z","bundle_sha256":"f899a99b76a77beec97d3c1bc48c20d3e7a98dc9f13f7477bd0ef7ac773e38a3"}}