{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AV7JNU6NDV6C6S7MXFHUX7VTFK","short_pith_number":"pith:AV7JNU6N","schema_version":"1.0","canonical_sha256":"057e96d3cd1d7c2f4becb94f4bfeb32aaa75abdef2768b72ac67a90b8cbc6714","source":{"kind":"arxiv","id":"1610.02413","version":1},"attestation_state":"computed","paper":{"title":"Equality of Opportunity in Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Price, Moritz Hardt, Nathan Srebro","submitted_at":"2016-10-07T20:16:29Z","abstract_excerpt":"We propose a criterion for discrimination against a specified sensitive attribute in supervised learning, where the goal is to predict some target based on available features. Assuming data about the predictor, target, and membership in the protected group are available, we show how to optimally adjust any learned predictor so as to remove discrimination according to our definition. Our framework also improves incentives by shifting the cost of poor classification from disadvantaged groups to the decision maker, who can respond by improving the classification accuracy.\n  In line with other stu"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1610.02413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-07T20:16:29Z","cross_cats_sorted":[],"title_canon_sha256":"f7da9fc3061cb82995aa1a3ddbc1059bf33d4ea8799f3cafa4d5e792410ad0c3","abstract_canon_sha256":"96d1a2c964102e3be5f27688a0b4bd9cf342d55e4a7c63a7b559ef1b257076ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:51.545302Z","signature_b64":"Rca3dgEtwW/AEdKhxwmjSH53TcCCu8A5ztlC5ZDiF48QYeea4Kf1hcZLtoOEziJ+fVMBdRQQ7NCU+AwA8+MgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"057e96d3cd1d7c2f4becb94f4bfeb32aaa75abdef2768b72ac67a90b8cbc6714","last_reissued_at":"2026-05-18T01:02:51.544920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:51.544920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equality of Opportunity in Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Price, Moritz Hardt, Nathan Srebro","submitted_at":"2016-10-07T20:16:29Z","abstract_excerpt":"We propose a criterion for discrimination against a specified sensitive attribute in supervised learning, where the goal is to predict some target based on available features. Assuming data about the predictor, target, and membership in the protected group are available, we show how to optimally adjust any learned predictor so as to remove discrimination according to our definition. Our framework also improves incentives by shifting the cost of poor classification from disadvantaged groups to the decision maker, who can respond by improving the classification accuracy.\n  In line with other stu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02413","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.02413","created_at":"2026-05-18T01:02:51.544986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02413v1","created_at":"2026-05-18T01:02:51.544986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02413","created_at":"2026-05-18T01:02:51.544986+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV7JNU6NDV6C","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV7JNU6NDV6C6S7M","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV7JNU6N","created_at":"2026-05-18T12:30:07.202191+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2508.14311","citing_title":"Online Learning with Multiple Fairness Regularizers via Graph-Structured Feedback","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2603.19042","citing_title":"Man and machine: artificial intelligence and judicial decision making","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10604","citing_title":"Fairness vs Performance: Characterizing the Pareto Frontier of Algorithmic Decision Systems","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23786","citing_title":"FAIR_XAI: Improving Multimodal Foundation Model Fairness via Explainability for Wellbeing Assessment","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2112.04359","citing_title":"Ethical and social risks of harm from Language Models","ref_index":107,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06378","citing_title":"Revisiting Fairness Impossibility with Endogenous Behavior","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK","json":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK.json","graph_json":"https://pith.science/api/pith-number/AV7JNU6NDV6C6S7MXFHUX7VTFK/graph.json","events_json":"https://pith.science/api/pith-number/AV7JNU6NDV6C6S7MXFHUX7VTFK/events.json","paper":"https://pith.science/paper/AV7JNU6N"},"agent_actions":{"view_html":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK","download_json":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK.json","view_paper":"https://pith.science/paper/AV7JNU6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02413&json=true","fetch_graph":"https://pith.science/api/pith-number/AV7JNU6NDV6C6S7MXFHUX7VTFK/graph.json","fetch_events":"https://pith.science/api/pith-number/AV7JNU6NDV6C6S7MXFHUX7VTFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK/action/storage_attestation","attest_author":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK/action/author_attestation","sign_citation":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK/action/citation_signature","submit_replication":"https://pith.science/pith/AV7JNU6NDV6C6S7MXFHUX7VTFK/action/replication_record"}},"created_at":"2026-05-18T01:02:51.544986+00:00","updated_at":"2026-05-18T01:02:51.544986+00:00"}