{"as_of":"2026-08-15T06:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5833baa3c90447e2d96e43fc1a98fd196fbb934cec47190ce5985bc029f6350c","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:23:08.034163Z","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-07T04:54:06.693850Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.06309","last_updated":"2019-05-29T02:05:10Z","snapshot_observed_at":"2026-08-14T16:47:20.727448Z","submitted_at":"2019-04-12T16:32:17Z","title":"Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.06309","snapshot_observed_at":"2026-08-12T16:23:08.034163Z","title":"Distributed Bandit Learning: Near- Optimal Regret with Efficient Communication.arXiv preprint arXiv:1904.06309, 2019","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.13690","last_updated":"2025-05-24T18:55:53Z","snapshot_observed_at":"2026-08-13T14:57:13.491988Z","submitted_at":"2024-11-20T20:09:44Z","title":"Multi-Agent Best Arm Identification in Stochastic Linear Bandits","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T16:23:08.034163Z"},"links":{"cited_paper":"/paper/1904.06309","citing_paper":"/paper/2411.13690"},"observation_digest":"sha256:281603bf0ce362ddaa7b8233ad04ef29dfe052b43657288346053147814265e9","observation_id":"7f4625ae-ba1d-4e00-b4f1-41108f76f7ad","resolution":{"observed_at":"2026-08-12T16:23:08.034163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.06309","last_updated":"2019-05-29T02:05:10Z","snapshot_observed_at":"2026-08-14T16:47:20.727448Z","submitted_at":"2019-04-12T16:32:17Z","title":"Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.06309","snapshot_observed_at":"2026-08-11T22:21:11.762324Z","title":"Distributed bandit learning: Near-optimal regret with efficient communication","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2412.03727","last_updated":"2025-02-10T05:18:01Z","snapshot_observed_at":"2026-08-14T18:02:28.244753Z","submitted_at":"2024-12-04T21:45:35Z","title":"Online Experimental Design With Estimation-Regret Trade-off Under Network Interference","version":3},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T22:21:11.762324Z"},"links":{"cited_paper":"/paper/1904.06309","citing_paper":"/paper/2412.03727"},"observation_digest":"sha256:88c59a2a2376eb0d221181e20b1327821e7b0f81f8cf65c3d03807e4a9ef4234","observation_id":"7ccda5b9-d4ec-4245-98d9-b459e7bf8274","resolution":{"observed_at":"2026-08-11T22:21:11.762324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.06309","last_updated":"2019-05-29T02:05:10Z","snapshot_observed_at":"2026-08-14T16:47:20.727448Z","submitted_at":"2019-04-12T16:32:17Z","title":"Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.06309","snapshot_observed_at":"2026-08-09T16:44:30.661296Z","title":"Distributed bandit learning: Near-optimal regret with efficient communication","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2502.01085","last_updated":"2025-06-03T03:29:00Z","snapshot_observed_at":"2026-08-14T01:05:24.167135Z","submitted_at":"2025-02-03T05:56:22Z","title":"Federated Linear Dueling Bandits","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T16:44:30.661296Z"},"links":{"cited_paper":"/paper/1904.06309","citing_paper":"/paper/2502.01085"},"observation_digest":"sha256:6450b55a01fcd7bc1108e78a6d1da5dbb7af02aac223a2655d245de6b50eef3a","observation_id":"bf073c3e-90b8-4014-b01c-3b99707dfda5","resolution":{"observed_at":"2026-08-09T16:44:30.661296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.06309","last_updated":"2019-05-29T02:05:10Z","snapshot_observed_at":"2026-08-14T16:47:20.727448Z","submitted_at":"2019-04-12T16:32:17Z","title":"Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication","version":2},"cited_work":{"arxiv_id":"1904.06309","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.06309","snapshot_observed_at":"2026-08-07T04:54:06.693850Z","title":"Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication","venue":"cs.LG","work_id":"98c9678a-1d22-460c-b5d7-0e2b2345a25c","year":2019},"citing_paper":{"arxiv_id":"2506.09940","last_updated":"2025-06-11T17:06:57Z","snapshot_observed_at":"2026-08-15T02:45:08.342678Z","submitted_at":"2025-06-11T17:06:57Z","title":"The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:54:04.786705Z"},"links":{"cited_paper":"/paper/1904.06309","citing_paper":"/paper/2506.09940"},"observation_digest":"sha256:5a8b3cf156ac120cbb1f3f63add548d89bec074fae2b4f30e72ff262a15ceb22","observation_id":"934db6f4-644f-4424-90c5-2aa261c47055","resolution":{"observed_at":"2026-08-07T04:54:06.868256Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.06309/citation-record","integrity":"/paper/1904.06309/integrity","json":"/paper/1904.06309/citation-record.json","paper":"/paper/1904.06309"},"outbound":[],"paper":{"arxiv_id":"1904.06309","last_updated":"2019-05-29T02:05:10Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T16:47:20.727448Z","submitted_at":"2019-04-12T16:32:17Z","title":"Distributed Bandit Learning: Near-Optimal Regret with Efficient 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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1904.06309."}