{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E4DXV6EKUCMPXH2TUVVI6EEVYI","short_pith_number":"pith:E4DXV6EK","canonical_record":{"source":{"id":"1802.07529","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-21T11:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"bc2cadd3799e295f3d0ddaafa81a6762bf1d34d223fa201700ba7c69f1898132","abstract_canon_sha256":"b16de8dfce973fe5d787d626f99816de3c58694e298e124a75098b9fe6009e36"},"schema_version":"1.0"},"canonical_sha256":"27077af88aa098fb9f53a56a8f1095c22e4cf234c149b369e5096d608792ed3b","source":{"kind":"arxiv","id":"1802.07529","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07529","created_at":"2026-05-18T00:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07529v3","created_at":"2026-05-18T00:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07529","created_at":"2026-05-18T00:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"E4DXV6EKUCMP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E4DXV6EKUCMPXH2T","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E4DXV6EK","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E4DXV6EKUCMPXH2TUVVI6EEVYI","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07529","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-21T11:56:51Z","cross_cats_sorted":[],"title_canon_sha256":"bc2cadd3799e295f3d0ddaafa81a6762bf1d34d223fa201700ba7c69f1898132","abstract_canon_sha256":"b16de8dfce973fe5d787d626f99816de3c58694e298e124a75098b9fe6009e36"},"schema_version":"1.0"},"canonical_sha256":"27077af88aa098fb9f53a56a8f1095c22e4cf234c149b369e5096d608792ed3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:26.968786Z","signature_b64":"vzUGKmtjsWng/rblYfHWaftKWCp0czDfZs2Eea65mEVgfYQpdGgx+iVc9gUO4JXy6t8dWgBNvoSmVuCUjHz9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27077af88aa098fb9f53a56a8f1095c22e4cf234c149b369e5096d608792ed3b","last_reissued_at":"2026-05-18T00:17:26.968205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:26.968205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07529","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-05-18T00:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9762GF6zq5HHbulNHegj+tDV0iBds44bDOzqXIfmta/47RnLKZVdLrisKOam0DTGLiy+qGg1I4E1nAUozAKXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:28:10.183469Z"},"content_sha256":"c3ff3868388187e8984a6c984ceaccb6e1076cdd2ece68f53d1a52166d487770","schema_version":"1.0","event_id":"sha256:c3ff3868388187e8984a6c984ceaccb6e1076cdd2ece68f53d1a52166d487770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E4DXV6EKUCMPXH2TUVVI6EEVYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Maroun Zaknoon, Yair Censor","submitted_at":"2018-02-21T11:56:51Z","abstract_excerpt":"The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However, algorithmic research of inconsistent CFPs exists and is mainly focused on two directions. One is oriented toward defining other solution concepts that will apply, such as proximity function minimization wherein a proximity function measures in some way the total violation of all constraints. The second direction investigates the behavior of algorithms that are designe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07529","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":""},"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:17:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDc7T/ZZiigpKw/80FkK/9V5RA9lEuAwqESuHJa+3Q6vZGqv/+i1WuOam1NfhxZyvUdYr2Cdf5Yry/SktqltDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T01:28:10.184266Z"},"content_sha256":"ab03c7c70d82833c43fa8474747bb9f70b300e54d77f0860b2ef27dcd9ed2064","schema_version":"1.0","event_id":"sha256:ab03c7c70d82833c43fa8474747bb9f70b300e54d77f0860b2ef27dcd9ed2064"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4DXV6EKUCMPXH2TUVVI6EEVYI/bundle.json","state_url":"https://pith.science/pith/E4DXV6EKUCMPXH2TUVVI6EEVYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4DXV6EKUCMPXH2TUVVI6EEVYI/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-08-04T01:28:10Z","links":{"resolver":"https://pith.science/pith/E4DXV6EKUCMPXH2TUVVI6EEVYI","bundle":"https://pith.science/pith/E4DXV6EKUCMPXH2TUVVI6EEVYI/bundle.json","state":"https://pith.science/pith/E4DXV6EKUCMPXH2TUVVI6EEVYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4DXV6EKUCMPXH2TUVVI6EEVYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E4DXV6EKUCMPXH2TUVVI6EEVYI","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":"b16de8dfce973fe5d787d626f99816de3c58694e298e124a75098b9fe6009e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-21T11:56:51Z","title_canon_sha256":"bc2cadd3799e295f3d0ddaafa81a6762bf1d34d223fa201700ba7c69f1898132"},"schema_version":"1.0","source":{"id":"1802.07529","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07529","created_at":"2026-05-18T00:17:26Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07529v3","created_at":"2026-05-18T00:17:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07529","created_at":"2026-05-18T00:17:26Z"},{"alias_kind":"pith_short_12","alias_value":"E4DXV6EKUCMP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E4DXV6EKUCMPXH2T","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E4DXV6EK","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:ab03c7c70d82833c43fa8474747bb9f70b300e54d77f0860b2ef27dcd9ed2064","target":"graph","created_at":"2026-05-18T00:17:26Z","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":"The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However, algorithmic research of inconsistent CFPs exists and is mainly focused on two directions. One is oriented toward defining other solution concepts that will apply, such as proximity function minimization wherein a proximity function measures in some way the total violation of all constraints. The second direction investigates the behavior of algorithms that are designe","authors_text":"Maroun Zaknoon, Yair Censor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-21T11:56:51Z","title":"Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07529","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:c3ff3868388187e8984a6c984ceaccb6e1076cdd2ece68f53d1a52166d487770","target":"record","created_at":"2026-05-18T00:17:26Z","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":"b16de8dfce973fe5d787d626f99816de3c58694e298e124a75098b9fe6009e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-21T11:56:51Z","title_canon_sha256":"bc2cadd3799e295f3d0ddaafa81a6762bf1d34d223fa201700ba7c69f1898132"},"schema_version":"1.0","source":{"id":"1802.07529","kind":"arxiv","version":3}},"canonical_sha256":"27077af88aa098fb9f53a56a8f1095c22e4cf234c149b369e5096d608792ed3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27077af88aa098fb9f53a56a8f1095c22e4cf234c149b369e5096d608792ed3b","first_computed_at":"2026-05-18T00:17:26.968205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:26.968205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzUGKmtjsWng/rblYfHWaftKWCp0czDfZs2Eea65mEVgfYQpdGgx+iVc9gUO4JXy6t8dWgBNvoSmVuCUjHz9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:26.968786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07529","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3ff3868388187e8984a6c984ceaccb6e1076cdd2ece68f53d1a52166d487770","sha256:ab03c7c70d82833c43fa8474747bb9f70b300e54d77f0860b2ef27dcd9ed2064"],"state_sha256":"bc5030f120c98d5c2fca418e5bccb7de69cbf6def69753f1bd5db7e52d55a37e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOnX6Jf3h45ROEbujSzfq6D5p6hLEYypO3Ie0H99HZfJyd7TVB0bCIw3YaBhNu/TW5TY80aA0JDRLSr82coSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T01:28:10.246426Z","bundle_sha256":"ed46bcece9a00fe92dd4790ff59beb8fc08e64f4a75100c64fb701d9316f0d07"}}