Pith. sign in

Paper Citation Record · LEDGER

Cascading Bandits Robust to Adversarial Corruptions

As of 11 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-11T06:34:44.6726+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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.143993Z digest=sha256:d52807762eeecc9367221b4683b39d570765893fd12fca94ab401ecc452c7f3f

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.150131Z digest=sha256:f484cea76c0ac6ea7e869bfd1c2954fff7a1710cb18b58da8a0ade556ed5a1de

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.

source=arxiv_source observed=2026-08-08T10:58:56.155322Z digest=sha256:f6a95b53b3bcf1af559ddc0aa6eec944fb048b25c42081607f5162189fee12f0

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.160740Z digest=sha256:d61aec91d7caa9f0a30bd3911e7ab9d7943bf91e8f8274657b81575abdb5850c

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.166035Z digest=sha256:738cacc1766575ce0f0ac478e71cc94853427514321132ded414aef9974ff8b6

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.171223Z digest=sha256:c30ee8bc5a19875f90adf3527849a7122463d88ae559749aa7108fd138373f2c

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.176860Z digest=sha256:536f11a0505b279ce3fd326761c3fd968acb72d94f5b6c2a1494a920d973c58c

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.182057Z digest=sha256:91a70e0960b59b464be3cdd7b92b5031af3df1731d39b63928a9cb6c8bf554bc

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.187069Z digest=sha256:0538a4b442501ed67c0c15e277b23efc378f3dbb7213f200ace9237086b44e4c

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.192475Z digest=sha256:6145d804a844f06eeb1a9f3ee23abbc1223e74ffdc9ed46c0298e48b75fd12b0

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.197660Z digest=sha256:92542d443f9438f5dfabea17ad1114085c56ab0ca16c3ab7fa3ebc2b30003039

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.204118Z digest=sha256:64066a66d57b778427940e9f7a836f1ab1ba67d4e01f62cea01d7424ad9e2449

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.209365Z digest=sha256:c5bae52e457a580b1e8cf7f0c913b2400319b939072643bdcf20091f439b6ea3

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.215160Z digest=sha256:310e7eae8e0bf4a80c659695b6ac6b9462540933c46d2892696b45e7249d89db

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.220050Z digest=sha256:ac20e4eb5333d0100b63708cf56042ab05eb381784b388bdc1312736c2312923

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.225478Z digest=sha256:5f427838568c6a60422b426e13fa53809a2f60ae62a1e6ff3e2344b6d344eaf9

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.231020Z digest=sha256:e1d86c488526942e4901dee21575cb1b92a709b56df3e1391efb15312d5434a1

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.236118Z digest=sha256:b73392244dda378e83eca2aefde5781b2a8bfd403eba3103cb95f3218061ba0e

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.241318Z digest=sha256:3be7733d965487f0d32f5d74ae138deb269e4ed2df481061135f8f6e823228e1

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.247291Z digest=sha256:cdd6db4638535abf139aa7d408ce6333acda52d93b646bdf207a2bbaf752ac0b

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.252766Z digest=sha256:e4bd70a3e99ee3d7d02e66be8cd74313f393321ffaed26da5a87e4786c82d285

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.257891Z digest=sha256:8b779aca2cc05c0ede1e0e7785305036815980d5dc6f03b954d31b43be37c1b6

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.263300Z digest=sha256:acf3d8eaf00b4664cf24017ae519d26a4e93b8f95ac33f963a65ff6bfa1a78c0

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.268462Z digest=sha256:09aa867a2e2b982991621b49c4f40e56679d407159e54d01b841a5a34bbb5ac9

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.273222Z digest=sha256:20834ec4acdcc6f92c4f083a6e826f267050f395939f02abbe9096425a625168

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.277718Z digest=sha256:287b0dbea1cea29f2c18f6ef2a7dcf5a9281eb4882d513b620ff800ff7450b2b

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.282171Z digest=sha256:d37654293a0b3d19a95d0bc9c167dc279f132d093082bcb37717ad9d0a746756

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.287225Z digest=sha256:fe70caa43c808ae29adede1db2f75455a1699ab0cb13134ea914f2ecaea06c26

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.292026Z digest=sha256:e8422eeb5adb5a39359a3da8df4b800a8a5d8c7af5a5fd5da2b24ea0c2f0753b

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.

source=arxiv_source observed=2026-08-08T10:58:56.297484Z digest=sha256:a1928649e49d5f8ac7ceafe6dffbf1bf6d00215137d312237bb5ad120df878f2

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.303525Z digest=sha256:180a3c292520738f941c649a3dc814a1061e95477d938f3b3a32ecb5ec2bf697

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.308530Z digest=sha256:adb4eb70dd5d8b025562fa6c12cb0f8d4181001dad9ff533191f2bdbe18ebfa2

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.

source=arxiv_source observed=2026-08-08T10:58:56.313264Z digest=sha256:fe407573a6d10c64f4f8c1f9d9cc94c270fc0985aad021504b123bab9bc30e00

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.318704Z digest=sha256:8d8140d54c0748fc4b64435ec3f23c1bec6b5704da096d9509867a139660fa12

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.324033Z digest=sha256:731c43892bd681c8f8188e6c21569b8f9cce30d481f4ca98975eeb6f1ab54de0

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.329280Z digest=sha256:6d4b12eeeda5ab9e898aca6500ad5ab2667ce312ee5d64098142d0b9e025bcfa

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.334755Z digest=sha256:d4de09d524b5d77ac76cb44431e484879d48c215e951ee3e4f4a8e80071a3f91

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-11T06:34:44.6726+00:00.

source=arxiv_source observed=2026-08-08T10:58:56.340014Z digest=sha256:484a8ad7a534d1b2ff69f5aa6989b549911131bbf76894d2fdd4888200ac74a4

Pith citing papers

No inbound Pith citation observations are available.