{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B7F34ACDYDMVD2U5QM7LFJNXU5","short_pith_number":"pith:B7F34ACD","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"},"canonical_sha256":"0fcbbe0043c0d951ea9d833eb2a5b7a74370e3b4102dce1335481f4d808c8a7f","source":{"kind":"arxiv","id":"1507.05371","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05371","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05371v2","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05371","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"pith_short_12","alias_value":"B7F34ACDYDMV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B7F34ACDYDMVD2U5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B7F34ACD","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B7F34ACDYDMVD2U5QM7LFJNXU5","target":"record","payload":{"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"},"canonical_sha256":"0fcbbe0043c0d951ea9d833eb2a5b7a74370e3b4102dce1335481f4d808c8a7f","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"},"source_kind":"arxiv","source_id":"1507.05371","source_version":2,"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-18T01:23:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcsyfNMdfHVzSchLiWx3gFGXM7VkOIdirfDOZnnyzEZ8PKWfxYXMQ0ndj48fOR44FDlOk6EwZqjpQM2UO1jzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:04:39.298295Z"},"content_sha256":"89a4087a0a315fd185faa3f1d23805f42d56daaef152ac7efbcce5801136775d","schema_version":"1.0","event_id":"sha256:89a4087a0a315fd185faa3f1d23805f42d56daaef152ac7efbcce5801136775d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B7F34ACDYDMVD2U5QM7LFJNXU5","target":"graph","payload":{"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"},"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-18T01:23:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ebntbv3fXD6LxOS8GVn+5lJGV+arJHdXoDV73kLFXK2Bh2OIL0s4DtnTeAW9vjZkKCDjMLz4ljTn8V9zCPUVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T21:04:39.298953Z"},"content_sha256":"a18c7688e0c8e4192dee72af9d632c6466f3d865bbec44ecfcfae9e66d065b74","schema_version":"1.0","event_id":"sha256:a18c7688e0c8e4192dee72af9d632c6466f3d865bbec44ecfcfae9e66d065b74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/bundle.json","state_url":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/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-18T21:04:39Z","links":{"resolver":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5","bundle":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/bundle.json","state":"https://pith.science/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7F34ACDYDMVD2U5QM7LFJNXU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B7F34ACDYDMVD2U5QM7LFJNXU5","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":"289a09d9be04f1e5ab5db630458b5e5f0aee1b23c0aa200ba0ef7cde31403b0b","cross_cats_sorted":["cs.IR","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-20T02:45:01Z","title_canon_sha256":"a746dcaa525f117b055f95953d5ac48790eb590f31fdac8cb83ed28eabb7d6d1"},"schema_version":"1.0","source":{"id":"1507.05371","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05371","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05371v2","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05371","created_at":"2026-05-18T01:23:12Z"},{"alias_kind":"pith_short_12","alias_value":"B7F34ACDYDMV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B7F34ACDYDMVD2U5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B7F34ACD","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:a18c7688e0c8e4192dee72af9d632c6466f3d865bbec44ecfcfae9e66d065b74","target":"graph","created_at":"2026-05-18T01:23:12Z","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":"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","authors_text":"Devavrat Shah, Guy Bresler, Luis F. Voloch","cross_cats":["cs.IR","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-20T02:45:01Z","title":"Regret Guarantees for Item-Item Collaborative Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05371","kind":"arxiv","version":2},"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:89a4087a0a315fd185faa3f1d23805f42d56daaef152ac7efbcce5801136775d","target":"record","created_at":"2026-05-18T01:23:12Z","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":"289a09d9be04f1e5ab5db630458b5e5f0aee1b23c0aa200ba0ef7cde31403b0b","cross_cats_sorted":["cs.IR","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-20T02:45:01Z","title_canon_sha256":"a746dcaa525f117b055f95953d5ac48790eb590f31fdac8cb83ed28eabb7d6d1"},"schema_version":"1.0","source":{"id":"1507.05371","kind":"arxiv","version":2}},"canonical_sha256":"0fcbbe0043c0d951ea9d833eb2a5b7a74370e3b4102dce1335481f4d808c8a7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fcbbe0043c0d951ea9d833eb2a5b7a74370e3b4102dce1335481f4d808c8a7f","first_computed_at":"2026-05-18T01:23:12.080686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:12.080686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iKc0HgmeP/iCJDsUbXjTSjjQFBiaf/Ca+F91QywT+UOPr+tpYr8UBH6NYp+lF8wzaXOWX+pw5Rh4dDgPmG9bAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:12.081125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05371","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89a4087a0a315fd185faa3f1d23805f42d56daaef152ac7efbcce5801136775d","sha256:a18c7688e0c8e4192dee72af9d632c6466f3d865bbec44ecfcfae9e66d065b74"],"state_sha256":"8135ba8adcb72e4fd6c9bb61c603d9f4dba1323ef328ece70f1f6e07a370f372"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYqwTZ7DsBBcczjptqdp5KL5aIRl7uwl+Tff6sdWYonkGqPULNqzreHOkTKzj3tUa5vHXrc/5JEUrZ2emOwsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T21:04:39.300483Z","bundle_sha256":"6bf0ea4f1fa264934bd37ec7d20a9961766a0a469ff9d9e298533fedde577d0f"}}