{"as_of":"2026-08-08T07:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e0f3636c18f6cac33627f009f5f172f60ef597e36095de9d8da9272cb9c9d8c","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:40:57.970524Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T17:31:04.833447Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T17:31:06.768617Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"cited_work":{"arxiv_id":"2505.21790","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.21790","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster rates for private adversarial bandits.ArXiv, abs/2505.21790","venue":null,"work_id":"d198d33c-d3cd-4b66-9955-2fc1bff6d2f5","year":2025},"citing_paper":{"arxiv_id":"2605.05266","last_updated":"2026-05-06T09:19:11Z","snapshot_observed_at":"2026-08-07T09:26:08.822312Z","submitted_at":"2026-05-06T09:19:11Z","title":"Differential Privacy in the Extensive-Form Bandit Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T17:31:04.833447Z"},"links":{"cited_paper":"/paper/2505.21790","citing_paper":"/paper/2605.05266"},"observation_digest":"sha256:7196656124bcee7a3007644999274e45ffed45155562e663bf0c89dfbf5aaefe","observation_id":"ca0680fb-bf93-4ab9-8370-f5370e88550e","resolution":{"observed_at":"2026-05-11T17:31:06.771508Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.21790/citation-record","integrity":"/paper/2505.21790/integrity","json":"/paper/2505.21790/citation-record.json","paper":"/paper/2505.21790"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:40:53.317006Z","title":"Fighting bandits with a new kind of smoothness","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:53.317006Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:ab54183cd51ee1178bc512327d7d43bb7beb7e01c35ac452e1e967b898c93f48","observation_id":"c5ad14df-1795-406d-8f8b-372eee924657","resolution":{"observed_at":"2026-08-07T13:40:53.317006Z","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-07T13:41:04.049545Z","title":"The price of differential privacy for online learning","venue":null,"work_id":"6b2ddc92-ff42-4745-ac9e-59eee1f7bee5","year":2017},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:53.410614Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:fa84c0b5e8dff961b32877837475e57c302d2cd99d76701de35912eb47ce2d06","observation_id":"8cad968b-25f0-4efd-9642-90869ade3403","resolution":{"observed_at":"2026-08-07T13:41:04.112113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1206.6400","last_updated":"2012-06-27T19:59:59Z","snapshot_observed_at":"2026-07-06T02:50:47.096675Z","submitted_at":"2012-06-27T19:59:59Z","title":"Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regret","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.6400","snapshot_observed_at":"2026-08-07T13:40:53.517361Z","title":"Online bandit learning against an adaptive adversary: from regret to policy regret","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:53.517361Z"},"links":{"cited_paper":"/paper/1206.6400","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:a253bb99cd4c4895fe0dba37e3f5c5056957b6fa0df2b9e07decdbe38c571820","observation_id":"62ccc30a-ec22-4437-a8c0-2db53434147d","resolution":{"observed_at":"2026-08-07T13:40:53.517361Z","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-07T13:41:03.816598Z","title":"Private online prediction from experts: Separations and faster rates","venue":null,"work_id":"f6c48026-d146-431e-8f3c-e07f33c4f11d","year":2023},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:53.658098Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:c50b4d2fc3d9ca25c8987a4d93575114d016c6cffad003f0c52d5b81ed72e897","observation_id":"a9ab9288-071c-4523-912a-865668dacbd1","resolution":{"observed_at":"2026-08-07T13:41:03.909428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03620","last_updated":"2025-02-21T23:22:52Z","snapshot_observed_at":"2026-07-06T18:26:10.408035Z","submitted_at":"2024-06-05T20:43:05Z","title":"Private Online Learning via Lazy Algorithms","version":2},"cited_work":{"arxiv_id":"2406.03620","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.03620","snapshot_observed_at":"2026-08-07T13:40:58.144089Z","title":"Private Online Learning via Lazy Algorithms","venue":"cs.LG","work_id":"4bcea492-a1bf-4271-8a50-1a4940ca3e46","year":2024},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:53.792568Z"},"links":{"cited_paper":"/paper/2406.03620","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:853a0824984220a6d74948b60138f85a9f794af1c8ea1fb50a808a132bd5c83f","observation_id":"b918fd1f-a623-47ef-9a36-a53a60de6a7e","resolution":{"observed_at":"2026-08-07T13:40:58.212736Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:53.929225Z","title":"Minimax policies for adversarial and stochastic bandits","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:53.929225Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:0e935d240fc9a8e47728accdf8815838137edfe2a826fe66153017dd86c89b13","observation_id":"03d87c81-e532-4616-a90d-294aad246900","resolution":{"observed_at":"2026-08-07T13:40:53.929225Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:40:54.061638Z","title":"The nonstochastic multiarmed bandit problem","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.061638Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:ce0428d88490f63ac301e7936c3066202acbf6eec2416b59176fca9a650ab165","observation_id":"2f090a6f-dac2-44f9-96ea-03fce290621a","resolution":{"observed_at":"2026-08-07T13:40:54.061638Z","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-07T13:41:03.517236Z","title":"When privacy meets partial information: A refined analysis of differentially private bandits","venue":null,"work_id":"0269ce05-068c-41a1-868b-0800218b2311","year":2022},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.175743Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:8b794657eb4fb54071be3c895cb1c99145b9b3e6f0f5185112bf170f27bc44c7","observation_id":"5f806a88-cb27-497e-a0ee-5d133061bc21","resolution":{"observed_at":"2026-08-07T13:41:03.634037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12298","last_updated":"2020-06-23T19:04:56Z","snapshot_observed_at":"2026-08-07T23:23:34.100922Z","submitted_at":"2019-05-29T09:56:41Z","title":"Differential Privacy for Multi-armed Bandits: What Is It and What Is Its Cost?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12298","snapshot_observed_at":"2026-08-07T13:40:54.290703Z","title":"Differential privacy for multi-armed bandits: What is it and what is its cost? arXiv preprint arXiv:1905.12298, 2019","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.290703Z"},"links":{"cited_paper":"/paper/1905.12298","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:85e9327c51d4c8ab1b1448b773ce141f5f57b83e97bec7a21e61c5fdacfbf42c","observation_id":"edb1b949-a43c-483d-b1df-215add1e920c","resolution":{"observed_at":"2026-08-07T13:40:54.290703Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:40:54.402672Z","title":"Regret analysis of stochastic and nonstochastic multi-armed bandit problems","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.402672Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:2f85cc9601ff38dc767543152b93d5476b38ad295247ef747e09ac777812809a","observation_id":"0c79f99c-94f5-422f-a3b4-6d589c9dc0e2","resolution":{"observed_at":"2026-08-07T13:40:54.402672Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:40:54.483412Z","title":"Prediction, learning, and games","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.483412Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:b134b898eb3cd2698e558752a8604384e9b75991a64ce70baee0b40f3bbdb3c3","observation_id":"6023b085-b5b7-403a-af18-439e4090fd06","resolution":{"observed_at":"2026-08-07T13:40:54.483412Z","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-07T13:41:03.293544Z","title":"Follow-the-perturbed-leader for adversarial bandits: Heavy tails, robustness, and privacy","venue":null,"work_id":"e6257830-9c39-45b7-84c8-46cc3460757e","year":null},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.642109Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:8f9ea2cf5415fdba665505e79abfde78b222d31915872b5ade3f6fb0dd2456ca","observation_id":"6c4cad1a-4fec-4d9b-8711-c9d4b9b0e1ee","resolution":{"observed_at":"2026-08-07T13:41:03.407172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:54.758546Z","title":"The price of bandit information in multiclass online classification","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.758546Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:9d5da92af652b34c9811f90df7e4510a80245fee87ed9ba030d5f50a8f3625ba","observation_id":"73626749-1e2f-4999-917a-b334b1efa552","resolution":{"observed_at":"2026-08-07T13:40:54.758546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1302.3203","last_updated":"2014-08-27T04:40:22Z","snapshot_observed_at":"2026-07-06T03:06:21.307215Z","submitted_at":"2013-02-13T20:06:06Z","title":"Local Privacy, Data Processing Inequalities, and Statistical Minimax Rates","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1302.3203","snapshot_observed_at":"2026-08-07T13:40:54.895082Z","title":"Local privacy, data processing inequalities, and statistical minimax rates","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:54.895082Z"},"links":{"cited_paper":"/paper/1302.3203","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:724bee7708ba1db404a117cdc084d61f5fe6f361473f58cfc6cd2d4a179fa813","observation_id":"941e465b-1cc5-4f4a-8649-f2c0898e1051","resolution":{"observed_at":"2026-08-07T13:40:54.895082Z","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-07T13:41:03.031558Z","title":"Differential privacy","venue":null,"work_id":"2ecbf003-4d8b-48e2-93be-5f9d783648d0","year":2006},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.040124Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:0516d61015aaca06218d7c52ab9812bec9d746ec984a393c121a0df82cd7b35e","observation_id":"064a3453-b32d-4950-9b76-7ad5bff5df6d","resolution":{"observed_at":"2026-08-07T13:41:03.169597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:02.830128Z","title":"Differential privacy under continual observation","venue":null,"work_id":"32627ef9-dc79-4fd7-bd93-867d5a8b538e","year":2010},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.157974Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:1ada04994f4458ff460b498e9adf757c5233adde441370c810d4b1adf77bdfcb","observation_id":"7042d993-5289-43d7-8cb1-4f0e63191510","resolution":{"observed_at":"2026-08-07T13:41:02.919059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:02.629255Z","title":"Boosting and differential privacy","venue":null,"work_id":"572d6fcd-6d26-4e4c-8f5b-e3d205b8d6f6","year":2010},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.254101Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:a179e5564f59cf0d489cbe39fd7c8fd116cb1eb16c5493757f84c51ab824d427","observation_id":"d54156be-8442-4d5e-bcab-797554f22d94","resolution":{"observed_at":"2026-08-07T13:41:02.724397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:55.338545Z","title":"The algorithmic foundations of differential privacy","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.338545Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:9a58ef4232db598fd12a523362c4aa0a9174d92985892bc7de9c2029cb121847","observation_id":"7e586cbd-3ec8-44d3-95c7-06b2c5b16ebe","resolution":{"observed_at":"2026-08-07T13:40:55.338545Z","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-07T13:41:02.425626Z","title":"(nearly) optimal algorithms for private online learning in full-information and bandit settings","venue":null,"work_id":"f2fbd2e6-77d8-4791-81d5-4297e8fdab91","year":2013},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.420972Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:5c200d819d20795c13f5a5db4db84858fc20906986288133d042381f7c3909ed","observation_id":"cb69bac6-fb25-4d02-9a12-3aee51ebd02e","resolution":{"observed_at":"2026-08-07T13:41:02.514298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:02.296099Z","title":"Follow-the-perturbed-leader achieves best-of-both-worlds for bandit problems","venue":null,"work_id":"56cc1b2a-31a6-4fcb-a020-3e0fbfed5925","year":2023},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.578341Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:63ec3ea6516e398655ee36e56fa1307be235e4901adc6ac2ccea53c4e5c20109","observation_id":"eb3ac4d0-d852-4d8b-8449-3f5ad7ef1e2d","resolution":{"observed_at":"2026-08-07T13:41:02.347090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07929","last_updated":"2024-05-30T07:17:20Z","snapshot_observed_at":"2026-08-05T18:41:39.666406Z","submitted_at":"2021-02-16T02:48:16Z","title":"Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07929","snapshot_observed_at":"2026-08-07T13:40:55.701327Z","title":"Optimal algorithms for private online learning in a stochastic environment","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.701327Z"},"links":{"cited_paper":"/paper/2102.07929","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:c7822c5c9f3e1b6733635121e4f494fec307535c00fdb4150957683517328e01","observation_id":"988f55d8-55aa-45b5-a6ef-244f248ca594","resolution":{"observed_at":"2026-08-07T13:40:55.701327Z","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-07T13:41:02.186710Z","title":"Adaptive best-of-both-worlds algorithm for heavy-tailed multi-armed bandits","venue":null,"work_id":"371b2aa1-909f-4c10-a949-085a93e8eee2","year":2022},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.817683Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:2a18b49b56fc3eed8a0552beccaeb665c4c7fa6ca1e74636740856dc5db51713","observation_id":"f5e33614-a549-4f82-8eaf-241a60481eff","resolution":{"observed_at":"2026-08-07T13:41:02.255814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:02.021243Z","title":"(near) dimension independent risk bounds for differentially private learning","venue":null,"work_id":"4bcd78c8-ae3d-4295-bcc4-dc7a57d9b5b6","year":2014},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:55.919924Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:ba529ec273e289f698577c1b62f7b88513806b34486a8d06500f1f5dd25ccfb1","observation_id":"88b3d4cc-7d56-4264-8773-e7e2de693f0e","resolution":{"observed_at":"2026-08-07T13:41:02.124933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:01.721830Z","title":"Differentially private online learning","venue":null,"work_id":"cf9357c8-28ca-497d-8882-38a4436c2fc5","year":2012},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.022111Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:77f2b53844cc58964fce102aae92f9c68976449095b659721e4e26e564add318","observation_id":"01001d18-a5ca-4b4d-a54c-430426421c18","resolution":{"observed_at":"2026-08-07T13:41:01.832511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:01.409795Z","title":"The composition theorem for differential privacy","venue":null,"work_id":"9737488a-0d43-4c12-81d6-3373feb14d74","year":2015},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.111245Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:16ffa52fb49f82d6860036a0c84a61826e6923b80ba1cfd375d12739fb8e056b","observation_id":"50a3b482-a687-4c25-bc27-1e96519ed306","resolution":{"observed_at":"2026-08-07T13:41:01.575323Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:01.093609Z","title":"Regret bounds for sleeping experts and bandits","venue":null,"work_id":"5ea1eb0f-c50a-4e48-953a-70614aeef943","year":2010},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.234105Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:ef62e3c075a12dc4878f15b18a13f019becfc092db12d773b91e2474acb6bd50","observation_id":"2345e6b7-999f-45de-89f5-9f88d5fdb6b5","resolution":{"observed_at":"2026-08-07T13:41:01.239870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:00.840201Z","title":"The weighted majority algorithm","venue":null,"work_id":"2c258c00-db9b-4d28-96fb-be4b1b1f1322","year":1994},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.333198Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:839e032d50576e10cd89e38989cf03e0572d8f2852134f7dafbf363dbeb72a70","observation_id":"32b301d9-7f73-49bc-8dc8-6466288183d7","resolution":{"observed_at":"2026-08-07T13:41:00.948741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2108.04782","last_updated":"2021-08-10T16:52:52Z","snapshot_observed_at":"2026-07-06T11:37:12.299667Z","submitted_at":"2021-08-10T16:52:52Z","title":"Bandit Algorithms for Precision Medicine","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.04782","snapshot_observed_at":"2026-08-07T13:40:56.465786Z","title":"Bandit algorithms for precision medicine","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.465786Z"},"links":{"cited_paper":"/paper/2108.04782","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:6ebf32ddf31c792f88913552470eccf9292e5ff244188aa3775f0e603c2dd715","observation_id":"b81c744d-9d01-439e-b1ff-99b34946b0b1","resolution":{"observed_at":"2026-08-07T13:40:56.465786Z","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-07T13:41:00.591415Z","title":"(nearly) optimal differentially private stochastic multi-arm bandits","venue":null,"work_id":"533a836e-6972-420e-9977-7fe82349b12a","year":2015},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.566435Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:d1ec6f9c7320a4364778767b2463ef781667ae65ada4ee347960a4af8fe41315","observation_id":"8309a18b-28bd-489e-96e2-625316a5530f","resolution":{"observed_at":"2026-08-07T13:41:00.706685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:41:00.363124Z","title":"Mitigating bias in adaptive data gathering via differential privacy","venue":null,"work_id":"fe846f90-45f9-46e8-9366-6dc6ee492e03","year":2018},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.676120Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:ec52acbd4b2cfce1a868f7d15a5a16eacdd01769c2165da5a28818ec55975e00","observation_id":"a9280b7c-8b84-4d79-a488-41f3bbe0e065","resolution":{"observed_at":"2026-08-07T13:41:00.453232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:56.797987Z","title":"Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.797987Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:7b9fd09a622e8dbe914fc1af97796133db79dd177e1b28d3791eb9c69936f8f2","observation_id":"b58f57a8-6201-40a9-b78d-55c825a4c948","resolution":{"observed_at":"2026-08-07T13:40:56.797987Z","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-07T13:41:00.109191Z","title":"Multiclass online learnability under bandit feedback","venue":null,"work_id":"d0857730-4d33-4c52-a36c-9baf3ed62fc0","year":2024},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:56.927359Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:cd07fd3425708517f648b6abf3f51e763655177c96be1d8a079dfe07f5e14a56","observation_id":"6f7b48e7-832a-4ff9-bb43-7e75e033aa1f","resolution":{"observed_at":"2026-08-07T13:41:00.249305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03121","last_updated":"2020-07-06T23:36:20Z","snapshot_observed_at":"2026-07-06T09:35:57.224581Z","submitted_at":"2020-07-06T23:36:20Z","title":"Multi-Armed Bandits with Local Differential Privacy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03121","snapshot_observed_at":"2026-08-07T13:40:57.035198Z","title":"Multi-armed bandits with local differential privacy","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.035198Z"},"links":{"cited_paper":"/paper/2007.03121","citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:0b3a44293c76b8d150f7f8422849122276aed0743a8d6687c6e395e011cf1a13","observation_id":"56fe1669-ab77-48b9-a83b-e93a5c8902ee","resolution":{"observed_at":"2026-08-07T13:40:57.035198Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:40:57.155368Z","title":"Estimation of regression coefficients when some regressors are not always observed","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.155368Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:20f5f729b2d6bc01156dea69004babe2cb0c3499b5b8a06aacb57126c8b9f86e","observation_id":"a0b59055-b527-4c98-9c1f-f71399782507","resolution":{"observed_at":"2026-08-07T13:40:57.155368Z","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-07T13:40:59.834403Z","title":"An optimal private stochastic-mab algorithm based on optimal private stopping rule","venue":null,"work_id":"94ff6db2-9af4-4658-b552-16777a2d6e2f","year":2019},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.294571Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:f3fa051367b2be28770d443e0fc1fa9df039c01f02fb9b0849f0d09aaee144a5","observation_id":"c22c4fe6-a78b-4681-b3c7-22db925bf738","resolution":{"observed_at":"2026-08-07T13:40:59.988225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:59.598850Z","title":"A lower bound for multi-armed bandits with expert advice","venue":null,"work_id":"47ce24df-62c0-43ff-9dba-a45e9ad0f850","year":2016},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.404653Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:4c86a6e9f09c0baf4db2e27131a7bc330623031e17f1fd88d999c948a289d4fb","observation_id":"6acc901c-9bbe-4c85-b874-4bec7eff1333","resolution":{"observed_at":"2026-08-07T13:40:59.702338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:59.351224Z","title":"Differentially private contextual linear bandits","venue":null,"work_id":"f71e543b-62f8-4446-a1e2-a54dab3df90d","year":2018},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.506687Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:6d7a1d68e26607fad7fd2e00390d2f4d5f904ef6ccd4d8b74b8e132c37f14fd3","observation_id":"40ad38b7-ec3f-4598-b714-b37563230e45","resolution":{"observed_at":"2026-08-07T13:40:59.450840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:59.135902Z","title":"Differentially private multi-armed bandits in the shuffle model","venue":null,"work_id":"2148158a-4a7b-4f6d-94c4-d389fd57063c","year":2021},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.614358Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:e3bafaf677e233230f847dc8c8e1829e7349e808456490f9cedfae1c7088a038","observation_id":"b574762c-5939-4b93-82b0-ad207331b485","resolution":{"observed_at":"2026-08-07T13:40:59.230029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:58.870381Z","title":"Algorithms for differentially private multi-armed bandits","venue":null,"work_id":"a2cff383-1c43-450a-bb48-04919844b8a5","year":2016},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.718606Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:fec9129f13df204a51e78fcdfcfd7877f3a19ade8cda6a451caaec5ddae57d1b","observation_id":"427b9ac4-fbdf-42c5-946d-370ca3c5d81f","resolution":{"observed_at":"2026-08-07T13:40:59.006934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:58.622013Z","title":"Achieving privacy in the adversarial multi-armed bandit","venue":null,"work_id":"649f9f96-5d43-441e-ae92-cff5b197dd0c","year":2017},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.824985Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:18599e7f9e04bf9caf286b35cf1efba6e031f401609186d191d1fb743103bd0d","observation_id":"e576429b-26e5-42ae-b751-5f273072763b","resolution":{"observed_at":"2026-08-07T13:40:58.742872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T13:40:58.333596Z","title":"Locally differentially private (contextual) bandits learning","venue":null,"work_id":"e3d55056-9a8a-460c-ae33-d36d799c1e33","year":2020},"citing_paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T13:40:57.970524Z"},"links":{"citing_paper":"/paper/2505.21790"},"observation_digest":"sha256:d0402a7fc052fc35da4ac4557bd3510c7506076e3a465e9dd9cb8da4cdb5926c","observation_id":"d69d3496-0c67-4a59-b1ee-6c4400818920","resolution":{"observed_at":"2026-08-07T13:40:58.455702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21790","last_updated":"2025-05-27T21:42:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T13:20:41.334131Z","submitted_at":"2025-05-27T21:42:10Z","title":"Faster Rates for Private Adversarial Bandits"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":41},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 1 inbound Pith citation observation for arXiv:2505.21790."}