{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7THA5RARSJBNKP7YHCE6AIUYWS","short_pith_number":"pith:7THA5RAR","schema_version":"1.0","canonical_sha256":"fcce0ec4119242d53ff83889e02298b48aac0ab54bd368fcce105704c96e906f","source":{"kind":"arxiv","id":"2111.10723","version":1},"attestation_state":"computed","paper":{"title":"End-to-end Learning for Fair Ranking Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ferdinando Fioretto, James Kotary, Pascal Van Hentenryck, Ziwei Zhu","submitted_at":"2021-11-21T03:25:04Z","abstract_excerpt":"The learning-to-rank problem aims at ranking items to maximize exposure of those most relevant to a user query. A desirable property of such ranking systems is to guarantee some notion of fairness among specified item groups. While fairness has recently been considered in the context of learning-to-rank systems, current methods cannot provide guarantees on the fairness of the proposed ranking policies.\n  This paper addresses this gap and introduces Smart Predict and Optimize for Fair Ranking (SPOFR), an integrated optimization and learning framework for fairness-constrained learning to rank. T"},"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":"2111.10723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-21T03:25:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"22054406d8e6679fcb7674a5340ebe2633c7d74799c50a7712a25ceb892960be","abstract_canon_sha256":"70e6fe51350542fd00eebe01d34618d0aa3e8226518878c605ec0850dc43ed6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:56.231462Z","signature_b64":"RO/+ontHlkxjxp1+AN63tA0RauuL2uaZCwi1qjovIpCji2AXz2VBk8JD46OGi+g2c82O9cUVrOmedpwynH8rAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcce0ec4119242d53ff83889e02298b48aac0ab54bd368fcce105704c96e906f","last_reissued_at":"2026-07-05T03:33:56.231045Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:56.231045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end Learning for Fair Ranking Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ferdinando Fioretto, James Kotary, Pascal Van Hentenryck, Ziwei Zhu","submitted_at":"2021-11-21T03:25:04Z","abstract_excerpt":"The learning-to-rank problem aims at ranking items to maximize exposure of those most relevant to a user query. A desirable property of such ranking systems is to guarantee some notion of fairness among specified item groups. While fairness has recently been considered in the context of learning-to-rank systems, current methods cannot provide guarantees on the fairness of the proposed ranking policies.\n  This paper addresses this gap and introduces Smart Predict and Optimize for Fair Ranking (SPOFR), an integrated optimization and learning framework for fairness-constrained learning to rank. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.10723","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.10723/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":"2111.10723","created_at":"2026-07-05T03:33:56.231108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.10723v1","created_at":"2026-07-05T03:33:56.231108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.10723","created_at":"2026-07-05T03:33:56.231108+00:00"},{"alias_kind":"pith_short_12","alias_value":"7THA5RARSJBN","created_at":"2026-07-05T03:33:56.231108+00:00"},{"alias_kind":"pith_short_16","alias_value":"7THA5RARSJBNKP7Y","created_at":"2026-07-05T03:33:56.231108+00:00"},{"alias_kind":"pith_short_8","alias_value":"7THA5RAR","created_at":"2026-07-05T03:33:56.231108+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS","json":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS.json","graph_json":"https://pith.science/api/pith-number/7THA5RARSJBNKP7YHCE6AIUYWS/graph.json","events_json":"https://pith.science/api/pith-number/7THA5RARSJBNKP7YHCE6AIUYWS/events.json","paper":"https://pith.science/paper/7THA5RAR"},"agent_actions":{"view_html":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS","download_json":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS.json","view_paper":"https://pith.science/paper/7THA5RAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.10723&json=true","fetch_graph":"https://pith.science/api/pith-number/7THA5RARSJBNKP7YHCE6AIUYWS/graph.json","fetch_events":"https://pith.science/api/pith-number/7THA5RARSJBNKP7YHCE6AIUYWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS/action/storage_attestation","attest_author":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS/action/author_attestation","sign_citation":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS/action/citation_signature","submit_replication":"https://pith.science/pith/7THA5RARSJBNKP7YHCE6AIUYWS/action/replication_record"}},"created_at":"2026-07-05T03:33:56.231108+00:00","updated_at":"2026-07-05T03:33:56.231108+00:00"}