{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J4SVLS7WNE3VDS2OSNZD7N3ZSK","short_pith_number":"pith:J4SVLS7W","canonical_record":{"source":{"id":"1502.02763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-10T02:56:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"61f57bb24d80f45f07cb71d97b700c928f86b702167eabda4c11c5a24ed0801a","abstract_canon_sha256":"f21100ea547eb82dd9a9af118158cc5843ae4585af87f688dcfe853530e450cf"},"schema_version":"1.0"},"canonical_sha256":"4f2555cbf6693751cb4e93723fb7799283a20bee788ad7a8c513bc14892716ed","source":{"kind":"arxiv","id":"1502.02763","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02763","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02763v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02763","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"J4SVLS7WNE3V","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J4SVLS7WNE3VDS2O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J4SVLS7W","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J4SVLS7WNE3VDS2OSNZD7N3ZSK","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02763","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-10T02:56:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"61f57bb24d80f45f07cb71d97b700c928f86b702167eabda4c11c5a24ed0801a","abstract_canon_sha256":"f21100ea547eb82dd9a9af118158cc5843ae4585af87f688dcfe853530e450cf"},"schema_version":"1.0"},"canonical_sha256":"4f2555cbf6693751cb4e93723fb7799283a20bee788ad7a8c513bc14892716ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.474345Z","signature_b64":"I/OgDrbr1dUZVS5C4lqls131DQqMuWLCTwEA2aZL0O31BoiiczLG/wC4J8OL5/kIQuViRPQv60aW6/qHC1hHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f2555cbf6693751cb4e93723fb7799283a20bee788ad7a8c513bc14892716ed","last_reissued_at":"2026-05-18T02:07:26.473887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.473887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02763","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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S236HU/RImXByfpjt2IlSk43ddZc4rbIfGkPOTJwVAHDHwUcHRbjxbRfbL3Cs50gDV1Z+Z++yCvYhyk4ErRzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:26:43.572218Z"},"content_sha256":"70e65706934d6db91b4027c696607f0e18784497deb7b7f08b8a86db21a3fd6c","schema_version":"1.0","event_id":"sha256:70e65706934d6db91b4027c696607f0e18784497deb7b7f08b8a86db21a3fd6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J4SVLS7WNE3VDS2OSNZD7N3ZSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cascading Bandits: Learning to Rank in the Cascade Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Azin Ashkan, Branislav Kveton, Csaba Szepesvari, Zheng Wen","submitted_at":"2015-02-10T02:56:04Z","abstract_excerpt":"A search engine usually outputs a list of $K$ web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we propose cascading bandits, a learning variant of the cascade model where the objective is to identify $K$ most attractive items. We formulate our problem as a stochastic combinatorial partial monitoring problem. We propose two algorithms for solving it, CascadeUCB1 and CascadeKL-UCB. We also prove gap-dependent upper bounds on the regret of these algorithms a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02763","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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkQVGQQ9qfiK0VzKDGuJoJYZvma3ta/YM2PVduI56NLuLpmiYnaOjGbvnU1/9hPd5O/tfZtGvPFxjxIn1OJ5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:26:43.572607Z"},"content_sha256":"a2ee41952041006dc43a3c27cffa20d1ffedcee8024c58f283b6c2c7d437dc70","schema_version":"1.0","event_id":"sha256:a2ee41952041006dc43a3c27cffa20d1ffedcee8024c58f283b6c2c7d437dc70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4SVLS7WNE3VDS2OSNZD7N3ZSK/bundle.json","state_url":"https://pith.science/pith/J4SVLS7WNE3VDS2OSNZD7N3ZSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4SVLS7WNE3VDS2OSNZD7N3ZSK/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-27T04:26:43Z","links":{"resolver":"https://pith.science/pith/J4SVLS7WNE3VDS2OSNZD7N3ZSK","bundle":"https://pith.science/pith/J4SVLS7WNE3VDS2OSNZD7N3ZSK/bundle.json","state":"https://pith.science/pith/J4SVLS7WNE3VDS2OSNZD7N3ZSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4SVLS7WNE3VDS2OSNZD7N3ZSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J4SVLS7WNE3VDS2OSNZD7N3ZSK","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":"f21100ea547eb82dd9a9af118158cc5843ae4585af87f688dcfe853530e450cf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-10T02:56:04Z","title_canon_sha256":"61f57bb24d80f45f07cb71d97b700c928f86b702167eabda4c11c5a24ed0801a"},"schema_version":"1.0","source":{"id":"1502.02763","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02763","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02763v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02763","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"J4SVLS7WNE3V","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J4SVLS7WNE3VDS2O","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J4SVLS7W","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:a2ee41952041006dc43a3c27cffa20d1ffedcee8024c58f283b6c2c7d437dc70","target":"graph","created_at":"2026-05-18T02:07:26Z","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":"A search engine usually outputs a list of $K$ web pages. The user examines this list, from the first web page to the last, and chooses the first attractive page. This model of user behavior is known as the cascade model. In this paper, we propose cascading bandits, a learning variant of the cascade model where the objective is to identify $K$ most attractive items. We formulate our problem as a stochastic combinatorial partial monitoring problem. We propose two algorithms for solving it, CascadeUCB1 and CascadeKL-UCB. We also prove gap-dependent upper bounds on the regret of these algorithms a","authors_text":"Azin Ashkan, Branislav Kveton, Csaba Szepesvari, Zheng Wen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-10T02:56:04Z","title":"Cascading Bandits: Learning to Rank in the Cascade Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02763","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:70e65706934d6db91b4027c696607f0e18784497deb7b7f08b8a86db21a3fd6c","target":"record","created_at":"2026-05-18T02:07:26Z","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":"f21100ea547eb82dd9a9af118158cc5843ae4585af87f688dcfe853530e450cf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-02-10T02:56:04Z","title_canon_sha256":"61f57bb24d80f45f07cb71d97b700c928f86b702167eabda4c11c5a24ed0801a"},"schema_version":"1.0","source":{"id":"1502.02763","kind":"arxiv","version":2}},"canonical_sha256":"4f2555cbf6693751cb4e93723fb7799283a20bee788ad7a8c513bc14892716ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f2555cbf6693751cb4e93723fb7799283a20bee788ad7a8c513bc14892716ed","first_computed_at":"2026-05-18T02:07:26.473887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:26.473887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I/OgDrbr1dUZVS5C4lqls131DQqMuWLCTwEA2aZL0O31BoiiczLG/wC4J8OL5/kIQuViRPQv60aW6/qHC1hHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:26.474345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02763","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70e65706934d6db91b4027c696607f0e18784497deb7b7f08b8a86db21a3fd6c","sha256:a2ee41952041006dc43a3c27cffa20d1ffedcee8024c58f283b6c2c7d437dc70"],"state_sha256":"7fc9145874a37cad0716261ff5ed87256c571a7fad26a251787861dacd32aa1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xd60fXiGVxBZNVFelom5wt3ZUvdzAb5tFhqWkovHDJz5YReffk7lTf6eCC+uXlp0OlfnKWxknlfnHo8xgKjdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:26:43.575022Z","bundle_sha256":"043f28042bf8c081cdf9f851a7a1686024b0778f1f7cc2ab73bb4f02a7c4b857"}}