{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JHRCSVU6BSO5C6V62Z23BXN36S","short_pith_number":"pith:JHRCSVU6","canonical_record":{"source":{"id":"2308.12359","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-23T18:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"05293712556ea13aa0c42f5a26a60834495b15c043b97c80583c4b0607445518","abstract_canon_sha256":"e4432fe9006610e2cd6fe507c94e1bde9655c9f47e85ca85a0f47097c1cf496b"},"schema_version":"1.0"},"canonical_sha256":"49e229569e0c9dd17abed675b0ddbbf480b7f640783da38f0de3a9eefc6d9159","source":{"kind":"arxiv","id":"2308.12359","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.12359","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"2308.12359v3","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12359","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"JHRCSVU6BSO5","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"pith_short_16","alias_value":"JHRCSVU6BSO5C6V6","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"pith_short_8","alias_value":"JHRCSVU6","created_at":"2026-07-05T11:13:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JHRCSVU6BSO5C6V62Z23BXN36S","target":"record","payload":{"canonical_record":{"source":{"id":"2308.12359","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-23T18:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"05293712556ea13aa0c42f5a26a60834495b15c043b97c80583c4b0607445518","abstract_canon_sha256":"e4432fe9006610e2cd6fe507c94e1bde9655c9f47e85ca85a0f47097c1cf496b"},"schema_version":"1.0"},"canonical_sha256":"49e229569e0c9dd17abed675b0ddbbf480b7f640783da38f0de3a9eefc6d9159","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:05.596999Z","signature_b64":"uVtIoAq2ago8fgwAOs1LgfQTjmN8qDnJryj4ycL2Op0THxv7oVZ/WAhfwJjAQgh8zadw0u+KpnE10LZP0f/LAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49e229569e0c9dd17abed675b0ddbbf480b7f640783da38f0de3a9eefc6d9159","last_reissued_at":"2026-07-05T11:13:05.596427Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:05.596427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.12359","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-07-05T11:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhHKgI0hxwNuNL4X0eVJwZBxZu7A9Ant2BKVISfRwFPkma8WigS5rmkrhZHX9yLD4C1nRZ4gD+ZiW9lptHZoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:04:42.437866Z"},"content_sha256":"a55654cbb7844bb659d9deadfac563171d43a5a98abde1b53b109cd0338a7e5b","schema_version":"1.0","event_id":"sha256:a55654cbb7844bb659d9deadfac563171d43a5a98abde1b53b109cd0338a7e5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JHRCSVU6BSO5C6V62Z23BXN36S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Moving Anchor Extragradient Methods For Smooth Structured Minimax Problems","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"James K. Alcala, Mahesh Sunkula, Yat Tin Chow","submitted_at":"2023-08-23T18:04:18Z","abstract_excerpt":"This work introduces a moving anchor acceleration technique to extragradient algorithms for smooth structured minimax problems. The moving anchor is introduced as a generalization of the original algorithmic anchoring framework, i.e. the EAG method introduced in [32], in hope of further acceleration. We show that the optimal order of convergence in terms of worst-case complexity on the squared gradient, O(1/k2), is achieved by our new method (where k is the number of iterations). We have also extended our algorithm to a more general nonconvex-nonconcave class of saddle point problems using the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12359","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.12359/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-05T11:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XPYMhn1tohAE57zPO5UCT9X13PlUFuF/UWuH+pJTDVW1KKlBz2YKWKelNb0m+jyQFGoVpvIQqvxYK+05uVmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:04:42.438786Z"},"content_sha256":"f62571a24c392ec9571243a8774c4d3c16970d904904908f0b92b716044de9c2","schema_version":"1.0","event_id":"sha256:f62571a24c392ec9571243a8774c4d3c16970d904904908f0b92b716044de9c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHRCSVU6BSO5C6V62Z23BXN36S/bundle.json","state_url":"https://pith.science/pith/JHRCSVU6BSO5C6V62Z23BXN36S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHRCSVU6BSO5C6V62Z23BXN36S/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-16T17:04:42Z","links":{"resolver":"https://pith.science/pith/JHRCSVU6BSO5C6V62Z23BXN36S","bundle":"https://pith.science/pith/JHRCSVU6BSO5C6V62Z23BXN36S/bundle.json","state":"https://pith.science/pith/JHRCSVU6BSO5C6V62Z23BXN36S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHRCSVU6BSO5C6V62Z23BXN36S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JHRCSVU6BSO5C6V62Z23BXN36S","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":"e4432fe9006610e2cd6fe507c94e1bde9655c9f47e85ca85a0f47097c1cf496b","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-23T18:04:18Z","title_canon_sha256":"05293712556ea13aa0c42f5a26a60834495b15c043b97c80583c4b0607445518"},"schema_version":"1.0","source":{"id":"2308.12359","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.12359","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"2308.12359v3","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12359","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"JHRCSVU6BSO5","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"pith_short_16","alias_value":"JHRCSVU6BSO5C6V6","created_at":"2026-07-05T11:13:05Z"},{"alias_kind":"pith_short_8","alias_value":"JHRCSVU6","created_at":"2026-07-05T11:13:05Z"}],"graph_snapshots":[{"event_id":"sha256:f62571a24c392ec9571243a8774c4d3c16970d904904908f0b92b716044de9c2","target":"graph","created_at":"2026-07-05T11:13:05Z","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/2308.12359/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work introduces a moving anchor acceleration technique to extragradient algorithms for smooth structured minimax problems. The moving anchor is introduced as a generalization of the original algorithmic anchoring framework, i.e. the EAG method introduced in [32], in hope of further acceleration. We show that the optimal order of convergence in terms of worst-case complexity on the squared gradient, O(1/k2), is achieved by our new method (where k is the number of iterations). We have also extended our algorithm to a more general nonconvex-nonconcave class of saddle point problems using the","authors_text":"James K. Alcala, Mahesh Sunkula, Yat Tin Chow","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-23T18:04:18Z","title":"Moving Anchor Extragradient Methods For Smooth Structured Minimax Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12359","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:a55654cbb7844bb659d9deadfac563171d43a5a98abde1b53b109cd0338a7e5b","target":"record","created_at":"2026-07-05T11:13:05Z","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":"e4432fe9006610e2cd6fe507c94e1bde9655c9f47e85ca85a0f47097c1cf496b","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-23T18:04:18Z","title_canon_sha256":"05293712556ea13aa0c42f5a26a60834495b15c043b97c80583c4b0607445518"},"schema_version":"1.0","source":{"id":"2308.12359","kind":"arxiv","version":3}},"canonical_sha256":"49e229569e0c9dd17abed675b0ddbbf480b7f640783da38f0de3a9eefc6d9159","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49e229569e0c9dd17abed675b0ddbbf480b7f640783da38f0de3a9eefc6d9159","first_computed_at":"2026-07-05T11:13:05.596427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:05.596427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uVtIoAq2ago8fgwAOs1LgfQTjmN8qDnJryj4ycL2Op0THxv7oVZ/WAhfwJjAQgh8zadw0u+KpnE10LZP0f/LAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:05.596999Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.12359","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a55654cbb7844bb659d9deadfac563171d43a5a98abde1b53b109cd0338a7e5b","sha256:f62571a24c392ec9571243a8774c4d3c16970d904904908f0b92b716044de9c2"],"state_sha256":"ae9e98dc7c3a21bcfb44267629fd25428f40b51a4fbbbb2537bf022aea29b811"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZjqTi+E5xtmkTHsl8roS0cryK9nvWqZr0deI1to+oNZMqxQsaGJIc8aHUMsJv4spgqaaObKPzysxothp5ygDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:04:42.445855Z","bundle_sha256":"97c8b5226850ddb2ce49911512db42b47bf58f4261e68603aaea58824d8921b6"}}