{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3PRXSEPTXVRPPUA5NQXSRHEUSD","short_pith_number":"pith:3PRXSEPT","schema_version":"1.0","canonical_sha256":"dbe37911f3bd62f7d01d6c2f289c9490edd25b167c29ba48deb0df9f9f5fdbac","source":{"kind":"arxiv","id":"1506.02444","version":3},"attestation_state":"computed","paper":{"title":"Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine 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, Bruce Cox","submitted_at":"2015-06-08T11:30:59Z","abstract_excerpt":"The majority of First Order methods for large-scale convex-concave saddle point problems and variational inequalities with monotone operators are proximal algorithms which at every iteration need to minimize over problem's domain X the sum of a linear form and a strongly convex function. To make such an algorithm practical, X should be proximal-friendly -- admit a strongly convex function with easy to minimize linear perturbations. As a byproduct, X admits a computationally cheap Linear Minimization Oracle (LMO) capable to minimize over X linear forms. There are, however, important situations "},"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":"1506.02444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-08T11:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"ce77d184b1491aa92275713f3776454df1a6d66b34108ed2dde7442f012f69b9","abstract_canon_sha256":"928f169ff9cae5567e60fd8e01d748c38369fae0705f805bbab8e7e150a8021c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:13.631960Z","signature_b64":"3TA2WNU9MkNzZ1ZjYOcdQQI/ON/b6Nj9T6JDEfydV4+SM0TL05584yCiyPYbO1v/MKXm5tcxtjR/4QAd7TE5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbe37911f3bd62f7d01d6c2f289c9490edd25b167c29ba48deb0df9f9f5fdbac","last_reissued_at":"2026-05-18T01:31:13.631527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:13.631527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine 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, Bruce Cox","submitted_at":"2015-06-08T11:30:59Z","abstract_excerpt":"The majority of First Order methods for large-scale convex-concave saddle point problems and variational inequalities with monotone operators are proximal algorithms which at every iteration need to minimize over problem's domain X the sum of a linear form and a strongly convex function. To make such an algorithm practical, X should be proximal-friendly -- admit a strongly convex function with easy to minimize linear perturbations. As a byproduct, X admits a computationally cheap Linear Minimization Oracle (LMO) capable to minimize over X linear forms. There are, however, important situations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02444","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.02444","created_at":"2026-05-18T01:31:13.631588+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02444v3","created_at":"2026-05-18T01:31:13.631588+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02444","created_at":"2026-05-18T01:31:13.631588+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PRXSEPTXVRP","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PRXSEPTXVRPPUA5","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PRXSEPT","created_at":"2026-05-18T12:29:02.477457+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/3PRXSEPTXVRPPUA5NQXSRHEUSD","json":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD.json","graph_json":"https://pith.science/api/pith-number/3PRXSEPTXVRPPUA5NQXSRHEUSD/graph.json","events_json":"https://pith.science/api/pith-number/3PRXSEPTXVRPPUA5NQXSRHEUSD/events.json","paper":"https://pith.science/paper/3PRXSEPT"},"agent_actions":{"view_html":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD","download_json":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD.json","view_paper":"https://pith.science/paper/3PRXSEPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02444&json=true","fetch_graph":"https://pith.science/api/pith-number/3PRXSEPTXVRPPUA5NQXSRHEUSD/graph.json","fetch_events":"https://pith.science/api/pith-number/3PRXSEPTXVRPPUA5NQXSRHEUSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/action/storage_attestation","attest_author":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/action/author_attestation","sign_citation":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/action/citation_signature","submit_replication":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/action/replication_record"}},"created_at":"2026-05-18T01:31:13.631588+00:00","updated_at":"2026-05-18T01:31:13.631588+00:00"}