{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EEXJOBKQDYCVSYNRPBYUXRXJZV","short_pith_number":"pith:EEXJOBKQ","canonical_record":{"source":{"id":"2210.03096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-06T17:50:42Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"e51a3ac09111dca3a3019b5d434c10f378615c0bba42a059e70f293a70dc3b59","abstract_canon_sha256":"d79795dae9e4bfda197b029ef21179a371192bfa1c71eae81ef5b04b51ce2563"},"schema_version":"1.0"},"canonical_sha256":"212e9705501e055961b178714bc6e9cd62d53d5d7a97170d34e7f9bdbcd7f637","source":{"kind":"arxiv","id":"2210.03096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03096","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03096v2","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03096","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"EEXJOBKQDYCV","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"EEXJOBKQDYCVSYNR","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"EEXJOBKQ","created_at":"2026-07-05T06:09:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EEXJOBKQDYCVSYNRPBYUXRXJZV","target":"record","payload":{"canonical_record":{"source":{"id":"2210.03096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-06T17:50:42Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"e51a3ac09111dca3a3019b5d434c10f378615c0bba42a059e70f293a70dc3b59","abstract_canon_sha256":"d79795dae9e4bfda197b029ef21179a371192bfa1c71eae81ef5b04b51ce2563"},"schema_version":"1.0"},"canonical_sha256":"212e9705501e055961b178714bc6e9cd62d53d5d7a97170d34e7f9bdbcd7f637","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:45.242970Z","signature_b64":"4APAEiFp9H9XQpqKrMnOgLvsico6VmkDbe/Kq8OGJtIPlYfgnNVV1L6OkYYyoFiVPzbJEbN6um2cxmDbwtFSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"212e9705501e055961b178714bc6e9cd62d53d5d7a97170d34e7f9bdbcd7f637","last_reissued_at":"2026-07-05T06:09:45.242556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:45.242556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.03096","source_version":2,"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-05T06:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7Pi8/ptZXNVhcRQd3DeXzZZ1wYiujG9lh1XA+Scu95aGFZYOVDB1bJEu68stVJdH8M+nrpTVTquv/ib6x/+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:13:11.990446Z"},"content_sha256":"7dc34f2da97d9547018e58e0211ee39ae0ddef9bc262e7d375c8607f9e33e6a6","schema_version":"1.0","event_id":"sha256:7dc34f2da97d9547018e58e0211ee39ae0ddef9bc262e7d375c8607f9e33e6a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EEXJOBKQDYCVSYNRPBYUXRXJZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"math.OC","authors_text":"Weiqiang Zheng, Yang Cai","submitted_at":"2022-10-06T17:50:42Z","abstract_excerpt":"We study first-order methods for constrained min-max optimization. Existing methods either require two gradient calls or two projections in each iteration, which may be costly in some applications. In this paper, we first show that a variant of the Optimistic Gradient (OG) method, a single-call single-projection algorithm, has $O(\\frac{1}{\\sqrt{T}})$ best-iterate convergence rate for inclusion problems with operators that satisfy the weak Minty variation inequality (MVI). Our second result is the first single-call single-projection algorithm -- the Accelerated Reflected Gradient (ARG) method t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03096","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.03096/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-05T06:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkCr2+fFcjQ0Ep8565vXNokQU1W5kbYPUkmKoIgpxcDyzteYjdkRv+T57ytGEJVI9Ae3oli5GCybK4FqB4J8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:13:11.990944Z"},"content_sha256":"d55ad45f61e8fc3993886b7261f4fff57ce8b34dfaea5e229712738d17323a24","schema_version":"1.0","event_id":"sha256:d55ad45f61e8fc3993886b7261f4fff57ce8b34dfaea5e229712738d17323a24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEXJOBKQDYCVSYNRPBYUXRXJZV/bundle.json","state_url":"https://pith.science/pith/EEXJOBKQDYCVSYNRPBYUXRXJZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEXJOBKQDYCVSYNRPBYUXRXJZV/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-08T09:13:11Z","links":{"resolver":"https://pith.science/pith/EEXJOBKQDYCVSYNRPBYUXRXJZV","bundle":"https://pith.science/pith/EEXJOBKQDYCVSYNRPBYUXRXJZV/bundle.json","state":"https://pith.science/pith/EEXJOBKQDYCVSYNRPBYUXRXJZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEXJOBKQDYCVSYNRPBYUXRXJZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EEXJOBKQDYCVSYNRPBYUXRXJZV","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":"d79795dae9e4bfda197b029ef21179a371192bfa1c71eae81ef5b04b51ce2563","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-06T17:50:42Z","title_canon_sha256":"e51a3ac09111dca3a3019b5d434c10f378615c0bba42a059e70f293a70dc3b59"},"schema_version":"1.0","source":{"id":"2210.03096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03096","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03096v2","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03096","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"EEXJOBKQDYCV","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"pith_short_16","alias_value":"EEXJOBKQDYCVSYNR","created_at":"2026-07-05T06:09:45Z"},{"alias_kind":"pith_short_8","alias_value":"EEXJOBKQ","created_at":"2026-07-05T06:09:45Z"}],"graph_snapshots":[{"event_id":"sha256:d55ad45f61e8fc3993886b7261f4fff57ce8b34dfaea5e229712738d17323a24","target":"graph","created_at":"2026-07-05T06:09:45Z","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/2210.03096/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study first-order methods for constrained min-max optimization. Existing methods either require two gradient calls or two projections in each iteration, which may be costly in some applications. In this paper, we first show that a variant of the Optimistic Gradient (OG) method, a single-call single-projection algorithm, has $O(\\frac{1}{\\sqrt{T}})$ best-iterate convergence rate for inclusion problems with operators that satisfy the weak Minty variation inequality (MVI). Our second result is the first single-call single-projection algorithm -- the Accelerated Reflected Gradient (ARG) method t","authors_text":"Weiqiang Zheng, Yang Cai","cross_cats":["cs.GT","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-06T17:50:42Z","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03096","kind":"arxiv","version":2},"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:7dc34f2da97d9547018e58e0211ee39ae0ddef9bc262e7d375c8607f9e33e6a6","target":"record","created_at":"2026-07-05T06:09:45Z","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":"d79795dae9e4bfda197b029ef21179a371192bfa1c71eae81ef5b04b51ce2563","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-06T17:50:42Z","title_canon_sha256":"e51a3ac09111dca3a3019b5d434c10f378615c0bba42a059e70f293a70dc3b59"},"schema_version":"1.0","source":{"id":"2210.03096","kind":"arxiv","version":2}},"canonical_sha256":"212e9705501e055961b178714bc6e9cd62d53d5d7a97170d34e7f9bdbcd7f637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"212e9705501e055961b178714bc6e9cd62d53d5d7a97170d34e7f9bdbcd7f637","first_computed_at":"2026-07-05T06:09:45.242556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:45.242556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4APAEiFp9H9XQpqKrMnOgLvsico6VmkDbe/Kq8OGJtIPlYfgnNVV1L6OkYYyoFiVPzbJEbN6um2cxmDbwtFSCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:45.242970Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.03096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dc34f2da97d9547018e58e0211ee39ae0ddef9bc262e7d375c8607f9e33e6a6","sha256:d55ad45f61e8fc3993886b7261f4fff57ce8b34dfaea5e229712738d17323a24"],"state_sha256":"9ceeff97ea821416d68d27d261072ae69ab5332bfb650e06ad88448589757525"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgC2gzZKbLyPxNAaI8FPk9rLJv3Y3yJdvS7y6FfAfUYJVUdzv4KrKysBMzdSkDQfZqvg/DQrpwgTFn6VjBh3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:13:11.994730Z","bundle_sha256":"1caeb91c476915df30e2e4daff3be32b0216b6af2aba5e189c7b6249b6c1e1d0"}}