{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XHLIRVSY3TOZNT6IEYXULICS3C","short_pith_number":"pith:XHLIRVSY","canonical_record":{"source":{"id":"1810.02060","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T05:07:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4bb3c463b11d84db55e16bf156422a316bdc3b1a419f73379058baac631ce7a7","abstract_canon_sha256":"f96a5e4c5cf26b189e0506b24b470929d7c252675c1c24f659a8a7861a3b919d"},"schema_version":"1.0"},"canonical_sha256":"b9d688d658dcdd96cfc8262f45a052d89f88543699bdfac525ef4e03be539465","source":{"kind":"arxiv","id":"1810.02060","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02060","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02060v4","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02060","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"XHLIRVSY3TOZ","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"pith_short_16","alias_value":"XHLIRVSY3TOZNT6I","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"pith_short_8","alias_value":"XHLIRVSY","created_at":"2026-07-05T02:38:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XHLIRVSY3TOZNT6IEYXULICS3C","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02060","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T05:07:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4bb3c463b11d84db55e16bf156422a316bdc3b1a419f73379058baac631ce7a7","abstract_canon_sha256":"f96a5e4c5cf26b189e0506b24b470929d7c252675c1c24f659a8a7861a3b919d"},"schema_version":"1.0"},"canonical_sha256":"b9d688d658dcdd96cfc8262f45a052d89f88543699bdfac525ef4e03be539465","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:58.796324Z","signature_b64":"FquoSQEH7g1cMgtuTkmsbg5cETBoLwIio8khLlmLhx9252PnC36VJyHrgLqWwGwSYc9VU9ZV+I0q4q+8J48xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9d688d658dcdd96cfc8262f45a052d89f88543699bdfac525ef4e03be539465","last_reissued_at":"2026-07-05T02:38:58.795842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:58.795842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02060","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:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGg+up2zIHyPQj6YYHATP9ryOOqbQnk94bnHcbHqJhzYvGl6LK8HZIPzWFR+Gft6U06UcVF1dOm2ghUnbT+ICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:59:04.125915Z"},"content_sha256":"adac85f732e751ffb2e9fa9022e136cadd6d695160d84b01515f22aa39708a7b","schema_version":"1.0","event_id":"sha256:adac85f732e751ffb2e9fa9022e136cadd6d695160d84b01515f22aa39708a7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XHLIRVSY3TOZNT6IEYXULICS3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Hassan Rafique, Mingrui Liu, Qihang Lin, Tianbao Yang","submitted_at":"2018-10-04T05:07:21Z","abstract_excerpt":"Min-max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution. Convex-concave min-max problem is an active topic of research with efficient algorithms and sound theoretical foundations developed. However, it remains a challenge to design provably efficient algorithms for non-convex min-max problems with or without smoothness. In this paper, we study a family of non-convex min-max problems, whose objective function is weakly convex in the variables of minimization and is concave in the variables of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02060","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/1810.02060/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:38:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HjOmMBg+gD12F+Q/Vws9TH+SdKddVSjIRqY0wRqaqRJx16J/fnUTTPGNlWexZEiAkOPjQxti6YXNuXPUefuVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:59:04.126468Z"},"content_sha256":"cf33fa2030ed7f1aa013ea902a87cd18f91ea1cd2e88e7b9cd0e82cfc0c76fa7","schema_version":"1.0","event_id":"sha256:cf33fa2030ed7f1aa013ea902a87cd18f91ea1cd2e88e7b9cd0e82cfc0c76fa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHLIRVSY3TOZNT6IEYXULICS3C/bundle.json","state_url":"https://pith.science/pith/XHLIRVSY3TOZNT6IEYXULICS3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHLIRVSY3TOZNT6IEYXULICS3C/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-15T05:59:04Z","links":{"resolver":"https://pith.science/pith/XHLIRVSY3TOZNT6IEYXULICS3C","bundle":"https://pith.science/pith/XHLIRVSY3TOZNT6IEYXULICS3C/bundle.json","state":"https://pith.science/pith/XHLIRVSY3TOZNT6IEYXULICS3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHLIRVSY3TOZNT6IEYXULICS3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XHLIRVSY3TOZNT6IEYXULICS3C","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":"f96a5e4c5cf26b189e0506b24b470929d7c252675c1c24f659a8a7861a3b919d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T05:07:21Z","title_canon_sha256":"4bb3c463b11d84db55e16bf156422a316bdc3b1a419f73379058baac631ce7a7"},"schema_version":"1.0","source":{"id":"1810.02060","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02060","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02060v4","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02060","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"XHLIRVSY3TOZ","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"pith_short_16","alias_value":"XHLIRVSY3TOZNT6I","created_at":"2026-07-05T02:38:58Z"},{"alias_kind":"pith_short_8","alias_value":"XHLIRVSY","created_at":"2026-07-05T02:38:58Z"}],"graph_snapshots":[{"event_id":"sha256:cf33fa2030ed7f1aa013ea902a87cd18f91ea1cd2e88e7b9cd0e82cfc0c76fa7","target":"graph","created_at":"2026-07-05T02:38:58Z","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/1810.02060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Min-max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution. Convex-concave min-max problem is an active topic of research with efficient algorithms and sound theoretical foundations developed. However, it remains a challenge to design provably efficient algorithms for non-convex min-max problems with or without smoothness. In this paper, we study a family of non-convex min-max problems, whose objective function is weakly convex in the variables of minimization and is concave in the variables of m","authors_text":"Hassan Rafique, Mingrui Liu, Qihang Lin, Tianbao Yang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T05:07:21Z","title":"Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02060","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:adac85f732e751ffb2e9fa9022e136cadd6d695160d84b01515f22aa39708a7b","target":"record","created_at":"2026-07-05T02:38:58Z","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":"f96a5e4c5cf26b189e0506b24b470929d7c252675c1c24f659a8a7861a3b919d","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T05:07:21Z","title_canon_sha256":"4bb3c463b11d84db55e16bf156422a316bdc3b1a419f73379058baac631ce7a7"},"schema_version":"1.0","source":{"id":"1810.02060","kind":"arxiv","version":4}},"canonical_sha256":"b9d688d658dcdd96cfc8262f45a052d89f88543699bdfac525ef4e03be539465","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9d688d658dcdd96cfc8262f45a052d89f88543699bdfac525ef4e03be539465","first_computed_at":"2026-07-05T02:38:58.795842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:38:58.795842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FquoSQEH7g1cMgtuTkmsbg5cETBoLwIio8khLlmLhx9252PnC36VJyHrgLqWwGwSYc9VU9ZV+I0q4q+8J48xDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:38:58.796324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02060","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adac85f732e751ffb2e9fa9022e136cadd6d695160d84b01515f22aa39708a7b","sha256:cf33fa2030ed7f1aa013ea902a87cd18f91ea1cd2e88e7b9cd0e82cfc0c76fa7"],"state_sha256":"e80723981c6b1e5428e1c18ffadef1c1367e6d2e965f02bf06742f0f93a7c4aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWhUmzm2Bmr6JWQ/KO/DDBG10mOOGTdpL5YbjvFmOzbeTVdZxvVnfmR6JJz720/8VrxvrKMSmPYwY+tDGFB+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:59:04.132813Z","bundle_sha256":"423dd5e3df14d1a8d4db3c6d4b0e99d689420e05dbae7d6f9aafb544099207b6"}}