{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PGAFLMTC5UHS3SI4LU3TRXDINS","short_pith_number":"pith:PGAFLMTC","schema_version":"1.0","canonical_sha256":"798055b262ed0f2dc91c5d3738dc686ca8d145b410f647b7e7ae98d1a374aa0c","source":{"kind":"arxiv","id":"1611.09697","version":1},"attestation_state":"computed","paper":{"title":"Finite-Value Superiorization for Variational Inequality Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Evgeni Nurminski","submitted_at":"2016-11-29T16:11:55Z","abstract_excerpt":"The main goal of this paper is to present the application of a superiorization methodology to solution of variational inequalities. Within this framework a variational inequality operator is considered as a small perturbation of a convex feasibility solver what allows to construct a simple iteration algorithm. The specific features of variational inequality problems allow to use a finite-value perturbation which may be advantageous from computational point of view. The price for simplicity and finite-value is that the algorithm provides an approximate solution of variational inequality problem"},"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":"1611.09697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-29T16:11:55Z","cross_cats_sorted":[],"title_canon_sha256":"5db8b83d5585732e558a36969eff0ae5e600b3e176b086aad88d5f4532acf90d","abstract_canon_sha256":"77912ca619026895a8461211e42655e33ac1d780058c991ba019b81aac531d64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:13.263866Z","signature_b64":"p9lJsPs1khWY83rYfEHPRDXK1Nsg9EjyyE1mRwsYnk3in675bznsXwAqgqxsW82gm6cM9TqBflJ/KOAFgMooAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"798055b262ed0f2dc91c5d3738dc686ca8d145b410f647b7e7ae98d1a374aa0c","last_reissued_at":"2026-05-18T00:56:13.263234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:13.263234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-Value Superiorization for Variational Inequality Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Evgeni Nurminski","submitted_at":"2016-11-29T16:11:55Z","abstract_excerpt":"The main goal of this paper is to present the application of a superiorization methodology to solution of variational inequalities. Within this framework a variational inequality operator is considered as a small perturbation of a convex feasibility solver what allows to construct a simple iteration algorithm. The specific features of variational inequality problems allow to use a finite-value perturbation which may be advantageous from computational point of view. The price for simplicity and finite-value is that the algorithm provides an approximate solution of variational inequality problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09697","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":"1611.09697","created_at":"2026-05-18T00:56:13.263339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09697v1","created_at":"2026-05-18T00:56:13.263339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09697","created_at":"2026-05-18T00:56:13.263339+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGAFLMTC5UHS","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGAFLMTC5UHS3SI4","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGAFLMTC","created_at":"2026-05-18T12:30:39.010887+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/PGAFLMTC5UHS3SI4LU3TRXDINS","json":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS.json","graph_json":"https://pith.science/api/pith-number/PGAFLMTC5UHS3SI4LU3TRXDINS/graph.json","events_json":"https://pith.science/api/pith-number/PGAFLMTC5UHS3SI4LU3TRXDINS/events.json","paper":"https://pith.science/paper/PGAFLMTC"},"agent_actions":{"view_html":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS","download_json":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS.json","view_paper":"https://pith.science/paper/PGAFLMTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09697&json=true","fetch_graph":"https://pith.science/api/pith-number/PGAFLMTC5UHS3SI4LU3TRXDINS/graph.json","fetch_events":"https://pith.science/api/pith-number/PGAFLMTC5UHS3SI4LU3TRXDINS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS/action/storage_attestation","attest_author":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS/action/author_attestation","sign_citation":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS/action/citation_signature","submit_replication":"https://pith.science/pith/PGAFLMTC5UHS3SI4LU3TRXDINS/action/replication_record"}},"created_at":"2026-05-18T00:56:13.263339+00:00","updated_at":"2026-05-18T00:56:13.263339+00:00"}