{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F2ET23DQAA2H4YLXKMMET454MN","short_pith_number":"pith:F2ET23DQ","schema_version":"1.0","canonical_sha256":"2e893d6c7000347e6177531849f3bc637657ec68d8cd6c8b4de093aed3d9059b","source":{"kind":"arxiv","id":"1608.03544","version":2},"attestation_state":"computed","paper":{"title":"On Context-Dependent Clustering of Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandros Karatzoglou, Claudio Gentile, Evans Etrue, Giovanni Zappella, Purushottam Kar, Shuai Li","submitted_at":"2016-08-06T14:13:28Z","abstract_excerpt":"We investigate a novel cluster-of-bandit algorithm CAB for collaborative recommendation tasks that implements the underlying feedback sharing mechanism by estimating the neighborhood of users in a context-dependent manner. CAB makes sharp departures from the state of the art by incorporating collaborative effects into inference as well as learning processes in a manner that seamlessly interleaving explore-exploit tradeoffs and collaborative steps. We prove regret bounds under various assumptions on the data, which exhibit a crisp dependence on the expected number of clusters over the users, a "},"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":"1608.03544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-06T14:13:28Z","cross_cats_sorted":["cs.AI","cs.IR","stat.ML"],"title_canon_sha256":"b5ff58ed92fea0123a7ae0abbdbb72854696ee2e1f207bcf75f13ec153bc9240","abstract_canon_sha256":"6f64a0cbf7e3a6268f994cf9789cc64fb02c81e757f99cb7ca9848d081cb7bee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:58.661777Z","signature_b64":"bafI73xs37csarDJ7Qmt6QzBSiATeleFb9aeVl+/WdTRADXBX9292MYK2eUF5LHVph/Qc0SOcCHYCVjF4ZE1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e893d6c7000347e6177531849f3bc637657ec68d8cd6c8b4de093aed3d9059b","last_reissued_at":"2026-05-18T00:49:58.661104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:58.661104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Context-Dependent Clustering of Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandros Karatzoglou, Claudio Gentile, Evans Etrue, Giovanni Zappella, Purushottam Kar, Shuai Li","submitted_at":"2016-08-06T14:13:28Z","abstract_excerpt":"We investigate a novel cluster-of-bandit algorithm CAB for collaborative recommendation tasks that implements the underlying feedback sharing mechanism by estimating the neighborhood of users in a context-dependent manner. CAB makes sharp departures from the state of the art by incorporating collaborative effects into inference as well as learning processes in a manner that seamlessly interleaving explore-exploit tradeoffs and collaborative steps. We prove regret bounds under various assumptions on the data, which exhibit a crisp dependence on the expected number of clusters over the users, a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03544","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":"1608.03544","created_at":"2026-05-18T00:49:58.661228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03544v2","created_at":"2026-05-18T00:49:58.661228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03544","created_at":"2026-05-18T00:49:58.661228+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2ET23DQAA2H","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2ET23DQAA2H4YLX","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2ET23DQ","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08003","citing_title":"Heterogeneous Multi-agent Multi-armed Bandits on Stochastic Block Models","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN","json":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN.json","graph_json":"https://pith.science/api/pith-number/F2ET23DQAA2H4YLXKMMET454MN/graph.json","events_json":"https://pith.science/api/pith-number/F2ET23DQAA2H4YLXKMMET454MN/events.json","paper":"https://pith.science/paper/F2ET23DQ"},"agent_actions":{"view_html":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN","download_json":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN.json","view_paper":"https://pith.science/paper/F2ET23DQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03544&json=true","fetch_graph":"https://pith.science/api/pith-number/F2ET23DQAA2H4YLXKMMET454MN/graph.json","fetch_events":"https://pith.science/api/pith-number/F2ET23DQAA2H4YLXKMMET454MN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN/action/storage_attestation","attest_author":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN/action/author_attestation","sign_citation":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN/action/citation_signature","submit_replication":"https://pith.science/pith/F2ET23DQAA2H4YLXKMMET454MN/action/replication_record"}},"created_at":"2026-05-18T00:49:58.661228+00:00","updated_at":"2026-05-18T00:49:58.661228+00:00"}