{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IKJGQTSCZ623TCLOE64ZOGQUAC","short_pith_number":"pith:IKJGQTSC","canonical_record":{"source":{"id":"1903.01687","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T06:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"402f1d856abb6ecca18c6bb9ffcd24880cf8a7a11b3f458e27e341da7c3ba609","abstract_canon_sha256":"db5e73bf1c2d8f1d9ad496a1634fe2037606b402223bf4dff9e35dd762063537"},"schema_version":"1.0"},"canonical_sha256":"4292684e42cfb5b9896e27b9971a1400befad39b6793af325ec9a20146ae510a","source":{"kind":"arxiv","id":"1903.01687","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01687","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01687v4","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01687","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"IKJGQTSCZ623","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_16","alias_value":"IKJGQTSCZ623TCLO","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_8","alias_value":"IKJGQTSC","created_at":"2026-07-05T02:30:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IKJGQTSCZ623TCLOE64ZOGQUAC","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01687","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T06:03:54Z","cross_cats_sorted":[],"title_canon_sha256":"402f1d856abb6ecca18c6bb9ffcd24880cf8a7a11b3f458e27e341da7c3ba609","abstract_canon_sha256":"db5e73bf1c2d8f1d9ad496a1634fe2037606b402223bf4dff9e35dd762063537"},"schema_version":"1.0"},"canonical_sha256":"4292684e42cfb5b9896e27b9971a1400befad39b6793af325ec9a20146ae510a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:40.417623Z","signature_b64":"294jHoLZCuL8zySLvtWWf4vzu0mkx4IW6lxDnzfVzGFT0vylh4UWe8tidE0U59+gXosZejoaKy503bmYgncODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4292684e42cfb5b9896e27b9971a1400befad39b6793af325ec9a20146ae510a","last_reissued_at":"2026-07-05T02:30:40.417226Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:40.417226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01687","source_version":4,"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-07-05T02:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77jvVgFaLB4r9wds4FWNnG2e4GJHbo04MMJE7GUkBeJur8QTnOIT4wREQG3juAkHq+qGg0hR3HqvbvagBw0ECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:04:53.650347Z"},"content_sha256":"15d227d9bfaa23bd6fe98713b61210878f3f075d7b3c8027b7d9d50489e32208","schema_version":"1.0","event_id":"sha256:15d227d9bfaa23bd6fe98713b61210878f3f075d7b3c8027b7d9d50489e32208"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IKJGQTSCZ623TCLOE64ZOGQUAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Renbo Zhao","submitted_at":"2019-03-05T06:03:54Z","abstract_excerpt":"We develop stochastic first-order primal-dual algorithms to solve a class of convex-concave saddle-point problems. When the saddle function is strongly convex in the primal variable, we develop the first stochastic restart scheme for this problem. When the gradient noises obey sub-Gaussian distributions, the oracle complexity of our restart scheme is strictly better than any of the existing methods, even in the deterministic case. Furthermore, for each problem parameter of interest, whenever the lower bound exists, the oracle complexity of our restart scheme is either optimal or nearly optimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01687","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1903.01687/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:30:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2D04Lk3vqw0ovDT0Qgy0j0raYK1Zv/YybtIxPlTmoVU3ZqXdG0hIQldBeHd1u2L3ZBuNX5NQbXCh9F3ve8VqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T18:04:53.650886Z"},"content_sha256":"9ed65659c6822ed6fffc78685cad1dc7196d52980743d40c77fd380fe0caaf13","schema_version":"1.0","event_id":"sha256:9ed65659c6822ed6fffc78685cad1dc7196d52980743d40c77fd380fe0caaf13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKJGQTSCZ623TCLOE64ZOGQUAC/bundle.json","state_url":"https://pith.science/pith/IKJGQTSCZ623TCLOE64ZOGQUAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKJGQTSCZ623TCLOE64ZOGQUAC/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-08-04T18:04:53Z","links":{"resolver":"https://pith.science/pith/IKJGQTSCZ623TCLOE64ZOGQUAC","bundle":"https://pith.science/pith/IKJGQTSCZ623TCLOE64ZOGQUAC/bundle.json","state":"https://pith.science/pith/IKJGQTSCZ623TCLOE64ZOGQUAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKJGQTSCZ623TCLOE64ZOGQUAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IKJGQTSCZ623TCLOE64ZOGQUAC","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":"db5e73bf1c2d8f1d9ad496a1634fe2037606b402223bf4dff9e35dd762063537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T06:03:54Z","title_canon_sha256":"402f1d856abb6ecca18c6bb9ffcd24880cf8a7a11b3f458e27e341da7c3ba609"},"schema_version":"1.0","source":{"id":"1903.01687","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01687","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01687v4","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01687","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_12","alias_value":"IKJGQTSCZ623","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_16","alias_value":"IKJGQTSCZ623TCLO","created_at":"2026-07-05T02:30:40Z"},{"alias_kind":"pith_short_8","alias_value":"IKJGQTSC","created_at":"2026-07-05T02:30:40Z"}],"graph_snapshots":[{"event_id":"sha256:9ed65659c6822ed6fffc78685cad1dc7196d52980743d40c77fd380fe0caaf13","target":"graph","created_at":"2026-07-05T02:30:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.01687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop stochastic first-order primal-dual algorithms to solve a class of convex-concave saddle-point problems. When the saddle function is strongly convex in the primal variable, we develop the first stochastic restart scheme for this problem. When the gradient noises obey sub-Gaussian distributions, the oracle complexity of our restart scheme is strictly better than any of the existing methods, even in the deterministic case. Furthermore, for each problem parameter of interest, whenever the lower bound exists, the oracle complexity of our restart scheme is either optimal or nearly optimal","authors_text":"Renbo Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T06:03:54Z","title":"Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01687","kind":"arxiv","version":4},"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:15d227d9bfaa23bd6fe98713b61210878f3f075d7b3c8027b7d9d50489e32208","target":"record","created_at":"2026-07-05T02:30:40Z","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":"db5e73bf1c2d8f1d9ad496a1634fe2037606b402223bf4dff9e35dd762063537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-05T06:03:54Z","title_canon_sha256":"402f1d856abb6ecca18c6bb9ffcd24880cf8a7a11b3f458e27e341da7c3ba609"},"schema_version":"1.0","source":{"id":"1903.01687","kind":"arxiv","version":4}},"canonical_sha256":"4292684e42cfb5b9896e27b9971a1400befad39b6793af325ec9a20146ae510a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4292684e42cfb5b9896e27b9971a1400befad39b6793af325ec9a20146ae510a","first_computed_at":"2026-07-05T02:30:40.417226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:30:40.417226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"294jHoLZCuL8zySLvtWWf4vzu0mkx4IW6lxDnzfVzGFT0vylh4UWe8tidE0U59+gXosZejoaKy503bmYgncODg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:30:40.417623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01687","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15d227d9bfaa23bd6fe98713b61210878f3f075d7b3c8027b7d9d50489e32208","sha256:9ed65659c6822ed6fffc78685cad1dc7196d52980743d40c77fd380fe0caaf13"],"state_sha256":"16bab2decf25bc9ceccbdab570c3a8493a8ccbec433300c54d2356b194609d21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgPXbMTNTRHZkQ9R/lrCIVyLdC2tPcQ7mGiICFCrlkDWaypTqAURUDD0JlH3bWLd2d3AZf7T6W3Lacozqm+EBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T18:04:53.655669Z","bundle_sha256":"198e2a327b00e7c068db25500df325a719c529d3a77782a592b9c8adf18e5a71"}}