Pith. sign in

Paper Citation Record · LEDGER

A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits

As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2207.03106.

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

pith.paper-citation-record.v1
2207.03106 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T22:21:11.676321Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-25T05:05:22.657721Z

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 978b9cc3-8fed-4b77-952c-0e0b0de38dc9 · 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 A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits

Reference 27

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T22:21:11.676321Z digest=sha256:870e3be05192b172c2262fee66ee637b00211557fa6916e7fb12e7f64f31d428

Observation 16f7dc3e-437f-46b2-9d6b-5c788b415ce7 · inbound

When Determinants Are Not Enough: Private Rare Switching cites this paper.

When Determinants Are Not Enough: Private Rare Switching A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-05-25T05:05:22.661203Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-05-25T05:04:26.921107Z digest=sha256:337d950917c58ecd2f5189426184ab79afacd3139ee930f11ab6e7cefa054ca9