{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:F3X6S6NJS5E3UCAW4DQ2CNC57P","short_pith_number":"pith:F3X6S6NJ","schema_version":"1.0","canonical_sha256":"2eefe979a99749ba0816e0e1a1345dfbcdaaa870ce4b7f4b860c82b74d18a1ad","source":{"kind":"arxiv","id":"2305.16637","version":2},"attestation_state":"computed","paper":{"title":"FARA: Future-aware Ranking Algorithm for Fairness Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Qingyao Ai, Tao Yang, Zhenduo Wang, Zhichao Xu","submitted_at":"2023-05-26T05:26:00Z","abstract_excerpt":"Ranking systems are the key components of modern Information Retrieval (IR) applications, such as search engines and recommender systems. Besides the ranking relevance to users, the exposure fairness to item providers has also been considered an important factor in ranking optimization. Many fair ranking algorithms have been proposed to jointly optimize both ranking relevance and fairness. However, we find that most existing fair ranking methods adopt greedy algorithms that only optimize rankings for the next immediate session or request. As shown in this paper, such a myopic paradigm could li"},"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":"2305.16637","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-05-26T05:26:00Z","cross_cats_sorted":[],"title_canon_sha256":"323626449564441f02ccbfd90e8998bb7ee61d149d47a7384e8db853b22cb128","abstract_canon_sha256":"c7188313ef466e457fdc45ab216036572a1195e60085dc66cf030e9ffa0f080f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:43.886185Z","signature_b64":"N3tFSY+02G68DK9TqustknlMLKYuXYIyCJXwvwH+NpFtEsth5bC3wqaDDFR09yeo1NbZ5Qci9VgxTi61DwCDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eefe979a99749ba0816e0e1a1345dfbcdaaa870ce4b7f4b860c82b74d18a1ad","last_reissued_at":"2026-07-05T06:42:43.885723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:43.885723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FARA: Future-aware Ranking Algorithm for Fairness Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Qingyao Ai, Tao Yang, Zhenduo Wang, Zhichao Xu","submitted_at":"2023-05-26T05:26:00Z","abstract_excerpt":"Ranking systems are the key components of modern Information Retrieval (IR) applications, such as search engines and recommender systems. Besides the ranking relevance to users, the exposure fairness to item providers has also been considered an important factor in ranking optimization. Many fair ranking algorithms have been proposed to jointly optimize both ranking relevance and fairness. However, we find that most existing fair ranking methods adopt greedy algorithms that only optimize rankings for the next immediate session or request. As shown in this paper, such a myopic paradigm could li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16637","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/2305.16637/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":"2305.16637","created_at":"2026-07-05T06:42:43.885779+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16637v2","created_at":"2026-07-05T06:42:43.885779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16637","created_at":"2026-07-05T06:42:43.885779+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3X6S6NJS5E3","created_at":"2026-07-05T06:42:43.885779+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3X6S6NJS5E3UCAW","created_at":"2026-07-05T06:42:43.885779+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3X6S6NJ","created_at":"2026-07-05T06:42:43.885779+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/F3X6S6NJS5E3UCAW4DQ2CNC57P","json":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P.json","graph_json":"https://pith.science/api/pith-number/F3X6S6NJS5E3UCAW4DQ2CNC57P/graph.json","events_json":"https://pith.science/api/pith-number/F3X6S6NJS5E3UCAW4DQ2CNC57P/events.json","paper":"https://pith.science/paper/F3X6S6NJ"},"agent_actions":{"view_html":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P","download_json":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P.json","view_paper":"https://pith.science/paper/F3X6S6NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16637&json=true","fetch_graph":"https://pith.science/api/pith-number/F3X6S6NJS5E3UCAW4DQ2CNC57P/graph.json","fetch_events":"https://pith.science/api/pith-number/F3X6S6NJS5E3UCAW4DQ2CNC57P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P/action/storage_attestation","attest_author":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P/action/author_attestation","sign_citation":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P/action/citation_signature","submit_replication":"https://pith.science/pith/F3X6S6NJS5E3UCAW4DQ2CNC57P/action/replication_record"}},"created_at":"2026-07-05T06:42:43.885779+00:00","updated_at":"2026-07-05T06:42:43.885779+00:00"}