{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QL25Q3A64VOAAYU45FHRUNLSRE","short_pith_number":"pith:QL25Q3A6","schema_version":"1.0","canonical_sha256":"82f5d86c1ee55c00629ce94f1a35728909c3c8e4e07cfdc62a51c7171f608620","source":{"kind":"arxiv","id":"1906.11711","version":1},"attestation_state":"computed","paper":{"title":"Reducing Popularity Bias in Recommendation Over Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Himan Abdollahpouri, Robin Burke","submitted_at":"2019-06-27T14:59:23Z","abstract_excerpt":"Many recommendation algorithms suffer from popularity bias: a small number of popular items being recommended too frequently, while other items get insufficient exposure. Research in this area so far has concentrated on a one-shot representation of this bias, and on algorithms to improve the diversity of individual recommendation lists. In this work, we take a time-sensitive view of popularity bias, in which the algorithm assesses its long-tail coverage at regular intervals, and compensates in the present moment for omissions in the past. In particular, we present a temporal version of the wel"},"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":"1906.11711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-06-27T14:59:23Z","cross_cats_sorted":[],"title_canon_sha256":"5e7f52f1aed49df045a881e4c6edd0e4077c3a679ab2638bdfe0eab17cc77b6a","abstract_canon_sha256":"52855af74979bdd05cc2e8ce666a8928d17312c29946e7605e62502478a3705c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.033377Z","signature_b64":"QJ4MA7tFzpdBMguH15/+Wmw8QShtO/qINcETQ5MKnl+5lLcbEXNkc+Ml2ErA7k7CnDPZZ4x9RZzZfOHKA4VGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f5d86c1ee55c00629ce94f1a35728909c3c8e4e07cfdc62a51c7171f608620","last_reissued_at":"2026-05-17T23:42:04.032851Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.032851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing Popularity Bias in Recommendation Over Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Himan Abdollahpouri, Robin Burke","submitted_at":"2019-06-27T14:59:23Z","abstract_excerpt":"Many recommendation algorithms suffer from popularity bias: a small number of popular items being recommended too frequently, while other items get insufficient exposure. Research in this area so far has concentrated on a one-shot representation of this bias, and on algorithms to improve the diversity of individual recommendation lists. In this work, we take a time-sensitive view of popularity bias, in which the algorithm assesses its long-tail coverage at regular intervals, and compensates in the present moment for omissions in the past. In particular, we present a temporal version of the wel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11711","kind":"arxiv","version":1},"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":"1906.11711","created_at":"2026-05-17T23:42:04.032935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11711v1","created_at":"2026-05-17T23:42:04.032935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11711","created_at":"2026-05-17T23:42:04.032935+00:00"},{"alias_kind":"pith_short_12","alias_value":"QL25Q3A64VOA","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QL25Q3A64VOAAYU4","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QL25Q3A6","created_at":"2026-05-18T12:33:27.125529+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/QL25Q3A64VOAAYU45FHRUNLSRE","json":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE.json","graph_json":"https://pith.science/api/pith-number/QL25Q3A64VOAAYU45FHRUNLSRE/graph.json","events_json":"https://pith.science/api/pith-number/QL25Q3A64VOAAYU45FHRUNLSRE/events.json","paper":"https://pith.science/paper/QL25Q3A6"},"agent_actions":{"view_html":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE","download_json":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE.json","view_paper":"https://pith.science/paper/QL25Q3A6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11711&json=true","fetch_graph":"https://pith.science/api/pith-number/QL25Q3A64VOAAYU45FHRUNLSRE/graph.json","fetch_events":"https://pith.science/api/pith-number/QL25Q3A64VOAAYU45FHRUNLSRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE/action/storage_attestation","attest_author":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE/action/author_attestation","sign_citation":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE/action/citation_signature","submit_replication":"https://pith.science/pith/QL25Q3A64VOAAYU45FHRUNLSRE/action/replication_record"}},"created_at":"2026-05-17T23:42:04.032935+00:00","updated_at":"2026-05-17T23:42:04.032935+00:00"}