{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FBV7JAT272VXVYEDQIBZP7I72H","short_pith_number":"pith:FBV7JAT2","schema_version":"1.0","canonical_sha256":"286bf4827afeab7ae083820397fd1fd1f9c865d6ae31e86bdebca0c4e97ae041","source":{"kind":"arxiv","id":"2111.12823","version":2},"attestation_state":"computed","paper":{"title":"Fairness for AUC via Feature Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anay Mehrotra, Hortense Fong, Nisheeth K. Vishnoi, Vineet Kumar","submitted_at":"2021-11-24T22:32:19Z","abstract_excerpt":"We study fairness in the context of classification where the performance is measured by the area under the curve (AUC) of the receiver operating characteristic. AUC is commonly used to measure the performance of prediction models. The same classifier can have significantly varying AUCs for different protected groups and, in real-world applications, it is often desirable to reduce such cross-group differences. We address the problem of how to acquire additional features to most greatly improve AUC for the disadvantaged group. We develop a novel approach, fairAUC, based on feature augmentation ("},"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":"2111.12823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-24T22:32:19Z","cross_cats_sorted":["cs.AI","cs.CY","stat.ML"],"title_canon_sha256":"a5fb77f1f0b38b1a8e35ccebf3f8e964b13a846450a797265081798225ddefc0","abstract_canon_sha256":"b061951ced4fcc1b508d2c5f2188159c0c1be300db7d79f1c8e5b332d5ef2176"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:51:05.638783Z","signature_b64":"vq7oLHOOOvHCYDrv4ukRLeD7msfeM4todhZFVmWbSmCu0fAHkeHtpQfKv8rLq5pWw0oZOz/007CtbpJ8p8+9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"286bf4827afeab7ae083820397fd1fd1f9c865d6ae31e86bdebca0c4e97ae041","last_reissued_at":"2026-07-05T04:51:05.638363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:51:05.638363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness for AUC via Feature Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anay Mehrotra, Hortense Fong, Nisheeth K. Vishnoi, Vineet Kumar","submitted_at":"2021-11-24T22:32:19Z","abstract_excerpt":"We study fairness in the context of classification where the performance is measured by the area under the curve (AUC) of the receiver operating characteristic. AUC is commonly used to measure the performance of prediction models. The same classifier can have significantly varying AUCs for different protected groups and, in real-world applications, it is often desirable to reduce such cross-group differences. We address the problem of how to acquire additional features to most greatly improve AUC for the disadvantaged group. We develop a novel approach, fairAUC, based on feature augmentation ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.12823","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.12823/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":"2111.12823","created_at":"2026-07-05T04:51:05.638419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.12823v2","created_at":"2026-07-05T04:51:05.638419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.12823","created_at":"2026-07-05T04:51:05.638419+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBV7JAT272VX","created_at":"2026-07-05T04:51:05.638419+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBV7JAT272VXVYED","created_at":"2026-07-05T04:51:05.638419+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBV7JAT2","created_at":"2026-07-05T04:51:05.638419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.03940","citing_title":"FairPOT: Balancing AUC Performance and Fairness with Proportional Optimal Transport","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H","json":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H.json","graph_json":"https://pith.science/api/pith-number/FBV7JAT272VXVYEDQIBZP7I72H/graph.json","events_json":"https://pith.science/api/pith-number/FBV7JAT272VXVYEDQIBZP7I72H/events.json","paper":"https://pith.science/paper/FBV7JAT2"},"agent_actions":{"view_html":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H","download_json":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H.json","view_paper":"https://pith.science/paper/FBV7JAT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.12823&json=true","fetch_graph":"https://pith.science/api/pith-number/FBV7JAT272VXVYEDQIBZP7I72H/graph.json","fetch_events":"https://pith.science/api/pith-number/FBV7JAT272VXVYEDQIBZP7I72H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H/action/storage_attestation","attest_author":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H/action/author_attestation","sign_citation":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H/action/citation_signature","submit_replication":"https://pith.science/pith/FBV7JAT272VXVYEDQIBZP7I72H/action/replication_record"}},"created_at":"2026-07-05T04:51:05.638419+00:00","updated_at":"2026-07-05T04:51:05.638419+00:00"}