{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VHUUJYFLERJ3KOP5MFO5ULNG5L","short_pith_number":"pith:VHUUJYFL","schema_version":"1.0","canonical_sha256":"a9e944e0ab2453b539fd615dda2da6eafadd809859ff83bddcb45a0081e31427","source":{"kind":"arxiv","id":"1901.07555","version":4},"attestation_state":"computed","paper":{"title":"Managing Popularity Bias in Recommender Systems with Personalized Re-ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bamshad Mobasher, Himan Abdollahpouri, Robin Burke","submitted_at":"2019-01-22T17:53:39Z","abstract_excerpt":"Many recommender systems suffer from popularity bias: popular items are recommended frequently while less popular, niche products, are recommended rarely or not at all. However, recommending the ignored products in the `long tail' is critical for businesses as they are less likely to be discovered. In this paper, we introduce a personalized diversification re-ranking approach to increase the representation of less popular items in recommendations while maintaining acceptable recommendation accuracy. Our approach is a post-processing step that can be applied to the output of any recommender sys"},"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":"1901.07555","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-01-22T17:53:39Z","cross_cats_sorted":[],"title_canon_sha256":"0f8706fe1d1748ee44b97c5c402662ae2025069a8c50e46fcc760608d263f26d","abstract_canon_sha256":"6671a2620affa7b08161d0ba3e6276f6514da107ba7ad4c038166d0342a39e63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:11.692910Z","signature_b64":"dYH8vxKGXNp6XXw7D6dDiJwd+dP9bOScHOHrpU4G1E/VFDcAYVWdUwuwIiQJiXiPR019OwrJECabhESEAeRWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9e944e0ab2453b539fd615dda2da6eafadd809859ff83bddcb45a0081e31427","last_reissued_at":"2026-07-04T23:53:11.692481Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:11.692481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Managing Popularity Bias in Recommender Systems with Personalized Re-ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bamshad Mobasher, Himan Abdollahpouri, Robin Burke","submitted_at":"2019-01-22T17:53:39Z","abstract_excerpt":"Many recommender systems suffer from popularity bias: popular items are recommended frequently while less popular, niche products, are recommended rarely or not at all. However, recommending the ignored products in the `long tail' is critical for businesses as they are less likely to be discovered. In this paper, we introduce a personalized diversification re-ranking approach to increase the representation of less popular items in recommendations while maintaining acceptable recommendation accuracy. Our approach is a post-processing step that can be applied to the output of any recommender sys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07555","kind":"arxiv","version":4},"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/1901.07555/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":"1901.07555","created_at":"2026-07-04T23:53:11.692537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07555v4","created_at":"2026-07-04T23:53:11.692537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07555","created_at":"2026-07-04T23:53:11.692537+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHUUJYFLERJ3","created_at":"2026-07-04T23:53:11.692537+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHUUJYFLERJ3KOP5","created_at":"2026-07-04T23:53:11.692537+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHUUJYFL","created_at":"2026-07-04T23:53:11.692537+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00448","citing_title":"Real-Time Hard Negative Sampling via LLM-based Clustering for Large-Scale Two-Tower Retrieval","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2507.21563","citing_title":"VoteGCL: Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07825","citing_title":"Filling the Gaps: Selective Knowledge Augmentation for LLM Recommenders","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L","json":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L.json","graph_json":"https://pith.science/api/pith-number/VHUUJYFLERJ3KOP5MFO5ULNG5L/graph.json","events_json":"https://pith.science/api/pith-number/VHUUJYFLERJ3KOP5MFO5ULNG5L/events.json","paper":"https://pith.science/paper/VHUUJYFL"},"agent_actions":{"view_html":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L","download_json":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L.json","view_paper":"https://pith.science/paper/VHUUJYFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07555&json=true","fetch_graph":"https://pith.science/api/pith-number/VHUUJYFLERJ3KOP5MFO5ULNG5L/graph.json","fetch_events":"https://pith.science/api/pith-number/VHUUJYFLERJ3KOP5MFO5ULNG5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L/action/storage_attestation","attest_author":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L/action/author_attestation","sign_citation":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L/action/citation_signature","submit_replication":"https://pith.science/pith/VHUUJYFLERJ3KOP5MFO5ULNG5L/action/replication_record"}},"created_at":"2026-07-04T23:53:11.692537+00:00","updated_at":"2026-07-04T23:53:11.692537+00:00"}