{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CWHA55HCBHAWQIRLG4KMVEEQJW","short_pith_number":"pith:CWHA55HC","schema_version":"1.0","canonical_sha256":"158e0ef4e209c168222b3714ca90904da6633b20ed0f7609fcbf95a313762505","source":{"kind":"arxiv","id":"1905.12370","version":3},"attestation_state":"computed","paper":{"title":"Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chang Li, Maarten de Rijke","submitted_at":"2019-05-29T12:18:51Z","abstract_excerpt":"Non-stationarity appears in many online applications such as web search and advertising. In this paper, we study the online learning to rank problem in a non-stationary environment where user preferences change abruptly at an unknown moment in time. We consider the problem of identifying the K most attractive items and propose cascading non-stationary bandits, an online learning variant of the cascading model, where a user browses a ranked list from top to bottom and clicks on the first attractive item. We propose two algorithms for solving this non-stationary problem: CascadeDUCB and CascadeS"},"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":"1905.12370","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T12:18:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"05febad3d6d98d000d3e4888ecfbbaae9e5a882f302272acbd2fc19ef3977fa2","abstract_canon_sha256":"1f0902f0c4104c268c29386de02da3270062951735426ae83baf56250a6dc3fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:06.529946Z","signature_b64":"B55rQ349lahu1ANCGRS7IeKQSiiWaA3GwaFW9FDTOk89jHkqpba1Gj41r2zhP5RjVnV0dm8LWwHJNiatOAGwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"158e0ef4e209c168222b3714ca90904da6633b20ed0f7609fcbf95a313762505","last_reissued_at":"2026-07-05T00:21:06.529439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:06.529439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chang Li, Maarten de Rijke","submitted_at":"2019-05-29T12:18:51Z","abstract_excerpt":"Non-stationarity appears in many online applications such as web search and advertising. In this paper, we study the online learning to rank problem in a non-stationary environment where user preferences change abruptly at an unknown moment in time. We consider the problem of identifying the K most attractive items and propose cascading non-stationary bandits, an online learning variant of the cascading model, where a user browses a ranked list from top to bottom and clicks on the first attractive item. We propose two algorithms for solving this non-stationary problem: CascadeDUCB and CascadeS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12370","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.12370/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":"1905.12370","created_at":"2026-07-05T00:21:06.529497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12370v3","created_at":"2026-07-05T00:21:06.529497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12370","created_at":"2026-07-05T00:21:06.529497+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWHA55HCBHAW","created_at":"2026-07-05T00:21:06.529497+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWHA55HCBHAWQIRL","created_at":"2026-07-05T00:21:06.529497+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWHA55HC","created_at":"2026-07-05T00:21:06.529497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08077","citing_title":"Cascading Bandits Robust to Adversarial Corruptions","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW","json":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW.json","graph_json":"https://pith.science/api/pith-number/CWHA55HCBHAWQIRLG4KMVEEQJW/graph.json","events_json":"https://pith.science/api/pith-number/CWHA55HCBHAWQIRLG4KMVEEQJW/events.json","paper":"https://pith.science/paper/CWHA55HC"},"agent_actions":{"view_html":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW","download_json":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW.json","view_paper":"https://pith.science/paper/CWHA55HC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12370&json=true","fetch_graph":"https://pith.science/api/pith-number/CWHA55HCBHAWQIRLG4KMVEEQJW/graph.json","fetch_events":"https://pith.science/api/pith-number/CWHA55HCBHAWQIRLG4KMVEEQJW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW/action/storage_attestation","attest_author":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW/action/author_attestation","sign_citation":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW/action/citation_signature","submit_replication":"https://pith.science/pith/CWHA55HCBHAWQIRLG4KMVEEQJW/action/replication_record"}},"created_at":"2026-07-05T00:21:06.529497+00:00","updated_at":"2026-07-05T00:21:06.529497+00:00"}