{"as_of":"2026-08-18T00:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5d016bd5b639538700124778dbec3919aac66e99f82b0afdfe8673090b073310","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T22:03:14.932776Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2411.08167/citation-record","integrity":"/paper/2411.08167/integrity","json":"/paper/2411.08167/citation-record.json","paper":"/paper/2411.08167"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T22:03:14.672981Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.672981Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:6db8f6cc2ab8fa0265a920dea5a3b61fb61d5222735cc6ef2d52d59184982c07","observation_id":"650e72d9-4096-46a6-87e1-9a87e4aa51fb","resolution":{"observed_at":"2026-08-12T22:03:14.672981Z","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-12T22:03:14.681994Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.681994Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:04928f46d9bf2d7d8658e39e2209f47ba2f1eb04e28da7d9a0432f55d1bd2e9b","observation_id":"12d99804-912c-4c05-a915-ff1878d8b496","resolution":{"observed_at":"2026-08-12T22:03:14.681994Z","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-12T22:03:14.688641Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.688641Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:45031862ba0309abdb77d5822590c17c13c092d78222b2a146adfb7443dfed04","observation_id":"c622df53-d566-4d0f-bcda-c6b979918406","resolution":{"observed_at":"2026-08-12T22:03:14.688641Z","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-12T22:03:14.696174Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.696174Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:1abcf9acf55c7eed3c7ad3ccd3357b8c7c409d78c47341da0e6196dbc4801e0d","observation_id":"dad990b7-2fb3-4eea-9829-31760e881857","resolution":{"observed_at":"2026-08-12T22:03:14.696174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1804.09028","last_updated":"2018-04-24T13:40:09Z","snapshot_observed_at":"2026-08-14T19:22:33.311363Z","submitted_at":"2018-04-24T13:40:09Z","title":"Estimate and Replace: A Novel Approach to Integrating Deep Neural Networks with Existing Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.09028","snapshot_observed_at":"2026-08-12T22:03:14.703939Z","title":"Software","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.703939Z"},"links":{"cited_paper":"/paper/1804.09028","citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:d1223f56d5fb4aa94e585a657f3c54555ba2280c05040fe1e3d6c74cd44f2e0c","observation_id":"f88c9cb0-dcb9-4f11-bd88-ad033d2cfdb3","resolution":{"observed_at":"2026-08-12T22:03:14.703939Z","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-12T22:03:15.799376Z","title":"Contextual bandit algorithms with supervised learning guarantees","venue":null,"work_id":"a84cd5ea-d073-4703-9fbb-f8e5c57127f4","year":2011},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.716594Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:4cd0bcfb937cb87c381f944d4683365385354814acf89312128848c64c528b15","observation_id":"abcca6f5-12fb-41d5-b09f-fdb4546c863f","resolution":{"observed_at":"2026-08-12T22:03:15.806640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.764021Z","title":"Stochastic linear bandits robust to adversarial attacks","venue":null,"work_id":"fcada4d9-2849-46c9-b320-cdfbad9ee852","year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.722676Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:4acd20847df3bfd2f37095bef429b058df4c1921b8d2b9e3673385f01668c18b","observation_id":"b977f59e-fc10-48c9-839c-69d03c253e6c","resolution":{"observed_at":"2026-08-12T22:03:15.773584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18784","last_updated":"2024-07-02T23:21:45Z","snapshot_observed_at":"2026-08-17T09:13:28.913157Z","submitted_at":"2023-05-30T06:35:49Z","title":"Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits","version":2},"cited_work":{"arxiv_id":"2305.18784","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.18784","snapshot_observed_at":"2026-08-12T22:03:15.081885Z","title":"Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits","venue":"cs.LG","work_id":"6a41ab0c-668f-44fe-b968-bb531c8a1383","year":2023},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.729249Z"},"links":{"cited_paper":"/paper/2305.18784","citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:6aea3010b16bafb508db762bbd31565bfbe1736cf65273f3fdbd4f6a07a041df","observation_id":"97386f91-32e4-4b73-a5f1-008e412e4fe8","resolution":{"observed_at":"2026-08-12T22:03:15.089588Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.731451Z","title":"Contextual bandits with linear payoff functions","venue":null,"work_id":"975c72cf-fd5b-4781-84d2-f56cc73502d5","year":2011},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.736446Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:281a7fc6bbe6637ccb94840ca5e62bca0f365e1a8c45c96c03e7533e9d8f5a54","observation_id":"71b08e53-6f6c-438f-a384-f201e5b423e7","resolution":{"observed_at":"2026-08-12T22:03:15.739008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.708098Z","title":"Concentration of measure for the analysis of randomized algorithms","venue":null,"work_id":"cc098697-8388-4e9f-aff5-9b50bcdd97b3","year":2009},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.742132Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:237c3ebf03d5dbe62beadc7159c9a635d04df8acfa7297ee561dcb07510bfed3","observation_id":"d40d7df1-2b3b-4cd2-a850-508839332fe7","resolution":{"observed_at":"2026-08-12T22:03:15.715903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:14.748795Z","title":"Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.748795Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:1bb543f3d319e733c4b8d1344f9cb299f85698dc2e9dc8834fa4fbe3a7692718","observation_id":"ad8d9923-48a7-4d26-bc31-b87c4875e77f","resolution":{"observed_at":"2026-08-12T22:03:14.748795Z","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-12T22:03:15.671974Z","title":"Better algorithms for stochastic bandits with adversarial corruptions","venue":null,"work_id":"dc648931-4d40-40d4-b462-eb6b68cc3406","year":2019},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.754909Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:92ae5c7dbf02a047fa2764c11e20658aed67d253b13b2e34ad20f11823bbc58c","observation_id":"a6369b98-6713-4ce6-8338-da39ce2c6ca4","resolution":{"observed_at":"2026-08-12T22:03:15.680220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.650630Z","title":"Distributed exploration in multi-armed bandits","venue":null,"work_id":"faca5df8-b965-4cdb-a516-31aa0f4cd21b","year":2013},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.761725Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:f3e0d650b7a2fe831e89b2c79481a21c245af92e46f3fd6fce88e3201895a8f3","observation_id":"d7170273-ce16-47d9-a4f2-9ec46337ab57","resolution":{"observed_at":"2026-08-12T22:03:15.657776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.629042Z","title":"Bayesian exploration with heterogeneous agents","venue":null,"work_id":"1e1c2919-15e8-4e6c-9626-70a02d6ec080","year":2019},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.768181Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:663420f5248204dae9f9103819412813a008e908fe498dc6905f30ecff6e2b50","observation_id":"613865b0-ac49-481a-963f-89ed214bb464","resolution":{"observed_at":"2026-08-12T22:03:15.634699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:14.775832Z","title":"Corruption-tolerant bandit learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.775832Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:69f5eedb206869ffdc386dfae4da46266b861a8120f757f3ba0c63a7dc90b0b5","observation_id":"3bf9ae6d-e098-4488-8e43-bf90d1bc1426","resolution":{"observed_at":"2026-08-12T22:03:14.775832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04207","last_updated":"2021-06-08T09:32:43Z","snapshot_observed_at":"2026-08-16T18:18:49.297083Z","submitted_at":"2021-06-08T09:32:43Z","title":"Cooperative Stochastic Multi-agent Multi-armed Bandits Robust to Adversarial Corruptions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.04207","snapshot_observed_at":"2026-08-12T22:03:14.782089Z","title":"Cooperative stochastic multi-agent multi-armed bandits robust to adversarial corruptions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.782089Z"},"links":{"cited_paper":"/paper/2106.04207","citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:c144453dc7b8c2cba66231e3bffe7e6d80faf6cbbda6baad6c09abafff74a968","observation_id":"190e10bc-7dcd-45e8-b242-a694b53fce96","resolution":{"observed_at":"2026-08-12T22:03:14.782089Z","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-12T22:03:15.597901Z","title":"Distributed learning in multi-armed bandit with multiple players","venue":null,"work_id":"182be5af-273b-4142-b0d6-dfe2784dea2d","year":2010},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.788353Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:6d13bb7f3ebee8ffef7027ece60136759c2ac189073fcc03b277be56cc38b910","observation_id":"04f8fb04-b871-48ec-9f1c-a123bb819fab","resolution":{"observed_at":"2026-08-12T22:03:15.603672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.577567Z","title":"Stochastic bandits robust to adversarial corruptions","venue":null,"work_id":"b782e9bf-89bf-4a61-89ef-545eb2428c8b","year":2018},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.795096Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:641c573d61f45f6940bcc116aaf7ae09f09c8bee767c518a086dfbfeb9858312","observation_id":"3326743e-c030-451c-af2e-ea535bbd6a92","resolution":{"observed_at":"2026-08-12T22:03:15.584569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.07817","last_updated":"2022-11-15T00:43:26Z","snapshot_observed_at":"2026-08-16T16:16:12.285185Z","submitted_at":"2022-11-15T00:43:26Z","title":"Multi-Player Bandits Robust to Adversarial Collisions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.07817","snapshot_observed_at":"2026-08-12T22:03:14.801396Z","title":"Multi-player bandits robust to adversarial collisions","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.801396Z"},"links":{"cited_paper":"/paper/2211.07817","citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:0fcc3f783fee90a7a0ee4fd3d326625c1a6230bc210c41030edecc73a817bc1c","observation_id":"ae191be3-bf68-4cc0-bd1f-8eccc9d76934","resolution":{"observed_at":"2026-08-12T22:03:14.801396Z","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-12T22:03:15.555133Z","title":"A practical algorithm for multiplayer bandits when arm means vary among players","venue":null,"work_id":"61c69fe0-14d9-4201-8519-61985a59b0bc","year":2020},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.808066Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:e8f356294b7e51ca152284b786d22ae003a7d6d88dbb4253ae15a022ff084961","observation_id":"467a2b41-ed47-491f-a754-73e7bebe3c71","resolution":{"observed_at":"2026-08-12T22:03:15.562096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.528560Z","title":"Robust federated best-arm identification in multi-armed bandits","venue":null,"work_id":"47932e2d-e84f-4aca-911c-3abf1087f9e2","year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.813503Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:e4e23f242242e3a8b92ee29593f26f772944a053f67442503512d1a3dd456b54","observation_id":"20a26b3b-f62a-4d24-92f1-89117cebb20a","resolution":{"observed_at":"2026-08-12T22:03:15.541355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.505402Z","title":"Heterogeneous multi-player multi-armed bandits: Closing the gap and generalization","venue":null,"work_id":"44baef76-9a66-4797-aec5-ef390012546a","year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.819003Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:a5d065afd71b5cf936f000a7d11736f52529b52d5926c0aa07c452a41ee6577e","observation_id":"b789f0b2-2d99-4bc0-9c30-1053438000a6","resolution":{"observed_at":"2026-08-12T22:03:15.513340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.476065Z","title":"Multi-armed bandits in recommendation systems: A survey of the state-of-the-art and future directions","venue":null,"work_id":"77d86527-4f5e-43bb-8db6-83f1e979ac19","year":2022},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.825564Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:42ec3019ef96c7d5041c7fef12c529542c6ac4580561c52491484367fd721ab5","observation_id":"73ed3029-cb4b-47c6-8eee-2b1723beba50","resolution":{"observed_at":"2026-08-12T22:03:15.484750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.454976Z","title":"Stochastic online shortest path routing: The value of feedback","venue":null,"work_id":"00258966-f0b3-404d-a959-0a324377c115","year":2017},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.830937Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:a73da5d27eb59f1e9c6a68ebc8449bc3bfb4e4b47ba10053dc34209759785dc2","observation_id":"2521a85c-66c6-4082-ae11-5a5f3a707c18","resolution":{"observed_at":"2026-08-12T22:03:15.461910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.425446Z","title":"Robust multi-agent multi-armed bandits","venue":null,"work_id":"fa55f263-807f-4a90-95da-424b13c00d4a","year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.836649Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:41d0d34c66f809d35615529397096bd02c4ec877456d33549969c74fc24226d1","observation_id":"6bdebaae-fbb5-419f-ba95-1bd4fe399bbe","resolution":{"observed_at":"2026-08-12T22:03:15.433712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.398341Z","title":"Robust multi-agent bandits over undirected graphs","venue":null,"work_id":"536d74d8-db38-4f68-830d-af593ad2f2c9","year":2022},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.841740Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:003e62852522de9a13c228fe49c8dc4e6968c5ea1c62170c2b9beeb5ac908fed","observation_id":"69b2c3f2-2911-4622-9f70-f4b476c6afc1","resolution":{"observed_at":"2026-08-12T22:03:15.407230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.372512Z","title":"Optimal algorithms for multiplayer multi-armed bandits","venue":null,"work_id":"c16dde76-e945-4c30-9b0f-061adb8a7584","year":2020},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.847950Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:62c57905ca4cf818dbafdf602e724306fe48e021a4f5c8e213be8ce003979778","observation_id":"baa4cc3f-7add-4eb2-977e-cf6ae76dbd9c","resolution":{"observed_at":"2026-08-12T22:03:15.379007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.344324Z","title":"Achieving near-optimal individual regret & low communications in multi-agent bandits","venue":null,"work_id":"e9e9ee5d-4cb5-4830-9f21-e1daf898ae99","year":2023},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.855278Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:52644faf505dadaef49108bc80163c19c19a041aac1a5cc2b44cd44c3b7aedca","observation_id":"d19cc547-77c8-469f-ac4a-1e37f43cced8","resolution":{"observed_at":"2026-08-12T22:03:15.350753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.324642Z","title":null,"venue":null,"work_id":"5417c858-979c-4962-8cef-b305c9fe5afd","year":2023},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.860567Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:89a29f0fe6ae3ced0349390896294c82f5747633608bf415a2186110e9539517","observation_id":"b130cbd1-0e10-456a-be7a-1ce98a1a48dd","resolution":{"observed_at":"2026-08-12T22:03:15.329893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.305461Z","title":null,"venue":null,"work_id":"ba07e846-20db-43c2-86be-ac3b1e2fb422","year":2023},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.866066Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:67672a3b5a1afda7563ddbf082d1109ed3192cf5aa1871253e9d189774bb5188","observation_id":"da4bc341-81c4-4aa6-bb8e-424743159ad6","resolution":{"observed_at":"2026-08-12T22:03:15.312038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.282140Z","title":"A model selection approach for corruption robust reinforcement learning","venue":null,"work_id":"c61c2d66-c614-4487-9911-586e45dc2134","year":2022},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.875666Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:2a8ca0a54870ceb061c6495670e50120c5e9411dc1fb7a981e80a542ffad9527","observation_id":"6e7e7293-a499-4211-b15a-40a151e98cd7","resolution":{"observed_at":"2026-08-12T22:03:15.289093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.255789Z","title":"Adversarial bandits with corruptions: Regret lower bound and no-regret algorithm","venue":null,"work_id":"a8de8c74-ea59-436d-8398-f30e3c3d34bb","year":2020},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.882699Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:1aa6f37be236ecd99afd1ee7431e25740d6e24f6b9c5b66e6afc4d33a6ef6c33","observation_id":"1c7da1c4-af52-4618-aacc-6bca012710f1","resolution":{"observed_at":"2026-08-12T22:03:15.267717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:14.892286Z","title":"Cooperative stochastic bandits with asynchronous agents and constrained feedback","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.892286Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:fc45f4da45a6e0db5e8b93e302e262f4765a5f29ecf2ed97ec72cb70849bf88a","observation_id":"9e14ac72-5c05-40f8-be44-64ce928cabf8","resolution":{"observed_at":"2026-08-12T22:03:14.892286Z","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-12T22:03:15.216400Z","title":"Distributed bandits with heterogeneous agents","venue":null,"work_id":"5c29e50f-ca0a-4cb3-b6e6-ee46d45ee0a0","year":2022},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.899099Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:4b9f9a979f6b1b79dbb8a9d554b80dd3367ee7f011d242202229c22956da52f2","observation_id":"6216e3b4-7de1-4f25-b107-15777725ac22","resolution":{"observed_at":"2026-08-12T22:03:15.224384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.12615","last_updated":"2021-10-25T02:53:24Z","snapshot_observed_at":"2026-08-16T17:46:56.427651Z","submitted_at":"2021-10-25T02:53:24Z","title":"Linear Contextual Bandits with Adversarial Corruptions","version":1},"cited_work":{"arxiv_id":"2110.12615","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.12615","snapshot_observed_at":"2026-08-12T22:03:14.991772Z","title":"Linear Contextual Bandits with Adversarial Corruptions","venue":"cs.LG","work_id":"d8ec904c-4806-4756-9fee-df2f7b58cf98","year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.905871Z"},"links":{"cited_paper":"/paper/2110.12615","citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:dbf1c327477c5db7ca251a1b8516fe561a4f97140094f958d03129fb9f52a563","observation_id":"fd60090a-87ca-4871-8e77-8ecfe6000492","resolution":{"observed_at":"2026-08-12T22:03:15.002790Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.193869Z","title":"A privacy-preserving distributed contextual federated online learning framework with big data support in social recommender systems","venue":null,"work_id":"6243ad11-3b59-4865-897e-055c36ea7cda","year":2019},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.913175Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:b1b68ac145a8ddd6e0eeaf546a756b424c2510dc2964c08af751c855e1e1e367","observation_id":"052e7b65-a0e8-423d-ad44-0ae6f1fc62a1","resolution":{"observed_at":"2026-08-12T22:03:15.200669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:15.172069Z","title":"Toward optimal adaptive online shortest path routing with acceleration under jamming attack","venue":null,"work_id":"85705f8b-7f64-4637-95b5-ba33d9f1d7c2","year":2019},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.919108Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:3a290ddbea883d1d6038b7bf70d6de6ae52df41bc9abfc9a862358578bea7ea7","observation_id":"d01d5ec9-fb75-43c5-a7ca-329841acaa5c","resolution":{"observed_at":"2026-08-12T22:03:15.179823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T22:03:14.924822Z","title":"Tsallis-inf: An optimal algorithm for stochastic and adversarial bandits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.924822Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:176eba1f012b874c8f68714115e4086e5a1d7fb3ad45b54c3442f16b93975708","observation_id":"70d28303-beac-4f13-9cc2-7171673155fb","resolution":{"observed_at":"2026-08-12T22:03:14.924822Z","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-12T22:03:15.136650Z","title":"Online shortest path routing: The value of information","venue":null,"work_id":"20d94f3d-7768-4cd7-a557-7c1e54b3db8e","year":2014},"citing_paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T22:03:14.932776Z"},"links":{"citing_paper":"/paper/2411.08167"},"observation_digest":"sha256:34378c93f5a6ce7005846018dd6a75ad8985ca2cd1862e535173a4ff7d0a348b","observation_id":"2b7c2d1f-0920-4ed8-b179-9ae6bf0c03fb","resolution":{"observed_at":"2026-08-12T22:03:15.143271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.08167","last_updated":"2024-11-12T20:20:26Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T03:46:52.869489Z","submitted_at":"2024-11-12T20:20:26Z","title":"Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":24},"total_outbound_references":39},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2411.08167."}