{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ARXA44DYFJL46EVHIARO5QF7DE","short_pith_number":"pith:ARXA44DY","schema_version":"1.0","canonical_sha256":"046e0e70782a57cf12a74022eec0bf1937d397886bae71efc3ebbbdfbd547da9","source":{"kind":"arxiv","id":"1009.3780","version":2},"attestation_state":"computed","paper":{"title":"Algorithms for the Split Variational Inequality Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Aviv Gibali, Simeon Reich, Yair Censor","submitted_at":"2010-09-20T11:58:56Z","abstract_excerpt":"We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational Inequality Problem (VIP)), the image of which under a given bounded linear transformation is a solution of another inverse problem such as a VIP. We construct iterative algorithms that solve such problems, under reasonable conditions, in Hilbert space and then discuss special cases, some of which are new even in Euclidean space."},"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":"1009.3780","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-20T11:58:56Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"bd1c6610562e53857fd5c01a8dbf1271ed7501937cc173f6e22a0c073e66f457","abstract_canon_sha256":"447708b7eaa1f11a501ff3ee92e9a0546769b99b0df6607e10f2d91ec58e9241"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:50.311327Z","signature_b64":"b1yVF5O9T3r/NgwQtwSET2kMubRoYa5P6Jix9kgQUw0cpazn+JDfBmh/QAkB68pBeKta5fNYxMlWZS3CLix1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"046e0e70782a57cf12a74022eec0bf1937d397886bae71efc3ebbbdfbd547da9","last_reissued_at":"2026-05-18T04:15:50.310695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:50.310695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for the Split Variational Inequality Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"math.OC","authors_text":"Aviv Gibali, Simeon Reich, Yair Censor","submitted_at":"2010-09-20T11:58:56Z","abstract_excerpt":"We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality Problem (SVIP), which is a SIP. It entails finding a solution of one inverse problem (e.g., a Variational Inequality Problem (VIP)), the image of which under a given bounded linear transformation is a solution of another inverse problem such as a VIP. We construct iterative algorithms that solve such problems, under reasonable conditions, in Hilbert space and then discuss special cases, some of which are new even in Euclidean space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3780","kind":"arxiv","version":2},"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":"1009.3780","created_at":"2026-05-18T04:15:50.310778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3780v2","created_at":"2026-05-18T04:15:50.310778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3780","created_at":"2026-05-18T04:15:50.310778+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARXA44DYFJL4","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARXA44DYFJL46EVH","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARXA44DY","created_at":"2026-05-18T12:26:05.355336+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/ARXA44DYFJL46EVHIARO5QF7DE","json":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE.json","graph_json":"https://pith.science/api/pith-number/ARXA44DYFJL46EVHIARO5QF7DE/graph.json","events_json":"https://pith.science/api/pith-number/ARXA44DYFJL46EVHIARO5QF7DE/events.json","paper":"https://pith.science/paper/ARXA44DY"},"agent_actions":{"view_html":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE","download_json":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE.json","view_paper":"https://pith.science/paper/ARXA44DY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3780&json=true","fetch_graph":"https://pith.science/api/pith-number/ARXA44DYFJL46EVHIARO5QF7DE/graph.json","fetch_events":"https://pith.science/api/pith-number/ARXA44DYFJL46EVHIARO5QF7DE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE/action/storage_attestation","attest_author":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE/action/author_attestation","sign_citation":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE/action/citation_signature","submit_replication":"https://pith.science/pith/ARXA44DYFJL46EVHIARO5QF7DE/action/replication_record"}},"created_at":"2026-05-18T04:15:50.310778+00:00","updated_at":"2026-05-18T04:15:50.310778+00:00"}