{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MYZMNECMJJ4TK5OORO33H6XXZZ","short_pith_number":"pith:MYZMNECM","canonical_record":{"source":{"id":"1605.07421","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-24T12:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"ceed9bb0c989b085ac9e2e6f3879b599c1567b93405df808801227449fa17b24","abstract_canon_sha256":"00540094ade098c71446bd5934e42374d6fa88391c1347b7629a34017e768cca"},"schema_version":"1.0"},"canonical_sha256":"6632c6904c4a793575ce8bb7b3faf7ce78e636df1eedbe636306100d3ffa1410","source":{"kind":"arxiv","id":"1605.07421","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07421","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07421v3","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07421","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"MYZMNECMJJ4T","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYZMNECMJJ4TK5OO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYZMNECM","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MYZMNECMJJ4TK5OORO33H6XXZZ","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07421","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-24T12:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"ceed9bb0c989b085ac9e2e6f3879b599c1567b93405df808801227449fa17b24","abstract_canon_sha256":"00540094ade098c71446bd5934e42374d6fa88391c1347b7629a34017e768cca"},"schema_version":"1.0"},"canonical_sha256":"6632c6904c4a793575ce8bb7b3faf7ce78e636df1eedbe636306100d3ffa1410","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:04.005090Z","signature_b64":"TcSr88W3+KAHxhrHW+Ino8i2R2hCDFEz/pcaI8ayiCf+SBiLpeZllNf63iDHui1w/7bZLHQJ86spbH/t+kE8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6632c6904c4a793575ce8bb7b3faf7ce78e636df1eedbe636306100d3ffa1410","last_reissued_at":"2026-05-18T00:36:04.004578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:04.004578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07421","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:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4ZSf/pWSxcOoS9NRoNDKfIP1CY9OwZORdskXphQYcOqwRA16WLS/kzuEPHVgxjhwbLksU8LXD+rz+ESLpeBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:14:52.705850Z"},"content_sha256":"977d949084fb7708dd2c78d3066a7d1de234140d477d332d36296628b6f899e6","schema_version":"1.0","event_id":"sha256:977d949084fb7708dd2c78d3066a7d1de234140d477d332d36296628b6f899e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MYZMNECMJJ4TK5OORO33H6XXZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new projection method for finding the closest point in the intersection of convex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francisco J. Arag\\'on Artacho, Rub\\'en Campoy","submitted_at":"2016-05-24T12:39:46Z","abstract_excerpt":"In this paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert space. This method, termed AAMR for averaged alternating modified reflections, can be viewed as an adequate modification of the Douglas--Rachford method that yields a solution to the best approximation problem. Under a constraint qualification at the point of interest, we show strong convergence of the method. In fact, the so-called strong CHIP fully characterizes the convergence of the AAMR method for every point in the space. We repor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07421","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:36:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5h+T8e/15xNty40AylDB3vRqNGGeFpfIoieUM1lraJLdmlbqkgkj1ab0heNEQDBbnZwoDCIr1YFW+UdZxB1iDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:14:52.706206Z"},"content_sha256":"610dc12283829d41cef5842f75791bbe8b5041f32a8d749d08cc52d25b10b465","schema_version":"1.0","event_id":"sha256:610dc12283829d41cef5842f75791bbe8b5041f32a8d749d08cc52d25b10b465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYZMNECMJJ4TK5OORO33H6XXZZ/bundle.json","state_url":"https://pith.science/pith/MYZMNECMJJ4TK5OORO33H6XXZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYZMNECMJJ4TK5OORO33H6XXZZ/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-22T05:14:52Z","links":{"resolver":"https://pith.science/pith/MYZMNECMJJ4TK5OORO33H6XXZZ","bundle":"https://pith.science/pith/MYZMNECMJJ4TK5OORO33H6XXZZ/bundle.json","state":"https://pith.science/pith/MYZMNECMJJ4TK5OORO33H6XXZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYZMNECMJJ4TK5OORO33H6XXZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MYZMNECMJJ4TK5OORO33H6XXZZ","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":"00540094ade098c71446bd5934e42374d6fa88391c1347b7629a34017e768cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-24T12:39:46Z","title_canon_sha256":"ceed9bb0c989b085ac9e2e6f3879b599c1567b93405df808801227449fa17b24"},"schema_version":"1.0","source":{"id":"1605.07421","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07421","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07421v3","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07421","created_at":"2026-05-18T00:36:04Z"},{"alias_kind":"pith_short_12","alias_value":"MYZMNECMJJ4T","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MYZMNECMJJ4TK5OO","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MYZMNECM","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:610dc12283829d41cef5842f75791bbe8b5041f32a8d749d08cc52d25b10b465","target":"graph","created_at":"2026-05-18T00:36:04Z","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 paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert space. This method, termed AAMR for averaged alternating modified reflections, can be viewed as an adequate modification of the Douglas--Rachford method that yields a solution to the best approximation problem. Under a constraint qualification at the point of interest, we show strong convergence of the method. In fact, the so-called strong CHIP fully characterizes the convergence of the AAMR method for every point in the space. We repor","authors_text":"Francisco J. Arag\\'on Artacho, Rub\\'en Campoy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-24T12:39:46Z","title":"A new projection method for finding the closest point in the intersection of convex sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07421","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:977d949084fb7708dd2c78d3066a7d1de234140d477d332d36296628b6f899e6","target":"record","created_at":"2026-05-18T00:36:04Z","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":"00540094ade098c71446bd5934e42374d6fa88391c1347b7629a34017e768cca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-24T12:39:46Z","title_canon_sha256":"ceed9bb0c989b085ac9e2e6f3879b599c1567b93405df808801227449fa17b24"},"schema_version":"1.0","source":{"id":"1605.07421","kind":"arxiv","version":3}},"canonical_sha256":"6632c6904c4a793575ce8bb7b3faf7ce78e636df1eedbe636306100d3ffa1410","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6632c6904c4a793575ce8bb7b3faf7ce78e636df1eedbe636306100d3ffa1410","first_computed_at":"2026-05-18T00:36:04.004578Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:04.004578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcSr88W3+KAHxhrHW+Ino8i2R2hCDFEz/pcaI8ayiCf+SBiLpeZllNf63iDHui1w/7bZLHQJ86spbH/t+kE8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:04.005090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07421","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:977d949084fb7708dd2c78d3066a7d1de234140d477d332d36296628b6f899e6","sha256:610dc12283829d41cef5842f75791bbe8b5041f32a8d749d08cc52d25b10b465"],"state_sha256":"90cc6bff0222e4b779b2d2f9ec225484d8e57436b6c195e2a3bca7ec597c779f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYSbQN2DQTHmJBVpnULcSMg+k2xo4wT5B4nK/FNAjNOlhWo58P0UpYDlScmHwoVxNV7NcSRdrVCMZtdWN5h6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T05:14:52.708133Z","bundle_sha256":"c0203706a08fc0515b2324b4665734b8645c499145c6fff71ca83b2ae64ae93f"}}