Pith. sign in

Paper Citation Record · LEDGER

Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs

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

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

pith.paper-citation-record.v1
2004.13465 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-12T06:34:41.77262+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-09T12:06:20.429874Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-09T12:06:20.758525Z

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 0ece84ef-eaf1-49ed-bb16-12d98a199311 · inbound

Catoni Contextual Bandits are Robust to Heavy-tailed Rewards cites this paper.

Catoni Contextual Bandits are Robust to Heavy-tailed Rewards Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs

Reference 29

Resolution
verified exact
local_arxiv, observed 2026-08-09T12:06:20.763222Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

source=arxiv_source observed=2026-08-09T12:06:20.429874Z digest=sha256:6403e11f80b406382e6281ad2b5328460066073bf8ff77412432ed3c16ac6c45

Observation d9beab0e-b81b-4658-8cf8-cec3f49ee13f · inbound

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set cites this paper.

Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs

Reference 40

Resolution
unresolved
no resolver link, observed 2026-07-30T16:14:13.761525Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-30T16:14:13.761525Z digest=sha256:60350fe1f275dc92ae2d141c72ed04aa9a07a9f8dbf6a5a76c13e2a2f0cfdc2b