{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JJK3GND2C7WG4GHKGZ4AMESUPP","short_pith_number":"pith:JJK3GND2","schema_version":"1.0","canonical_sha256":"4a55b3347a17ec6e18ea36780612547bfb4777a7912a9af02c6cb4969714f651","source":{"kind":"arxiv","id":"2501.00891","version":1},"attestation_state":"computed","paper":{"title":"Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"John C.S. Lui, Maoli Liu, Xiangxiang Dai, Zhuohua Li","submitted_at":"2025-01-01T16:38:29Z","abstract_excerpt":"The contextual multi-armed bandit (MAB) problem is crucial in sequential decision-making. A line of research, known as online clustering of bandits, extends contextual MAB by grouping similar users into clusters, utilizing shared features to improve learning efficiency. However, existing algorithms, which rely on the upper confidence bound (UCB) strategy, struggle to gather adequate statistical information to accurately identify unknown user clusters. As a result, their theoretical analyses require several strong assumptions about the \"diversity\" of contexts generated by the environment, leadi"},"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":"2501.00891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-01T16:38:29Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"633740f205c0a87215ea8f6ba03c6e1bfaa42fc7945c110cdc4216a53fa0f0a9","abstract_canon_sha256":"b58c3fa32fd3f352d0e3da71bc148e5a0d4bef15a4a2ce34cf567cc5c6858907"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:11.696005Z","signature_b64":"p9Bl6+wjk3Bw4G1VYyHkoveyotlLLzc1K6W1TFzeoP+10rm0oSNpyyCvuTgl/D17iXqaugIrY9flCegbjJUhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a55b3347a17ec6e18ea36780612547bfb4777a7912a9af02c6cb4969714f651","last_reissued_at":"2026-07-05T09:56:11.695516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:11.695516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"John C.S. Lui, Maoli Liu, Xiangxiang Dai, Zhuohua Li","submitted_at":"2025-01-01T16:38:29Z","abstract_excerpt":"The contextual multi-armed bandit (MAB) problem is crucial in sequential decision-making. A line of research, known as online clustering of bandits, extends contextual MAB by grouping similar users into clusters, utilizing shared features to improve learning efficiency. However, existing algorithms, which rely on the upper confidence bound (UCB) strategy, struggle to gather adequate statistical information to accurately identify unknown user clusters. As a result, their theoretical analyses require several strong assumptions about the \"diversity\" of contexts generated by the environment, leadi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00891","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.00891/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.00891","created_at":"2026-07-05T09:56:11.695573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.00891v1","created_at":"2026-07-05T09:56:11.695573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00891","created_at":"2026-07-05T09:56:11.695573+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJK3GND2C7WG","created_at":"2026-07-05T09:56:11.695573+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJK3GND2C7WG4GHK","created_at":"2026-07-05T09:56:11.695573+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJK3GND2","created_at":"2026-07-05T09:56:11.695573+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":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP","json":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP.json","graph_json":"https://pith.science/api/pith-number/JJK3GND2C7WG4GHKGZ4AMESUPP/graph.json","events_json":"https://pith.science/api/pith-number/JJK3GND2C7WG4GHKGZ4AMESUPP/events.json","paper":"https://pith.science/paper/JJK3GND2"},"agent_actions":{"view_html":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP","download_json":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP.json","view_paper":"https://pith.science/paper/JJK3GND2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.00891&json=true","fetch_graph":"https://pith.science/api/pith-number/JJK3GND2C7WG4GHKGZ4AMESUPP/graph.json","fetch_events":"https://pith.science/api/pith-number/JJK3GND2C7WG4GHKGZ4AMESUPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP/action/storage_attestation","attest_author":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP/action/author_attestation","sign_citation":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP/action/citation_signature","submit_replication":"https://pith.science/pith/JJK3GND2C7WG4GHKGZ4AMESUPP/action/replication_record"}},"created_at":"2026-07-05T09:56:11.695573+00:00","updated_at":"2026-07-05T09:56:11.695573+00:00"}