{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IXDBPZBFJBBXXPPNSWPMK5NLTZ","short_pith_number":"pith:IXDBPZBF","schema_version":"1.0","canonical_sha256":"45c617e42548437bbded959ec575ab9e7466052076f47a47e5452127e082448f","source":{"kind":"arxiv","id":"2006.04292","version":1},"attestation_state":"computed","paper":{"title":"Achieving Equalized Odds by Resampling Sensitive Attributes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Emmanuel J. Cand\\`es, Stephen Bates, Yaniv Romano","submitted_at":"2020-06-08T00:18:34Z","abstract_excerpt":"We present a flexible framework for learning predictive models that approximately satisfy the equalized odds notion of fairness. This is achieved by introducing a general discrepancy functional that rigorously quantifies violations of this criterion. This differentiable functional is used as a penalty driving the model parameters towards equalized odds. To rigorously evaluate fitted models, we develop a formal hypothesis test to detect whether a prediction rule violates this property, the first such test in the literature. Both the model fitting and hypothesis testing leverage a resampled vers"},"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":"2006.04292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-08T00:18:34Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"72c9fbfac94ae200da2e16d9adb1e0fdb3738c9fa3cd1cb014cbe5ca5c3519f5","abstract_canon_sha256":"915a74ded95524f28d61df9142bfda5bb91295ab13e45248f7cc2cac8cb3dae0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:37.812223Z","signature_b64":"21YOH7oKbrA5G4zwo/A9uTAf97/YEw/ii14ADKBT/yPethiwgh2xwxdbdCBTiMqz8k6S8ITm5KW8bFMVBz4cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45c617e42548437bbded959ec575ab9e7466052076f47a47e5452127e082448f","last_reissued_at":"2026-07-05T01:08:37.811788Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:37.811788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Equalized Odds by Resampling Sensitive Attributes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Emmanuel J. Cand\\`es, Stephen Bates, Yaniv Romano","submitted_at":"2020-06-08T00:18:34Z","abstract_excerpt":"We present a flexible framework for learning predictive models that approximately satisfy the equalized odds notion of fairness. This is achieved by introducing a general discrepancy functional that rigorously quantifies violations of this criterion. This differentiable functional is used as a penalty driving the model parameters towards equalized odds. To rigorously evaluate fitted models, we develop a formal hypothesis test to detect whether a prediction rule violates this property, the first such test in the literature. Both the model fitting and hypothesis testing leverage a resampled vers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.04292","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.04292/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.04292","created_at":"2026-07-05T01:08:37.811849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.04292v1","created_at":"2026-07-05T01:08:37.811849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.04292","created_at":"2026-07-05T01:08:37.811849+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXDBPZBFJBBX","created_at":"2026-07-05T01:08:37.811849+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXDBPZBFJBBXXPPN","created_at":"2026-07-05T01:08:37.811849+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXDBPZBF","created_at":"2026-07-05T01:08:37.811849+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29623","citing_title":"SCARCE: Scalable Cascade Analysis for Rare-event Characterisation via Embeddings","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ","json":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ.json","graph_json":"https://pith.science/api/pith-number/IXDBPZBFJBBXXPPNSWPMK5NLTZ/graph.json","events_json":"https://pith.science/api/pith-number/IXDBPZBFJBBXXPPNSWPMK5NLTZ/events.json","paper":"https://pith.science/paper/IXDBPZBF"},"agent_actions":{"view_html":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ","download_json":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ.json","view_paper":"https://pith.science/paper/IXDBPZBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.04292&json=true","fetch_graph":"https://pith.science/api/pith-number/IXDBPZBFJBBXXPPNSWPMK5NLTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/IXDBPZBFJBBXXPPNSWPMK5NLTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ/action/storage_attestation","attest_author":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ/action/author_attestation","sign_citation":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ/action/citation_signature","submit_replication":"https://pith.science/pith/IXDBPZBFJBBXXPPNSWPMK5NLTZ/action/replication_record"}},"created_at":"2026-07-05T01:08:37.811849+00:00","updated_at":"2026-07-05T01:08:37.811849+00:00"}