{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/pretending-fair-decisions-via-stealthily","title":"Faking Fairness via Stealthily Biased Sampling","arxiv_id":"1901.08291","date":"2019-01-24","proceeding":null,"authors":["Kazuto Fukuchi","Satoshi Hara","Takanori Maehara"],"abstract":"Auditing fairness of decision-makers is now in high demand. To respond to this social demand, several fairness auditing tools have been developed. The focus of this study is to raise an awareness of the risk of malicious decision-makers who fake fairness by abusing the auditing tools and thereby deceiving the social communities. The question is whether such a fraud of the decision-maker is detectable so that the society can avoid the risk of fake fairness. In this study, we answer this question negatively. We specifically put our focus on a situation where the decision-maker publishes a benchmark dataset as the evidence of his/her fairness and attempts to deceive a person who uses an auditing tool that computes a fairness metric. To assess the (un)detectability of the fraud, we explicitly construct an algorithm, the stealthily biased sampling, that can deliberately construct an evil benchmark dataset via subsampling. We show that the fraud made by the stealthily based sampling is indeed difficult to detect both theoretically and empirically.","url_abs":"https://arxiv.org/abs/1901.08291v2","url_pdf":"https://arxiv.org/pdf/1901.08291v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"pretending-fair-decisions-via-stealthily","repo_url":"https://github.com/sato9hara/stealthily-biased-sampling","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"pretending-fair-decisions-via-stealthily","repo_url":"https://github.com/gablabc/fool_shap","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"fairness","task_name":"Fairness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1901.08291","atlas_url":"https://app.syntology.ai/?focus=1901.08291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08291"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/gablabc/fool_shap","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sato9hara/stealthily-biased-sampling","reach":null}],"summary":{"unverified":3},"by_repo_kind":{"official":{"samples":3,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"3fa38a70da046765","entry":"compute_wasserstein","repo":"sato9hara/stealthily-biased-sampling","repo_kind":"official","path":"stealth_sampling.py","file_url":"https://github.com/sato9hara/stealthily-biased-sampling/blob/HEAD/stealth_sampling.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3fa38a70da046765"}},{"code_sha256_prefix":"f138443497c8b325","entry":"stealth_sampling","repo":"sato9hara/stealthily-biased-sampling","repo_kind":"official","path":"stealth_sampling.py","file_url":"https://github.com/sato9hara/stealthily-biased-sampling/blob/HEAD/stealth_sampling.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f138443497c8b325"}},{"code_sha256_prefix":"6ec1cf6403da7d98","entry":"stealth_sampling_bootstrap","repo":"sato9hara/stealthily-biased-sampling","repo_kind":"official","path":"stealth_sampling.py","file_url":"https://github.com/sato9hara/stealthily-biased-sampling/blob/HEAD/stealth_sampling.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6ec1cf6403da7d98"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}