{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FA6YA3HZ7PUEYBDM3R5A7JQCQN","short_pith_number":"pith:FA6YA3HZ","schema_version":"1.0","canonical_sha256":"283d806cf9fbe84c046cdc7a0fa602834918b39eed48c6e7571df6551ece8cea","source":{"kind":"arxiv","id":"2007.13019","version":1},"attestation_state":"computed","paper":{"title":"Feedback Loop and Bias Amplification in Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bamshad Mobasher, Himan Abdollahpouri, Masoud Mansoury, Mykola Pechenizkiy, Robin Burke","submitted_at":"2020-07-25T21:59:54Z","abstract_excerpt":"Recommendation algorithms are known to suffer from popularity bias; a few popular items are recommended frequently while the majority of other items are ignored. These recommendations are then consumed by the users, their reaction will be logged and added to the system: what is generally known as a feedback loop. In this paper, we propose a method for simulating the users interaction with the recommenders in an offline setting and study the impact of feedback loop on the popularity bias amplification of several recommendation algorithms. We then show how this bias amplification leads to severa"},"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":"2007.13019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-07-25T21:59:54Z","cross_cats_sorted":[],"title_canon_sha256":"a9d54e676a9dba173479cf55d710a21ca16ea72885fd62d20e95fc362ae88e1c","abstract_canon_sha256":"7b2b616deb295331c0f4ede99bca2049b6f204061ca32c5295f54fd1338bb9c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:05.921547Z","signature_b64":"yzihFgTjdn9zN2laPpNOLLE3lPxXQCBhTN7aT4pI6Poa97JPUa/JkMui2moGCq9WyxSYZtmNYeb2LYOCN6KXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"283d806cf9fbe84c046cdc7a0fa602834918b39eed48c6e7571df6551ece8cea","last_reissued_at":"2026-07-05T01:22:05.921089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:05.921089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feedback Loop and Bias Amplification in Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Bamshad Mobasher, Himan Abdollahpouri, Masoud Mansoury, Mykola Pechenizkiy, Robin Burke","submitted_at":"2020-07-25T21:59:54Z","abstract_excerpt":"Recommendation algorithms are known to suffer from popularity bias; a few popular items are recommended frequently while the majority of other items are ignored. These recommendations are then consumed by the users, their reaction will be logged and added to the system: what is generally known as a feedback loop. In this paper, we propose a method for simulating the users interaction with the recommenders in an offline setting and study the impact of feedback loop on the popularity bias amplification of several recommendation algorithms. We then show how this bias amplification leads to severa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.13019","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.13019/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":"2007.13019","created_at":"2026-07-05T01:22:05.921148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.13019v1","created_at":"2026-07-05T01:22:05.921148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.13019","created_at":"2026-07-05T01:22:05.921148+00:00"},{"alias_kind":"pith_short_12","alias_value":"FA6YA3HZ7PUE","created_at":"2026-07-05T01:22:05.921148+00:00"},{"alias_kind":"pith_short_16","alias_value":"FA6YA3HZ7PUEYBDM","created_at":"2026-07-05T01:22:05.921148+00:00"},{"alias_kind":"pith_short_8","alias_value":"FA6YA3HZ","created_at":"2026-07-05T01:22:05.921148+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.24092","citing_title":"ConAlign: Conditional Alignment Framework for Balancing Biased and Unbiased Recommendation","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN","json":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN.json","graph_json":"https://pith.science/api/pith-number/FA6YA3HZ7PUEYBDM3R5A7JQCQN/graph.json","events_json":"https://pith.science/api/pith-number/FA6YA3HZ7PUEYBDM3R5A7JQCQN/events.json","paper":"https://pith.science/paper/FA6YA3HZ"},"agent_actions":{"view_html":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN","download_json":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN.json","view_paper":"https://pith.science/paper/FA6YA3HZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.13019&json=true","fetch_graph":"https://pith.science/api/pith-number/FA6YA3HZ7PUEYBDM3R5A7JQCQN/graph.json","fetch_events":"https://pith.science/api/pith-number/FA6YA3HZ7PUEYBDM3R5A7JQCQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN/action/storage_attestation","attest_author":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN/action/author_attestation","sign_citation":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN/action/citation_signature","submit_replication":"https://pith.science/pith/FA6YA3HZ7PUEYBDM3R5A7JQCQN/action/replication_record"}},"created_at":"2026-07-05T01:22:05.921148+00:00","updated_at":"2026-07-05T01:22:05.921148+00:00"}