{"as_of":"2026-08-19T03:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a91de065cf59815da74dff99ee06f26d90c648af4e2b6dd30f0841455efdfcdd","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T10:58:56.340014Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2502.08077/citation-record","integrity":"/paper/2502.08077/integrity","json":"/paper/2502.08077/citation-record.json","paper":"/paper/2502.08077"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:57.035654Z","title":"Cascading bandits: Learning to rank in the cascade model","venue":null,"work_id":"ebbe341d-d330-43ae-b132-008915615365","year":2015},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.143993Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:5e54edc314558bedd023dce887a5fbd608d9dff721ded9f304141c56ccf0725d","observation_id":"80aa7707-3718-4258-a07d-972cbeccf56f","resolution":{"observed_at":"2026-08-08T10:58:57.042395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:57.017695Z","title":"Learning to rank: Regret lower bounds and efficient algorithms","venue":null,"work_id":"80d91c5e-9e9c-4086-9a11-76e04bb64855","year":2015},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.150131Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:9172a514b4bca61b999bb9e50ca4ad5a26f1b3b8e8ae490a568868696843f6be","observation_id":"5785cd4f-2419-4ce9-abec-a1a78864f57a","resolution":{"observed_at":"2026-08-08T10:58:57.023408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.155322Z","title":"Learning to rank: from pairwise approach to listwise approach","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.155322Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:f6a95b53b3bcf1af559ddc0aa6eec944fb048b25c42081607f5162189fee12f0","observation_id":"c5d71a73-f357-458e-9710-eea883b05452","resolution":{"observed_at":"2026-08-08T10:58:56.155322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.989278Z","title":"Learning to rank","venue":null,"work_id":"2ffe9d3b-f01e-44b1-82d2-c9acb01d2ed0","year":2005},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.160740Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:03cf8323bc1cffd7dbb603e2bea9e6c850c9e41777aeb59c0766a92c22dbba60","observation_id":"14ebdde8-965a-45d3-8c41-c31b5b61003b","resolution":{"observed_at":"2026-08-08T10:58:56.994567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.972521Z","title":"Toprank: A practical algorithm for online stochastic ranking","venue":null,"work_id":"d5f1b5fe-b157-433d-acbe-ff2bf6f46859","year":2018},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.166035Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:a1c3c9499b1cf644322a8a0d3e030e404d4ef0a9dfe79c14c99091e7fd7da6d0","observation_id":"c4b75587-20dc-4c8e-aac7-6dba5477aef7","resolution":{"observed_at":"2026-08-08T10:58:56.977845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.955977Z","title":"Thompson sampling algorithms for cascading bandits","venue":null,"work_id":"fa761b27-b211-4e28-81cc-01a5acdae4ea","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.171223Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:6a9fac19cc1a92dcf1ed40f39494b10f3cf82b24826fc7aa18d70a05b5424d3a","observation_id":"30a7841a-2ef7-4119-a534-fb50c3a28f73","resolution":{"observed_at":"2026-08-08T10:58:56.961231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.939203Z","title":"An experimental comparison of click position-bias models","venue":null,"work_id":"18aeb048-e3d1-4d99-812a-853a5c2bfc17","year":2008},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.176860Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:63a92b3ef1bebef37867935528a00dbcb09f6ac803e76186c4ef90112f16a84f","observation_id":"24e5b743-1138-430f-af9a-9c95d90e4520","resolution":{"observed_at":"2026-08-08T10:58:56.944514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.922844Z","title":"Combinatorial cascading bandits","venue":null,"work_id":"cea09a5d-9a16-4c6a-9163-290d8ee07434","year":2015},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.182057Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:e54eddab001912aba085b7c9e1442c6ce3670cd233a08498ac8a23ae522a8739","observation_id":"e9329575-b90d-489b-95d0-e9930fa5ae86","resolution":{"observed_at":"2026-08-08T10:58:56.927842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12370","last_updated":"2019-11-22T15:47:21Z","snapshot_observed_at":"2026-08-18T01:14:26.649182Z","submitted_at":"2019-05-29T12:18:51Z","title":"Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model","version":3},"cited_work":{"arxiv_id":"1905.12370","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.12370","snapshot_observed_at":"2026-08-08T10:58:56.524650Z","title":"Cascading Non-Stationary Bandits: Online Learning to Rank in the Non-Stationary Cascade Model","venue":"cs.LG","work_id":"881d5763-ac54-4da6-87f6-6edadfe63cff","year":2019},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.187069Z"},"links":{"cited_paper":"/paper/1905.12370","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:e174f9bf8cffe94a716716058e3a0d6c8af840018b3a4b12fe33ec160cfcb86f","observation_id":"b9c713a0-7152-47c1-abf1-e59e7f86168c","resolution":{"observed_at":"2026-08-08T10:58:56.530349Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.906190Z","title":"Stochastic bandits robust to adversarial corruptions","venue":null,"work_id":"15ebb66a-6f73-4ba1-9f28-2c8de8635153","year":2018},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.192475Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:199edaaea645d9f580c43d9aa47748facdfcb133a81decc604e4d0eb1245620a","observation_id":"d821a28c-9a29-49ae-ba50-df701f8609cf","resolution":{"observed_at":"2026-08-08T10:58:56.911661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.889465Z","title":"Better algorithms for stochastic bandits with adversarial corruptions","venue":null,"work_id":"eeaa2da6-56a7-48aa-8efd-fad08c93fde2","year":2019},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.197660Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:9b63b858bd9f2a8c184bd98a0aa0a4dc366b5da6b665972edd65d0dfef2d45d8","observation_id":"a70ab690-56ee-413e-b99f-c4bcf711a0f0","resolution":{"observed_at":"2026-08-08T10:58:56.894933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.874016Z","title":"Learning diverse rankings with multi-armed bandits","venue":null,"work_id":"fd110140-eeb4-4b4a-a352-52d95ca74d80","year":2008},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.204118Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:a2b9d4e494f1ac229c48026c7ca9381a36f383d236ff899a79259c18a0373c50","observation_id":"146a4b0f-5bb9-4d9a-982c-a354d1cd1c58","resolution":{"observed_at":"2026-08-08T10:58:56.879011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04207","last_updated":"2021-06-08T09:32:43Z","snapshot_observed_at":"2026-08-16T18:18:49.297083Z","submitted_at":"2021-06-08T09:32:43Z","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","version":1},"cited_work":{"arxiv_id":"2106.04207","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.04207","snapshot_observed_at":"2026-08-08T10:58:56.499875Z","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","venue":"cs.LG","work_id":"63512a69-09fd-48e8-8f8e-d4c96a9b3217","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.209365Z"},"links":{"cited_paper":"/paper/2106.04207","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:63c313782b01fe363e32f7dc193271e5f2a87e5b2f08b9a17a60ced3c13ea2e0","observation_id":"91069773-46f2-41ee-a0c2-01d832503e39","resolution":{"observed_at":"2026-08-08T10:58:56.506131Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.857530Z","title":"Stochastic graphical bandits with adversarial corruptions","venue":null,"work_id":"b3b7e7bd-709b-4a0d-a10c-a290cca9cbb6","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.215160Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:87c7f72f4d8b406404dc7b893f202dabe98e65694c04b882bf9a339006b3343d","observation_id":"262967b9-7044-41aa-9e86-c6d14f7ec714","resolution":{"observed_at":"2026-08-08T10:58:56.863018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.841115Z","title":"Robust stochastic linear contextual bandits under adversarial attacks","venue":null,"work_id":"c7171c88-d65a-4906-8e61-f8a11cf09ad8","year":2022},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.220050Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:d9438d35a2b341592a55a1d7d0c151ecce93582d1a30ef3c0e73bf238e391980","observation_id":"1ca843c5-d0aa-44a6-b5a5-008eb93c1a5e","resolution":{"observed_at":"2026-08-08T10:58:56.846559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.824497Z","title":"Online corrupted user detection and regret minimization","venue":null,"work_id":"1efb5b6a-1219-4529-8b11-0dc9dbb75db4","year":2024},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.225478Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:9c22c39f7ba6762d26412a0e8087f7b1aca4d69f3d10ab84861da1b2a7c3a63e","observation_id":"c3a64317-be02-432e-8c1e-7727faac7d4b","resolution":{"observed_at":"2026-08-08T10:58:56.829646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.807154Z","title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","venue":null,"work_id":"0304e853-1e41-45b9-8187-4ca0857d1def","year":2006},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.231020Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:9f931497e6b3a4baa9615c836f981707ffc25a6b1f7166f31ab18d5dc7a0855b","observation_id":"198e89d4-fae3-471c-9204-4ea8fe790fbd","resolution":{"observed_at":"2026-08-08T10:58:56.812284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.789700Z","title":"Online learning to rank in stochastic click models","venue":null,"work_id":"b734b0d5-28b1-42df-a03c-03583a822767","year":2017},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.236118Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:6008787d947d5019de5d40aa2017b71b636facd6d24c5b42889ddd6da3c93fa4","observation_id":"a234b626-81dc-4142-83b4-a47b5f793ac3","resolution":{"observed_at":"2026-08-08T10:58:56.794793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.12577","last_updated":"2022-10-10T16:04:47Z","snapshot_observed_at":"2026-08-16T17:12:17.876045Z","submitted_at":"2022-03-23T17:37:43Z","title":"Minimax Regret for Cascading Bandits","version":3},"cited_work":{"arxiv_id":"2203.12577","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.12577","snapshot_observed_at":"2026-08-08T10:58:56.475025Z","title":"Minimax Regret for Cascading Bandits","venue":"cs.LG","work_id":"ab231fdb-4cba-49a0-adbc-ba982645621b","year":2022},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.241318Z"},"links":{"cited_paper":"/paper/2203.12577","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:d8e3059ce5a6e0532254870c7ceadf4bf5db3a0d251441f6a3404c85b48f7b55","observation_id":"f1351905-46c8-41a2-b404-985f7c585de8","resolution":{"observed_at":"2026-08-08T10:58:56.481123Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.773239Z","title":"Contextual combinatorial cascading bandits","venue":null,"work_id":"12565fc0-ad1d-470d-b969-968970b7f838","year":2016},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.247291Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:23ac3c41c9726ce08cd58bcbb80bb6f2a2008d5fd8d43b9b4aade6f72c86d5bf","observation_id":"97fdb2f1-5cbc-43f3-a3d9-1c85c4b39646","resolution":{"observed_at":"2026-08-08T10:58:56.778427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.756076Z","title":"Online clustering of contextual cascading bandits","venue":null,"work_id":"456fbca1-6dd1-4b2d-9ae1-78f3d23a643c","year":2018},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.252766Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:01bc95e7b523496484fc237bfd7692b6218c4b9fcc7cbdbae1723b1e54601df6","observation_id":"a32c7b01-0e54-49a3-a9bf-677b1a2f8404","resolution":{"observed_at":"2026-08-08T10:58:56.761052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.05359","last_updated":"2016-06-30T17:07:26Z","snapshot_observed_at":"2026-08-14T22:05:40.235284Z","submitted_at":"2016-03-17T05:37:12Z","title":"Cascading Bandits for Large-Scale Recommendation Problems","version":2},"cited_work":{"arxiv_id":"1603.05359","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.05359","snapshot_observed_at":"2026-08-08T10:58:56.450131Z","title":"Cascading Bandits for Large-Scale Recommendation Problems","venue":"cs.LG","work_id":"ef27e2b2-3c76-4849-b2d8-da51d099cb36","year":2016},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.257891Z"},"links":{"cited_paper":"/paper/1603.05359","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:e758f04f4cb553824745c685729ddb7d92f0c24fd9a521e11dd606efefd47f29","observation_id":"43a76b9a-3682-4bf0-ac21-92102c70b454","resolution":{"observed_at":"2026-08-08T10:58:56.455961Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.739523Z","title":"Online learning to rank with features","venue":null,"work_id":"e9c0b840-b149-424f-93c1-6e00f60bfba2","year":2019},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.263300Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:cf5844361c99c7bb527d3dc145c4226a2d5c362ded4c83efaa1f88bbace3cb57","observation_id":"2365a776-deea-4059-a876-346649be69ee","resolution":{"observed_at":"2026-08-08T10:58:56.745336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.721865Z","title":"Cascading hybrid bandits: Online learning to rank for relevance and diversity","venue":null,"work_id":"4016a724-5e2c-4eab-9591-2e1460248f28","year":2020},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.268462Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:fa809f10111b02459c7a4bd562ac8d084bcdc91f6de0b0a53183f0c5e47ddb88","observation_id":"c77db8db-0ec5-40eb-ab35-1fcd86daa8b0","resolution":{"observed_at":"2026-08-08T10:58:56.728177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.704996Z","title":"Corruption-tolerant bandit learning","venue":null,"work_id":"dface9fc-6b63-4feb-836a-010b27757dfa","year":2019},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.273222Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:ccc16943ffd5f4726d7540707da3aad5fe5039aa3072ea3e5a6dfaf14b76aa00","observation_id":"40904f46-ad30-4ae0-9f61-c0e8dc8fa505","resolution":{"observed_at":"2026-08-08T10:58:56.710496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.687724Z","title":"Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits","venue":null,"work_id":"767d16f6-b489-40d4-87ae-ea271d8a54f2","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.277718Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:e6b84046cd2cae7a4b347625ac22eb8b73cccd6fa50e19276f1437a1af7114ca","observation_id":"bad41073-ba49-4cdd-be90-008cc3f064c4","resolution":{"observed_at":"2026-08-08T10:58:56.692785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.671658Z","title":"Stochastic dueling bandits with adversarial corruption","venue":null,"work_id":"5d209eb3-0242-42aa-b0e3-e2ee22a6f1db","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.282171Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:f074231e0b66a29be5cffa64eb6fb199012c896feb0b41dfa1ae835595fe6e57","observation_id":"c1300756-0420-4062-b210-eebe5db63daf","resolution":{"observed_at":"2026-08-08T10:58:56.676599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.655533Z","title":"Adversarial bandits with corruptions: Regret lower bound and no-regret algorithm","venue":null,"work_id":"c1472a27-269b-4b5e-bd8d-4aaa4edf92c0","year":2020},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.287225Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:ffa05af3de09529b993d7a249ea29109fe65a7bf69980cefbbaf7bff327db29e","observation_id":"ebd83de8-3810-4c97-8860-a377229475c3","resolution":{"observed_at":"2026-08-08T10:58:56.660761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.02109","last_updated":"2019-09-04T20:55:00Z","snapshot_observed_at":"2026-08-14T04:57:49.827677Z","submitted_at":"2019-09-04T20:55:00Z","title":"Stochastic Linear Optimization with Adversarial Corruption","version":1},"cited_work":{"arxiv_id":"1909.02109","doi":null,"metadata_source":"pith","pith_arxiv_id":"1909.02109","snapshot_observed_at":"2026-08-08T10:58:56.427058Z","title":"Stochastic Linear Optimization with Adversarial Corruption","venue":"cs.LG","work_id":"dead4f77-357c-48bc-965d-1be00a0a527f","year":2019},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.292026Z"},"links":{"cited_paper":"/paper/1909.02109","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:209ef482336b0c8d9946905519ad33f0fac1737a6ff24df777b2e3743d30dc89","observation_id":"863afa77-fb2c-4fb9-aebe-1eab1e641f85","resolution":{"observed_at":"2026-08-08T10:58:56.432079Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.06811","last_updated":"2022-07-10T02:02:58Z","snapshot_observed_at":"2026-08-16T17:00:27.563806Z","submitted_at":"2022-05-13T17:58:58Z","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06811","snapshot_observed_at":"2026-08-08T10:58:56.297484Z","title":"Nearly optimal algorithms for linear contextual bandits with adversarial corruptions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.297484Z"},"links":{"cited_paper":"/paper/2205.06811","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:b84d0224436a57048b6df2ac1fbcaa325abff28b8500b9445634fbd8badf434c","observation_id":"70fdc965-5861-4d41-b4e6-5b67fd48e066","resolution":{"observed_at":"2026-08-08T10:58:56.297484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.638133Z","title":"Online learning and detecting corrupted users for conversational recommendation systems","venue":null,"work_id":"ac04ec65-16dc-458a-bc1a-2389c774ba37","year":2024},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.303525Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:c06eec4a0c8c4be0a99b5fa5af7607d491c9e3c79d3b1a3bc8ca7a1887611547","observation_id":"bd6be992-81e8-4e2f-9415-9ed1b875cea9","resolution":{"observed_at":"2026-08-08T10:58:56.644442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.621257Z","title":"Stochastic linear bandits robust to adversarial attacks","venue":null,"work_id":"81596a7d-49b0-4f76-8736-0192305fdb1c","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.308530Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:599f0f9e8c41394e02d167013e70ad34a6e39e45d2a4d6cf6e5575150fa53e4f","observation_id":"7b7cde50-60de-4076-a591-39b41826a78a","resolution":{"observed_at":"2026-08-08T10:58:56.626569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.313264Z","title":"The movielens datasets: History and context","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.313264Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:fe407573a6d10c64f4f8c1f9d9cc94c270fc0985aad021504b123bab9bc30e00","observation_id":"de86f984-5c45-4173-a540-04a559d27bb1","resolution":{"observed_at":"2026-08-08T10:58:56.313264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.591291Z","title":"Federated multi-armed bandits","venue":null,"work_id":"2ffcdc14-2d50-4391-ab64-185bccc17676","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.318704Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:52084cce0a068373632c19c6c4c8a6e5c72689623b63a6d3141dff6dae0ef324","observation_id":"c981afd6-799a-41a5-8e86-6e4f1aa809de","resolution":{"observed_at":"2026-08-08T10:58:56.598707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.575728Z","title":"Comparison-based conversational recommender system with relative bandit feedback","venue":null,"work_id":"2c0e42f3-c979-4692-9f9d-973441ce9dbf","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.324033Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:07e3cc59c8d749dfe6d29b82c24758f72ba7796f8cb578bd807b154363b8f721","observation_id":"e003b461-d233-4d95-8b29-61790e1aa896","resolution":{"observed_at":"2026-08-08T10:58:56.580644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.06513","last_updated":"2017-03-19T21:06:51Z","snapshot_observed_at":"2026-08-14T21:11:06.072075Z","submitted_at":"2017-03-19T21:06:51Z","title":"Bernoulli Rank-$1$ Bandits for Click Feedback","version":1},"cited_work":{"arxiv_id":"1703.06513","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.06513","snapshot_observed_at":"2026-08-08T10:58:56.380064Z","title":"Bernoulli Rank-$1$ Bandits for Click Feedback","venue":"cs.LG","work_id":"1241b6bb-8a11-4116-aa35-9f393cea320d","year":2017},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.329280Z"},"links":{"cited_paper":"/paper/1703.06513","citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:b8e9619bca1cbb2c36ff7ac7b95502cd2b6025d61cccacecbfb4147fedf467bf","observation_id":"1ecf6a50-b8d3-4b37-89fd-2bc05f85e969","resolution":{"observed_at":"2026-08-08T10:58:56.388129Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.559224Z","title":"Clustering of conversational bandits for user preference learning and elicitation","venue":null,"work_id":"0be60c54-f55f-4a4b-9418-549287bc2ae6","year":2021},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.334755Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:b08c2123b44bfb9e8e3c195f31d2c4a4e831f36be3f275e271a362138ebc749a","observation_id":"f6d57afe-510d-4b48-b23d-04dd2770354b","resolution":{"observed_at":"2026-08-08T10:58:56.564313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T10:58:56.542270Z","title":"Click models for web search","venue":null,"work_id":"cd581fa6-a4da-4518-b57c-24239cd22cee","year":2015},"citing_paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-08T10:58:56.340014Z"},"links":{"citing_paper":"/paper/2502.08077"},"observation_digest":"sha256:7407593716a2ef4dedc272de10a58447407a681dc171618fb1a3ae6b89c729bc","observation_id":"352f3603-9c03-48f7-b5e8-2646e85cc53a","resolution":{"observed_at":"2026-08-08T10:58:56.547666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.08077","last_updated":"2025-02-12T02:44:41Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T12:04:32.932516Z","submitted_at":"2025-02-12T02:44:41Z","title":"Cascading Bandits Robust to Adversarial Corruptions"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":6,"verified_fuzzy":29},"total_outbound_references":38},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"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."}