{"as_of":"2026-08-19T14:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3676ece560997712e9e672bf1c984c07d068c6901a9a692f4e82bf28f64711b8","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-19T06:32:44.657259+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-08-15T21:26:34.569424Z","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-15T21:26:34.914764Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.08710","last_updated":"2025-05-27T15:31:21Z","snapshot_observed_at":"2026-08-19T04:29:29.657738Z","submitted_at":"2023-09-15T19:01:42Z","title":"Adaptive Sample Sharing for Multi Agent Linear Bandits","version":3},"cited_work":{"arxiv_id":"2309.08710","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.08710","snapshot_observed_at":"2026-08-15T21:26:34.914764Z","title":"Adaptive Sample Sharing for Multi Agent Linear Bandits","venue":"cs.LG","work_id":"29af15d1-cb96-4a86-97f6-4e38d6955758","year":2023},"citing_paper":{"arxiv_id":"2505.10147","last_updated":"2025-05-15T10:20:26Z","snapshot_observed_at":"2026-08-17T20:00:08.871764Z","submitted_at":"2025-05-15T10:20:26Z","title":"Near Optimal Best Arm Identification for Clustered Bandits","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T21:26:34.569424Z"},"links":{"cited_paper":"/paper/2309.08710","citing_paper":"/paper/2505.10147"},"observation_digest":"sha256:95cf923c401970869dc97af345cb3bed308ce5e611df1ea635b3b86f3da4890e","observation_id":"56a6f580-6234-4f65-8644-3666e379c3f3","resolution":{"observed_at":"2026-08-15T21:26:34.917957Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2309.08710/citation-record","integrity":"/paper/2309.08710/integrity","json":"/paper/2309.08710/citation-record.json","paper":"/paper/2309.08710"},"outbound":[],"paper":{"arxiv_id":"2309.08710","last_updated":"2025-05-27T15:31:21Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T04:29:29.657738Z","submitted_at":"2023-09-15T19:01:42Z","title":"Adaptive Sample Sharing for Multi Agent Linear Bandits"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2309.08710."}