{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6B5DUQU3IKIPNARUX3EU4PWSFX","short_pith_number":"pith:6B5DUQU3","canonical_record":{"source":{"id":"1901.08183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T00:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"d84bedeba6e2ab36d66cfe399853f0f0ce1f69f7ff70b899f556a9b1520ab51f","abstract_canon_sha256":"22c17068d17b82fb5b3b75174ec8c93ed2307a61e9cb12c9d059a22eaff320b5"},"schema_version":"1.0"},"canonical_sha256":"f07a3a429b4290f68234bec94e3ed22de0707145d70686266f35ab0acea89979","source":{"kind":"arxiv","id":"1901.08183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08183","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08183v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08183","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"6B5DUQU3IKIP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6B5DUQU3IKIPNARU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6B5DUQU3","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6B5DUQU3IKIPNARUX3EU4PWSFX","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T00:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"d84bedeba6e2ab36d66cfe399853f0f0ce1f69f7ff70b899f556a9b1520ab51f","abstract_canon_sha256":"22c17068d17b82fb5b3b75174ec8c93ed2307a61e9cb12c9d059a22eaff320b5"},"schema_version":"1.0"},"canonical_sha256":"f07a3a429b4290f68234bec94e3ed22de0707145d70686266f35ab0acea89979","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:37.708640Z","signature_b64":"wnen7kkivnFh8Pmofd3OvWQ6JbEUB3NXfpmmcWgAEdFtOgKN21c1n6x9ihLHFrsUn0+j4ZiCAPQCT0IT/Ie3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f07a3a429b4290f68234bec94e3ed22de0707145d70686266f35ab0acea89979","last_reissued_at":"2026-05-17T23:55:37.708080Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:37.708080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08183","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97Ah7+5RWeOCPvBTocIcmQ3i0sefMmSHDG9QYNAFn0D8GNQdttgwDLPD+tu7wSK7/w/r5zXTd/Tmlzz7cKHwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:08:29.293577Z"},"content_sha256":"4464a3c9072787dab830313eccd2b1c85abfbdfdb0ac54cad4bed512a0389711","schema_version":"1.0","event_id":"sha256:4464a3c9072787dab830313eccd2b1c85abfbdfdb0ac54cad4bed512a0389711"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6B5DUQU3IKIPNARUX3EU4PWSFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Numerical explorations of feasibility algorithms for finding points in the intersection of finite sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Heinz H. Bauschke, Sylvain Gretchko, Walaa M. Moursi","submitted_at":"2019-01-24T00:44:49Z","abstract_excerpt":"Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in the intersection of a collection of constraint sets. Theoretical properties of projection methods are fairly well understood when the underlying constraint sets are convex; however, convergence results for the nonconvex case are more complicated and typically only local. In this paper, we explore the perhaps simplest instance of a feasibility algorithm, nam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08183","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-17T23:55:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DidBbzO6MIJV+fi/0RGLjOSWbb92gq3JW1gxchNGh1aEC3OFPS4r0TlxRuczADa46OY0UJ4UQw4IM/I3T9fEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:08:29.293927Z"},"content_sha256":"001bd0f68a64fe80d93db72526f152119e929cdf49cf2c546598a164031b154b","schema_version":"1.0","event_id":"sha256:001bd0f68a64fe80d93db72526f152119e929cdf49cf2c546598a164031b154b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6B5DUQU3IKIPNARUX3EU4PWSFX/bundle.json","state_url":"https://pith.science/pith/6B5DUQU3IKIPNARUX3EU4PWSFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6B5DUQU3IKIPNARUX3EU4PWSFX/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-09T15:08:29Z","links":{"resolver":"https://pith.science/pith/6B5DUQU3IKIPNARUX3EU4PWSFX","bundle":"https://pith.science/pith/6B5DUQU3IKIPNARUX3EU4PWSFX/bundle.json","state":"https://pith.science/pith/6B5DUQU3IKIPNARUX3EU4PWSFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6B5DUQU3IKIPNARUX3EU4PWSFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6B5DUQU3IKIPNARUX3EU4PWSFX","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":"22c17068d17b82fb5b3b75174ec8c93ed2307a61e9cb12c9d059a22eaff320b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T00:44:49Z","title_canon_sha256":"d84bedeba6e2ab36d66cfe399853f0f0ce1f69f7ff70b899f556a9b1520ab51f"},"schema_version":"1.0","source":{"id":"1901.08183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08183","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08183v1","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08183","created_at":"2026-05-17T23:55:37Z"},{"alias_kind":"pith_short_12","alias_value":"6B5DUQU3IKIP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6B5DUQU3IKIPNARU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6B5DUQU3","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:001bd0f68a64fe80d93db72526f152119e929cdf49cf2c546598a164031b154b","target":"graph","created_at":"2026-05-17T23:55:37Z","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":"Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in the intersection of a collection of constraint sets. Theoretical properties of projection methods are fairly well understood when the underlying constraint sets are convex; however, convergence results for the nonconvex case are more complicated and typically only local. In this paper, we explore the perhaps simplest instance of a feasibility algorithm, nam","authors_text":"Heinz H. Bauschke, Sylvain Gretchko, Walaa M. Moursi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T00:44:49Z","title":"Numerical explorations of feasibility algorithms for finding points in the intersection of finite sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08183","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:4464a3c9072787dab830313eccd2b1c85abfbdfdb0ac54cad4bed512a0389711","target":"record","created_at":"2026-05-17T23:55:37Z","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":"22c17068d17b82fb5b3b75174ec8c93ed2307a61e9cb12c9d059a22eaff320b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-24T00:44:49Z","title_canon_sha256":"d84bedeba6e2ab36d66cfe399853f0f0ce1f69f7ff70b899f556a9b1520ab51f"},"schema_version":"1.0","source":{"id":"1901.08183","kind":"arxiv","version":1}},"canonical_sha256":"f07a3a429b4290f68234bec94e3ed22de0707145d70686266f35ab0acea89979","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f07a3a429b4290f68234bec94e3ed22de0707145d70686266f35ab0acea89979","first_computed_at":"2026-05-17T23:55:37.708080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:37.708080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wnen7kkivnFh8Pmofd3OvWQ6JbEUB3NXfpmmcWgAEdFtOgKN21c1n6x9ihLHFrsUn0+j4ZiCAPQCT0IT/Ie3BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:37.708640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4464a3c9072787dab830313eccd2b1c85abfbdfdb0ac54cad4bed512a0389711","sha256:001bd0f68a64fe80d93db72526f152119e929cdf49cf2c546598a164031b154b"],"state_sha256":"fbdb604eb170990adb4165e1061ac8db446a3eeb8ec3ff98ddb522d2e37ef050"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uBoV5pQj/TnjbtjYELcCjF1lulNJoxmXbwK1r9RBGQU9pZVC5IZufvLp+Z+OyBvr7kT/f/HgeCCeXqn8rmECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:08:29.295918Z","bundle_sha256":"5dd92884e961890d75a6b8528069f7962056fa8ad662dccc6f03e4d6650a22de"}}