{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LQ5GTBMKTIH3W2BBJWQOPFTMN5","short_pith_number":"pith:LQ5GTBMK","schema_version":"1.0","canonical_sha256":"5c3a69858a9a0fbb68214da0e7966c6f5677d0453cb77f7bafd50b11fdca2a37","source":{"kind":"arxiv","id":"2112.01160","version":1},"attestation_state":"computed","paper":{"title":"Learning Robust Recommender from Noisy Implicit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Fuli Feng, Liqiang Nie, Tat-Seng Chua, Wenjie Wang, Xiangnan He","submitted_at":"2021-12-02T12:12:02Z","abstract_excerpt":"The ubiquity of implicit feedback makes it indispensable for building recommender systems. However, it does not actually reflect the actual satisfaction of users. For example, in E-commerce, a large portion of clicks do not translate to purchases, and many purchases end up with negative reviews. As such, it is of importance to account for the inevitable noises in implicit feedback. However, little work on recommendation has taken the noisy nature of implicit feedback into consideration. In this work, we explore the central theme of denoising implicit feedback for recommender learning, includin"},"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":"2112.01160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-02T12:12:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7d1652f5507e0bfa32f0d69f94c7924a7f15c69656b48536b2e1b64994bfa6b1","abstract_canon_sha256":"873fe87640dd64ebae77860fc703beb4f875d894dd2c5dc2b3ca918dcf41cdc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:05.909037Z","signature_b64":"f0pdBfri1FC1XqW94i6bbKkGO8mo533cRJRuTR/erisOJyYhtINEByA8FWxiAaz/q7GvpO0AXYOWKAcPDIQsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c3a69858a9a0fbb68214da0e7966c6f5677d0453cb77f7bafd50b11fdca2a37","last_reissued_at":"2026-07-05T03:37:05.908594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:05.908594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Robust Recommender from Noisy Implicit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Fuli Feng, Liqiang Nie, Tat-Seng Chua, Wenjie Wang, Xiangnan He","submitted_at":"2021-12-02T12:12:02Z","abstract_excerpt":"The ubiquity of implicit feedback makes it indispensable for building recommender systems. However, it does not actually reflect the actual satisfaction of users. For example, in E-commerce, a large portion of clicks do not translate to purchases, and many purchases end up with negative reviews. As such, it is of importance to account for the inevitable noises in implicit feedback. However, little work on recommendation has taken the noisy nature of implicit feedback into consideration. In this work, we explore the central theme of denoising implicit feedback for recommender learning, includin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01160","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/2112.01160/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":"2112.01160","created_at":"2026-07-05T03:37:05.908661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.01160v1","created_at":"2026-07-05T03:37:05.908661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01160","created_at":"2026-07-05T03:37:05.908661+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQ5GTBMKTIH3","created_at":"2026-07-05T03:37:05.908661+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQ5GTBMKTIH3W2BB","created_at":"2026-07-05T03:37:05.908661+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQ5GTBMK","created_at":"2026-07-05T03:37:05.908661+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.19647","citing_title":"CAdam: Confidence-Based Optimization for Online Learning","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5","json":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5.json","graph_json":"https://pith.science/api/pith-number/LQ5GTBMKTIH3W2BBJWQOPFTMN5/graph.json","events_json":"https://pith.science/api/pith-number/LQ5GTBMKTIH3W2BBJWQOPFTMN5/events.json","paper":"https://pith.science/paper/LQ5GTBMK"},"agent_actions":{"view_html":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5","download_json":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5.json","view_paper":"https://pith.science/paper/LQ5GTBMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.01160&json=true","fetch_graph":"https://pith.science/api/pith-number/LQ5GTBMKTIH3W2BBJWQOPFTMN5/graph.json","fetch_events":"https://pith.science/api/pith-number/LQ5GTBMKTIH3W2BBJWQOPFTMN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5/action/storage_attestation","attest_author":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5/action/author_attestation","sign_citation":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5/action/citation_signature","submit_replication":"https://pith.science/pith/LQ5GTBMKTIH3W2BBJWQOPFTMN5/action/replication_record"}},"created_at":"2026-07-05T03:37:05.908661+00:00","updated_at":"2026-07-05T03:37:05.908661+00:00"}