Pith. sign in

Paper Citation Record · LEDGER

Tight Memory-Regret Lower Bounds for Streaming Bandits

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

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

pith.paper-citation-record.v1
2306.07903 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-12T00:56:56.966075Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-09T16:52:19.501174Z

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 c5fd3d84-9721-4ed1-b3ba-31cd2fa9cc04 · inbound

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap cites this paper.

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap Tight Memory-Regret Lower Bounds for Streaming Bandits

Reference 24

Resolution
verified exact
local_arxiv, observed 2026-08-09T16:52:19.507520Z

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=pdf_text observed=2026-08-09T16:52:19.420446Z digest=sha256:cc9bf01b3c53506544fa551d602261068ca154897c7b5f1b479ccd9b09c36196

Observation e0a9b048-6756-41dc-a7c8-09db33713fff · inbound

Information Routing across Batch Boundaries: Memory--Batch Tradeoffs in Lipschitz Bandits cites this paper.

Information Routing across Batch Boundaries: Memory--Batch Tradeoffs in Lipschitz Bandits Tight Memory-Regret Lower Bounds for Streaming Bandits

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-12T00:56:56.966075Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-12T00:56:56.966075Z digest=sha256:185aae3b70f8931367408b5f829c02cc2bbd482744ead0c35f5358a4206f1230