{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7FNGGX3RJIEHXTB2R3SZHVE7VO","short_pith_number":"pith:7FNGGX3R","canonical_record":{"source":{"id":"1901.10443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T18:42:49Z","cross_cats_sorted":["cs.CY","stat.ML"],"title_canon_sha256":"05addfbdd441cd0247b709632f82359e39ac189bd76f34ec9053c98ebe10b34e","abstract_canon_sha256":"4c71d45e514a193614ff5bdfd8b6861b4aa927deb679470d3a2ff9998db7a06c"},"schema_version":"1.0"},"canonical_sha256":"f95a635f714a087bcc3a8ee593d49fab93cd915b3abbb12a2abf757c70c90ed7","source":{"kind":"arxiv","id":"1901.10443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10443","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10443v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10443","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"7FNGGX3RJIEH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7FNGGX3RJIEHXTB2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7FNGGX3R","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7FNGGX3RJIEHXTB2R3SZHVE7VO","target":"record","payload":{"canonical_record":{"source":{"id":"1901.10443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T18:42:49Z","cross_cats_sorted":["cs.CY","stat.ML"],"title_canon_sha256":"05addfbdd441cd0247b709632f82359e39ac189bd76f34ec9053c98ebe10b34e","abstract_canon_sha256":"4c71d45e514a193614ff5bdfd8b6861b4aa927deb679470d3a2ff9998db7a06c"},"schema_version":"1.0"},"canonical_sha256":"f95a635f714a087bcc3a8ee593d49fab93cd915b3abbb12a2abf757c70c90ed7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:15.370507Z","signature_b64":"LKy/172E3bJLQIARcUW5GzFt6cVDYSKzG1BURnWoQ6jVtzxcTjM9LgHBzKvivJji/mtwJelcaSxVw+i43YSbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95a635f714a087bcc3a8ee593d49fab93cd915b3abbb12a2abf757c70c90ed7","last_reissued_at":"2026-05-17T23:55:15.369936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:15.369936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.10443","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-17T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJiaqALaxRtbP+62KRctpkanFAL4tqac/mKBpsbbYV8EY5pC1O83wI+j+JXHm9RNW3gPjIFrj/TK93jOsU1AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:52:58.984625Z"},"content_sha256":"c574642bd66243a68f71a23a516735ed5555a916e35d01db83f340ef3c514428","schema_version":"1.0","event_id":"sha256:c574642bd66243a68f71a23a516735ed5555a916e35d01db83f340ef3c514428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7FNGGX3RJIEHXTB2R3SZHVE7VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Adversarial Learning for Fair Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"L. Elisa Celis, Vijay Keswani","submitted_at":"2019-01-29T18:42:49Z","abstract_excerpt":"Motivated by concerns that machine learning algorithms may introduce significant bias in classification models, developing fair classifiers has become an important problem in machine learning research. One important paradigm towards this has been providing algorithms for adversarially learning fair classifiers (Zhang et al., 2018; Madras et al., 2018). We formulate the adversarial learning problem as a multi-objective optimization problem and find the fair model using gradient descent-ascent algorithm with a modified gradient update step, inspired by the approach of Zhang et al., 2018. We prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10443","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-17T23:55:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbsRWnEY051d35Uypyplux2JHDwL8++6C2ZzGxT1dIpyjiRmGVCD6wy8EFiUvHYO1c1mWr+Om9NwijJ/qO2nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:52:58.985424Z"},"content_sha256":"468dbc7d71631a180faa9ea6f2efbca86933a425453ee6b811c2edbb67e42aee","schema_version":"1.0","event_id":"sha256:468dbc7d71631a180faa9ea6f2efbca86933a425453ee6b811c2edbb67e42aee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FNGGX3RJIEHXTB2R3SZHVE7VO/bundle.json","state_url":"https://pith.science/pith/7FNGGX3RJIEHXTB2R3SZHVE7VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FNGGX3RJIEHXTB2R3SZHVE7VO/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-30T15:52:58Z","links":{"resolver":"https://pith.science/pith/7FNGGX3RJIEHXTB2R3SZHVE7VO","bundle":"https://pith.science/pith/7FNGGX3RJIEHXTB2R3SZHVE7VO/bundle.json","state":"https://pith.science/pith/7FNGGX3RJIEHXTB2R3SZHVE7VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FNGGX3RJIEHXTB2R3SZHVE7VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7FNGGX3RJIEHXTB2R3SZHVE7VO","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":"4c71d45e514a193614ff5bdfd8b6861b4aa927deb679470d3a2ff9998db7a06c","cross_cats_sorted":["cs.CY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T18:42:49Z","title_canon_sha256":"05addfbdd441cd0247b709632f82359e39ac189bd76f34ec9053c98ebe10b34e"},"schema_version":"1.0","source":{"id":"1901.10443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10443","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10443v1","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10443","created_at":"2026-05-17T23:55:15Z"},{"alias_kind":"pith_short_12","alias_value":"7FNGGX3RJIEH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7FNGGX3RJIEHXTB2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7FNGGX3R","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:468dbc7d71631a180faa9ea6f2efbca86933a425453ee6b811c2edbb67e42aee","target":"graph","created_at":"2026-05-17T23:55:15Z","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":"Motivated by concerns that machine learning algorithms may introduce significant bias in classification models, developing fair classifiers has become an important problem in machine learning research. One important paradigm towards this has been providing algorithms for adversarially learning fair classifiers (Zhang et al., 2018; Madras et al., 2018). We formulate the adversarial learning problem as a multi-objective optimization problem and find the fair model using gradient descent-ascent algorithm with a modified gradient update step, inspired by the approach of Zhang et al., 2018. We prov","authors_text":"L. Elisa Celis, Vijay Keswani","cross_cats":["cs.CY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T18:42:49Z","title":"Improved Adversarial Learning for Fair Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10443","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:c574642bd66243a68f71a23a516735ed5555a916e35d01db83f340ef3c514428","target":"record","created_at":"2026-05-17T23:55:15Z","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":"4c71d45e514a193614ff5bdfd8b6861b4aa927deb679470d3a2ff9998db7a06c","cross_cats_sorted":["cs.CY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-29T18:42:49Z","title_canon_sha256":"05addfbdd441cd0247b709632f82359e39ac189bd76f34ec9053c98ebe10b34e"},"schema_version":"1.0","source":{"id":"1901.10443","kind":"arxiv","version":1}},"canonical_sha256":"f95a635f714a087bcc3a8ee593d49fab93cd915b3abbb12a2abf757c70c90ed7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95a635f714a087bcc3a8ee593d49fab93cd915b3abbb12a2abf757c70c90ed7","first_computed_at":"2026-05-17T23:55:15.369936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:15.369936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LKy/172E3bJLQIARcUW5GzFt6cVDYSKzG1BURnWoQ6jVtzxcTjM9LgHBzKvivJji/mtwJelcaSxVw+i43YSbBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:15.370507Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c574642bd66243a68f71a23a516735ed5555a916e35d01db83f340ef3c514428","sha256:468dbc7d71631a180faa9ea6f2efbca86933a425453ee6b811c2edbb67e42aee"],"state_sha256":"72d0804aae676b17e8ef4d7f5603fd939899dd96e9b6e607c048a69c875fe300"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNrPO/QVPFZa/1Dq39vS9qwAt2OR0MZ0uamaH7qOrfelTA6m2hP0F11eIkb5FQnBgtAHakwvkfsCjfwnRW0VBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:52:58.989684Z","bundle_sha256":"863ba5235f0effad5ebb999bed94b9eaae568ac6186a69cb5a50f074eb1e5043"}}