{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MNLSKUAVFJO36ZAADHNDA6VJS5","short_pith_number":"pith:MNLSKUAV","schema_version":"1.0","canonical_sha256":"63572550152a5dbf640019da307aa99743391cb4d8648ef72184b35116d6a6f9","source":{"kind":"arxiv","id":"2211.04449","version":1},"attestation_state":"computed","paper":{"title":"Fairness-aware Regression Robust to Adversarial Attacks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Lifeng Lai, Yulu Jin","submitted_at":"2022-11-04T18:09:34Z","abstract_excerpt":"In this paper, we take a first step towards answering the question of how to design fair machine learning algorithms that are robust to adversarial attacks. Using a minimax framework, we aim to design an adversarially robust fair regression model that achieves optimal performance in the presence of an attacker who is able to add a carefully designed adversarial data point to the dataset or perform a rank-one attack on the dataset. By solving the proposed nonsmooth nonconvex-nonconcave minimax problem, the optimal adversary as well as the robust fairness-aware regression model are obtained. For"},"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":"2211.04449","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CR","submitted_at":"2022-11-04T18:09:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"add1fa0e9b33cd554efe31ff1a7352a26bfed5767349f017249cda48ee748e69","abstract_canon_sha256":"776e63f0a3c04a4deaa221e089902f5c2ea6b7b64d1b620a94e8d6aa836adf58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:14:29.803088Z","signature_b64":"8TRhdoiTXcXA0DF1dcxxAJqmVihdFqs/LK+HJS91Xw9GG+jh8dHMvuoX9IXnVYxqHhMN0CwpMTEkyDpSUTdzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63572550152a5dbf640019da307aa99743391cb4d8648ef72184b35116d6a6f9","last_reissued_at":"2026-07-05T05:14:29.802580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:14:29.802580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness-aware Regression Robust to Adversarial Attacks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Lifeng Lai, Yulu Jin","submitted_at":"2022-11-04T18:09:34Z","abstract_excerpt":"In this paper, we take a first step towards answering the question of how to design fair machine learning algorithms that are robust to adversarial attacks. Using a minimax framework, we aim to design an adversarially robust fair regression model that achieves optimal performance in the presence of an attacker who is able to add a carefully designed adversarial data point to the dataset or perform a rank-one attack on the dataset. By solving the proposed nonsmooth nonconvex-nonconcave minimax problem, the optimal adversary as well as the robust fairness-aware regression model are obtained. For"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04449","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/2211.04449/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":"2211.04449","created_at":"2026-07-05T05:14:29.802645+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04449v1","created_at":"2026-07-05T05:14:29.802645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04449","created_at":"2026-07-05T05:14:29.802645+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNLSKUAVFJO3","created_at":"2026-07-05T05:14:29.802645+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNLSKUAVFJO36ZAA","created_at":"2026-07-05T05:14:29.802645+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNLSKUAV","created_at":"2026-07-05T05:14:29.802645+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5","json":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5.json","graph_json":"https://pith.science/api/pith-number/MNLSKUAVFJO36ZAADHNDA6VJS5/graph.json","events_json":"https://pith.science/api/pith-number/MNLSKUAVFJO36ZAADHNDA6VJS5/events.json","paper":"https://pith.science/paper/MNLSKUAV"},"agent_actions":{"view_html":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5","download_json":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5.json","view_paper":"https://pith.science/paper/MNLSKUAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04449&json=true","fetch_graph":"https://pith.science/api/pith-number/MNLSKUAVFJO36ZAADHNDA6VJS5/graph.json","fetch_events":"https://pith.science/api/pith-number/MNLSKUAVFJO36ZAADHNDA6VJS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5/action/storage_attestation","attest_author":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5/action/author_attestation","sign_citation":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5/action/citation_signature","submit_replication":"https://pith.science/pith/MNLSKUAVFJO36ZAADHNDA6VJS5/action/replication_record"}},"created_at":"2026-07-05T05:14:29.802645+00:00","updated_at":"2026-07-05T05:14:29.802645+00:00"}