{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O6G2V3IZE6746ICFFOSQEFC6RC","short_pith_number":"pith:O6G2V3IZ","schema_version":"1.0","canonical_sha256":"778daaed1927bfcf20452ba502145e8886a92895ce15246d3bc2f16a5ce07b17","source":{"kind":"arxiv","id":"1809.02921","version":2},"attestation_state":"computed","paper":{"title":"Personalizing Fairness-aware Re-ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Robin Burke, Weiwen Liu","submitted_at":"2018-09-09T04:51:51Z","abstract_excerpt":"Personalized recommendation brings about novel challenges in ensuring fairness, especially in scenarios in which users are not the only stakeholders involved in the recommender system. For example, the system may want to ensure that items from different providers have a fair chance of being recommended. To solve this problem, we propose a Fairness-Aware Re-ranking algorithm (FAR) to balance the ranking quality and provider-side fairness. We iteratively generate the ranking list by trading off between accuracy and the coverage of the providers. Although fair treatment of providers is desirable,"},"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":"1809.02921","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-09-09T04:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"6702bb2f7d216827de393509d9dd3be0a5bd33676790e524ea5ddcaee7eafb20","abstract_canon_sha256":"032e81ba4e19c19ee490fb138ee219ecc57ebec84ad489e4cace167b47cd43e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:50.271515Z","signature_b64":"xh8B/Co3eriUiv3aC+Gi8Rpiq9KGVTjoaamm6I+elOEiC03KcWIgPKHzhZBwmbC7dkJIrPmB+NgqR/xbbQknBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"778daaed1927bfcf20452ba502145e8886a92895ce15246d3bc2f16a5ce07b17","last_reissued_at":"2026-05-18T00:05:50.270992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:50.270992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Personalizing Fairness-aware Re-ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Robin Burke, Weiwen Liu","submitted_at":"2018-09-09T04:51:51Z","abstract_excerpt":"Personalized recommendation brings about novel challenges in ensuring fairness, especially in scenarios in which users are not the only stakeholders involved in the recommender system. For example, the system may want to ensure that items from different providers have a fair chance of being recommended. To solve this problem, we propose a Fairness-Aware Re-ranking algorithm (FAR) to balance the ranking quality and provider-side fairness. We iteratively generate the ranking list by trading off between accuracy and the coverage of the providers. Although fair treatment of providers is desirable,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02921","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":""},"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":"1809.02921","created_at":"2026-05-18T00:05:50.271071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02921v2","created_at":"2026-05-18T00:05:50.271071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02921","created_at":"2026-05-18T00:05:50.271071+00:00"},{"alias_kind":"pith_short_12","alias_value":"O6G2V3IZE674","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"O6G2V3IZE6746ICF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"O6G2V3IZ","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.11711","citing_title":"Reducing Popularity Bias in Recommendation Over Time","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC","json":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC.json","graph_json":"https://pith.science/api/pith-number/O6G2V3IZE6746ICFFOSQEFC6RC/graph.json","events_json":"https://pith.science/api/pith-number/O6G2V3IZE6746ICFFOSQEFC6RC/events.json","paper":"https://pith.science/paper/O6G2V3IZ"},"agent_actions":{"view_html":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC","download_json":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC.json","view_paper":"https://pith.science/paper/O6G2V3IZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02921&json=true","fetch_graph":"https://pith.science/api/pith-number/O6G2V3IZE6746ICFFOSQEFC6RC/graph.json","fetch_events":"https://pith.science/api/pith-number/O6G2V3IZE6746ICFFOSQEFC6RC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC/action/storage_attestation","attest_author":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC/action/author_attestation","sign_citation":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC/action/citation_signature","submit_replication":"https://pith.science/pith/O6G2V3IZE6746ICFFOSQEFC6RC/action/replication_record"}},"created_at":"2026-05-18T00:05:50.271071+00:00","updated_at":"2026-05-18T00:05:50.271071+00:00"}