{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EBVSUMUZ33ETWQLI5DC7EJ7CBK","short_pith_number":"pith:EBVSUMUZ","schema_version":"1.0","canonical_sha256":"206b2a3299dec93b4168e8c5f227e20a896faaee2090adf759941860419d6b65","source":{"kind":"arxiv","id":"1909.03601","version":3},"attestation_state":"computed","paper":{"title":"Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Hayato Sakata, Kazuhide Nakata, Suguru Yaginuma, Yuta Nishino, Yuta Saito","submitted_at":"2019-09-09T02:54:20Z","abstract_excerpt":"Recommender systems widely use implicit feedback such as click data because of its general availability. Although the presence of clicks signals the users' preference to some extent, the lack of such clicks does not necessarily indicate a negative response from the users, as it is possible that the users were not exposed to the items (positive-unlabeled problem). This leads to a difficulty in predicting the users' preferences from implicit feedback. Previous studies addressed the positive-unlabeled problem by uniformly upweighting the loss for the positive feedback data or estimating the confi"},"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":"1909.03601","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-09-09T02:54:20Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"69174084b4eb4dd7f24476f5145549413959cc77aad3ef25392b1d3cfeb3a19e","abstract_canon_sha256":"aeaf06c17145208377f160186409b0c67a6bc5b36fe3838977c66d58229acbb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:55.114025Z","signature_b64":"VIynI5JLoLMLS6VUbWJmmfwHlPM7S1YSzWNgZoOW/RzDHGNn4uDwAjLLpjD4jjsU2JSKiiYV0GD08x1u/zyOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"206b2a3299dec93b4168e8c5f227e20a896faaee2090adf759941860419d6b65","last_reissued_at":"2026-07-05T04:31:55.113535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:55.113535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Hayato Sakata, Kazuhide Nakata, Suguru Yaginuma, Yuta Nishino, Yuta Saito","submitted_at":"2019-09-09T02:54:20Z","abstract_excerpt":"Recommender systems widely use implicit feedback such as click data because of its general availability. Although the presence of clicks signals the users' preference to some extent, the lack of such clicks does not necessarily indicate a negative response from the users, as it is possible that the users were not exposed to the items (positive-unlabeled problem). This leads to a difficulty in predicting the users' preferences from implicit feedback. Previous studies addressed the positive-unlabeled problem by uniformly upweighting the loss for the positive feedback data or estimating the confi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.03601","kind":"arxiv","version":3},"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/1909.03601/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":"1909.03601","created_at":"2026-07-05T04:31:55.113591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.03601v3","created_at":"2026-07-05T04:31:55.113591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.03601","created_at":"2026-07-05T04:31:55.113591+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBVSUMUZ33ET","created_at":"2026-07-05T04:31:55.113591+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBVSUMUZ33ETWQLI","created_at":"2026-07-05T04:31:55.113591+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBVSUMUZ","created_at":"2026-07-05T04:31:55.113591+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":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK","json":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK.json","graph_json":"https://pith.science/api/pith-number/EBVSUMUZ33ETWQLI5DC7EJ7CBK/graph.json","events_json":"https://pith.science/api/pith-number/EBVSUMUZ33ETWQLI5DC7EJ7CBK/events.json","paper":"https://pith.science/paper/EBVSUMUZ"},"agent_actions":{"view_html":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK","download_json":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK.json","view_paper":"https://pith.science/paper/EBVSUMUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.03601&json=true","fetch_graph":"https://pith.science/api/pith-number/EBVSUMUZ33ETWQLI5DC7EJ7CBK/graph.json","fetch_events":"https://pith.science/api/pith-number/EBVSUMUZ33ETWQLI5DC7EJ7CBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK/action/storage_attestation","attest_author":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK/action/author_attestation","sign_citation":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK/action/citation_signature","submit_replication":"https://pith.science/pith/EBVSUMUZ33ETWQLI5DC7EJ7CBK/action/replication_record"}},"created_at":"2026-07-05T04:31:55.113591+00:00","updated_at":"2026-07-05T04:31:55.113591+00:00"}