{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KJ52OCVXRRD3U5MGSX4PLG7Y6X","short_pith_number":"pith:KJ52OCVX","schema_version":"1.0","canonical_sha256":"527ba70ab78c47ba758695f8f59bf8f5ffc460ea8af85b3babbdd10d68098134","source":{"kind":"arxiv","id":"2412.00424","version":2},"attestation_state":"computed","paper":{"title":"FairSort: Learning to Fair Rank for Personalized Recommendations in Two-Sided Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.GT","authors_text":"Guodong Fan, Guoli Wu, Hongqi Chen, HongYue Wu, Jianmao Xiao, Jingyu Li, Shizhan Chen, Xiao Xue, Zhiyong Feng","submitted_at":"2024-11-30T10:30:49Z","abstract_excerpt":"Traditional recommendation systems focus on maximizing user satisfaction by suggesting their favourite items. This user-centric approach may lead to unfair exposure distribution among the providers. On the contrary, a provider-centric design might become unfair to the users. Therefore, this paper proposes a re-ranking model FairSort to find a trade-off solution among user-side fairness, provider-side fairness, and personalized recommendations utility. Previous works habitually treat this issue as a knapsack problem, incorporating both-side fairness as constraints.\n  In this paper, we adopt a n"},"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":"2412.00424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-11-30T10:30:49Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"bd7e7bb3547d63504f398bad307d19e4753a00c7541f2fc5c58c804f5918faee","abstract_canon_sha256":"e5b9f2ee42d6fa75f02a7ce8836a7755d905a34fca6135d3ad47c11baf9f3a5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:59.089119Z","signature_b64":"hSTFqEX2K7rGjFekzVbB2xrzF5hGb2Ss7G1TBgz6pWCdBJACNVMoH6D1qrpouWzPNW7NssLC8wwip5Ymh8ZHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"527ba70ab78c47ba758695f8f59bf8f5ffc460ea8af85b3babbdd10d68098134","last_reissued_at":"2026-07-05T09:45:59.088577Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:59.088577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FairSort: Learning to Fair Rank for Personalized Recommendations in Two-Sided Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.GT","authors_text":"Guodong Fan, Guoli Wu, Hongqi Chen, HongYue Wu, Jianmao Xiao, Jingyu Li, Shizhan Chen, Xiao Xue, Zhiyong Feng","submitted_at":"2024-11-30T10:30:49Z","abstract_excerpt":"Traditional recommendation systems focus on maximizing user satisfaction by suggesting their favourite items. This user-centric approach may lead to unfair exposure distribution among the providers. On the contrary, a provider-centric design might become unfair to the users. Therefore, this paper proposes a re-ranking model FairSort to find a trade-off solution among user-side fairness, provider-side fairness, and personalized recommendations utility. Previous works habitually treat this issue as a knapsack problem, incorporating both-side fairness as constraints.\n  In this paper, we adopt a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.00424","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/2412.00424/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":"2412.00424","created_at":"2026-07-05T09:45:59.088652+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.00424v2","created_at":"2026-07-05T09:45:59.088652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.00424","created_at":"2026-07-05T09:45:59.088652+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJ52OCVXRRD3","created_at":"2026-07-05T09:45:59.088652+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJ52OCVXRRD3U5MG","created_at":"2026-07-05T09:45:59.088652+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJ52OCVX","created_at":"2026-07-05T09:45:59.088652+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/KJ52OCVXRRD3U5MGSX4PLG7Y6X","json":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X.json","graph_json":"https://pith.science/api/pith-number/KJ52OCVXRRD3U5MGSX4PLG7Y6X/graph.json","events_json":"https://pith.science/api/pith-number/KJ52OCVXRRD3U5MGSX4PLG7Y6X/events.json","paper":"https://pith.science/paper/KJ52OCVX"},"agent_actions":{"view_html":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X","download_json":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X.json","view_paper":"https://pith.science/paper/KJ52OCVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.00424&json=true","fetch_graph":"https://pith.science/api/pith-number/KJ52OCVXRRD3U5MGSX4PLG7Y6X/graph.json","fetch_events":"https://pith.science/api/pith-number/KJ52OCVXRRD3U5MGSX4PLG7Y6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X/action/storage_attestation","attest_author":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X/action/author_attestation","sign_citation":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X/action/citation_signature","submit_replication":"https://pith.science/pith/KJ52OCVXRRD3U5MGSX4PLG7Y6X/action/replication_record"}},"created_at":"2026-07-05T09:45:59.088652+00:00","updated_at":"2026-07-05T09:45:59.088652+00:00"}