{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FQQ2ZEHMPSHRRQEM7HV4BYVEQ4","short_pith_number":"pith:FQQ2ZEHM","canonical_record":{"source":{"id":"1802.01504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-05T16:27:06Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"92787c2c569f4e52f2a757c3424927bf4bc96e6cca4ab86b8be25bab97f01956","abstract_canon_sha256":"007e594d54429b4db75114a1e99aea89e4addcaa67d5e231511013b65e6537b9"},"schema_version":"1.0"},"canonical_sha256":"2c21ac90ec7c8f18c08cf9ebc0e2a4872f7f2cd1b4f2c3bb0fee54f160f936ee","source":{"kind":"arxiv","id":"1802.01504","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01504","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01504v2","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01504","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"FQQ2ZEHMPSHR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FQQ2ZEHMPSHRRQEM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FQQ2ZEHM","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FQQ2ZEHMPSHRRQEM7HV4BYVEQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-05T16:27:06Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"92787c2c569f4e52f2a757c3424927bf4bc96e6cca4ab86b8be25bab97f01956","abstract_canon_sha256":"007e594d54429b4db75114a1e99aea89e4addcaa67d5e231511013b65e6537b9"},"schema_version":"1.0"},"canonical_sha256":"2c21ac90ec7c8f18c08cf9ebc0e2a4872f7f2cd1b4f2c3bb0fee54f160f936ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:54.572648Z","signature_b64":"IX2ELawNOrIxUXPY1wI5XYYoQIUfbO2+L2JNW9ANMZTjFusiJOvWaH49zf8fY0swtZexRZmmKq+ELgvYhY5sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c21ac90ec7c8f18c08cf9ebc0e2a4872f7f2cd1b4f2c3bb0fee54f160f936ee","last_reissued_at":"2026-05-17T23:54:54.572159Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:54.572159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01504","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-05-17T23:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9MAO5/8bA6sOgRL061F10lb03ilz9T4YeixaezLc4rP6zifHmxLh7fz2dnx6oKn4BNfbn8H59f2GbMN8OaDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:05.472166Z"},"content_sha256":"8f046e0a7b6a3648bd9a38d44d98d191676d79d9fdde74a4a6aca34aeffee851","schema_version":"1.0","event_id":"sha256:8f046e0a7b6a3648bd9a38d44d98d191676d79d9fdde74a4a6aca34aeffee851"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FQQ2ZEHMPSHRRQEM7HV4BYVEQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Convergence of the Primal-Dual Gradient Method for Convex-Concave Saddle Point Problems without Strong Convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Simon S. Du, Wei Hu","submitted_at":"2018-02-05T16:27:06Z","abstract_excerpt":"We consider the convex-concave saddle point problem $\\min_{x}\\max_{y} f(x)+y^\\top A x-g(y)$ where $f$ is smooth and convex and $g$ is smooth and strongly convex. We prove that if the coupling matrix $A$ has full column rank, the vanilla primal-dual gradient method can achieve linear convergence even if $f$ is not strongly convex. Our result generalizes previous work which either requires $f$ and $g$ to be quadratic functions or requires proximal mappings for both $f$ and $g$. We adopt a novel analysis technique that in each iteration uses a \"ghost\" update as a reference, and show that the iter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01504","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":""},"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-17T23:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7kTFlByZbzOz96/ADyi4iOD1bxeeA0DlFlpbPEZLkrLtC5QIBigsRjH3wjsnhbaXZI0rNFWNQbYh8fAIfoW9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:14:05.472534Z"},"content_sha256":"aeb3b0246f826877994a99cb2a09c629d9fff7ee43d08026c875b1986b9a3351","schema_version":"1.0","event_id":"sha256:aeb3b0246f826877994a99cb2a09c629d9fff7ee43d08026c875b1986b9a3351"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQQ2ZEHMPSHRRQEM7HV4BYVEQ4/bundle.json","state_url":"https://pith.science/pith/FQQ2ZEHMPSHRRQEM7HV4BYVEQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQQ2ZEHMPSHRRQEM7HV4BYVEQ4/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-31T21:14:05Z","links":{"resolver":"https://pith.science/pith/FQQ2ZEHMPSHRRQEM7HV4BYVEQ4","bundle":"https://pith.science/pith/FQQ2ZEHMPSHRRQEM7HV4BYVEQ4/bundle.json","state":"https://pith.science/pith/FQQ2ZEHMPSHRRQEM7HV4BYVEQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQQ2ZEHMPSHRRQEM7HV4BYVEQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FQQ2ZEHMPSHRRQEM7HV4BYVEQ4","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":"007e594d54429b4db75114a1e99aea89e4addcaa67d5e231511013b65e6537b9","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-05T16:27:06Z","title_canon_sha256":"92787c2c569f4e52f2a757c3424927bf4bc96e6cca4ab86b8be25bab97f01956"},"schema_version":"1.0","source":{"id":"1802.01504","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01504","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01504v2","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01504","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"FQQ2ZEHMPSHR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FQQ2ZEHMPSHRRQEM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FQQ2ZEHM","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:aeb3b0246f826877994a99cb2a09c629d9fff7ee43d08026c875b1986b9a3351","target":"graph","created_at":"2026-05-17T23:54:54Z","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":"We consider the convex-concave saddle point problem $\\min_{x}\\max_{y} f(x)+y^\\top A x-g(y)$ where $f$ is smooth and convex and $g$ is smooth and strongly convex. We prove that if the coupling matrix $A$ has full column rank, the vanilla primal-dual gradient method can achieve linear convergence even if $f$ is not strongly convex. Our result generalizes previous work which either requires $f$ and $g$ to be quadratic functions or requires proximal mappings for both $f$ and $g$. We adopt a novel analysis technique that in each iteration uses a \"ghost\" update as a reference, and show that the iter","authors_text":"Simon S. Du, Wei Hu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-05T16:27:06Z","title":"Linear Convergence of the Primal-Dual Gradient Method for Convex-Concave Saddle Point Problems without Strong Convexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01504","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:8f046e0a7b6a3648bd9a38d44d98d191676d79d9fdde74a4a6aca34aeffee851","target":"record","created_at":"2026-05-17T23:54:54Z","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":"007e594d54429b4db75114a1e99aea89e4addcaa67d5e231511013b65e6537b9","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-05T16:27:06Z","title_canon_sha256":"92787c2c569f4e52f2a757c3424927bf4bc96e6cca4ab86b8be25bab97f01956"},"schema_version":"1.0","source":{"id":"1802.01504","kind":"arxiv","version":2}},"canonical_sha256":"2c21ac90ec7c8f18c08cf9ebc0e2a4872f7f2cd1b4f2c3bb0fee54f160f936ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c21ac90ec7c8f18c08cf9ebc0e2a4872f7f2cd1b4f2c3bb0fee54f160f936ee","first_computed_at":"2026-05-17T23:54:54.572159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:54.572159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IX2ELawNOrIxUXPY1wI5XYYoQIUfbO2+L2JNW9ANMZTjFusiJOvWaH49zf8fY0swtZexRZmmKq+ELgvYhY5sDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:54.572648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01504","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f046e0a7b6a3648bd9a38d44d98d191676d79d9fdde74a4a6aca34aeffee851","sha256:aeb3b0246f826877994a99cb2a09c629d9fff7ee43d08026c875b1986b9a3351"],"state_sha256":"0b50df8f668177911d21e1060319dd37482dd39ad9f61d70201af73ca0e7e4af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67bDyKHi0rFK1dI50tldp9mcW8pP1FxJHJ2ZVKyLknu8zkBCcQwA8/oRokw8wUOuSTgAy/tOt5uiWNhtwJSVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:14:05.474753Z","bundle_sha256":"09fc1fd5da4339d211429e405359155bd90339f76d60e66116338d82495b3d33"}}