{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3PRXSEPTXVRPPUA5NQXSRHEUSD","short_pith_number":"pith:3PRXSEPT","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"},"canonical_sha256":"dbe37911f3bd62f7d01d6c2f289c9490edd25b167c29ba48deb0df9f9f5fdbac","source":{"kind":"arxiv","id":"1506.02444","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02444","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02444v3","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02444","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"3PRXSEPTXVRP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3PRXSEPTXVRPPUA5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3PRXSEPT","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3PRXSEPTXVRPPUA5NQXSRHEUSD","target":"record","payload":{"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"},"canonical_sha256":"dbe37911f3bd62f7d01d6c2f289c9490edd25b167c29ba48deb0df9f9f5fdbac","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"},"source_kind":"arxiv","source_id":"1506.02444","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v54N6Fbia3rZ+AVG0gRvOqFYhN8Ppmvtt5UwN0NnLrwRL5J5o3F2dzKuPzdTTJNaedbzb9rTcCcY/ZD83VGzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:36:47.011725Z"},"content_sha256":"0706289051ad0e3474e230f6a49e82bb620898b257811e7d03894873073e06b6","schema_version":"1.0","event_id":"sha256:0706289051ad0e3474e230f6a49e82bb620898b257811e7d03894873073e06b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3PRXSEPTXVRPPUA5NQXSRHEUSD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJ01JYnffflV9oN0bYPz/jp2VHOeE6KSaZBkSDEDLgVHsU3hJX2/tjV2B2fhp+r2H3UQ5Cdo4WHaFpMWPuGSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:36:47.012078Z"},"content_sha256":"ecf9a24e03785ff5067b73fb6561ae0be7ed0653c1a88f5b54f90998c7ae8ce0","schema_version":"1.0","event_id":"sha256:ecf9a24e03785ff5067b73fb6561ae0be7ed0653c1a88f5b54f90998c7ae8ce0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/bundle.json","state_url":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T16:36:47Z","links":{"resolver":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD","bundle":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/bundle.json","state":"https://pith.science/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PRXSEPTXVRPPUA5NQXSRHEUSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3PRXSEPTXVRPPUA5NQXSRHEUSD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"928f169ff9cae5567e60fd8e01d748c38369fae0705f805bbab8e7e150a8021c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-08T11:30:59Z","title_canon_sha256":"ce77d184b1491aa92275713f3776454df1a6d66b34108ed2dde7442f012f69b9"},"schema_version":"1.0","source":{"id":"1506.02444","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02444","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02444v3","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02444","created_at":"2026-05-18T01:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"3PRXSEPTXVRP","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3PRXSEPTXVRPPUA5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3PRXSEPT","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:ecf9a24e03785ff5067b73fb6561ae0be7ed0653c1a88f5b54f90998c7ae8ce0","target":"graph","created_at":"2026-05-18T01:31:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Anatoli Juditsky, Arkadi Nemirovski, Bruce Cox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-08T11:30:59Z","title":"Decomposition Techniques for Bilinear Saddle Point Problems and Variational Inequalities with Affine Monotone Operators on Domains Given by Linear Minimization Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02444","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0706289051ad0e3474e230f6a49e82bb620898b257811e7d03894873073e06b6","target":"record","created_at":"2026-05-18T01:31:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"928f169ff9cae5567e60fd8e01d748c38369fae0705f805bbab8e7e150a8021c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-08T11:30:59Z","title_canon_sha256":"ce77d184b1491aa92275713f3776454df1a6d66b34108ed2dde7442f012f69b9"},"schema_version":"1.0","source":{"id":"1506.02444","kind":"arxiv","version":3}},"canonical_sha256":"dbe37911f3bd62f7d01d6c2f289c9490edd25b167c29ba48deb0df9f9f5fdbac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbe37911f3bd62f7d01d6c2f289c9490edd25b167c29ba48deb0df9f9f5fdbac","first_computed_at":"2026-05-18T01:31:13.631527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:13.631527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3TA2WNU9MkNzZ1ZjYOcdQQI/ON/b6Nj9T6JDEfydV4+SM0TL05584yCiyPYbO1v/MKXm5tcxtjR/4QAd7TE5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:13.631960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02444","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0706289051ad0e3474e230f6a49e82bb620898b257811e7d03894873073e06b6","sha256:ecf9a24e03785ff5067b73fb6561ae0be7ed0653c1a88f5b54f90998c7ae8ce0"],"state_sha256":"8795a7c5f095449c07f6e36919316ff3ac7c67d1b52cbb50b92003fd0650296c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Qu21gA8vE1xtksoDzR7CwJYRVd7ADicPUjmS+xLzEuBdtfncwrUSYcSPSdQZQaTcgfs3xhyILs5VlbY5MRvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:36:47.014404Z","bundle_sha256":"2577251d92cc4632284de8ce0078261f429559305e46887f46efd334d4784330"}}