{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YTCI6DPZ76IX2PFJSQ4KPK25ZD","short_pith_number":"pith:YTCI6DPZ","schema_version":"1.0","canonical_sha256":"c4c48f0df9ff917d3ca99438a7ab5dc8d9dfd98cc2b572569131ce7975a7b19d","source":{"kind":"arxiv","id":"1806.10033","version":1},"attestation_state":"computed","paper":{"title":"Stability of a convex feasibility problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carlo Alberto De Bernardi, Elena Molho, Enrico Miglierina","submitted_at":"2018-06-26T14:47:40Z","abstract_excerpt":"The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$, respectively, which minimize the distance between the sets. In the present paper, we study some stability properties for the convex feasibility problem: we consider two sequences of sets, each of them converging, with respect to a suitable notion of set convergence, respectively, to $A$ and $B$. Under appropriate assumptions on the original problem, we ensure"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1806.10033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-26T14:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"9c93a9b4b142713f36417ed46d563b084ce28369a22c2f3e63a843f4389d743d","abstract_canon_sha256":"9ebb15bf5ebb0c67122178f79914b8a341c639c20162d6a2c3fa14af79ae808a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:20.151930Z","signature_b64":"WTGxzTyZskyxX+bBjhVaI8OzarryTZjsYa/amiIvpJqXgXcj48eTAwUN2mRNbBnOaZ17860XMWaNymJKPdkNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4c48f0df9ff917d3ca99438a7ab5dc8d9dfd98cc2b572569131ce7975a7b19d","last_reissued_at":"2026-05-18T00:12:20.151208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:20.151208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability of a convex feasibility problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carlo Alberto De Bernardi, Elena Molho, Enrico Miglierina","submitted_at":"2018-06-26T14:47:40Z","abstract_excerpt":"The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$, respectively, which minimize the distance between the sets. In the present paper, we study some stability properties for the convex feasibility problem: we consider two sequences of sets, each of them converging, with respect to a suitable notion of set convergence, respectively, to $A$ and $B$. Under appropriate assumptions on the original problem, we ensure"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10033","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.10033","created_at":"2026-05-18T00:12:20.151330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10033v1","created_at":"2026-05-18T00:12:20.151330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10033","created_at":"2026-05-18T00:12:20.151330+00:00"},{"alias_kind":"pith_short_12","alias_value":"YTCI6DPZ76IX","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YTCI6DPZ76IX2PFJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YTCI6DPZ","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD","json":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD.json","graph_json":"https://pith.science/api/pith-number/YTCI6DPZ76IX2PFJSQ4KPK25ZD/graph.json","events_json":"https://pith.science/api/pith-number/YTCI6DPZ76IX2PFJSQ4KPK25ZD/events.json","paper":"https://pith.science/paper/YTCI6DPZ"},"agent_actions":{"view_html":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD","download_json":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD.json","view_paper":"https://pith.science/paper/YTCI6DPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10033&json=true","fetch_graph":"https://pith.science/api/pith-number/YTCI6DPZ76IX2PFJSQ4KPK25ZD/graph.json","fetch_events":"https://pith.science/api/pith-number/YTCI6DPZ76IX2PFJSQ4KPK25ZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD/action/storage_attestation","attest_author":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD/action/author_attestation","sign_citation":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD/action/citation_signature","submit_replication":"https://pith.science/pith/YTCI6DPZ76IX2PFJSQ4KPK25ZD/action/replication_record"}},"created_at":"2026-05-18T00:12:20.151330+00:00","updated_at":"2026-05-18T00:12:20.151330+00:00"}