{"as_of":"2026-08-19T01:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ea694e3d15bff1598699fb6b1e7d7227f8eb4b42f2e02fe4a593184e5bf6a8e","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T16:44:30.910163Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"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.01085/citation-record","integrity":"/paper/2502.01085/integrity","json":"/paper/2502.01085/citation-record.json","paper":"/paper/2502.01085"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:44:30.616026Z","title":"Optimal algorithms for stochastic contextual preference bandits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.616026Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:d96514e985a14ec7f3a94c3c59222918ee73c4772be7c85537e3e3bc845941ab","observation_id":"8baff0c3-8185-4792-b40f-9b0d1de00e33","resolution":{"observed_at":"2026-08-09T16:44:30.616026Z","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-09T16:44:31.891580Z","title":"Efficient and optimal algorithms for contextual dueling bandits under realizability","venue":null,"work_id":"ac4cbe34-9b11-4b94-9b31-fa494bc7289e","year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.621625Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:a4a91e552283f4fd72970d477b7d0367fd8e32c7ed8ec8fca0d2144a38ab0290","observation_id":"3bebda6d-90fb-4257-a91a-d6cf75c25485","resolution":{"observed_at":"2026-08-09T16:44:31.897169Z","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-09T16:44:30.626546Z","title":"Stochastic contextual dueling bandits under linear stochastic transitivity models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.626546Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:9b88ef23099e8f77cc7a57332eb5bacec82cc8961d80fd9dc5217c045a751a8a","observation_id":"d75260f5-2575-48a0-8f89-222f2fb9e1bf","resolution":{"observed_at":"2026-08-09T16:44:30.626546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06013","last_updated":"2024-04-09T04:45:18Z","snapshot_observed_at":"2026-08-16T14:02:31.873327Z","submitted_at":"2024-04-09T04:45:18Z","title":"Feel-Good Thompson Sampling for Contextual Dueling Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.06013","snapshot_observed_at":"2026-08-09T16:44:30.631890Z","title":"Feel-good thompson sampling for contextual dueling bandits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.631890Z"},"links":{"cited_paper":"/paper/2404.06013","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:4747c894f804d83ad494cd4e8722e0824f313d9a2466f24221b46f3a70312f6f","observation_id":"1a3ab303-805a-49a3-8ebe-68538b781830","resolution":{"observed_at":"2026-08-09T16:44:30.631890Z","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-09T16:44:30.637005Z","title":"The k-armed dueling bandits problem","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.637005Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:ec74a0df6710ec2d0198f58f5c93ed53523267cf4218e1843f35b6431f7ca444","observation_id":"3b07175e-b766-4347-aa90-506bd889767d","resolution":{"observed_at":"2026-08-09T16:44:30.637005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17346","last_updated":"2024-05-27T16:49:29Z","snapshot_observed_at":"2026-08-17T18:36:00.358256Z","submitted_at":"2024-05-27T16:49:29Z","title":"Prompt Optimization with Human Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17346","snapshot_observed_at":"2026-08-09T16:44:30.641818Z","title":"Prompt optimization with human feedback.arXiv preprint arXiv:2405.17346, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.641818Z"},"links":{"cited_paper":"/paper/2405.17346","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:2aeb83d95e418eb1d50100a9e34095803ee09e1794a32396a68e0963fdc1685f","observation_id":"5575a231-c644-4859-81b7-f862f73dcddb","resolution":{"observed_at":"2026-08-09T16:44:30.641818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09401","last_updated":"2025-02-11T18:18:59Z","snapshot_observed_at":"2026-08-17T03:04:22.544692Z","submitted_at":"2024-02-14T18:58:40Z","title":"Reinforcement Learning from Human Feedback with Active Queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09401","snapshot_observed_at":"2026-08-09T16:44:30.647246Z","title":"Reinforcement learning from human feedback with active queries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.647246Z"},"links":{"cited_paper":"/paper/2402.09401","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:6ad26f9601aeea0f5c55cb7cbd9c99249f2a234442ea58723e407c2627e62fd7","observation_id":"ab14e6a3-2ddf-46d5-9cb7-a967ae82c36b","resolution":{"observed_at":"2026-08-09T16:44:30.647246Z","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-09T16:44:30.652011Z","title":"Communication-efficient learning of deep networks from decentralized data","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.652011Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:a866c0637eef85b7b66af6f1382a1208f41eb4381a4475c120b5e0af2b503e78","observation_id":"e4bc756e-ba46-41be-9d2b-2e0160a79577","resolution":{"observed_at":"2026-08-09T16:44:30.652011Z","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-09T16:44:31.843661Z","title":"Federated multi-armed bandits","venue":null,"work_id":"beac74f3-4d49-4b65-89ce-7bf1547daf43","year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.656765Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:7b8c3ee5a9242b74366824a960c219e508c119a6a1cd6cb9661ca35468ceb702","observation_id":"12f28940-b916-44ef-b656-67376b6a7aee","resolution":{"observed_at":"2026-08-09T16:44:31.849567Z","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":"1904.06309","last_updated":"2019-05-29T02:05:10Z","snapshot_observed_at":"2026-08-14T16:47:20.727448Z","submitted_at":"2019-04-12T16:32:17Z","title":"Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.06309","snapshot_observed_at":"2026-08-09T16:44:30.661296Z","title":"Distributed bandit learning: Near-optimal regret with efficient communication","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.661296Z"},"links":{"cited_paper":"/paper/1904.06309","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:6450b55a01fcd7bc1108e78a6d1da5dbb7af02aac223a2655d245de6b50eef3a","observation_id":"bf073c3e-90b8-4014-b01c-3b99707dfda5","resolution":{"observed_at":"2026-08-09T16:44:30.661296Z","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-09T16:44:31.826916Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":"d9bda205-28f2-469a-9d66-1cb19e5194b6","year":2011},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.666218Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:06ea2681f44f3c6b6f258b634dd131b41aad4fb3bdfb2b3085f40c260e3e9ec5","observation_id":"eb509b7e-9c92-451e-b907-67c7d12772bc","resolution":{"observed_at":"2026-08-09T16:44:31.832242Z","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":"2205.14309","last_updated":"2023-03-01T02:54:36Z","snapshot_observed_at":"2026-08-18T04:43:45.322004Z","submitted_at":"2022-05-28T02:58:37Z","title":"Federated Neural Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14309","snapshot_observed_at":"2026-08-09T16:44:30.671155Z","title":"Federated neural bandits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.671155Z"},"links":{"cited_paper":"/paper/2205.14309","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:c17829dc42235c53087843f8b3c694a343e663c84ff56baa05af0b024aa632b1","observation_id":"a37e7c12-74da-4b97-af1f-d3df046fa9cf","resolution":{"observed_at":"2026-08-09T16:44:30.671155Z","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-09T16:44:31.810189Z","title":"Mm algorithms for generalized bradley-terry models","venue":null,"work_id":"e3c9e356-858f-481c-967c-bb898bf8764e","year":2004},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.676022Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:e135c70682c66a4a7c3d02947caea78742b6fda609b6cace420e8a089d7bc1da","observation_id":"0310b92a-cbeb-4838-a834-3520d5fab35a","resolution":{"observed_at":"2026-08-09T16:44:31.815497Z","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-09T16:44:30.680517Z","title":"Individual choice behavior: A theoretical analysis","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.680517Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:ebece628c0bea9f6bf44f258852b690327571242271169f602e9dd976923eba0","observation_id":"e49915c5-2aee-4af4-b4f2-9cd4d84d9d04","resolution":{"observed_at":"2026-08-09T16:44:30.680517Z","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-09T16:44:31.781273Z","title":"Provably optimal algorithms for generalized linear contextual bandits","venue":null,"work_id":"54ef40bb-948d-4bd3-b251-6ddc5b3a6e9a","year":2017},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.685050Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:cfdeb40cb00cc33b0a317030ca9e7a5a829ccef9c48d0c349a1951138361fcd7","observation_id":"2845876f-e9c2-484c-a9df-301063935b69","resolution":{"observed_at":"2026-08-09T16:44:31.786813Z","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-09T16:44:31.764167Z","title":"An efficient algorithm for generalized linear bandit: Online stochastic gradient descent and thompson sampling, 2021","venue":null,"work_id":"85bca3dc-7fa9-4b63-ba5c-6f49926b6bb4","year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.689468Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:f13d0e12c9ef2b0851f5eca333bc14882ee158138be7dec47577f0c3e5ec50a9","observation_id":"203ed17a-5354-448d-b028-4f27e3f4e7b3","resolution":{"observed_at":"2026-08-09T16:44:31.770150Z","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-09T16:44:31.748417Z","title":"Provably optimal algorithms for generalized linear contextual bandits, 2017","venue":null,"work_id":"452540bd-d94e-4882-bdd9-b68dc08560c5","year":2017},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.693880Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:e2a6c3f979a339d05c3d3958a728ffa4ee604fdc875b131e4a20317f1389e23a","observation_id":"4cc51e8f-a1a7-4e87-bef8-21cdbf0697d3","resolution":{"observed_at":"2026-08-09T16:44:31.753389Z","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-09T16:44:31.732261Z","title":"Stochastic linear contextual bandits with diverse contexts, 2020","venue":null,"work_id":"f2ea8ae8-6608-4989-8e76-f8ed9dfb8cd5","year":2020},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.698259Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:60f351c43784acc4ce74649d927fdc3b01801778b2cf3ad4aecd68a9cf152356","observation_id":"d2293822-a0c7-4d09-9814-3a3bda41aefe","resolution":{"observed_at":"2026-08-09T16:44:31.737455Z","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-09T16:44:31.716896Z","title":"Introduction to online convex optimization","venue":null,"work_id":"76c54cfa-00c6-4113-97c3-c7f7fc4ae928","year":2016},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.702817Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:82de0fcad4d94633704f8e186402ad49d51e9e8ceca72f72de11837ced5d5aa9","observation_id":"fa62f73f-e28b-4453-868b-a00a57ad32c4","resolution":{"observed_at":"2026-08-09T16:44:31.721883Z","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-09T16:44:30.707777Z","title":"Pytorch: An imperative style, high-performance deep learning library, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.707777Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:5bf187bca93f67bc18bf6e9d8d19e692b40468bba12d9ebcdec751984467cf5c","observation_id":"7d3dfd4e-b101-4311-9589-443baa777f08","resolution":{"observed_at":"2026-08-09T16:44:30.707777Z","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-09T16:44:30.712114Z","title":"Maxwell Harper and Joseph A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.712114Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:85d8809ce398305955dd24c6121ea39e27f2fe6f96f38dc389d748fec3c9625d","observation_id":"756803f1-11b3-4c55-ae04-ef25ca6f4918","resolution":{"observed_at":"2026-08-09T16:44:30.712114Z","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-09T16:44:31.681702Z","title":null,"venue":null,"work_id":"990bf226-8485-46a5-b345-a358bac7819b","year":2023},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.716699Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:b3cfc0cc0addf90da33312a45c94de4863d368ce113f79b3eb138aabbd926412","observation_id":"5d7b1568-ad13-4da8-b31e-ef0a7bf7a1d2","resolution":{"observed_at":"2026-08-09T16:44:31.686721Z","resolver_source":"raw_fallback","status":"unresolved"},"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-09T16:44:31.665577Z","title":"Privacy-preserving communication-efficient federated multi-armed bandits","venue":null,"work_id":"6be511c5-47c8-4f64-85ac-dce188c1a981","year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.720967Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:651b80fa9a636dadb5a5a43f4c56d83c35b8fc2f5cba9c7827cde0b87ce3d260","observation_id":"fe88f476-888f-493d-a311-a81604922466","resolution":{"observed_at":"2026-08-09T16:44:31.670852Z","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-09T16:44:30.725502Z","title":"Federated optimization in heterogeneous networks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.725502Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:1f4793c1d67a1c68997a5c4788c0997df418a052c177230bb4e0b6fadb6d2275","observation_id":"137dba6f-0446-4302-b75a-f1dfe2f3fe42","resolution":{"observed_at":"2026-08-09T16:44:30.725502Z","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-09T16:44:31.640039Z","title":"Federated multi-armed bandits with personalization","venue":null,"work_id":"f066e718-d1e3-4adf-95b5-197ceac36e51","year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.729970Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:f4e05fda1039c17c15863fac798b0e672d16ae237689bb9a3523eb5750fe01dd","observation_id":"5ea97f94-893a-4f55-aea1-f67de1cc8a14","resolution":{"observed_at":"2026-08-09T16:44:31.645038Z","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-09T16:44:31.624163Z","title":"Differentially-private federated linear bandits","venue":null,"work_id":"757c8fb0-29bf-4ed4-bb93-a740a21b6214","year":2020},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.734417Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:b7b93d934ee5f31cbfcbc215089200cad176e957f31d90bbc218d7b32cae8567","observation_id":"ad9a625a-0543-445e-9091-1386454c9288","resolution":{"observed_at":"2026-08-09T16:44:31.629428Z","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-09T16:44:31.608991Z","title":"Federated linear contextual bandits","venue":null,"work_id":"f109dbc6-ab99-4cab-8eab-a1aaa89310f4","year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.738801Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:1541c99daad34e08b4825f4d0b4c75f16fa04cf3f6f9d1d5c34dea855f72d75c","observation_id":"037818ac-9dce-4500-ad4e-15ede831960d","resolution":{"observed_at":"2026-08-09T16:44:31.614002Z","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-09T16:44:31.593358Z","title":"Asynchronous upper confidence bound algorithms for federated linear bandits","venue":null,"work_id":"e5040043-d97c-456c-a9e8-73658f7cd135","year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.743304Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:b7059be22d79a974329d6745cb8d13ddfd0bd76fa1560431f72bf9509fe7cd28","observation_id":"f8151a64-6b8f-495a-8ec6-abd0aa5eea52","resolution":{"observed_at":"2026-08-09T16:44:31.598607Z","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-09T16:44:31.577145Z","title":"Federated bayesian optimization via thompson sampling","venue":null,"work_id":"4727b6fb-0a5c-4e9d-b3fc-58d0132ecebd","year":2020},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.747815Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:cb0027ee1f5eb12166e75e5c78eca2c5ab51ff5d490804f238d8baef70c403c0","observation_id":"8fd4fba9-1b89-4e2c-b8a4-09e17687802a","resolution":{"observed_at":"2026-08-09T16:44:31.582316Z","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-09T16:44:31.560529Z","title":"Differentially private federated Bayesian optimization with distributed exploration","venue":null,"work_id":"22e28f65-bf9f-4d4b-a08b-58a0e60110cb","year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.752179Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:4d1537f4a7eb8a90ccc17bb6b02ff00909a77b2e0c65d0471bf2d23c25ff3bec","observation_id":"40a885bf-83d7-4785-9664-8a7c2101f993","resolution":{"observed_at":"2026-08-09T16:44:31.566125Z","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-09T16:44:31.543253Z","title":"Communication effi- cient distributed learning for kernelized contextual bandits","venue":null,"work_id":"5da64347-0ef9-4cea-ba57-a6a79157b9ad","year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.756879Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:de6be9fc1a11f478b58222d88728c13cd1a28002821f54f75fb7fe841682dba0","observation_id":"46a4ad3a-02be-4670-81c3-761d9ae43fde","resolution":{"observed_at":"2026-08-09T16:44:31.549317Z","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-09T16:44:31.526108Z","title":"Communication efficient federated learning for generalized linear bandits","venue":null,"work_id":"c04ec7b9-d123-45e8-96b0-4ae6d649fd9c","year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.761144Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:0a02ef0c87d2264481f78e9bcd13289824503c466e770a3f197cc8872139c980","observation_id":"07ece397-7cc1-462a-83df-8672ace8cbac","resolution":{"observed_at":"2026-08-09T16:44:31.532365Z","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-09T16:44:31.508692Z","title":"Federated bandit: A gossiping approach","venue":null,"work_id":"96a33dbb-8927-441a-85c4-9d2dce13438a","year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.765514Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:3bfa33af85fe0b243fb12522c24b1660bb92918e16c585975349e23216145abf","observation_id":"5d057f58-ba55-4a41-a522-e01b140f6fd7","resolution":{"observed_at":"2026-08-09T16:44:31.515346Z","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-09T16:44:31.486607Z","title":"SAMBA: A generic framework for secure federated multi-armed bandits","venue":null,"work_id":"972229b4-a5eb-47ca-a883-a03aff71c02c","year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.769986Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:9aff1500d38d1c43414d8bff5d637b82872f98152665c4edcd8384f989fc6269","observation_id":"9aaeca58-a1a0-4ca1-a301-41d65631143d","resolution":{"observed_at":"2026-08-09T16:44:31.492819Z","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-09T16:44:31.468417Z","title":"Federated linear contextual bandits with heterogeneous clients","venue":null,"work_id":"f9663548-297b-4106-ae8f-ce73b2011c44","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.774320Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:1a7df3d8dff752f515331b31151b479fd79b74b0b420de25c433798f7cf90fb6","observation_id":"10a13646-7ce7-45bb-9fd4-b9f1c9a87b7e","resolution":{"observed_at":"2026-08-09T16:44:31.473799Z","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-09T16:44:31.451522Z","title":"Federated linear bandits with finite adversarial actions","venue":null,"work_id":"b902f236-2bab-4d21-918b-ab53d638680f","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.779041Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:9ddf66f95e8caff04628163e1efb4a6bebb7f108f2cf89ca7029ce75858dbe8f","observation_id":"9556b793-7ff9-4703-b0ed-8e8008e9a8b6","resolution":{"observed_at":"2026-08-09T16:44:31.457066Z","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-09T16:44:31.434264Z","title":"Federated contextual cascading bandits with asynchronous communication and heterogeneous users","venue":null,"work_id":"ad0d6ea1-22c3-468b-976f-720a3fd18dad","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.783408Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:8493a1bdecfee7ee90ee632b803dd904d52c7932062847142884da149d6037ff","observation_id":"4566ef4e-0d80-4e85-81b5-22b0185f0df1","resolution":{"observed_at":"2026-08-09T16:44:31.439487Z","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":"2402.03531","last_updated":"2024-02-05T21:38:23Z","snapshot_observed_at":"2026-08-16T14:21:14.435910Z","submitted_at":"2024-02-05T21:38:23Z","title":"Fairness and Privacy Guarantees in Federated Contextual Bandits","version":1},"cited_work":{"arxiv_id":"2402.03531","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.03531","snapshot_observed_at":"2026-08-09T16:44:31.066536Z","title":"Fairness and Privacy Guarantees in Federated Contextual Bandits","venue":"cs.LG","work_id":"4a92af2f-0b16-4c02-aa12-4b2899a3b817","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.787983Z"},"links":{"cited_paper":"/paper/2402.03531","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:c5b8933252dc9580c475a1fc174ef2fae428d1d2f8c224f4cd509b474b6c529e","observation_id":"af91d08a-1c93-47d1-86cc-8259d2ff5e3b","resolution":{"observed_at":"2026-08-09T16:44:31.071904Z","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":"2405.05950","last_updated":"2024-05-09T17:40:09Z","snapshot_observed_at":"2026-08-16T13:53:57.741729Z","submitted_at":"2024-05-09T17:40:09Z","title":"Federated Combinatorial Multi-Agent Multi-Armed Bandits","version":1},"cited_work":{"arxiv_id":"2405.05950","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.05950","snapshot_observed_at":"2026-08-09T16:44:31.044755Z","title":"Federated Combinatorial Multi-Agent Multi-Armed Bandits","venue":"cs.LG","work_id":"976b0248-82b8-48f0-96ff-4329feb47fcf","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.792816Z"},"links":{"cited_paper":"/paper/2405.05950","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:744dc1e11157c98fbad2c5716c9614e2d8ab78ca9ef7e077b506078015808b7f","observation_id":"2cc90a37-5548-4637-9927-d69f55128f8d","resolution":{"observed_at":"2026-08-09T16:44:31.050027Z","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-09T16:44:31.418367Z","title":"Towards fair and scalable trial assignment in federated bandits: A shapley value approach","venue":null,"work_id":"9e21ca3b-6a78-4a70-a3fa-307053090b46","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.797505Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:bf4bcb80bf724f9c104b398c50b5b15ba476416dabd6011ac2ac093730eca773","observation_id":"6ea0dfaf-1418-4fed-b304-8222d5f60973","resolution":{"observed_at":"2026-08-09T16:44:31.423349Z","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-09T16:44:31.403297Z","title":"Federated x-armed bandit","venue":null,"work_id":"15df04ef-00e6-415c-9664-e4e0484819a5","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.801870Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:90dc79d3818089d34d03d41530b9696893f1a8097a345f43895a0a065680db81","observation_id":"d9541d69-0786-4852-ae4f-35c37eef8b1f","resolution":{"observed_at":"2026-08-09T16:44:31.408471Z","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":"2402.04485","last_updated":"2024-02-07T00:23:20Z","snapshot_observed_at":"2026-08-16T14:20:48.053597Z","submitted_at":"2024-02-07T00:23:20Z","title":"Incentivized Truthful Communication for Federated Bandits","version":1},"cited_work":{"arxiv_id":"2402.04485","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.04485","snapshot_observed_at":"2026-08-09T16:44:31.022477Z","title":"Incentivized Truthful Communication for Federated Bandits","venue":"cs.LG","work_id":"02afe7aa-6635-4bd1-a8dd-41e4966045db","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.806350Z"},"links":{"cited_paper":"/paper/2402.04485","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:ea8682872c0406b452124a298c455fb6766f0f5528d90d5a97dd5bf26ee7f639","observation_id":"e732fe57-d09b-40c3-a686-3e8656613f65","resolution":{"observed_at":"2026-08-09T16:44:31.027949Z","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":"2405.02881","last_updated":"2024-06-20T16:11:59Z","snapshot_observed_at":"2026-08-18T12:00:15.205559Z","submitted_at":"2024-05-05T10:28:06Z","title":"FedConPE: Efficient Federated Conversational Bandits with Heterogeneous Clients","version":2},"cited_work":{"arxiv_id":"2405.02881","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.02881","snapshot_observed_at":"2026-08-09T16:44:30.995871Z","title":"FedConPE: Efficient Federated Conversational Bandits with Heterogeneous Clients","venue":"cs.LG","work_id":"926577fc-297d-4a71-8890-a6ac500e9a69","year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.811035Z"},"links":{"cited_paper":"/paper/2405.02881","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:a5cc8244efbdbe087feaf788233004cf0bb9db822aaf4bb2fdf5a94e1812c38c","observation_id":"b5f2eac5-0e83-4829-9616-361bac5ee90c","resolution":{"observed_at":"2026-08-09T16:44:31.003701Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:44:30.816185Z","title":"Interactively optimizing information retrieval systems as a dueling bandits problem","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.816185Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:5144f1030988de4f72bc490f88519a531743b33bd91e937e6197c7e4c42eb841","observation_id":"eecb8cca-7f28-4fe7-94bf-370a212e9ba0","resolution":{"observed_at":"2026-08-09T16:44:30.816185Z","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-09T16:44:30.820535Z","title":"Beat the mean bandit","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.820535Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:cfe99e2892f055b06ec11ae6a970e4c6f66823dada5ea0b8b9b06ab539d347b1","observation_id":"e3b175f6-5e8c-44f0-aeb4-6cc4350f8332","resolution":{"observed_at":"2026-08-09T16:44:30.820535Z","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-09T16:44:30.824772Z","title":"Relative confidence sampling for efficient on-line ranker evaluation","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.824772Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:a98bb58b20bc149a771fa430882924861251b6f9b2ab74030539ab2e9d0cc863","observation_id":"6d2d1f2b-4163-44c7-b1f9-adc4ec8d8802","resolution":{"observed_at":"2026-08-09T16:44:30.824772Z","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-09T16:44:30.829111Z","title":"Reducing dueling bandits to cardinal bandits","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.829111Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:d4ae0b73d2d18c8395b70bb3224aaf783d9a9933186ca29637c88bb9e107b4ea","observation_id":"1d79a626-a366-47ee-b04e-734a2ad701c4","resolution":{"observed_at":"2026-08-09T16:44:30.829111Z","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-09T16:44:30.833450Z","title":"Relative upper confidence bound for the k-armed dueling bandit problem","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.833450Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:092889ef9219e988b29c828251bc8bc82d0299eca03e64db3c6e93dc8c9eb8d9","observation_id":"dcbc22ca-1626-4a67-be05-4be0a2cca0c5","resolution":{"observed_at":"2026-08-09T16:44:30.833450Z","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-09T16:44:30.837941Z","title":"Regret lower bound and optimal algorithm in dueling bandit problem","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.837941Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:22ef818d9a56c5b3875e7bf7b329fc835736f7eeb7f4ef64efb94cd5dc81e984","observation_id":"cb187285-c91b-4f8a-8337-5f9cd8ad9ac3","resolution":{"observed_at":"2026-08-09T16:44:30.837941Z","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-09T16:44:30.842427Z","title":"A relative exponential weighing algorithm for adversarial utility-based dueling bandits","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.842427Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:8ac9f55e347f0fcad96667973bb692605b45e6fb61efc911b089852d047508ad","observation_id":"38715afa-2eb5-4933-a09f-3adbd91a7305","resolution":{"observed_at":"2026-08-09T16:44:30.842427Z","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-09T16:44:31.317407Z","title":"Battle of bandits","venue":null,"work_id":"29e72372-d94d-4878-90d0-6b8e0878d3b8","year":2018},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.846978Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:a081287796afff20ac21884ae7c7b5894f92e9d8f64d7245f8fe99c6c976d67a","observation_id":"26944c7a-4895-4e62-9991-170435336106","resolution":{"observed_at":"2026-08-09T16:44:31.322326Z","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-09T16:44:31.301266Z","title":"Active ranking with subset-wise preferences","venue":null,"work_id":"413accad-e13c-4f84-997d-76c387842147","year":2019},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.851916Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:09db4fdec1c050b613a895e975e1c9922f64ee85b51a6fb099a5ad2138ccfea7","observation_id":"676e1c18-ce3d-4a36-9965-b3ceef27645d","resolution":{"observed_at":"2026-08-09T16:44:31.306195Z","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-09T16:44:31.285844Z","title":"Pac battling bandits in the plackett-luce model","venue":null,"work_id":"c8eb0301-254d-41fc-ac1c-8c990c5b09be","year":2019},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.856540Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:3cb9bfb57402ba718880a713a5cdcd9d3e83af9551a850b70b4d671fd53fbf97","observation_id":"83090f54-acb6-45c3-a71e-ecc3535b7518","resolution":{"observed_at":"2026-08-09T16:44:31.290771Z","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-09T16:44:31.269615Z","title":"Exploiting correlation to achieve faster learning rates in low-rank preference bandits","venue":null,"work_id":"23d21a2e-d9cf-4516-ae04-4606a52cb1be","year":2022},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.860924Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:037d0c96b5c83ec24e9a6211b3b77b9cdb3f207f91d258f862c31964aaa246a5","observation_id":"3d6b0f70-e7bc-4286-b072-c9b6ac55ab54","resolution":{"observed_at":"2026-08-09T16:44:31.274824Z","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-09T16:44:30.865345Z","title":"Principled reinforcement learning with human feedback from pairwise or k-wise comparisons","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.865345Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:5bf41388fbddcc2c8eeaa4e0bf7b11f159ca024ceb65ffa63bf44e5c760ad679","observation_id":"fe7a3489-0b84-40e2-8756-261e2b1f949a","resolution":{"observed_at":"2026-08-09T16:44:30.865345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00968","last_updated":"2024-10-15T03:38:23Z","snapshot_observed_at":"2026-08-16T14:55:58.788684Z","submitted_at":"2023-10-02T08:15:52Z","title":"Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.00968","snapshot_observed_at":"2026-08-09T16:44:30.869961Z","title":"Variance-aware regret bounds for stochastic contextual dueling bandits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.869961Z"},"links":{"cited_paper":"/paper/2310.00968","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:0795d7a24f64b233543aae5798daf8338fc957e4d72f2d8e235522c905907c14","observation_id":"b875cee5-1ded-443d-b9dd-af7bc89125d3","resolution":{"observed_at":"2026-08-09T16:44:30.869961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17112","last_updated":"2025-04-16T11:44:53Z","snapshot_observed_at":"2026-08-16T13:31:30.517519Z","submitted_at":"2024-07-24T09:23:22Z","title":"Neural Dueling Bandits: Preference-Based Optimization with Human Feedback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.17112","snapshot_observed_at":"2026-08-09T16:44:30.874716Z","title":"Neural dueling bandits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.874716Z"},"links":{"cited_paper":"/paper/2407.17112","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:6920bc145432fa5df294e1e11cbee365ece1c517431dd7219490f5df6400d6e7","observation_id":"61960fac-8467-445a-a0f6-c5e3c7642e02","resolution":{"observed_at":"2026-08-09T16:44:30.874716Z","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-09T16:44:31.241675Z","title":"Clustering of conversational ban- dits for user preference learning and elicitation","venue":null,"work_id":"27399ab1-49c2-4c6f-8037-75d8e8f35208","year":2021},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.879852Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:5762f877ae4bffb4775d044202e90a54423a55c03f8bbe923cc2cb444e7e6f3c","observation_id":"9601bc57-69b4-4912-8341-c336e83b416d","resolution":{"observed_at":"2026-08-09T16:44:31.246466Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.05359","snapshot_observed_at":"2026-08-09T16:44:30.884461Z","title":"Cas- cading bandits for large-scale recommendation problems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.884461Z"},"links":{"cited_paper":"/paper/1603.05359","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:5c23e3d380ad1b8cc4b179c5eb2f89925942a7f3eef7eb1e0bcc83e9fa2009c8","observation_id":"3d3a56b7-f7c2-4f83-8005-655014e5e597","resolution":{"observed_at":"2026-08-09T16:44:30.884461Z","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-09T16:44:31.225177Z","title":"Introduction to online convex optimization, 2023","venue":null,"work_id":"ecd84f87-42a7-4116-9937-996529046437","year":2023},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.890173Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:dc39f3fc1c3c2e3fb2f49e95f8e8c5fe0af5a1d432a432e10fbc5af0b3766318","observation_id":"ead6b72b-49ec-4bc9-8366-1e1531efe1a8","resolution":{"observed_at":"2026-08-09T16:44:31.229983Z","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-09T16:44:31.209940Z","title":"Then we have that Mt ≥ κµVt and that V −1 t ≥ κµM −1 t","venue":null,"work_id":"c740f28d-0a91-45f2-a406-e72b56f723e3","year":null},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.894867Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:c7a9f618cc97bfba67ebe45101ca0a3c93e57a13d2fd241267c976695b8ead5d","observation_id":"f8a431c4-d7be-4496-9bf6-a7c8610b9bcf","resolution":{"observed_at":"2026-08-09T16:44:31.214786Z","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-09T16:44:31.194303Z","title":"bad iterations","venue":null,"work_id":"73d8787b-e6ef-47e2-86f7-083b33484261","year":null},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.900161Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:ca68578a92a4e94bbae85b4ef1cede9e42b53d178532c4d99f084771b47a8097","observation_id":"e3a1b274-082c-4e22-b813-a39eb57ba768","resolution":{"observed_at":"2026-08-09T16:44:31.199379Z","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-09T16:44:31.179045Z","title":null,"venue":null,"work_id":"fab91e65-864f-4535-bd39-fbaa2b2363a3","year":null},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.905475Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:2dde038bbdbfb34a90810d5b3dbd8809545620bbc1accfd08c451e8e032e9fd4","observation_id":"6bf6128f-aa00-4fa7-a12c-b0c9d9834080","resolution":{"observed_at":"2026-08-09T16:44:31.183744Z","resolver_source":"raw_fallback","status":"unresolved"},"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-09T16:44:31.163362Z","title":"(33) Summing over s, we have that tX s=1 f fed s (eθt) ≥ tX s=1 f fed s (θt) +   tX s=1 ∇f fed s (θt)⊤   eθt − θt + αt 2 ∥eθt − θt∥2","venue":null,"work_id":"03c762dd-1313-4d59-9ec3-104d395283f2","year":null},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.910163Z"},"links":{"citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:9b977cdac97abaa5558096c9398bcacc2fb663669cfa10eaf04470153c576a7b","observation_id":"59dfaf9a-feec-47c4-9f4c-cf472ec63abd","resolution":{"observed_at":"2026-08-09T16:44:31.168499Z","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.01085","last_updated":"2025-06-03T03:29:00Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":26,"verified_exact":4,"verified_fuzzy":34},"total_outbound_references":64},"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 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2502.01085."}