{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BQHURB3YMCHYMO2XH6ABLG76BJ","short_pith_number":"pith:BQHURB3Y","schema_version":"1.0","canonical_sha256":"0c0f488778608f863b573f80159bfe0a5d2d94b657d240a2420e94d1a00d67a2","source":{"kind":"arxiv","id":"2105.03153","version":2},"attestation_state":"computed","paper":{"title":"Pairwise Fairness for Ordinal Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chris Russell, Krishnaram Kenthapadi, Matth\\\"aus Kleindessner, Muhammad Bilal Zafar, Samira Samadi","submitted_at":"2021-05-07T10:33:42Z","abstract_excerpt":"We initiate the study of fairness for ordinal regression. We adapt two fairness notions previously considered in fair ranking and propose a strategy for training a predictor that is approximately fair according to either notion. Our predictor has the form of a threshold model, composed of a scoring function and a set of thresholds, and our strategy is based on a reduction to fair binary classification for learning the scoring function and local search for choosing the thresholds. We provide generalization guarantees on the error and fairness violation of our predictor, and we illustrate the ef"},"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":"2105.03153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-05-07T10:33:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"397b6fb003bd6af8855504dca19dd97841353e5017c056aa54823115f247bdff","abstract_canon_sha256":"211a77e489e4aed1a99baff0c5fbeba352f5d65f5c508ed7ed4a3a0f72055156"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:01.616112Z","signature_b64":"2uk7aHs1bj40XrVsQJaiMBjDUuOY1V2eKugnwSNITAAIYWcoi4/116UYHrFTP6xRx/ir0qtUUJlTrNP78SV9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c0f488778608f863b573f80159bfe0a5d2d94b657d240a2420e94d1a00d67a2","last_reissued_at":"2026-07-05T03:56:01.615638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:01.615638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise Fairness for Ordinal Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chris Russell, Krishnaram Kenthapadi, Matth\\\"aus Kleindessner, Muhammad Bilal Zafar, Samira Samadi","submitted_at":"2021-05-07T10:33:42Z","abstract_excerpt":"We initiate the study of fairness for ordinal regression. We adapt two fairness notions previously considered in fair ranking and propose a strategy for training a predictor that is approximately fair according to either notion. Our predictor has the form of a threshold model, composed of a scoring function and a set of thresholds, and our strategy is based on a reduction to fair binary classification for learning the scoring function and local search for choosing the thresholds. We provide generalization guarantees on the error and fairness violation of our predictor, and we illustrate the ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03153","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/2105.03153/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":"2105.03153","created_at":"2026-07-05T03:56:01.615701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.03153v2","created_at":"2026-07-05T03:56:01.615701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03153","created_at":"2026-07-05T03:56:01.615701+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQHURB3YMCHY","created_at":"2026-07-05T03:56:01.615701+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQHURB3YMCHYMO2X","created_at":"2026-07-05T03:56:01.615701+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQHURB3Y","created_at":"2026-07-05T03:56:01.615701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16610","citing_title":"Fairness Constraints in High-Dimensional Generalized Linear Models","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ","json":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ.json","graph_json":"https://pith.science/api/pith-number/BQHURB3YMCHYMO2XH6ABLG76BJ/graph.json","events_json":"https://pith.science/api/pith-number/BQHURB3YMCHYMO2XH6ABLG76BJ/events.json","paper":"https://pith.science/paper/BQHURB3Y"},"agent_actions":{"view_html":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ","download_json":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ.json","view_paper":"https://pith.science/paper/BQHURB3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.03153&json=true","fetch_graph":"https://pith.science/api/pith-number/BQHURB3YMCHYMO2XH6ABLG76BJ/graph.json","fetch_events":"https://pith.science/api/pith-number/BQHURB3YMCHYMO2XH6ABLG76BJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ/action/storage_attestation","attest_author":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ/action/author_attestation","sign_citation":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ/action/citation_signature","submit_replication":"https://pith.science/pith/BQHURB3YMCHYMO2XH6ABLG76BJ/action/replication_record"}},"created_at":"2026-07-05T03:56:01.615701+00:00","updated_at":"2026-07-05T03:56:01.615701+00:00"}