{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U7V3WTYFMEIBYHLLF3VN7DHPRW","short_pith_number":"pith:U7V3WTYF","canonical_record":{"source":{"id":"1804.06500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T23:13:28Z","cross_cats_sorted":["cs.GT","math.OC","stat.ML"],"title_canon_sha256":"c290a59a1ab3079688478b161d78a03e1147e8bd1e365bde1bc7385ef539b4f7","abstract_canon_sha256":"e20241223c98022fdc79aee9009c20b302e6e1745eeedb886ad6af29971717df"},"schema_version":"1.0"},"canonical_sha256":"a7ebbb4f0561101c1d6b2eeadf8cef8daa482f206f098d24a987b2471cfd0db3","source":{"kind":"arxiv","id":"1804.06500","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06500","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06500v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06500","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"U7V3WTYFMEIB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U7V3WTYFMEIBYHLL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U7V3WTYF","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U7V3WTYFMEIBYHLLF3VN7DHPRW","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T23:13:28Z","cross_cats_sorted":["cs.GT","math.OC","stat.ML"],"title_canon_sha256":"c290a59a1ab3079688478b161d78a03e1147e8bd1e365bde1bc7385ef539b4f7","abstract_canon_sha256":"e20241223c98022fdc79aee9009c20b302e6e1745eeedb886ad6af29971717df"},"schema_version":"1.0"},"canonical_sha256":"a7ebbb4f0561101c1d6b2eeadf8cef8daa482f206f098d24a987b2471cfd0db3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:30.084012Z","signature_b64":"oic/l5HHEa3gP0DpeT5QXPGByc36jeYK44s/8VXeN60uFeva1v7W8K/Gl+BUjMrdeWcaAIcz0cdf3kPf6j2NCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7ebbb4f0561101c1d6b2eeadf8cef8daa482f206f098d24a987b2471cfd0db3","last_reissued_at":"2026-05-18T00:04:30.083472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:30.083472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06500","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-18T00:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uGo0iU1CM3zaXGWdHUMKC43rN7wVJ03KC2OcmHPyvUk02P7ccwjWTvh7ZJ486LC5iWdv1iLDhMWJz/YY54YQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:25:10.143713Z"},"content_sha256":"a4c60220d2a57fa450a02ddc5cd0351e22441ba252e118f979b8dac097b28af7","schema_version":"1.0","event_id":"sha256:a4c60220d2a57fa450a02ddc5cd0351e22441ba252e118f979b8dac097b28af7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U7V3WTYFMEIBYHLLF3VN7DHPRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Player Games for Efficient Non-Convex Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Cotter, Heinrich Jiang, Karthik Sridharan","submitted_at":"2018-04-17T23:13:28Z","abstract_excerpt":"In recent years, constrained optimization has become increasingly relevant to the machine learning community, with applications including Neyman-Pearson classification, robust optimization, and fair machine learning. A natural approach to constrained optimization is to optimize the Lagrangian, but this is not guaranteed to work in the non-convex setting, and, if using a first-order method, cannot cope with non-differentiable constraints (e.g. constraints on rates or proportions).\n  The Lagrangian can be interpreted as a two-player game played between a player who seeks to optimize over the mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06500","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-18T00:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11xuw0PR45Jo+H2FnyF+UjVhijpchgDp3OkNeMb+r4C+BulAWUKVEjR5BJeKp2Y/n0IPN0a0QTrdeItsGtU2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:25:10.144364Z"},"content_sha256":"23efbd6669c802351cfc6c5eadd9930d2839a09c60114be044382d9e503061c8","schema_version":"1.0","event_id":"sha256:23efbd6669c802351cfc6c5eadd9930d2839a09c60114be044382d9e503061c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7V3WTYFMEIBYHLLF3VN7DHPRW/bundle.json","state_url":"https://pith.science/pith/U7V3WTYFMEIBYHLLF3VN7DHPRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7V3WTYFMEIBYHLLF3VN7DHPRW/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-27T10:25:10Z","links":{"resolver":"https://pith.science/pith/U7V3WTYFMEIBYHLLF3VN7DHPRW","bundle":"https://pith.science/pith/U7V3WTYFMEIBYHLLF3VN7DHPRW/bundle.json","state":"https://pith.science/pith/U7V3WTYFMEIBYHLLF3VN7DHPRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7V3WTYFMEIBYHLLF3VN7DHPRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U7V3WTYFMEIBYHLLF3VN7DHPRW","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":"e20241223c98022fdc79aee9009c20b302e6e1745eeedb886ad6af29971717df","cross_cats_sorted":["cs.GT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T23:13:28Z","title_canon_sha256":"c290a59a1ab3079688478b161d78a03e1147e8bd1e365bde1bc7385ef539b4f7"},"schema_version":"1.0","source":{"id":"1804.06500","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06500","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06500v2","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06500","created_at":"2026-05-18T00:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"U7V3WTYFMEIB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U7V3WTYFMEIBYHLL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U7V3WTYF","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:23efbd6669c802351cfc6c5eadd9930d2839a09c60114be044382d9e503061c8","target":"graph","created_at":"2026-05-18T00:04: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":"In recent years, constrained optimization has become increasingly relevant to the machine learning community, with applications including Neyman-Pearson classification, robust optimization, and fair machine learning. A natural approach to constrained optimization is to optimize the Lagrangian, but this is not guaranteed to work in the non-convex setting, and, if using a first-order method, cannot cope with non-differentiable constraints (e.g. constraints on rates or proportions).\n  The Lagrangian can be interpreted as a two-player game played between a player who seeks to optimize over the mod","authors_text":"Andrew Cotter, Heinrich Jiang, Karthik Sridharan","cross_cats":["cs.GT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T23:13:28Z","title":"Two-Player Games for Efficient Non-Convex Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06500","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:a4c60220d2a57fa450a02ddc5cd0351e22441ba252e118f979b8dac097b28af7","target":"record","created_at":"2026-05-18T00:04: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":"e20241223c98022fdc79aee9009c20b302e6e1745eeedb886ad6af29971717df","cross_cats_sorted":["cs.GT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-17T23:13:28Z","title_canon_sha256":"c290a59a1ab3079688478b161d78a03e1147e8bd1e365bde1bc7385ef539b4f7"},"schema_version":"1.0","source":{"id":"1804.06500","kind":"arxiv","version":2}},"canonical_sha256":"a7ebbb4f0561101c1d6b2eeadf8cef8daa482f206f098d24a987b2471cfd0db3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7ebbb4f0561101c1d6b2eeadf8cef8daa482f206f098d24a987b2471cfd0db3","first_computed_at":"2026-05-18T00:04:30.083472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:30.083472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oic/l5HHEa3gP0DpeT5QXPGByc36jeYK44s/8VXeN60uFeva1v7W8K/Gl+BUjMrdeWcaAIcz0cdf3kPf6j2NCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:30.084012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06500","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4c60220d2a57fa450a02ddc5cd0351e22441ba252e118f979b8dac097b28af7","sha256:23efbd6669c802351cfc6c5eadd9930d2839a09c60114be044382d9e503061c8"],"state_sha256":"4d3e6888e266a8508840854930745dc355b9687828ff991036f559ea77ad83c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfTnh6UGH2tF6jNOMfVuST0LK4garDUmlhf9ysvEcihDDASa//DXPRXF09lXEexzQePf6oX35TWci/BRFyY8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:25:10.147715Z","bundle_sha256":"fe942bba0ae0238901e30caf1b965941c970d0f457541b9cd4ee053e359faa16"}}