Pith. sign in

Paper Citation Record · LEDGER

Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication

As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1904.06309.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1904.06309 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-14T06:32:32.682623+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T16:23:08.034163Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-07T04:54:06.693850Z

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 7f4625ae-ba1d-4e00-b4f1-41108f76f7ad · inbound

Multi-Agent Best Arm Identification in Stochastic Linear Bandits cites this paper.

Multi-Agent Best Arm Identification in Stochastic Linear Bandits Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-12T16:23:08.034163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-12T16:23:08.034163Z digest=sha256:281603bf0ce362ddaa7b8233ad04ef29dfe052b43657288346053147814265e9

Observation 7ccda5b9-d4ec-4245-98d9-b459e7bf8274 · inbound

Online Experimental Design With Estimation-Regret Trade-off Under Network Interference cites this paper.

Online Experimental Design With Estimation-Regret Trade-off Under Network Interference Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-11T22:21:11.762324Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T22:21:11.762324Z digest=sha256:88c59a2a2376eb0d221181e20b1327821e7b0f81f8cf65c3d03807e4a9ef4234

Observation bf073c3e-90b8-4014-b01c-3b99707dfda5 · inbound

Federated Linear Dueling Bandits cites this paper.

Federated Linear Dueling Bandits Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-09T16:44:30.661296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-09T16:44:30.661296Z digest=sha256:6450b55a01fcd7bc1108e78a6d1da5dbb7af02aac223a2655d245de6b50eef3a

Observation 934db6f4-644f-4424-90c5-2aa261c47055 · inbound

The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability cites this paper.

The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication

Reference 25

Resolution
verified exact
local_arxiv, observed 2026-08-07T04:54:06.868256Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.

source=pdf_text observed=2026-08-07T04:54:04.786705Z digest=sha256:6e8aa2611a170b4c848aadc3a74e90b7bd831f8e804cdb636bd4165fa985550c