{"as_of":"2026-08-17T22:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5ea80db4a70533b22324799d55c8924dd6520809126c73dfa804791cacac0c96","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:34:44.958023Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T14:29:08.866393Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06210","snapshot_observed_at":"2026-08-15T19:34:32.352464Z","title":"Optimal cooperative multiplayer learning bandits with noisy rewards and no communication","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.15856","last_updated":"2025-06-18T20:04:43Z","snapshot_observed_at":"2026-08-15T19:28:23.100194Z","submitted_at":"2025-06-18T20:04:43Z","title":"Learning to Coordinate Under Threshold Rewards: A Cooperative Multi-Agent Bandit Framework","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T19:34:32.352464Z"},"links":{"cited_paper":"/paper/2311.06210","citing_paper":"/paper/2506.15856"},"observation_digest":"sha256:835d7671fcf32614e7bda18808fb8dbedd2f9fc559c38c31c9b37a3b16b108ca","observation_id":"bf4a7aca-b7d9-4bdf-874d-60d88e9f27d5","resolution":{"observed_at":"2026-08-15T19:34:32.352464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06210","snapshot_observed_at":"2026-08-15T14:31:10.488840Z","title":"Optimal cooperative multiplayer learning bandits with noisy rewards and no communication,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.10526","last_updated":"2026-08-11T06:06:12Z","snapshot_observed_at":"2026-08-15T14:16:11.425355Z","submitted_at":"2026-08-11T06:06:12Z","title":"Coordinating the Unknown Lipschitz Constant in Multiplayer Bandits","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T14:31:10.488840Z"},"links":{"cited_paper":"/paper/2311.06210","citing_paper":"/paper/2608.10526"},"observation_digest":"sha256:f08f3f5812e575791208ca209b112d6cce0aad9fbef128e84f37f3c3dbcfa67d","observation_id":"bf4e7fb9-0bb7-4518-9214-8d04b84de3d4","resolution":{"observed_at":"2026-08-15T14:31:10.488840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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:81d60d8be39e712a3075d72a2707fca2276cb313cd209e51a0a1fa7bdb39309a","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-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":"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06210","snapshot_observed_at":"2026-08-16T00:34:44.958023Z","title":"Optimal cooperative multiplayer learning bandits with noisy rewards and no communication,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.11873","last_updated":"2026-08-12T09:57:58Z","snapshot_observed_at":"2026-08-16T00:21:44.378530Z","submitted_at":"2026-08-12T09:57:58Z","title":"DCM Bandits: Multiplayer Information Asymmetric Cascading Bandits for Multiple Clicks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T00:34:44.958023Z"},"links":{"cited_paper":"/paper/2311.06210","citing_paper":"/paper/2608.11873"},"observation_digest":"sha256:d0f98b37671e8ee6520af22d004c152c54c44a93034216b02a0dab792a615c1f","observation_id":"4936443f-d52f-419d-880c-eb85a42ea507","resolution":{"observed_at":"2026-08-16T00:34:44.958023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06210","snapshot_observed_at":"2026-08-16T00:06:35.401617Z","title":"arXiv preprint arXiv:2311.06210 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.12753","last_updated":"2026-08-13T03:06:11Z","snapshot_observed_at":"2026-08-16T23:10:56.374888Z","submitted_at":"2026-08-13T03:06:11Z","title":"Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T00:06:35.401617Z"},"links":{"cited_paper":"/paper/2311.06210","citing_paper":"/paper/2608.12753"},"observation_digest":"sha256:b05352585ae290d23f539bf1b13f92e06da8eb03e8b7b217076726d816b12865","observation_id":"9e5c7185-99ba-44e1-8684-5d060dfbaf9c","resolution":{"observed_at":"2026-08-16T00:06:35.401617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.06210/citation-record","integrity":"/paper/2311.06210/integrity","json":"/paper/2311.06210/citation-record.json","paper":"/paper/2311.06210"},"outbound":[],"paper":{"arxiv_id":"2311.06210","last_updated":"2023-11-10T17:55:44Z","latest_version":1,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2311.06210."}