{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NV6YAT5FZGXPW37XZVWRZISDS2","short_pith_number":"pith:NV6YAT5F","canonical_record":{"source":{"id":"1311.1098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-05T15:54:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"82ea46a81f3d3e62c6ce804c7b43d25ee77032cb38fd1bbccec8dee5ec405ecc","abstract_canon_sha256":"69ba28080478b2bea7b8eaa23feeabb8ef72966114c5436f69a848c51c57ba7e"},"schema_version":"1.0"},"canonical_sha256":"6d7d804fa5c9aefb6ff7cd6d1ca24396aec6253a3e9146faee3ac02ec3c5dbc6","source":{"kind":"arxiv","id":"1311.1098","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1098","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1098v3","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1098","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"NV6YAT5FZGXP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NV6YAT5FZGXPW37X","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NV6YAT5F","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NV6YAT5FZGXPW37XZVWRZISDS2","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-05T15:54:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"82ea46a81f3d3e62c6ce804c7b43d25ee77032cb38fd1bbccec8dee5ec405ecc","abstract_canon_sha256":"69ba28080478b2bea7b8eaa23feeabb8ef72966114c5436f69a848c51c57ba7e"},"schema_version":"1.0"},"canonical_sha256":"6d7d804fa5c9aefb6ff7cd6d1ca24396aec6253a3e9146faee3ac02ec3c5dbc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:23.081039Z","signature_b64":"90pa26ch1jr1nUBaMQkoZAfaGdEMEXpHt3HowmSwI02yBaZ/j6FQxEA8bJsM9hu6pMulwhUPjR3ILHPM0D0FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d7d804fa5c9aefb6ff7cd6d1ca24396aec6253a3e9146faee3ac02ec3c5dbc6","last_reissued_at":"2026-05-18T02:51:23.080387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:23.080387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1098","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-18T02:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjBbeFguNLCiLKXatDjERbaUuK4sV+4YSwaTb0wbxwWtk9wP24xSQvE1qK7a7hHkCpYycsFzD1/9io0MyjOcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:26:42.723294Z"},"content_sha256":"e9654742f51eaa3b5a0b5b29dcc10b6fbd7f3eb0e6d4669a700ae7d88a12c126","schema_version":"1.0","event_id":"sha256:e9654742f51eaa3b5a0b5b29dcc10b6fbd7f3eb0e6d4669a700ae7d88a12c126"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NV6YAT5FZGXPW37XZVWRZISDS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mirror Prox Algorithm for Multi-Term Composite Minimization and Semi-Separable Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Anatoli Juditsky, Arkadi Nemirovski, Niao He","submitted_at":"2013-11-05T15:54:35Z","abstract_excerpt":"In the paper, we develop a composite version of Mirror Prox algorithm for solving convex-concave saddle point problems and monotone variational inequalities of special structure, allowing to cover saddle point/variational analogies of what is usually called \"composite minimization\" (minimizing a sum of an easy-to-handle nonsmooth and a general-type smooth convex functions \"as if\" there were no nonsmooth component at all). We demonstrate that the composite Mirror Prox inherits the favourable (and unimprovable already in the large-scale bilinear saddle point case) $O(1/\\epsilon)$ efficiency esti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1098","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-18T02:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cyq/g+pmjY9tBbrHOY3vssGlPQD+Bs45JYkJTzbI6CdSYSeaKj1grTNt86QiZn1E8aPSDLukSBQj48pnmcuACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:26:42.724005Z"},"content_sha256":"b13a7213f2e2a8e41e48c6600d714042478c6d9d416229228b06a9586fd5bd3a","schema_version":"1.0","event_id":"sha256:b13a7213f2e2a8e41e48c6600d714042478c6d9d416229228b06a9586fd5bd3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NV6YAT5FZGXPW37XZVWRZISDS2/bundle.json","state_url":"https://pith.science/pith/NV6YAT5FZGXPW37XZVWRZISDS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NV6YAT5FZGXPW37XZVWRZISDS2/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-05-29T22:26:42Z","links":{"resolver":"https://pith.science/pith/NV6YAT5FZGXPW37XZVWRZISDS2","bundle":"https://pith.science/pith/NV6YAT5FZGXPW37XZVWRZISDS2/bundle.json","state":"https://pith.science/pith/NV6YAT5FZGXPW37XZVWRZISDS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NV6YAT5FZGXPW37XZVWRZISDS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NV6YAT5FZGXPW37XZVWRZISDS2","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":"69ba28080478b2bea7b8eaa23feeabb8ef72966114c5436f69a848c51c57ba7e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-05T15:54:35Z","title_canon_sha256":"82ea46a81f3d3e62c6ce804c7b43d25ee77032cb38fd1bbccec8dee5ec405ecc"},"schema_version":"1.0","source":{"id":"1311.1098","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1098","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1098v3","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1098","created_at":"2026-05-18T02:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"NV6YAT5FZGXP","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NV6YAT5FZGXPW37X","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NV6YAT5F","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:b13a7213f2e2a8e41e48c6600d714042478c6d9d416229228b06a9586fd5bd3a","target":"graph","created_at":"2026-05-18T02:51:23Z","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":"In the paper, we develop a composite version of Mirror Prox algorithm for solving convex-concave saddle point problems and monotone variational inequalities of special structure, allowing to cover saddle point/variational analogies of what is usually called \"composite minimization\" (minimizing a sum of an easy-to-handle nonsmooth and a general-type smooth convex functions \"as if\" there were no nonsmooth component at all). We demonstrate that the composite Mirror Prox inherits the favourable (and unimprovable already in the large-scale bilinear saddle point case) $O(1/\\epsilon)$ efficiency esti","authors_text":"Anatoli Juditsky, Arkadi Nemirovski, Niao He","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-05T15:54:35Z","title":"Mirror Prox Algorithm for Multi-Term Composite Minimization and Semi-Separable Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1098","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:e9654742f51eaa3b5a0b5b29dcc10b6fbd7f3eb0e6d4669a700ae7d88a12c126","target":"record","created_at":"2026-05-18T02:51:23Z","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":"69ba28080478b2bea7b8eaa23feeabb8ef72966114c5436f69a848c51c57ba7e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-11-05T15:54:35Z","title_canon_sha256":"82ea46a81f3d3e62c6ce804c7b43d25ee77032cb38fd1bbccec8dee5ec405ecc"},"schema_version":"1.0","source":{"id":"1311.1098","kind":"arxiv","version":3}},"canonical_sha256":"6d7d804fa5c9aefb6ff7cd6d1ca24396aec6253a3e9146faee3ac02ec3c5dbc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d7d804fa5c9aefb6ff7cd6d1ca24396aec6253a3e9146faee3ac02ec3c5dbc6","first_computed_at":"2026-05-18T02:51:23.080387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:23.080387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"90pa26ch1jr1nUBaMQkoZAfaGdEMEXpHt3HowmSwI02yBaZ/j6FQxEA8bJsM9hu6pMulwhUPjR3ILHPM0D0FDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:23.081039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1098","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9654742f51eaa3b5a0b5b29dcc10b6fbd7f3eb0e6d4669a700ae7d88a12c126","sha256:b13a7213f2e2a8e41e48c6600d714042478c6d9d416229228b06a9586fd5bd3a"],"state_sha256":"37258a6101166c7c9b0a3344d9da9bb56ad6e598e4d62c9d8146604aff3202d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k2M4ULJdzdXImyCkGSOEd/SZ485kBb3PdSdGr8gvropRopZdSbQ3iOEiiuQA+/MNY9uqIozDLXow/U8tXniEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:26:42.727847Z","bundle_sha256":"2bf4045e72883acb856bdf576b60b9f5ef623a54647a6a6bc293b4f1da7c8972"}}