{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:34OGPNKPZ4LEJKH2NRSOQWQJ2T","short_pith_number":"pith:34OGPNKP","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"},"canonical_sha256":"df1c67b54fcf1644a8fa6c64e85a09d4d31df83406b451faa054bb09bde7abf7","source":{"kind":"arxiv","id":"1711.08594","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08594","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08594v2","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08594","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"34OGPNKPZ4LE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"34OGPNKPZ4LEJKH2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"34OGPNKP","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:34OGPNKPZ4LEJKH2NRSOQWQJ2T","target":"record","payload":{"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"},"canonical_sha256":"df1c67b54fcf1644a8fa6c64e85a09d4d31df83406b451faa054bb09bde7abf7","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"},"source_kind":"arxiv","source_id":"1711.08594","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-17T23:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1l7/End/zjmI9Qor4pUeQ08o1+UkXQFWod9ENNu1CltgdAZONjkI04vzGUBar7htB7/6ORwSktBgsIBl3YuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:13:21.220493Z"},"content_sha256":"495493ae931b1ba2a4ae1b1a326b5bd06b4da8d2d50bdb8d500fd72e1339c6a1","schema_version":"1.0","event_id":"sha256:495493ae931b1ba2a4ae1b1a326b5bd06b4da8d2d50bdb8d500fd72e1339c6a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:34OGPNKPZ4LEJKH2NRSOQWQJ2T","target":"graph","payload":{"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"},"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-17T23:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INTMG9zmA/uABQbowq67QqGnAJjHyYARgId8RdncbcyRWgQDjhEMmawX+lZFL6g+6Hlt28Vh46VtRVcqgWHOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:13:21.221351Z"},"content_sha256":"302754f58f2a6d85626c9620b12eed20d59b7795c22f9b8fa72b09bf50bf98e4","schema_version":"1.0","event_id":"sha256:302754f58f2a6d85626c9620b12eed20d59b7795c22f9b8fa72b09bf50bf98e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/bundle.json","state_url":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/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-31T12:13:21Z","links":{"resolver":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T","bundle":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/bundle.json","state":"https://pith.science/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34OGPNKPZ4LEJKH2NRSOQWQJ2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:34OGPNKPZ4LEJKH2NRSOQWQJ2T","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":"9a6755de751b6989f31bcfded5ca961e93d308f6f39c0fb74c301af2b1a2a2f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-23T07:00:22Z","title_canon_sha256":"5793ac8d0082ba1d89c81f9a9b646c85a83b37f47a5a4dbdbf2b357c5fcecf56"},"schema_version":"1.0","source":{"id":"1711.08594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08594","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08594v2","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08594","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"34OGPNKPZ4LE","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"34OGPNKPZ4LEJKH2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"34OGPNKP","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:302754f58f2a6d85626c9620b12eed20d59b7795c22f9b8fa72b09bf50bf98e4","target":"graph","created_at":"2026-05-17T23:55:01Z","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":"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","authors_text":"Shuai Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-23T07:00:22Z","title":"Online Clustering of Contextual Cascading Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08594","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:495493ae931b1ba2a4ae1b1a326b5bd06b4da8d2d50bdb8d500fd72e1339c6a1","target":"record","created_at":"2026-05-17T23:55:01Z","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":"9a6755de751b6989f31bcfded5ca961e93d308f6f39c0fb74c301af2b1a2a2f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-23T07:00:22Z","title_canon_sha256":"5793ac8d0082ba1d89c81f9a9b646c85a83b37f47a5a4dbdbf2b357c5fcecf56"},"schema_version":"1.0","source":{"id":"1711.08594","kind":"arxiv","version":2}},"canonical_sha256":"df1c67b54fcf1644a8fa6c64e85a09d4d31df83406b451faa054bb09bde7abf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df1c67b54fcf1644a8fa6c64e85a09d4d31df83406b451faa054bb09bde7abf7","first_computed_at":"2026-05-17T23:55:01.142206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:01.142206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5GJZS32bg00ks9/SyKwEZ98DJ2S4Et4b4pgMGmKw/7sN3vIVPPSisMGlxDYsMVG+bSK2iM8GiahXqbUbOSPoCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:01.142637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:495493ae931b1ba2a4ae1b1a326b5bd06b4da8d2d50bdb8d500fd72e1339c6a1","sha256:302754f58f2a6d85626c9620b12eed20d59b7795c22f9b8fa72b09bf50bf98e4"],"state_sha256":"7a372884f947e6de96667465a1e08978ce0eb626e825f9a1bc023b678ebf1ea2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvPEzFZ4OQHqBHYFHnuLZ/dETyBrpJQuPHfGRB/bozNrYrMjMuD7T0HGW7WpE7IR87pd4gDNPHOaXnoIah0QAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:13:21.225655Z","bundle_sha256":"8c68026cc8b247fcd7f0615bbd3dd91fe4af187a1e598d767a52a5b8427b86f9"}}