{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HUXR6Z3CN75SHFJN3GFDQTLVOX","short_pith_number":"pith:HUXR6Z3C","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"},"canonical_sha256":"3d2f1f67626ffb23952dd98a384d7575f34303f483154713a1bf7e02b794dc6a","source":{"kind":"arxiv","id":"1411.6591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6591","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6591v1","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6591","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"HUXR6Z3CN75S","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HUXR6Z3CN75SHFJN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HUXR6Z3C","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HUXR6Z3CN75SHFJN3GFDQTLVOX","target":"record","payload":{"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"},"canonical_sha256":"3d2f1f67626ffb23952dd98a384d7575f34303f483154713a1bf7e02b794dc6a","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"},"source_kind":"arxiv","source_id":"1411.6591","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIObUZ/jD3M3f5VKkJncSz4t2YnH1bCtg+YcUQPr7mp/J/CvdwM1qR3Che/ADqMrcloAiE5ahyo8FLJuFfFfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:57.744243Z"},"content_sha256":"ede3a5a25717a6544975c7e1178e2af1002048fdca1bc9bfcc36ad62bdab4ff0","schema_version":"1.0","event_id":"sha256:ede3a5a25717a6544975c7e1178e2af1002048fdca1bc9bfcc36ad62bdab4ff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HUXR6Z3CN75SHFJN3GFDQTLVOX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZ8HEjQ+Jw/YqEqfcuACkrWXhFRC5QSvujHIYKt5fesmVnc/WQ4kjwxZ/wp/TeWmh7Tbm8TFWKyRQSoXLm/DBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:53:57.744960Z"},"content_sha256":"780e02f9186ebf1f6a3533b16e72fe920497d011d45e44ec82bd02d744de5e6f","schema_version":"1.0","event_id":"sha256:780e02f9186ebf1f6a3533b16e72fe920497d011d45e44ec82bd02d744de5e6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/bundle.json","state_url":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T17:53:57Z","links":{"resolver":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX","bundle":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/bundle.json","state":"https://pith.science/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUXR6Z3CN75SHFJN3GFDQTLVOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HUXR6Z3CN75SHFJN3GFDQTLVOX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a02f4b0e1feab5741f237c43f4ca6234c99c527487f299d3626a25993c6b8416","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-31T19:59:59Z","title_canon_sha256":"7b5d6a608f16d2b8e401a70e487a6a53b0701f569bd1d71fe869f03623618b32"},"schema_version":"1.0","source":{"id":"1411.6591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6591","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6591v1","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6591","created_at":"2026-05-18T02:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"HUXR6Z3CN75S","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HUXR6Z3CN75SHFJN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HUXR6Z3C","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:780e02f9186ebf1f6a3533b16e72fe920497d011d45e44ec82bd02d744de5e6f","target":"graph","created_at":"2026-05-18T02:32:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Devavrat Shah, George H. Chen, Guy Bresler","cross_cats":["cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-31T19:59:59Z","title":"A Latent Source Model for Online Collaborative Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6591","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ede3a5a25717a6544975c7e1178e2af1002048fdca1bc9bfcc36ad62bdab4ff0","target":"record","created_at":"2026-05-18T02:32:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a02f4b0e1feab5741f237c43f4ca6234c99c527487f299d3626a25993c6b8416","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-31T19:59:59Z","title_canon_sha256":"7b5d6a608f16d2b8e401a70e487a6a53b0701f569bd1d71fe869f03623618b32"},"schema_version":"1.0","source":{"id":"1411.6591","kind":"arxiv","version":1}},"canonical_sha256":"3d2f1f67626ffb23952dd98a384d7575f34303f483154713a1bf7e02b794dc6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d2f1f67626ffb23952dd98a384d7575f34303f483154713a1bf7e02b794dc6a","first_computed_at":"2026-05-18T02:32:54.753819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:54.753819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nq/x7qQLKpFkpQgtJ28zwoFSA28cMVOoX/4+m8AyT1KZacY4vzr6wwUPT6FKoY9kP+csUKfNrgEuOklYR1GdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:54.754179Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ede3a5a25717a6544975c7e1178e2af1002048fdca1bc9bfcc36ad62bdab4ff0","sha256:780e02f9186ebf1f6a3533b16e72fe920497d011d45e44ec82bd02d744de5e6f"],"state_sha256":"b58e26961d35e028498d24f5a2241599154f06cec3251dce61de051f8fc9ac76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LN1CItBi81u3Q1+JfBJSP7uDAzHLgboWPymlGNj70YOMbjOS3PvDD5z1Po41FAbNv+/IoszlZY5/FzQ+xfugDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:53:57.748570Z","bundle_sha256":"78593b4055d657b8db750fa33a335a6a918be3e48f72814d6cc650023c3fdf8a"}}