{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:46A2IQJPGYGYPBYKGPJY7KHTMZ","short_pith_number":"pith:46A2IQJP","schema_version":"1.0","canonical_sha256":"e781a4412f360d87870a33d38fa8f3665f066e1d9a3eb6791e885642b5713de6","source":{"kind":"arxiv","id":"2412.18138","version":2},"attestation_state":"computed","paper":{"title":"What Constitutes a Less Discriminatory Algorithm?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CY","authors_text":"Benjamin Laufer, Manish Raghavan, Solon Barocas","submitted_at":"2024-12-24T03:49:48Z","abstract_excerpt":"Disparate impact doctrine offers an important legal apparatus for targeting discriminatory data-driven algorithmic decisions. A recent body of work has focused on conceptualizing one particular construct from this doctrine: the less discriminatory alternative, an alternative policy that reduces disparities while meeting the same business needs of a status quo or baseline policy. However, attempts to operationalize this construct in the algorithmic setting must grapple with some thorny challenges and ambiguities. In this paper, we attempt to raise and resolve important questions about less disc"},"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":"2412.18138","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CY","submitted_at":"2024-12-24T03:49:48Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"83a2d964974f0165ee5092b4aca26c8f9d330e6dd105b7be58e28eafeb8a679d","abstract_canon_sha256":"b18566600a19f0b224fa8fcddf5634a836c08df8fd47e8822fe5e99a667cb2b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:22.517846Z","signature_b64":"ZRupWpxg/E6eKdph9oF6w7LTgVJHImz9MleF4ndJIUWOgLCBOB7wRfFJjYfBaA+Lce8duUYI3SCPXbfzUifmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e781a4412f360d87870a33d38fa8f3665f066e1d9a3eb6791e885642b5713de6","last_reissued_at":"2026-07-05T10:38:22.517396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:22.517396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What Constitutes a Less Discriminatory Algorithm?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CY","authors_text":"Benjamin Laufer, Manish Raghavan, Solon Barocas","submitted_at":"2024-12-24T03:49:48Z","abstract_excerpt":"Disparate impact doctrine offers an important legal apparatus for targeting discriminatory data-driven algorithmic decisions. A recent body of work has focused on conceptualizing one particular construct from this doctrine: the less discriminatory alternative, an alternative policy that reduces disparities while meeting the same business needs of a status quo or baseline policy. However, attempts to operationalize this construct in the algorithmic setting must grapple with some thorny challenges and ambiguities. In this paper, we attempt to raise and resolve important questions about less disc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18138","kind":"arxiv","version":2},"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/2412.18138/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":"2412.18138","created_at":"2026-07-05T10:38:22.517454+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.18138v2","created_at":"2026-07-05T10:38:22.517454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18138","created_at":"2026-07-05T10:38:22.517454+00:00"},{"alias_kind":"pith_short_12","alias_value":"46A2IQJPGYGY","created_at":"2026-07-05T10:38:22.517454+00:00"},{"alias_kind":"pith_short_16","alias_value":"46A2IQJPGYGYPBYK","created_at":"2026-07-05T10:38:22.517454+00:00"},{"alias_kind":"pith_short_8","alias_value":"46A2IQJP","created_at":"2026-07-05T10:38:22.517454+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15634","citing_title":"Be Intentional About Fairness!: Fairness, Size, and Multiplicity in the Rashomon Set","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ","json":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ.json","graph_json":"https://pith.science/api/pith-number/46A2IQJPGYGYPBYKGPJY7KHTMZ/graph.json","events_json":"https://pith.science/api/pith-number/46A2IQJPGYGYPBYKGPJY7KHTMZ/events.json","paper":"https://pith.science/paper/46A2IQJP"},"agent_actions":{"view_html":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ","download_json":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ.json","view_paper":"https://pith.science/paper/46A2IQJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.18138&json=true","fetch_graph":"https://pith.science/api/pith-number/46A2IQJPGYGYPBYKGPJY7KHTMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/46A2IQJPGYGYPBYKGPJY7KHTMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ/action/storage_attestation","attest_author":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ/action/author_attestation","sign_citation":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ/action/citation_signature","submit_replication":"https://pith.science/pith/46A2IQJPGYGYPBYKGPJY7KHTMZ/action/replication_record"}},"created_at":"2026-07-05T10:38:22.517454+00:00","updated_at":"2026-07-05T10:38:22.517454+00:00"}