{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HUXR6Z3CN75SHFJN3GFDQTLVOX","short_pith_number":"pith:HUXR6Z3C","schema_version":"1.0","canonical_sha256":"3d2f1f67626ffb23952dd98a384d7575f34303f483154713a1bf7e02b794dc6a","source":{"kind":"arxiv","id":"1411.6591","version":1},"attestation_state":"computed","paper":{"title":"A Latent Source Model for Online Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Devavrat Shah, George H. Chen, Guy Bresler","submitted_at":"2014-10-31T19:59:59Z","abstract_excerpt":"Despite the prevalence of collaborative filtering in recommendation systems, there has been little theoretical development on why and how well it works, especially in the \"online\" setting, where items are recommended to users over time. We address this theoretical gap by introducing a model for online recommendation systems, cast item recommendation under the model as a learning problem, and analyze the performance of a cosine-similarity collaborative filtering method. In our model, each of $n$ users either likes or dislikes each of $m$ items. We assume there to be $k$ types of users, and all "},"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":"1411.6591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-31T19:59:59Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"7b5d6a608f16d2b8e401a70e487a6a53b0701f569bd1d71fe869f03623618b32","abstract_canon_sha256":"a02f4b0e1feab5741f237c43f4ca6234c99c527487f299d3626a25993c6b8416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:54.754179Z","signature_b64":"Nq/x7qQLKpFkpQgtJ28zwoFSA28cMVOoX/4+m8AyT1KZacY4vzr6wwUPT6FKoY9kP+csUKfNrgEuOklYR1GdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d2f1f67626ffb23952dd98a384d7575f34303f483154713a1bf7e02b794dc6a","last_reissued_at":"2026-05-18T02:32:54.753819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:54.753819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Latent Source Model for Online Collaborative Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Devavrat Shah, George H. Chen, Guy Bresler","submitted_at":"2014-10-31T19:59:59Z","abstract_excerpt":"Despite the prevalence of collaborative filtering in recommendation systems, there has been little theoretical development on why and how well it works, especially in the \"online\" setting, where items are recommended to users over time. We address this theoretical gap by introducing a model for online recommendation systems, cast item recommendation under the model as a learning problem, and analyze the performance of a cosine-similarity collaborative filtering method. In our model, each of $n$ users either likes or dislikes each of $m$ items. We assume there to be $k$ types of users, and all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6591","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":"1411.6591","created_at":"2026-05-18T02:32:54.753868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.6591v1","created_at":"2026-05-18T02:32:54.753868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6591","created_at":"2026-05-18T02:32:54.753868+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUXR6Z3CN75S","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUXR6Z3CN75SHFJN","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUXR6Z3C","created_at":"2026-05-18T12:28:30.664211+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/HUXR6Z3CN75SHFJN3GFDQTLVOX","json":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX.json","graph_json":"https://pith.science/api/pith-number/HUXR6Z3CN75SHFJN3GFDQTLVOX/graph.json","events_json":"https://pith.science/api/pith-number/HUXR6Z3CN75SHFJN3GFDQTLVOX/events.json","paper":"https://pith.science/paper/HUXR6Z3C"},"agent_actions":{"view_html":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX","download_json":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX.json","view_paper":"https://pith.science/paper/HUXR6Z3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.6591&json=true","fetch_graph":"https://pith.science/api/pith-number/HUXR6Z3CN75SHFJN3GFDQTLVOX/graph.json","fetch_events":"https://pith.science/api/pith-number/HUXR6Z3CN75SHFJN3GFDQTLVOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/action/storage_attestation","attest_author":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/action/author_attestation","sign_citation":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/action/citation_signature","submit_replication":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/action/replication_record"}},"created_at":"2026-05-18T02:32:54.753868+00:00","updated_at":"2026-05-18T02:32:54.753868+00:00"}