Paper Citation Record · LEDGER

Cascading Bandits Robust to Adversarial Corruptions

As of 19 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2502.08077.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2502.08077 v1

Coverage vector

measured 38 of 38 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T10:58:56.340014Z

measured 38 of 38 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

38 of 38 outbound references displayed

verified exact6
verified fuzzy29
unresolved3
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 80aa7707-3718-4258-a07d-972cbeccf56f · outbound

This paper cites Cascading bandits: Learning to rank in the cascade model.

Cascading Bandits Robust to Adversarial Corruptions Cascading bandits: Learning to rank in the cascade model

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:57.042395Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 5785cd4f-2419-4ce9-abec-a1a78864f57a · outbound

This paper cites Learning to rank: Regret lower bounds and efficient algorithms.

Cascading Bandits Robust to Adversarial Corruptions Learning to rank: Regret lower bounds and efficient algorithms

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:57.023408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c5d71a73-f357-458e-9710-eea883b05452 · outbound

This paper cites Learning to rank: from pairwise approach to listwise approach.

Cascading Bandits Robust to Adversarial Corruptions Learning to rank: from pairwise approach to listwise approach

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-08T10:58:56.155322Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14ebdde8-965a-45d3-8c41-c31b5b61003b · outbound

This paper cites Learning to rank.

Cascading Bandits Robust to Adversarial Corruptions Learning to rank

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.994567Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c4b75587-20dc-4c8e-aac7-6dba5477aef7 · outbound

This paper cites Toprank: A practical algorithm for online stochastic ranking.

Cascading Bandits Robust to Adversarial Corruptions Toprank: A practical algorithm for online stochastic ranking

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.977845Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 30a7841a-2ef7-4119-a534-fb50c3a28f73 · outbound

This paper cites Thompson sampling algorithms for cascading bandits.

Cascading Bandits Robust to Adversarial Corruptions Thompson sampling algorithms for cascading bandits

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.961231Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 24e5b743-1138-430f-af9a-9c95d90e4520 · outbound

This paper cites An experimental comparison of click position-bias models.

Cascading Bandits Robust to Adversarial Corruptions An experimental comparison of click position-bias models

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.944514Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e9329575-b90d-489b-95d0-e9930fa5ae86 · outbound

This paper cites Combinatorial cascading bandits.

Cascading Bandits Robust to Adversarial Corruptions Combinatorial cascading bandits

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.927842Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation b9c713a0-7152-47c1-abf1-e59e7f86168c · outbound

This paper cites Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model.

Cascading Bandits Robust to Adversarial Corruptions Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-08-08T10:58:56.530349Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation d821a28c-9a29-49ae-ba50-df701f8609cf · outbound

This paper cites Stochastic bandits robust to adversarial corruptions.

Cascading Bandits Robust to Adversarial Corruptions Stochastic bandits robust to adversarial corruptions

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.911661Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a70ab690-56ee-413e-b99f-c4bcf711a0f0 · outbound

This paper cites Better algorithms for stochastic bandits with adversarial corruptions.

Cascading Bandits Robust to Adversarial Corruptions Better algorithms for stochastic bandits with adversarial corruptions

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.894933Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 146a4b0f-5bb9-4d9a-982c-a354d1cd1c58 · outbound

This paper cites Learning diverse rankings with multi-armed bandits.

Cascading Bandits Robust to Adversarial Corruptions Learning diverse rankings with multi-armed bandits

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.879011Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 91069773-46f2-41ee-a0c2-01d832503e39 · outbound

This paper cites Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions.

Cascading Bandits Robust to Adversarial Corruptions Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions

Reference 13

Resolution: verified exact; local_arxiv, observed 2026-08-08T10:58:56.506131Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 262967b9-7044-41aa-9e86-c6d14f7ec714 · outbound

This paper cites Stochastic graphical bandits with adversarial corruptions.

Cascading Bandits Robust to Adversarial Corruptions Stochastic graphical bandits with adversarial corruptions

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.863018Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 1ca843c5-d0aa-44a6-b5a5-008eb93c1a5e · outbound

This paper cites Robust stochastic linear contextual bandits under adversarial attacks.

Cascading Bandits Robust to Adversarial Corruptions Robust stochastic linear contextual bandits under adversarial attacks

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.846559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c3a64317-be02-432e-8c1e-7727faac7d4b · outbound

This paper cites Online corrupted user detection and regret minimization.

Cascading Bandits Robust to Adversarial Corruptions Online corrupted user detection and regret minimization

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.829646Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 198e89d4-fae3-471c-9204-4ea8fe790fbd · outbound

This paper cites Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems.

Cascading Bandits Robust to Adversarial Corruptions Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.812284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a234b626-81dc-4142-83b4-a47b5f793ac3 · outbound

This paper cites Online learning to rank in stochastic click models.

Cascading Bandits Robust to Adversarial Corruptions Online learning to rank in stochastic click models

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.794793Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f1351905-46c8-41a2-b404-985f7c585de8 · outbound

This paper cites Minimax Regret for Cascading Bandits.

Cascading Bandits Robust to Adversarial Corruptions Minimax Regret for Cascading Bandits

Reference 19

