{"as_of":"2026-08-19T00:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb400f2b56ce0691734b95c0910ec830affca5d04dcfd43882f3a9fd02b08c9b","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:29:08.831068Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"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/2608.10529/citation-record","integrity":"/paper/2608.10529/integrity","json":"/paper/2608.10529/citation-record.json","paper":"/paper/2608.10529"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T14:29:09.102928Z","title":"Some aspects of the sequential design of experiments,","venue":null,"work_id":"f879fac1-4a6e-4a87-9ae9-c32d0bf1f232","year":1952},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.762717Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:e09005aa0789930bcbbca4ade5061e6750da0045f2283bb6e23adc114a712cd2","observation_id":"68ae550b-b91e-4d6f-b1f4-fe46b8236463","resolution":{"observed_at":"2026-08-15T14:29:09.107360Z","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-15T14:29:08.767906Z","title":"On the likelihood that one unknown probability exceeds another in view of the evidence of two samples,","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.767906Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:d00e51c5c0c263ac4a0be32fa351dac0b2809e7cffbffe07f6e0153cf2de065a","observation_id":"d604ff1d-edd3-4b3c-8998-aaa3d6ececb0","resolution":{"observed_at":"2026-08-15T14:29:08.767906Z","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-15T14:29:09.076907Z","title":"Competitive collaborative learning,","venue":null,"work_id":"20497f42-ea8d-4abc-8023-c23d01dc6020","year":2008},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.772589Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:db1a17fa0aef03eba4ab2d0de7d0c4ace9bfa45d668b65a935490f9b1528ebca","observation_id":"09b4b8c6-27b7-4acd-8655-268ffb595cbe","resolution":{"observed_at":"2026-08-15T14:29:09.081096Z","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-15T14:29:09.063076Z","title":"Gossip-based distributed stochastic bandit algorithms,","venue":null,"work_id":"9c705d61-a9a7-43aa-a488-3bd865c37244","year":2013},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.776634Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:990a7d6ad917bba3a2c8eb5da151186a5e946cfdd5d6531b68399d757c1d651f","observation_id":"99ed2fd7-c981-4a4b-9149-605a1a4b52ea","resolution":{"observed_at":"2026-08-15T14:29:09.067617Z","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-15T14:29:09.049427Z","title":"Decentralized learning for multi- player multiarmed bandits,","venue":null,"work_id":"cdbd8852-ebe9-4a77-92fb-3b2384aa7fe6","year":2014},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.780783Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:e4d17c2ef54efcb7d513a45a5bae23ff16d8e345698681b213d705455e0f528b","observation_id":"f154e8b1-8179-41a1-a8f9-ea40aacd5745","resolution":{"observed_at":"2026-08-15T14:29:09.053539Z","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-15T14:29:09.035941Z","title":"Multi-player multi-armed bandits with collision- dependent reward distributions,","venue":null,"work_id":"292a1832-e12c-4c7d-b655-22f16fd30c22","year":2021},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.785741Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:08ba658337901edf68bf16f84047eac725b5fa7773fd06c1605b439f3a88bc31","observation_id":"9db6ddf2-3ad0-45e3-b35d-07fb5d0eb248","resolution":{"observed_at":"2026-08-15T14:29:09.040262Z","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":"2109.03818","last_updated":"2021-09-07T18:18:58Z","snapshot_observed_at":"2026-08-16T17:58:14.759316Z","submitted_at":"2021-09-07T18:18:58Z","title":"Online Learning for Cooperative Multi-Player Multi-Armed Bandits","version":1},"cited_work":{"arxiv_id":"2109.03818","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.03818","snapshot_observed_at":"2026-08-15T14:29:08.890020Z","title":"Online Learning for Cooperative Multi-Player Multi-Armed Bandits","venue":"cs.LG","work_id":"07a02466-fb50-4690-8aa2-646f3465bfb0","year":2021},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.790420Z"},"links":{"cited_paper":"/paper/2109.03818","citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:96adc0a8b1751652a65e5ff3a1102b13751841964f148a026cdbd9d2ae9f4013","observation_id":"09b7f914-bc72-4213-af2d-54480a202786","resolution":{"observed_at":"2026-08-15T14:29:08.895048Z","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":"2311.06210","last_updated":"2023-11-10T17:55:44Z","snapshot_observed_at":"2026-08-17T18:34:33.921452Z","submitted_at":"2023-11-10T17:55:44Z","title":"Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication","version":1},"cited_work":{"arxiv_id":"2311.06210","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.06210","snapshot_observed_at":"2026-08-15T14:29:08.866393Z","title":"Optimal Cooperative Multiplayer Learning Bandits with Noisy Rewards and No Communication","venue":"cs.LG","work_id":"084376b1-075a-4cd8-9842-06c9bde3f4cb","year":2023},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.794871Z"},"links":{"cited_paper":"/paper/2311.06210","citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:bfb17dc83182e96e01e9a28a08c2099ac87c5b10a6d7ae5b32b0497b123bb567","observation_id":"b7b1c62e-4526-43b8-8f8e-5e3286f00657","resolution":{"observed_at":"2026-08-15T14:29:08.873684Z","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-15T14:29:09.021271Z","title":"A survey on multi-player bandits,","venue":null,"work_id":"fbfdbbe6-7f54-4963-8c75-80b2f9e20c2a","year":2024},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.799494Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:eff19981e1a86dff08eabe51e4a0351d24c913fef287dcd47f13289745b520a9","observation_id":"141758a2-1d63-43ba-8e6b-612d6d2e5287","resolution":{"observed_at":"2026-08-15T14:29:09.025699Z","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-15T14:29:09.006847Z","title":"Bandits with heavy tail,","venue":null,"work_id":"c2c28174-51d2-4f54-b27f-7ec77fbb7acf","year":2012},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.803479Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:033a25e26c6ac02295dbf8a9394b71b189f91440803f609d5543d444c0109c65","observation_id":"16858117-f499-4313-8726-9d6dd450f97f","resolution":{"observed_at":"2026-08-15T14:29:09.011114Z","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-15T14:29:08.991363Z","title":"Deterministic sequencing of exploration and exploitation for multi-armed bandit problems,","venue":null,"work_id":"ffbf444e-5134-43e9-b9b1-9e9ad9714c92","year":2013},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.807453Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:0c649f198d83e54989d1f918be2a5ca9ef3e5425492614e41af6344b54b2f0f6","observation_id":"51c9ba4e-fc78-4b2b-bf64-b45942a6f819","resolution":{"observed_at":"2026-08-15T14:29:08.996239Z","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-15T14:29:08.976643Z","title":"Pure exploration of multi- armed bandits with heavy-tailed payoffs.,","venue":null,"work_id":"9eab3092-9c5c-485d-8798-4c2ff2bbaad8","year":2018},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.811318Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:910e18c43d1642eb3c0020e28f86da80948f179dfb21376417f5c922b3388538","observation_id":"ee7517e3-cc40-4012-8bca-bd1082bd2ef1","resolution":{"observed_at":"2026-08-15T14:29:08.981463Z","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-15T14:29:08.961258Z","title":"Almost optimal algorithms for linear stochastic bandits with heavy-tailed payoffs,","venue":null,"work_id":"405d72bb-5128-4a61-86cd-e31e1c23fbea","year":2018},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.815513Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:031dff51bbdc81e080d875194c9b545a97712e92de30dfdaa2bb0575fb0e47f1","observation_id":"0118c07f-47dc-4eef-8436-e3745a41a5d1","resolution":{"observed_at":"2026-08-15T14:29:08.966281Z","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-15T14:29:08.945629Z","title":"Minimax optimal bandits for heavy tail rewards,","venue":null,"work_id":"104eb00a-2e01-4976-ad3c-6aacc1d17a1f","year":2024},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.819567Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:d484c1fd7f1c94949eded10ba0aa5ad4d0cb30e802426974be2fc6db286f20c9","observation_id":"66f362fb-b338-4dbd-aa25-00a27fb094df","resolution":{"observed_at":"2026-08-15T14:29:08.950543Z","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-15T14:29:08.932243Z","title":"Catoni-style confidence sequences for heavy- tailed mean estimation,","venue":null,"work_id":"5505f839-37d5-453a-9835-150de6764b24","year":2023},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.823233Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:f87e48c8393b6317357d02aa954741b9c06ff11c9ab08f869528090f04ffc827","observation_id":"f77943eb-1f42-41c3-966b-03e81884aa88","resolution":{"observed_at":"2026-08-15T14:29:08.936445Z","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-15T14:29:08.919077Z","title":"Cooperative multi-agent bandits with heavy tails,","venue":null,"work_id":"73b7415c-fe0b-4ac4-9987-15fc5b51f355","year":2020},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.827235Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:de1ee98b434c99e397fbc42f9e970a6db90407b0c44ec88c8d4dcee9a2b78413","observation_id":"6d77b853-b69f-494d-b7f2-cb224df82c9d","resolution":{"observed_at":"2026-08-15T14:29:08.923096Z","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-15T14:29:08.904846Z","title":"Multi-agent multi-armed bandit with fully heavy- tailed dynamics,","venue":null,"work_id":"275ed1c9-0368-48fa-b91e-607138b8aa55","year":2025},"citing_paper":{"arxiv_id":"2608.10529","last_updated":"2026-08-11T06:10:42Z","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T14:29:08.831068Z"},"links":{"citing_paper":"/paper/2608.10529"},"observation_digest":"sha256:8f2d02a6f5e80c91214bafbead3ff3213db4ae4140dc3ea508d6f8a9bd3725bd","observation_id":"15abbc86-84dd-4595-9d12-7cf76cba8f16","resolution":{"observed_at":"2026-08-15T14:29:08.908843Z","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":"2608.10529","last_updated":"2026-08-11T06:10:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T06:44:15.286375Z","submitted_at":"2026-08-11T06:10:42Z","title":"Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":2,"verified_fuzzy":14},"total_outbound_references":17},"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 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2608.10529."}