{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QVTFP54X4N7IJZR5UBTUFZBVU3","short_pith_number":"pith:QVTFP54X","schema_version":"1.0","canonical_sha256":"856657f797e37e84e63da06742e435a6fbb3042d1d712a2603f5b944d367ec5a","source":{"kind":"arxiv","id":"1905.10660","version":2},"attestation_state":"computed","paper":{"title":"An Algorithmic Framework for Fairness Elicitation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Christopher Jung, Logan Stapleton, Michael Kearns, Seth Neel, Zhiwei Steven Wu","submitted_at":"2019-05-25T19:19:13Z","abstract_excerpt":"We consider settings in which the right notion of fairness is not captured by simple mathematical definitions (such as equality of error rates across groups), but might be more complex and nuanced and thus require elicitation from individual or collective stakeholders. We introduce a framework in which pairs of individuals can be identified as requiring (approximately) equal treatment under a learned model, or requiring ordered treatment such as \"applicant Alice should be at least as likely to receive a loan as applicant Bob\". We provide a provably convergent and oracle efficient algorithm 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":"1905.10660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-25T19:19:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a549f108452bc4bf1125bef48366facfdc07896bf6b27502ca822f8ad5ee038b","abstract_canon_sha256":"d85bfc294c892e55fa2d5ce65f212b6b5176bbf90c442e769e4394f5a9edc341"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:42:51.893720Z","signature_b64":"fVtlN0DU2Kjr3b6UaO6+L7ywiBq2OaE41Jbibdjni95/PC0gxrtmnj/UzfHO/hejTAjpTMHjpxGCg6M09MYwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"856657f797e37e84e63da06742e435a6fbb3042d1d712a2603f5b944d367ec5a","last_reissued_at":"2026-07-05T01:42:51.893234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:42:51.893234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithmic Framework for Fairness Elicitation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Roth, Christopher Jung, Logan Stapleton, Michael Kearns, Seth Neel, Zhiwei Steven Wu","submitted_at":"2019-05-25T19:19:13Z","abstract_excerpt":"We consider settings in which the right notion of fairness is not captured by simple mathematical definitions (such as equality of error rates across groups), but might be more complex and nuanced and thus require elicitation from individual or collective stakeholders. We introduce a framework in which pairs of individuals can be identified as requiring (approximately) equal treatment under a learned model, or requiring ordered treatment such as \"applicant Alice should be at least as likely to receive a loan as applicant Bob\". We provide a provably convergent and oracle efficient algorithm for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10660","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/1905.10660/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":"1905.10660","created_at":"2026-07-05T01:42:51.893292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10660v2","created_at":"2026-07-05T01:42:51.893292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10660","created_at":"2026-07-05T01:42:51.893292+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVTFP54X4N7I","created_at":"2026-07-05T01:42:51.893292+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVTFP54X4N7IJZR5","created_at":"2026-07-05T01:42:51.893292+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVTFP54X","created_at":"2026-07-05T01:42:51.893292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09881","citing_title":"Toward Calibrated, Fair, and accurate Deepfake Detection","ref_index":166,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23145","citing_title":"Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3","json":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3.json","graph_json":"https://pith.science/api/pith-number/QVTFP54X4N7IJZR5UBTUFZBVU3/graph.json","events_json":"https://pith.science/api/pith-number/QVTFP54X4N7IJZR5UBTUFZBVU3/events.json","paper":"https://pith.science/paper/QVTFP54X"},"agent_actions":{"view_html":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3","download_json":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3.json","view_paper":"https://pith.science/paper/QVTFP54X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10660&json=true","fetch_graph":"https://pith.science/api/pith-number/QVTFP54X4N7IJZR5UBTUFZBVU3/graph.json","fetch_events":"https://pith.science/api/pith-number/QVTFP54X4N7IJZR5UBTUFZBVU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3/action/storage_attestation","attest_author":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3/action/author_attestation","sign_citation":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3/action/citation_signature","submit_replication":"https://pith.science/pith/QVTFP54X4N7IJZR5UBTUFZBVU3/action/replication_record"}},"created_at":"2026-07-05T01:42:51.893292+00:00","updated_at":"2026-07-05T01:42:51.893292+00:00"}