Resolution: verified exact; local_arxiv, observed 2026-08-08T10:58:56.481123Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 97fdb2f1-5cbc-43f3-a3d9-1c85c4b39646 · outbound

This paper cites Contextual combinatorial cascading bandits.

Cascading Bandits Robust to Adversarial Corruptions Contextual combinatorial cascading bandits

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.778427Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation a32c7b01-0e54-49a3-a9bf-677b1a2f8404 · outbound

This paper cites Online clustering of contextual cascading bandits.

Cascading Bandits Robust to Adversarial Corruptions Online clustering of contextual cascading bandits

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.761052Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 43a76b9a-3682-4bf0-ac21-92102c70b454 · outbound

This paper cites Cascading Bandits for Large-Scale Recommendation Problems.

Cascading Bandits Robust to Adversarial Corruptions Cascading Bandits for Large-Scale Recommendation Problems

Reference 22

Resolution: verified exact; local_arxiv, observed 2026-08-08T10:58:56.455961Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 2365a776-deea-4059-a876-346649be69ee · outbound

This paper cites Online learning to rank with features.

Cascading Bandits Robust to Adversarial Corruptions Online learning to rank with features

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.745336Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c77db8db-0ec5-40eb-ab35-1fcd86daa8b0 · outbound

This paper cites Cascading hybrid bandits: Online learning to rank for relevance and diversity.

Cascading Bandits Robust to Adversarial Corruptions Cascading hybrid bandits: Online learning to rank for relevance and diversity

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.728177Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 40904f46-ad30-4ae0-9f61-c0e8dc8fa505 · outbound

This paper cites Corruption-tolerant bandit learning.

Cascading Bandits Robust to Adversarial Corruptions Corruption-tolerant bandit learning

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.710496Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation bad41073-ba49-4cdd-be90-008cc3f064c4 · outbound

This paper cites Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits.

Cascading Bandits Robust to Adversarial Corruptions Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.692785Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation c1300756-0420-4062-b210-eebe5db63daf · outbound

This paper cites Stochastic dueling bandits with adversarial corruption.

Cascading Bandits Robust to Adversarial Corruptions Stochastic dueling bandits with adversarial corruption

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.676599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation ebd83de8-3810-4c97-8860-a377229475c3 · outbound

This paper cites Adversarial bandits with corruptions: Regret lower bound and no-regret algorithm.

Cascading Bandits Robust to Adversarial Corruptions Adversarial bandits with corruptions: Regret lower bound and no-regret algorithm

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.660761Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 863afa77-fb2c-4fb9-aebe-1eab1e641f85 · outbound

This paper cites Stochastic Linear Optimization with Adversarial Corruption.

Cascading Bandits Robust to Adversarial Corruptions Stochastic Linear Optimization with Adversarial Corruption

Reference 29

Resolution: verified exact; local_arxiv, observed 2026-08-08T10:58:56.432079Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 70fdc965-5861-4d41-b4e6-5b67fd48e066 · outbound

This paper cites Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions.

Cascading Bandits Robust to Adversarial Corruptions Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-08T10:58:56.297484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd6be992-81e8-4e2f-9415-9ed1b875cea9 · outbound

This paper cites Online learning and detecting corrupted users for conversational recommendation systems.

Cascading Bandits Robust to Adversarial Corruptions Online learning and detecting corrupted users for conversational recommendation systems

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.644442Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 7b7cde50-60de-4076-a591-39b41826a78a · outbound

This paper cites Stochastic linear bandits robust to adversarial attacks.

Cascading Bandits Robust to Adversarial Corruptions Stochastic linear bandits robust to adversarial attacks

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.626569Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation de86f984-5c45-4173-a540-04a559d27bb1 · outbound

This paper cites The movielens datasets: History and context.

Cascading Bandits Robust to Adversarial Corruptions The movielens datasets: History and context

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-08T10:58:56.313264Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c981afd6-799a-41a5-8e86-6e4f1aa809de · outbound

This paper cites Federated multi-armed bandits.

Cascading Bandits Robust to Adversarial Corruptions Federated multi-armed bandits

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.598707Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation e003b461-d233-4d95-8b29-61790e1aa896 · outbound

This paper cites Comparison-based conversational recommender system with relative bandit feedback.

Cascading Bandits Robust to Adversarial Corruptions Comparison-based conversational recommender system with relative bandit feedback

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.580644Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 1ecf6a50-b8d3-4b37-89fd-2bc05f85e969 · outbound

This paper cites Bernoulli Rank-$1$ Bandits for Click Feedback.

Cascading Bandits Robust to Adversarial Corruptions Bernoulli Rank-$1$ Bandits for Click Feedback

Reference 36

Resolution: verified exact; local_arxiv, observed 2026-08-08T10:58:56.388129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation f6d57afe-510d-4b48-b23d-04dd2770354b · outbound

This paper cites Clustering of conversational bandits for user preference learning and elicitation.

Cascading Bandits Robust to Adversarial Corruptions Clustering of conversational bandits for user preference learning and elicitation

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.564313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Observation 352f3603-9c03-48f7-b5e8-2646e85cc53a · outbound

This paper cites Click models for web search.

Cascading Bandits Robust to Adversarial Corruptions Click models for web search

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T10:58:56.547666Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

Pith citing papers

No inbound Pith citation observations are available.