{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PULIGZRB4GTRKG53VPOZP5XEL2","short_pith_number":"pith:PULIGZRB","schema_version":"1.0","canonical_sha256":"7d16836621e1a7151bbbabdd97f6e45ea9605680e8fdc2ad4f9c17e4f415a574","source":{"kind":"arxiv","id":"1609.07236","version":1},"attestation_state":"computed","paper":{"title":"On the (im)possibility of fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CY","authors_text":"Carlos Scheidegger, Sorelle A. Friedler, Suresh Venkatasubramanian","submitted_at":"2016-09-23T05:38:20Z","abstract_excerpt":"What does it mean for an algorithm to be fair? Different papers use different notions of algorithmic fairness, and although these appear internally consistent, they also seem mutually incompatible. We present a mathematical setting in which the distinctions in previous papers can be made formal. In addition to characterizing the spaces of inputs (the \"observed\" space) and outputs (the \"decision\" space), we introduce the notion of a construct space: a space that captures unobservable, but meaningful variables for the prediction.\n  We show that in order to prove desirable properties of the entir"},"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":"1609.07236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CY","submitted_at":"2016-09-23T05:38:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"366ac1143a09ed228c371bab9de2f68466869a1dfa4152833ee5cb5e60878031","abstract_canon_sha256":"dd204ad09f45cd5cb0075642c090fd657e6104e093c90574bf741efdd960b34e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:01.892517Z","signature_b64":"xO0v82b4DEn2jMeyEEFe5gJudvBqTUcbt0xk9v+CyN2+twDDVigmFuRbOyrKlXQp58czxWCT1Qb0T/F2EH8kCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d16836621e1a7151bbbabdd97f6e45ea9605680e8fdc2ad4f9c17e4f415a574","last_reissued_at":"2026-05-18T01:04:01.891815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:01.891815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the (im)possibility of fairness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CY","authors_text":"Carlos Scheidegger, Sorelle A. Friedler, Suresh Venkatasubramanian","submitted_at":"2016-09-23T05:38:20Z","abstract_excerpt":"What does it mean for an algorithm to be fair? Different papers use different notions of algorithmic fairness, and although these appear internally consistent, they also seem mutually incompatible. We present a mathematical setting in which the distinctions in previous papers can be made formal. In addition to characterizing the spaces of inputs (the \"observed\" space) and outputs (the \"decision\" space), we introduce the notion of a construct space: a space that captures unobservable, but meaningful variables for the prediction.\n  We show that in order to prove desirable properties of the entir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07236","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":"1609.07236","created_at":"2026-05-18T01:04:01.891938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07236v1","created_at":"2026-05-18T01:04:01.891938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07236","created_at":"2026-05-18T01:04:01.891938+00:00"},{"alias_kind":"pith_short_12","alias_value":"PULIGZRB4GTR","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PULIGZRB4GTRKG53","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PULIGZRB","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10604","citing_title":"Fairness vs Performance: Characterizing the Pareto Frontier of Algorithmic Decision Systems","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17952","citing_title":"Causal inference for social network formation","ref_index":181,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02640","citing_title":"Trustworthy AI Suffers from Invariance Conflicts and Causality is The Solution","ref_index":242,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2","json":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2.json","graph_json":"https://pith.science/api/pith-number/PULIGZRB4GTRKG53VPOZP5XEL2/graph.json","events_json":"https://pith.science/api/pith-number/PULIGZRB4GTRKG53VPOZP5XEL2/events.json","paper":"https://pith.science/paper/PULIGZRB"},"agent_actions":{"view_html":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2","download_json":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2.json","view_paper":"https://pith.science/paper/PULIGZRB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07236&json=true","fetch_graph":"https://pith.science/api/pith-number/PULIGZRB4GTRKG53VPOZP5XEL2/graph.json","fetch_events":"https://pith.science/api/pith-number/PULIGZRB4GTRKG53VPOZP5XEL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2/action/storage_attestation","attest_author":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2/action/author_attestation","sign_citation":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2/action/citation_signature","submit_replication":"https://pith.science/pith/PULIGZRB4GTRKG53VPOZP5XEL2/action/replication_record"}},"created_at":"2026-05-18T01:04:01.891938+00:00","updated_at":"2026-05-18T01:04:01.891938+00:00"}