{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TOQ6Z6JDAYEHUUZ2JZDR5OLFOR","short_pith_number":"pith:TOQ6Z6JD","schema_version":"1.0","canonical_sha256":"9ba1ecf92306087a533a4e471eb965747eb7343c91cc445febb1ca792502b372","source":{"kind":"arxiv","id":"2103.14000","version":3},"attestation_state":"computed","paper":{"title":"Fairness in Ranking: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Julia Stoyanovich, Ke Yang, Meike Zehlike","submitted_at":"2021-03-25T17:38:20Z","abstract_excerpt":"In the past few years, there has been much work on incorporating fairness requirements into algorithmic rankers, with contributions coming from the data management, algorithms, information retrieval, and recommender systems communities. In this survey we give a systematic overview of this work, offering a broad perspective that connects formalizations and algorithmic approaches across subfields. An important contribution of our work is in developing a common narrative around the value frameworks that motivate specific fairness-enhancing interventions in ranking. This allows us to unify the pre"},"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":"2103.14000","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-03-25T17:38:20Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"8318eb7b5c02b5f2109733e896667dbb03d14cd790d4ebcb8732c7491702a177","abstract_canon_sha256":"8980ca12d8285faa59a6b907f3ab62547ab0f4c1d443e9872d572f29c9276aab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:55.051744Z","signature_b64":"65jNFmQd3PWjqcT5y7bqiMkCkd9L73veXFkhGVhYyW5gH/3EOKqgQAXRTOGnrBKa/BoBFIiE/M0Wq7G5uT7qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ba1ecf92306087a533a4e471eb965747eb7343c91cc445febb1ca792502b372","last_reissued_at":"2026-07-05T04:47:55.051281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:55.051281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fairness in Ranking: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.IR","authors_text":"Julia Stoyanovich, Ke Yang, Meike Zehlike","submitted_at":"2021-03-25T17:38:20Z","abstract_excerpt":"In the past few years, there has been much work on incorporating fairness requirements into algorithmic rankers, with contributions coming from the data management, algorithms, information retrieval, and recommender systems communities. In this survey we give a systematic overview of this work, offering a broad perspective that connects formalizations and algorithmic approaches across subfields. An important contribution of our work is in developing a common narrative around the value frameworks that motivate specific fairness-enhancing interventions in ranking. This allows us to unify the pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14000","kind":"arxiv","version":3},"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/2103.14000/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":"2103.14000","created_at":"2026-07-05T04:47:55.051342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.14000v3","created_at":"2026-07-05T04:47:55.051342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14000","created_at":"2026-07-05T04:47:55.051342+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOQ6Z6JDAYEH","created_at":"2026-07-05T04:47:55.051342+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOQ6Z6JDAYEHUUZ2","created_at":"2026-07-05T04:47:55.051342+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOQ6Z6JD","created_at":"2026-07-05T04:47:55.051342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30984","citing_title":"Towards Critical IR Theories and Practices","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2205.08809","citing_title":"Software Fairness: An Analysis and Survey","ref_index":139,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07117","citing_title":"Toward Individual Fairness Without Centralized Data: Selective Counterfactual Consistency for Vertical Federated Learning","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR","json":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR.json","graph_json":"https://pith.science/api/pith-number/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/graph.json","events_json":"https://pith.science/api/pith-number/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/events.json","paper":"https://pith.science/paper/TOQ6Z6JD"},"agent_actions":{"view_html":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR","download_json":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR.json","view_paper":"https://pith.science/paper/TOQ6Z6JD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.14000&json=true","fetch_graph":"https://pith.science/api/pith-number/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/graph.json","fetch_events":"https://pith.science/api/pith-number/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/action/storage_attestation","attest_author":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/action/author_attestation","sign_citation":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/action/citation_signature","submit_replication":"https://pith.science/pith/TOQ6Z6JDAYEHUUZ2JZDR5OLFOR/action/replication_record"}},"created_at":"2026-07-05T04:47:55.051342+00:00","updated_at":"2026-07-05T04:47:55.051342+00:00"}