{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/on-the-impossibility-of-fairness","title":"On the (im)possibility of fairness","arxiv_id":"1609.07236","date":"2016-09-23","proceeding":null,"authors":["Sorelle A. Friedler","Carlos Scheidegger","Suresh Venkatasubramanian"],"abstract":"What does it mean for an algorithm to be fair? Different papers use different\nnotions of algorithmic fairness, and although these appear internally\nconsistent, they also seem mutually incompatible. We present a mathematical\nsetting in which the distinctions in previous papers can be made formal. In\naddition to characterizing the spaces of inputs (the \"observed\" space) and\noutputs (the \"decision\" space), we introduce the notion of a construct space: a\nspace that captures unobservable, but meaningful variables for the prediction.\n  We show that in order to prove desirable properties of the entire\ndecision-making process, different mechanisms for fairness require different\nassumptions about the nature of the mapping from construct space to decision\nspace. The results in this paper imply that future treatments of algorithmic\nfairness should more explicitly state assumptions about the relationship\nbetween constructs and observations.","url_abs":"http://arxiv.org/abs/1609.07236v1","url_pdf":"http://arxiv.org/pdf/1609.07236v1.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":"on-the-impossibility-of-fairness","repo_url":"https://github.com/cteicher-m/loanBiases","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"on-the-impossibility-of-fairness","repo_url":"https://github.com/yclavinas/ai_big_data_quantum_compution","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"fairness","task_name":"Fairness"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1609.07236","atlas_url":"https://app.syntology.ai/?focus=1609.07236","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1609.07236"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1609.07236\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1609.07236"},"call":"get_concepts_for_paper(arxiv_id=\"1609.07236\")"}],"by_repo":[{"repo":"cteicher-m/loanBiases","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"yclavinas/ai_big_data_quantum_compution","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d57631925b533b4d513be74985c7e08e169aefedad738abfeb3a05864dfb296a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}