{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3L3WDCTWLVAK2F35T3XNW34TVP","short_pith_number":"pith:3L3WDCTW","schema_version":"1.0","canonical_sha256":"daf7618a765d40ad177d9eeedb6f93abea3f6dc6f9a8c397c6422752a4c44dc4","source":{"kind":"arxiv","id":"1401.8257","version":3},"attestation_state":"computed","paper":{"title":"Online Clustering of Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Claudio Gentile, Giovanni Zappella, Shuai Li","submitted_at":"2014-01-31T18:49:42Z","abstract_excerpt":"We introduce a novel algorithmic approach to content recommendation based on adaptive clustering of exploration-exploitation (\"bandit\") strategies. We provide a sharp regret analysis of this algorithm in a standard stochastic noise setting, demonstrate its scalability properties, and prove its effectiveness on a number of artificial and real-world datasets. Our experiments show a significant increase in prediction performance over state-of-the-art methods for bandit problems."},"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":"1401.8257","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-31T18:49:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6f18dca9fb9ccf97404694e537b4fcbab1cc8652b13affbd4cfc4251777e7214","abstract_canon_sha256":"048c545ea652795f7f4f4cac296e6bfce0125065fd2385256269a26ffcd6f4e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:22.722459Z","signature_b64":"dE4yZlVehKlIodHkwJVlUWxjBhHEHcl/N5nHzDgSOlPwa+6uRxlCh7wCexC54Lq5faiRNo9sZgI9A3aObXqvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"daf7618a765d40ad177d9eeedb6f93abea3f6dc6f9a8c397c6422752a4c44dc4","last_reissued_at":"2026-05-18T02:50:22.721876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:22.721876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Clustering of Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Claudio Gentile, Giovanni Zappella, Shuai Li","submitted_at":"2014-01-31T18:49:42Z","abstract_excerpt":"We introduce a novel algorithmic approach to content recommendation based on adaptive clustering of exploration-exploitation (\"bandit\") strategies. We provide a sharp regret analysis of this algorithm in a standard stochastic noise setting, demonstrate its scalability properties, and prove its effectiveness on a number of artificial and real-world datasets. Our experiments show a significant increase in prediction performance over state-of-the-art methods for bandit problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8257","kind":"arxiv","version":3},"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":"1401.8257","created_at":"2026-05-18T02:50:22.721947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.8257v3","created_at":"2026-05-18T02:50:22.721947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8257","created_at":"2026-05-18T02:50:22.721947+00:00"},{"alias_kind":"pith_short_12","alias_value":"3L3WDCTWLVAK","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3L3WDCTWLVAK2F35","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3L3WDCTW","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10870","citing_title":"Remember the Decision, Not the Description: A Rate-Distortion Framework for Agent Memory","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP","json":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP.json","graph_json":"https://pith.science/api/pith-number/3L3WDCTWLVAK2F35T3XNW34TVP/graph.json","events_json":"https://pith.science/api/pith-number/3L3WDCTWLVAK2F35T3XNW34TVP/events.json","paper":"https://pith.science/paper/3L3WDCTW"},"agent_actions":{"view_html":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP","download_json":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP.json","view_paper":"https://pith.science/paper/3L3WDCTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.8257&json=true","fetch_graph":"https://pith.science/api/pith-number/3L3WDCTWLVAK2F35T3XNW34TVP/graph.json","fetch_events":"https://pith.science/api/pith-number/3L3WDCTWLVAK2F35T3XNW34TVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP/action/storage_attestation","attest_author":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP/action/author_attestation","sign_citation":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP/action/citation_signature","submit_replication":"https://pith.science/pith/3L3WDCTWLVAK2F35T3XNW34TVP/action/replication_record"}},"created_at":"2026-05-18T02:50:22.721947+00:00","updated_at":"2026-05-18T02:50:22.721947+00:00"}