{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E2QWGNJ4XZBMGJDQADOF6CP67S","short_pith_number":"pith:E2QWGNJ4","canonical_record":{"source":{"id":"1803.02453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T22:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"95accae440d5e46015b2674f648e11f9bbbd16de4feb8d2a499a5963d1f55a2d","abstract_canon_sha256":"81ce50943b644e45f38c522e3a11a13e711c7767f06f5d0d9dd937fb9214b5af"},"schema_version":"1.0"},"canonical_sha256":"26a163353cbe42c3247000dc5f09fefcbcfccb1c16a418413690014481b4856c","source":{"kind":"arxiv","id":"1803.02453","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02453","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02453v3","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02453","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"E2QWGNJ4XZBM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2QWGNJ4XZBMGJDQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2QWGNJ4","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E2QWGNJ4XZBMGJDQADOF6CP67S","target":"record","payload":{"canonical_record":{"source":{"id":"1803.02453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T22:39:58Z","cross_cats_sorted":[],"title_canon_sha256":"95accae440d5e46015b2674f648e11f9bbbd16de4feb8d2a499a5963d1f55a2d","abstract_canon_sha256":"81ce50943b644e45f38c522e3a11a13e711c7767f06f5d0d9dd937fb9214b5af"},"schema_version":"1.0"},"canonical_sha256":"26a163353cbe42c3247000dc5f09fefcbcfccb1c16a418413690014481b4856c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:46.693708Z","signature_b64":"vE9dAsB7ZFwwbjlnybU9I4tBKjTkXuFnsIH28OYuuMUzjrI9/Qskj01H7ibLzv4ElYbtW/U11/1wF7rF4EwJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26a163353cbe42c3247000dc5f09fefcbcfccb1c16a418413690014481b4856c","last_reissued_at":"2026-05-18T00:10:46.693183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:46.693183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.02453","source_version":3,"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:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3FeRMtCptOGRnnZ09hxm889LNEm2DIM35+PzqWsZ0rpS8OJ8BrsQSZ5I9eBSCDxncJ3qbsOeADF0k0oc7qCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:51:43.728564Z"},"content_sha256":"aec1f9c6757ef72b0ee4be398ff06086d32ff19d05d2c8c5c4bc55020c0dabe6","schema_version":"1.0","event_id":"sha256:aec1f9c6757ef72b0ee4be398ff06086d32ff19d05d2c8c5c4bc55020c0dabe6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E2QWGNJ4XZBMGJDQADOF6CP67S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Reductions Approach to Fair Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, Alina Beygelzimer, Hanna Wallach, John Langford, Miroslav Dud\\'ik","submitted_at":"2018-03-06T22:39:58Z","abstract_excerpt":"We present a systematic approach for achieving fairness in a binary classification setting. While we focus on two well-known quantitative definitions of fairness, our approach encompasses many other previously studied definitions as special cases. The key idea is to reduce fair classification to a sequence of cost-sensitive classification problems, whose solutions yield a randomized classifier with the lowest (empirical) error subject to the desired constraints. We introduce two reductions that work for any representation of the cost-sensitive classifier and compare favorably to prior baseline"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02453","kind":"arxiv","version":3},"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:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuMcGJfDXc7zlOn2MlZ+H1wNIibaxcpwig+5F5HYOvmce/bWECXs4V8G7OlWnk/Zz6/WveWoocKqKL204pL8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:51:43.729141Z"},"content_sha256":"f8c9d09f7b8e430154cbecdeb1fb78a10a4aaf79d49120985858f9f369bd3c79","schema_version":"1.0","event_id":"sha256:f8c9d09f7b8e430154cbecdeb1fb78a10a4aaf79d49120985858f9f369bd3c79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2QWGNJ4XZBMGJDQADOF6CP67S/bundle.json","state_url":"https://pith.science/pith/E2QWGNJ4XZBMGJDQADOF6CP67S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2QWGNJ4XZBMGJDQADOF6CP67S/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-27T01:51:43Z","links":{"resolver":"https://pith.science/pith/E2QWGNJ4XZBMGJDQADOF6CP67S","bundle":"https://pith.science/pith/E2QWGNJ4XZBMGJDQADOF6CP67S/bundle.json","state":"https://pith.science/pith/E2QWGNJ4XZBMGJDQADOF6CP67S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2QWGNJ4XZBMGJDQADOF6CP67S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E2QWGNJ4XZBMGJDQADOF6CP67S","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":"81ce50943b644e45f38c522e3a11a13e711c7767f06f5d0d9dd937fb9214b5af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T22:39:58Z","title_canon_sha256":"95accae440d5e46015b2674f648e11f9bbbd16de4feb8d2a499a5963d1f55a2d"},"schema_version":"1.0","source":{"id":"1803.02453","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02453","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02453v3","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02453","created_at":"2026-05-18T00:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"E2QWGNJ4XZBM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E2QWGNJ4XZBMGJDQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E2QWGNJ4","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:f8c9d09f7b8e430154cbecdeb1fb78a10a4aaf79d49120985858f9f369bd3c79","target":"graph","created_at":"2026-05-18T00:10:46Z","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 present a systematic approach for achieving fairness in a binary classification setting. While we focus on two well-known quantitative definitions of fairness, our approach encompasses many other previously studied definitions as special cases. The key idea is to reduce fair classification to a sequence of cost-sensitive classification problems, whose solutions yield a randomized classifier with the lowest (empirical) error subject to the desired constraints. We introduce two reductions that work for any representation of the cost-sensitive classifier and compare favorably to prior baseline","authors_text":"Alekh Agarwal, Alina Beygelzimer, Hanna Wallach, John Langford, Miroslav Dud\\'ik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T22:39:58Z","title":"A Reductions Approach to Fair Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02453","kind":"arxiv","version":3},"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:aec1f9c6757ef72b0ee4be398ff06086d32ff19d05d2c8c5c4bc55020c0dabe6","target":"record","created_at":"2026-05-18T00:10:46Z","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":"81ce50943b644e45f38c522e3a11a13e711c7767f06f5d0d9dd937fb9214b5af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-06T22:39:58Z","title_canon_sha256":"95accae440d5e46015b2674f648e11f9bbbd16de4feb8d2a499a5963d1f55a2d"},"schema_version":"1.0","source":{"id":"1803.02453","kind":"arxiv","version":3}},"canonical_sha256":"26a163353cbe42c3247000dc5f09fefcbcfccb1c16a418413690014481b4856c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26a163353cbe42c3247000dc5f09fefcbcfccb1c16a418413690014481b4856c","first_computed_at":"2026-05-18T00:10:46.693183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:46.693183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vE9dAsB7ZFwwbjlnybU9I4tBKjTkXuFnsIH28OYuuMUzjrI9/Qskj01H7ibLzv4ElYbtW/U11/1wF7rF4EwJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:46.693708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02453","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aec1f9c6757ef72b0ee4be398ff06086d32ff19d05d2c8c5c4bc55020c0dabe6","sha256:f8c9d09f7b8e430154cbecdeb1fb78a10a4aaf79d49120985858f9f369bd3c79"],"state_sha256":"a79690a8ed430e3b322cda1444921d1f9b0433e982be992291b5e90798fee912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKbTAPDA2m3ISr78WhAeWS3hhHmnCKSaiviMdTsS5gAUak7trazSlxHy93JzVcPUVdjhEWnqLq5Focwpxt/fCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:51:43.732175Z","bundle_sha256":"30e6ca311138a83dc4073e20303173af4454e3153ad788614e635afd01d4a1d3"}}