{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GJVVOERLIGE4T3FHCD3E27QQTV","short_pith_number":"pith:GJVVOERL","canonical_record":{"source":{"id":"1808.02901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-08T18:04:13Z","cross_cats_sorted":[],"title_canon_sha256":"25151ce4963869c425aed3150216aca1e2c5d607bf068e9efc13082fd87e796a","abstract_canon_sha256":"2ddffb7dbd4371488dc6280136b5a90966ab540799e60dc1f774006750378ae8"},"schema_version":"1.0"},"canonical_sha256":"326b57122b4189c9eca710f64d7e109d54fb002dd4d4a862ffec420b84c12628","source":{"kind":"arxiv","id":"1808.02901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02901","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02901v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02901","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"GJVVOERLIGE4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GJVVOERLIGE4T3FH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GJVVOERL","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GJVVOERLIGE4T3FHCD3E27QQTV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-08T18:04:13Z","cross_cats_sorted":[],"title_canon_sha256":"25151ce4963869c425aed3150216aca1e2c5d607bf068e9efc13082fd87e796a","abstract_canon_sha256":"2ddffb7dbd4371488dc6280136b5a90966ab540799e60dc1f774006750378ae8"},"schema_version":"1.0"},"canonical_sha256":"326b57122b4189c9eca710f64d7e109d54fb002dd4d4a862ffec420b84c12628","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.697643Z","signature_b64":"rU9M/a1Sel2kMyRsPfcyB32QFDPx9QPWx3lMjKEOeCT3bdtFO+iyLN56dBXF2tkjw72I98ZcXxuO7+CVQmUABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"326b57122b4189c9eca710f64d7e109d54fb002dd4d4a862ffec420b84c12628","last_reissued_at":"2026-05-18T00:08:30.697228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.697228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02901","source_version":1,"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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RfzMRKAJGdTlymsWOfCtiN10nJNB/dLi5C9OSpk/Pa6P1e4Ds8aIB4hMTeJj3HW3AcmTjejriN128gtdvaOlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:01:03.721534Z"},"content_sha256":"1f33e0fee8da57241db18c0a454c03b38711170739bde0a8d022242ac1446dbb","schema_version":"1.0","event_id":"sha256:1f33e0fee8da57241db18c0a454c03b38711170739bde0a8d022242ac1446dbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GJVVOERLIGE4T3FHCD3E27QQTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yangyang Xu, Yuyuan Ouyang","submitted_at":"2018-08-08T18:04:13Z","abstract_excerpt":"On solving a convex-concave bilinear saddle-point problem (SPP), there have been many works studying the complexity results of first-order methods. These results are all about upper complexity bounds, which can determine at most how many efforts would guarantee a solution of desired accuracy. In this paper, we pursue the opposite direction by deriving lower complexity bounds of first-order methods on large-scale SPPs. Our results apply to the methods whose iterates are in the linear span of past first-order information, as well as more general methods that produce their iterates in an arbitrar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02901","kind":"arxiv","version":1},"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-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HRQz9/evcWJcPyuwwJVwc+4HeJO69fjxQo0hkxGQP+XB1Rk7igTy4/+ykOgOZh0tRofGMGgQI6hR1GcQKhdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:01:03.721875Z"},"content_sha256":"4bfee3ae6a6c3736f9ddd0cd21d158aeba1a324b827aa436ec1082be6c2c16bc","schema_version":"1.0","event_id":"sha256:4bfee3ae6a6c3736f9ddd0cd21d158aeba1a324b827aa436ec1082be6c2c16bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJVVOERLIGE4T3FHCD3E27QQTV/bundle.json","state_url":"https://pith.science/pith/GJVVOERLIGE4T3FHCD3E27QQTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJVVOERLIGE4T3FHCD3E27QQTV/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-05T10:01:03Z","links":{"resolver":"https://pith.science/pith/GJVVOERLIGE4T3FHCD3E27QQTV","bundle":"https://pith.science/pith/GJVVOERLIGE4T3FHCD3E27QQTV/bundle.json","state":"https://pith.science/pith/GJVVOERLIGE4T3FHCD3E27QQTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJVVOERLIGE4T3FHCD3E27QQTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GJVVOERLIGE4T3FHCD3E27QQTV","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":"2ddffb7dbd4371488dc6280136b5a90966ab540799e60dc1f774006750378ae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-08T18:04:13Z","title_canon_sha256":"25151ce4963869c425aed3150216aca1e2c5d607bf068e9efc13082fd87e796a"},"schema_version":"1.0","source":{"id":"1808.02901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02901","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02901v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02901","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"GJVVOERLIGE4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GJVVOERLIGE4T3FH","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GJVVOERL","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:4bfee3ae6a6c3736f9ddd0cd21d158aeba1a324b827aa436ec1082be6c2c16bc","target":"graph","created_at":"2026-05-18T00:08:30Z","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":"On solving a convex-concave bilinear saddle-point problem (SPP), there have been many works studying the complexity results of first-order methods. These results are all about upper complexity bounds, which can determine at most how many efforts would guarantee a solution of desired accuracy. In this paper, we pursue the opposite direction by deriving lower complexity bounds of first-order methods on large-scale SPPs. Our results apply to the methods whose iterates are in the linear span of past first-order information, as well as more general methods that produce their iterates in an arbitrar","authors_text":"Yangyang Xu, Yuyuan Ouyang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-08T18:04:13Z","title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02901","kind":"arxiv","version":1},"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:1f33e0fee8da57241db18c0a454c03b38711170739bde0a8d022242ac1446dbb","target":"record","created_at":"2026-05-18T00:08:30Z","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":"2ddffb7dbd4371488dc6280136b5a90966ab540799e60dc1f774006750378ae8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-08T18:04:13Z","title_canon_sha256":"25151ce4963869c425aed3150216aca1e2c5d607bf068e9efc13082fd87e796a"},"schema_version":"1.0","source":{"id":"1808.02901","kind":"arxiv","version":1}},"canonical_sha256":"326b57122b4189c9eca710f64d7e109d54fb002dd4d4a862ffec420b84c12628","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"326b57122b4189c9eca710f64d7e109d54fb002dd4d4a862ffec420b84c12628","first_computed_at":"2026-05-18T00:08:30.697228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:30.697228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rU9M/a1Sel2kMyRsPfcyB32QFDPx9QPWx3lMjKEOeCT3bdtFO+iyLN56dBXF2tkjw72I98ZcXxuO7+CVQmUABA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:30.697643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f33e0fee8da57241db18c0a454c03b38711170739bde0a8d022242ac1446dbb","sha256:4bfee3ae6a6c3736f9ddd0cd21d158aeba1a324b827aa436ec1082be6c2c16bc"],"state_sha256":"36c13704b38f70571fca35296a1b8354b214e2b57691d261e8467648f3c6e01a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+snjC/TORrPog8xnn1vCxijZ3JuHOTz7p4HncvSJxjOcRXztKF45qxcteo2dkGhnP4O4mwirFE7StFVRVpYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:01:03.723752Z","bundle_sha256":"f59a71a33c0809b9c040d36a9dce1e60646c265e9570b94f589bba2cf38c062d"}}