{"as_of":"2026-08-23T10:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6be09e8fd8bd9e5fb3f588ab404dfc2f185d6744a05ac57495f4a03de003e2c","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T13:31:44.701536Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T18:51:08.859090Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.10200","last_updated":"2021-02-19T23:10:48Z","snapshot_observed_at":"2026-08-16T18:44:18.605191Z","submitted_at":"2021-02-19T23:10:48Z","title":"A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information","version":1},"cited_work":{"arxiv_id":"2102.10200","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.10200","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A high performance, low complexity algorithm for multi-player bandits without collision sensing information","venue":null,"work_id":"0c1492be-bf49-4757-9ce1-ea25fdaf7645","year":2021},"citing_paper":{"arxiv_id":"2605.06202","last_updated":"2026-05-07T13:10:24Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T13:10:24Z","title":"Bandit Learning in General Open Multi-agent Systems","version":1},"reference_index":241,"source":"arxiv_source","source_observed_at":"2026-05-08T13:31:44.701536Z"},"links":{"cited_paper":"/paper/2102.10200","citing_paper":"/paper/2605.06202"},"observation_digest":"sha256:7eb545c488979496bbc0793c3cd6de67822099ed5701f16aebe4523d48933f13","observation_id":"34065455-6307-46f2-b75c-552d4d9a8d55","resolution":{"observed_at":"2026-05-11T18:51:08.861393Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.10200/citation-record","integrity":"/paper/2102.10200/integrity","json":"/paper/2102.10200/citation-record.json","paper":"/paper/2102.10200"},"outbound":[],"paper":{"arxiv_id":"2102.10200","last_updated":"2021-02-19T23:10:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:44:18.605191Z","submitted_at":"2021-02-19T23:10:48Z","title":"A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"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."}