{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:34OGPNKPZ4LEJKH2NRSOQWQJ2T","short_pith_number":"pith:34OGPNKP","schema_version":"1.0","canonical_sha256":"df1c67b54fcf1644a8fa6c64e85a09d4d31df83406b451faa054bb09bde7abf7","source":{"kind":"arxiv","id":"1711.08594","version":2},"attestation_state":"computed","paper":{"title":"Online Clustering of Contextual Cascading Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shuai Li","submitted_at":"2017-11-23T07:00:22Z","abstract_excerpt":"We consider a new setting of online clustering of contextual cascading bandits, an online learning problem where the underlying cluster structure over users is unknown and needs to be learned from a random prefix feedback. More precisely, a learning agent recommends an ordered list of items to a user, who checks the list and stops at the first satisfactory item, if any. We propose an algorithm of CLUB-cascade for this setting and prove a $T$-step regret bound of order $\\tilde{O}(\\sqrt{T})$. Previous work corresponds to the degenerate case of only one cluster, and our general regret bound in th"},"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":"1711.08594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-23T07:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"5793ac8d0082ba1d89c81f9a9b646c85a83b37f47a5a4dbdbf2b357c5fcecf56","abstract_canon_sha256":"9a6755de751b6989f31bcfded5ca961e93d308f6f39c0fb74c301af2b1a2a2f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:01.142637Z","signature_b64":"5GJZS32bg00ks9/SyKwEZ98DJ2S4Et4b4pgMGmKw/7sN3vIVPPSisMGlxDYsMVG+bSK2iM8GiahXqbUbOSPoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df1c67b54fcf1644a8fa6c64e85a09d4d31df83406b451faa054bb09bde7abf7","last_reissued_at":"2026-05-17T23:55:01.142206Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:01.142206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Clustering of Contextual Cascading Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Shuai Li","submitted_at":"2017-11-23T07:00:22Z","abstract_excerpt":"We consider a new setting of online clustering of contextual cascading bandits, an online learning problem where the underlying cluster structure over users is unknown and needs to be learned from a random prefix feedback. More precisely, a learning agent recommends an ordered list of items to a user, who checks the list and stops at the first satisfactory item, if any. We propose an algorithm of CLUB-cascade for this setting and prove a $T$-step regret bound of order $\\tilde{O}(\\sqrt{T})$. Previous work corresponds to the degenerate case of only one cluster, and our general regret bound in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08594","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":"1711.08594","created_at":"2026-05-17T23:55:01.142269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08594v2","created_at":"2026-05-17T23:55:01.142269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08594","created_at":"2026-05-17T23:55:01.142269+00:00"},{"alias_kind":"pith_short_12","alias_value":"34OGPNKPZ4LE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"34OGPNKPZ4LEJKH2","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"34OGPNKP","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T","json":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T.json","graph_json":"https://pith.science/api/pith-number/34OGPNKPZ4LEJKH2NRSOQWQJ2T/graph.json","events_json":"https://pith.science/api/pith-number/34OGPNKPZ4LEJKH2NRSOQWQJ2T/events.json","paper":"https://pith.science/paper/34OGPNKP"},"agent_actions":{"view_html":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T","download_json":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T.json","view_paper":"https://pith.science/paper/34OGPNKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08594&json=true","fetch_graph":"https://pith.science/api/pith-number/34OGPNKPZ4LEJKH2NRSOQWQJ2T/graph.json","fetch_events":"https://pith.science/api/pith-number/34OGPNKPZ4LEJKH2NRSOQWQJ2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/action/storage_attestation","attest_author":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/action/author_attestation","sign_citation":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/action/citation_signature","submit_replication":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/action/replication_record"}},"created_at":"2026-05-17T23:55:01.142269+00:00","updated_at":"2026-05-17T23:55:01.142269+00:00"}