Pith. sign in

Paper Citation Record · LEDGER

Algorithms for multi-armed bandit problems

As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:1402.6028.

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

pith.paper-citation-record.v1
1402.6028 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 9 of 9 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-06T06:34:29.942622+00:00

measured 9 of 9 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T20:27:02.916543Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-04T16:49:57.171090Z

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 5ddf42b8-a476-4735-81af-7454ff96c086 · inbound

Exploring Exploration in Bayesian Optimization cites this paper.

Exploring Exploration in Bayesian Optimization Algorithms for multi-armed bandit problems

Reference 12

Resolution
verified exact
local_arxiv, observed 2026-05-23T03:32:28.735921Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-23T03:27:45.840995Z digest=sha256:81d971586fb2e06efa4c76204214f0d293c482f6e1bfb63f3b121ede5f4aa28c

Observation 579c20fe-caee-4318-9d21-6dc70c8324f4 · inbound

Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee cites this paper.

Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee Algorithms for multi-armed bandit problems

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-05T20:27:02.916543Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T20:27:02.916543Z digest=sha256:b9058ebcbb9f9621a50f77427563eece480c6233f7d4d2415ffab95e6e2881fd

Observation 30598111-6267-4410-9e26-258d074eb01b · inbound

Reactive Users vs. Social Recommender Systems: Managing Opinion Drifts with Adaptive Policies cites this paper.

Reactive Users vs. Social Recommender Systems: Managing Opinion Drifts with Adaptive Policies Algorithms for multi-armed bandit problems

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-05T19:08:08.825311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T19:08:08.825311Z digest=sha256:04d94ff11613f3f6db63efd8b2d858790d9c753c70f65cc8dd2c1348960160af

Observation 27ab0d30-5d67-4fbb-ad96-55ca94b04a32 · inbound

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks cites this paper.

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks Algorithms for multi-armed bandit problems

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-05T15:20:19.349019Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T15:20:19.349019Z digest=sha256:1e6a7e0ee8f8f7fb668ecb64d0713d52adf773416b8811f2cdc1d1028dc427b6

Observation 58aa93e8-dceb-4c1e-916c-67c75ea8089b · inbound

Efficient Adversarial Attacks on High-dimensional Offline Bandits cites this paper.

Efficient Adversarial Attacks on High-dimensional Offline Bandits Algorithms for multi-armed bandit problems

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-03T05:41:50.386634Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T05:41:50.386634Z digest=sha256:69460fc07233dd95f131f39ae3d6f5d27a2766cc46bf3faf6255877eb03aa261

Observation 5c5d1542-5b93-439c-af9b-2fd7c064cd17 · inbound

AgentOpt v0.1 Technical Report: Client-Side Optimization for LLM-Based Agent cites this paper.

AgentOpt v0.1 Technical Report: Client-Side Optimization for LLM-Based Agent Algorithms for multi-armed bandit problems

Reference 14

Resolution
verified exact
arxiv_id, observed 2026-05-10T22:25:52.553025Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-10T19:51:39.564680Z digest=sha256:8df480ce881097c519f3d739704516cdd1600d26b819a308cc18a62522e72307

Observation 0a160bb4-da1c-4d11-bdaf-8636c612f0c9 · inbound

Adaptive COVID-19 Trajectory Forecasting Using MAB-Inspired Ensemble Weighting cites this paper.

Adaptive COVID-19 Trajectory Forecasting Using MAB-Inspired Ensemble Weighting Algorithms for multi-armed bandit problems

Reference 41

Resolution
metadata mismatch
local_arxiv, observed 2026-07-04T02:59:25.371881Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-06-26T18:44:50.105494Z digest=sha256:9865010dba6bb633d973c3de9d9654f558c1ea488b3e8739a1e09694db7450fa

Observation 74d9820c-53cc-4f44-aae5-68854aa866c6 · inbound

An Introduction to Causal Reinforcement Learning cites this paper.

An Introduction to Causal Reinforcement Learning Algorithms for multi-armed bandit problems

Reference 249

Resolution
metadata mismatch
local_arxiv, observed 2026-07-04T16:49:57.172575Z

Source-reported events for the cited work

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

source=arxiv_source observed=2026-06-26T00:17:57.091481Z digest=sha256:7c5518ad69a22b81f2fd3277a0049b6f796e83f23b45181bf68ee07831ba64bb

Observation c68306f6-4f3c-4722-89e2-2caa7e277d8f · inbound

The Greedy Advantage in Finite-Horizon Bandits cites this paper.

The Greedy Advantage in Finite-Horizon Bandits Algorithms for multi-armed bandit problems

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-03T08:22:35.193964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-03T08:22:35.193964Z digest=sha256:14b5eff98c7a2698013875595385c9fb7ed632f51947552730b84b2a931230c6