{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B7F34ACDYDMVD2U5QM7LFJNXU5","short_pith_number":"pith:B7F34ACD","schema_version":"1.0","canonical_sha256":"0fcbbe0043c0d951ea9d833eb2a5b7a74370e3b4102dce1335481f4d808c8a7f","source":{"kind":"arxiv","id":"1507.05371","version":2},"attestation_state":"computed","paper":{"title":"Regret Guarantees for Item-Item Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Devavrat Shah, Guy Bresler, Luis F. Voloch","submitted_at":"2015-07-20T02:45:01Z","abstract_excerpt":"There is much empirical evidence that item-item collaborative filtering works well in practice. Motivated to understand this, we provide a framework to design and analyze various recommendation algorithms. The setup amounts to online binary matrix completion, where at each time a random user requests a recommendation and the algorithm chooses an entry to reveal in the user's row. The goal is to minimize regret, or equivalently to maximize the number of +1 entries revealed at any time. We analyze an item-item collaborative filtering algorithm that can achieve fundamentally better performance co"},"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":"1507.05371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-20T02:45:01Z","cross_cats_sorted":["cs.IR","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"a746dcaa525f117b055f95953d5ac48790eb590f31fdac8cb83ed28eabb7d6d1","abstract_canon_sha256":"289a09d9be04f1e5ab5db630458b5e5f0aee1b23c0aa200ba0ef7cde31403b0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:12.081125Z","signature_b64":"iKc0HgmeP/iCJDsUbXjTSjjQFBiaf/Ca+F91QywT+UOPr+tpYr8UBH6NYp+lF8wzaXOWX+pw5Rh4dDgPmG9bAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fcbbe0043c0d951ea9d833eb2a5b7a74370e3b4102dce1335481f4d808c8a7f","last_reissued_at":"2026-05-18T01:23:12.080686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:12.080686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regret Guarantees for Item-Item Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Devavrat Shah, Guy Bresler, Luis F. Voloch","submitted_at":"2015-07-20T02:45:01Z","abstract_excerpt":"There is much empirical evidence that item-item collaborative filtering works well in practice. Motivated to understand this, we provide a framework to design and analyze various recommendation algorithms. The setup amounts to online binary matrix completion, where at each time a random user requests a recommendation and the algorithm chooses an entry to reveal in the user's row. The goal is to minimize regret, or equivalently to maximize the number of +1 entries revealed at any time. We analyze an item-item collaborative filtering algorithm that can achieve fundamentally better performance co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05371","kind":"arxiv","version":2},"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":"1507.05371","created_at":"2026-05-18T01:23:12.080749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05371v2","created_at":"2026-05-18T01:23:12.080749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05371","created_at":"2026-05-18T01:23:12.080749+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7F34ACDYDMV","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7F34ACDYDMVD2U5","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7F34ACD","created_at":"2026-05-18T12:29:14.074870+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/B7F34ACDYDMVD2U5QM7LFJNXU5","json":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5.json","graph_json":"https://pith.science/api/pith-number/B7F34ACDYDMVD2U5QM7LFJNXU5/graph.json","events_json":"https://pith.science/api/pith-number/B7F34ACDYDMVD2U5QM7LFJNXU5/events.json","paper":"https://pith.science/paper/B7F34ACD"},"agent_actions":{"view_html":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5","download_json":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5.json","view_paper":"https://pith.science/paper/B7F34ACD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05371&json=true","fetch_graph":"https://pith.science/api/pith-number/B7F34ACDYDMVD2U5QM7LFJNXU5/graph.json","fetch_events":"https://pith.science/api/pith-number/B7F34ACDYDMVD2U5QM7LFJNXU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/action/storage_attestation","attest_author":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/action/author_attestation","sign_citation":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/action/citation_signature","submit_replication":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/action/replication_record"}},"created_at":"2026-05-18T01:23:12.080749+00:00","updated_at":"2026-05-18T01:23:12.080749+00:00"}