{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CH4EQCSGOVB4LVMB6BMLJYLK2E","short_pith_number":"pith:CH4EQCSG","schema_version":"1.0","canonical_sha256":"11f8480a467543c5d581f058b4e16ad10b40236134073152c9091dc4d6d6a194","source":{"kind":"arxiv","id":"1312.1073","version":2},"attestation_state":"computed","paper":{"title":"Solving Variational Inequalities with Monotone Operators on Domains Given by Linear Minimization Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky, Arkadi Nemirovski","submitted_at":"2013-12-04T09:22:41Z","abstract_excerpt":"The standard algorithms for solving large-scale convex-concave saddle point problems, or, more generally, variational inequalities with monotone operators, are proximal type algorithms which at every iteration need to compute a prox-mapping, that is, to minimize over problem's domain $X$ the sum of a linear form and the specific convex distance-generating function underlying the algorithms in question. Relative computational simplicity of prox-mappings, which is the standard requirement when implementing proximal algorithms, clearly implies the possibility to equip $X$ with a relatively comput"},"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":"1312.1073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-04T09:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"a929eb356edb8bd38dab5ca365de33b8e64673d4684e76d5f98c7975d894b1a6","abstract_canon_sha256":"5df5fb91cd0efd91830051c90cd038169288923386d49779dc60339509ea15ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:12.114459Z","signature_b64":"D/Qsi8nliUQjOL7zfiUKFTPnLScB85lmwh70ADOlT7Rdo/dUuSWcsxoO8z2cOZln3z4BkCE9hCa/FhDh6AQAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11f8480a467543c5d581f058b4e16ad10b40236134073152c9091dc4d6d6a194","last_reissued_at":"2026-05-18T02:49:12.113830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:12.113830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Variational Inequalities with Monotone Operators on Domains Given by Linear Minimization Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky, Arkadi Nemirovski","submitted_at":"2013-12-04T09:22:41Z","abstract_excerpt":"The standard algorithms for solving large-scale convex-concave saddle point problems, or, more generally, variational inequalities with monotone operators, are proximal type algorithms which at every iteration need to compute a prox-mapping, that is, to minimize over problem's domain $X$ the sum of a linear form and the specific convex distance-generating function underlying the algorithms in question. Relative computational simplicity of prox-mappings, which is the standard requirement when implementing proximal algorithms, clearly implies the possibility to equip $X$ with a relatively comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1073","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":"1312.1073","created_at":"2026-05-18T02:49:12.113929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1073v2","created_at":"2026-05-18T02:49:12.113929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1073","created_at":"2026-05-18T02:49:12.113929+00:00"},{"alias_kind":"pith_short_12","alias_value":"CH4EQCSGOVB4","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CH4EQCSGOVB4LVMB","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CH4EQCSG","created_at":"2026-05-18T12:27:40.988391+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/CH4EQCSGOVB4LVMB6BMLJYLK2E","json":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E.json","graph_json":"https://pith.science/api/pith-number/CH4EQCSGOVB4LVMB6BMLJYLK2E/graph.json","events_json":"https://pith.science/api/pith-number/CH4EQCSGOVB4LVMB6BMLJYLK2E/events.json","paper":"https://pith.science/paper/CH4EQCSG"},"agent_actions":{"view_html":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E","download_json":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E.json","view_paper":"https://pith.science/paper/CH4EQCSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1073&json=true","fetch_graph":"https://pith.science/api/pith-number/CH4EQCSGOVB4LVMB6BMLJYLK2E/graph.json","fetch_events":"https://pith.science/api/pith-number/CH4EQCSGOVB4LVMB6BMLJYLK2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E/action/storage_attestation","attest_author":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E/action/author_attestation","sign_citation":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E/action/citation_signature","submit_replication":"https://pith.science/pith/CH4EQCSGOVB4LVMB6BMLJYLK2E/action/replication_record"}},"created_at":"2026-05-18T02:49:12.113929+00:00","updated_at":"2026-05-18T02:49:12.113929+00:00"}