Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information
As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2102.10200.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-23T06:30:58.430688+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-08T13:31:44.701536Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T18:51:08.859090Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 34065455-6307-46f2-b75c-552d4d9a8d55 · inbound
Bandit Learning in General Open Multi-agent Systems cites this paper.
Bandit Learning in General Open Multi-agent Systems A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information
Reference 241
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T18:51:08.861393Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.