{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D2SR5BY6JRM7UPMQTK57AOUUWW","short_pith_number":"pith:D2SR5BY6","schema_version":"1.0","canonical_sha256":"1ea51e871e4c59fa3d909abbf03a94b592f8b97781ff3e0b30a2a4eaa9c4359e","source":{"kind":"arxiv","id":"1809.04737","version":1},"attestation_state":"computed","paper":{"title":"Fairness-aware Classification: Criterion, Convexity, and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lu Zhang, Xintao Wu, Yongkai Wu","submitted_at":"2018-09-13T01:56:57Z","abstract_excerpt":"Fairness-aware classification is receiving increasing attention in the machine learning fields. Recently research proposes to formulate the fairness-aware classification as constrained optimization problems. However, several limitations exist in previous works due to the lack of a theoretical framework for guiding the formulation. In this paper, we propose a general framework for learning fair classifiers which addresses previous limitations. The framework formulates various commonly-used fairness metrics as convex constraints that can be directly incorporated into classic classification model"},"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":"1809.04737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-13T01:56:57Z","cross_cats_sorted":["cs.AI","cs.CY","stat.ML"],"title_canon_sha256":"871b2bd7cfb1aeefb5d13fa04af9df976df0fd78fd82ddf432c868a355ed6d5f","abstract_canon_sha256":"b8f5d2d8ec07f4ff8b6eeb2175b1ece22d9f4943781819eade469c83a4418a93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:49.779223Z","signature_b64":"IOecrCsybYhUxzNXA7cY6nrLdOXbS48ZOfkWGFecZIpV7n4QOjpU/938ZwGtn8DEWINpHocjRmaIwEIrphDADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea51e871e4c59fa3d909abbf03a94b592f8b97781ff3e0b30a2a4eaa9c4359e","last_reissued_at":"2026-05-18T00:05:49.778658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:49.778658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness-aware Classification: Criterion, Convexity, and Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Lu Zhang, Xintao Wu, Yongkai Wu","submitted_at":"2018-09-13T01:56:57Z","abstract_excerpt":"Fairness-aware classification is receiving increasing attention in the machine learning fields. Recently research proposes to formulate the fairness-aware classification as constrained optimization problems. However, several limitations exist in previous works due to the lack of a theoretical framework for guiding the formulation. In this paper, we propose a general framework for learning fair classifiers which addresses previous limitations. The framework formulates various commonly-used fairness metrics as convex constraints that can be directly incorporated into classic classification model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04737","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":"1809.04737","created_at":"2026-05-18T00:05:49.778732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04737v1","created_at":"2026-05-18T00:05:49.778732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04737","created_at":"2026-05-18T00:05:49.778732+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2SR5BY6JRM7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2SR5BY6JRM7UPMQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2SR5BY6","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2503.16251","citing_title":"RESFL: An Uncertainty-Aware Framework for Responsible Federated Learning by Balancing Privacy, Fairness and Utility","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW","json":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW.json","graph_json":"https://pith.science/api/pith-number/D2SR5BY6JRM7UPMQTK57AOUUWW/graph.json","events_json":"https://pith.science/api/pith-number/D2SR5BY6JRM7UPMQTK57AOUUWW/events.json","paper":"https://pith.science/paper/D2SR5BY6"},"agent_actions":{"view_html":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW","download_json":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW.json","view_paper":"https://pith.science/paper/D2SR5BY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04737&json=true","fetch_graph":"https://pith.science/api/pith-number/D2SR5BY6JRM7UPMQTK57AOUUWW/graph.json","fetch_events":"https://pith.science/api/pith-number/D2SR5BY6JRM7UPMQTK57AOUUWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW/action/storage_attestation","attest_author":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW/action/author_attestation","sign_citation":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW/action/citation_signature","submit_replication":"https://pith.science/pith/D2SR5BY6JRM7UPMQTK57AOUUWW/action/replication_record"}},"created_at":"2026-05-18T00:05:49.778732+00:00","updated_at":"2026-05-18T00:05:49.778732+00:00"}