Paper Citation Record · LEDGER

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors

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

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

pith.paper-citation-record.v1
2506.05479 v1

Coverage vector

measured 51 of 51 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T10:39:41.184336Z

measured 51 of 51 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

51 of 51 outbound references displayed

verified exact9
verified fuzzy31
unresolved10
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation af7ec60d-6b78-41b0-860f-94a9b54a6146 · outbound

This paper cites Online facility location with multiple advice.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online facility location with multiple advice

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:47.151122Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e2912d51-06dc-406e-a1c3-a54a8efd6be6 · outbound

This paper cites Better best of both worlds bounds for bandits with switching costs.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Better best of both worlds bounds for bandits with switching costs

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.999314Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation fe61be8b-4bce-4895-9aa3-078e329928ab · outbound

This paper cites Online algorithms with multiple predictions.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online algorithms with multiple predictions

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.862527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 0dd520ea-96f0-480d-a5b3-ee19234067bc · outbound

This paper cites Learning-augmented dynamic power management with multiple states via new ski rental bounds.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Learning-augmented dynamic power management with multiple states via new ski rental bounds

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.749300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b39154a2-623e-40a0-928c-8b223e40ee60 · outbound

This paper cites Mixing predictions for online metric algorithms.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Mixing predictions for online metric algorithms

Reference 5

Resolution: verified exact; local_arxiv, observed 2026-08-07T10:39:41.322171Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation c0bc08ec-2278-4d9c-a9bc-18950c49b7e1 · outbound

This paper cites Learning-augmented dynamic power management with multiple states via new ski rental bounds.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Learning-augmented dynamic power management with multiple states via new ski rental bounds

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.026279Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2aa3d4b-31a5-4b54-b4ac-126740a96708 · outbound

This paper cites Online bandit learning against an adaptive adversary: from regret to policy regret.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online bandit learning against an adaptive adversary: from regret to policy regret

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.598956Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 3d8e37f3-ba3f-4eab-9b47-3607e48f5370 · outbound

This paper cites an unresolved cited work.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.033153Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4f7c672-436e-418a-8440-e4036d1d9b75 · outbound

This paper cites Z., and Manasse, M.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Z., and Manasse, M

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.491521Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 470b7cbf-a328-40cd-a2c4-bd762c9459bd · outbound

This paper cites Energy-efficient scheduling with predictions.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Energy-efficient scheduling with predictions

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.345819Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 428f325b-0356-4a85-947a-541284c7772b · outbound

This paper cites Learning augmented energy minimization via speed scaling.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Learning augmented energy minimization via speed scaling

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.190700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d89f00e3-7bec-497e-b482-9aef050ce1c0 · outbound

This paper cites Ramsey-type theorems for metric spaces with applications to online problems.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Ramsey-type theorems for metric spaces with applications to online problems

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.046785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea4da7b2-24b4-448e-ab59-acedc39aacf8 · outbound

This paper cites and Perchet, V.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Perchet, V

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:46.036272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation fdc126ae-19e4-4486-ac92-4bb4e15f93c8 · outbound

This paper cites and Perchet, V.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Perchet, V

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:45.902073Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 86a528dc-f153-47eb-b8d0-858cab502a7c · outbound

This paper cites A Universal Error Measure for Input Predictions Applied to Online Graph Problems.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors A Universal Error Measure for Input Predictions Applied to Online Graph Problems

Reference 15

Resolution: verified exact; local_arxiv, observed 2026-08-07T10:39:41.290289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 72c61ec5-a5d6-464a-a42d-4df4306aedd0 · outbound

This paper cites Online linear optimization with many hints.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online linear optimization with many hints

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:45.747541Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 527fa86b-9ed6-4260-a2c7-de68dd8f5f12 · outbound

This paper cites and Burch, C.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Burch, C

Reference 17

Resolution: verified exact; doi, observed 2026-08-07T10:39:41.275404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 831a8818-758b-43de-b698-d4c0f418d85a · outbound

This paper cites and Mansour, Y.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Mansour, Y

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:45.577009Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 40dd8757-087e-4d74-83e8-b5f047c2cc76 · outbound

This paper cites an unresolved cited work.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Unresolved cited work

Reference 19

Resolution: metadata mismatch; raw_fallback, observed 2026-08-07T10:39:41.858675Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 80742736-28d3-430b-a96b-9147e3c6cdd1 · outbound

This paper cites B., Lee, J.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors B., Lee, J

Reference 20

Resolution: verified exact; doi, observed 2026-08-07T10:39:41.264953Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation db0d7e90-f1b2-421b-b89f-1af18e8e1a93 · outbound

This paper cites The Randomized $k$-Server Conjecture is False!.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors The Randomized $k$-Server Conjecture is False!

Reference 21

Resolution: verified exact; local_arxiv, observed 2026-08-07T10:39:41.254700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation ae9443bd-7f72-42b9-9408-4e4389aff1af · outbound

This paper cites Shortest paths without a map, but with an entropic regularizer.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Shortest paths without a map, but with an entropic regularizer

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:45.439309Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 11342830-ba19-48b2-948e-f6963b158c23 · outbound

This paper cites and Lugosi, G.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Lugosi, G

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.084206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 22640ebc-bd14-4d02-8ea7-d8c5ca0e911b · outbound

This paper cites Online Learning with Switching Costs and Other Adaptive Adversaries.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online Learning with Switching Costs and Other Adaptive Adversaries

Reference 24

Resolution: verified exact; local_arxiv, observed 2026-08-07T10:39:41.635304Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 2bc80d97-638b-43be-8dde-b256f58341f8 · outbound

This paper cites Predictive flows for faster ford-fulkerson.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Predictive flows for faster ford-fulkerson

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:45.289489Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation c9145c88-a496-429f-a54b-11fb9e783844 · outbound

This paper cites Bandits with switching costs: T2/3 regret.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Bandits with switching costs: T2/3 regret

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:45.120453Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 042ba525-fc8f-4887-a555-1de7bef523db · outbound

This paper cites Algorithms with prediction portfolios.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Algorithms with prediction portfolios

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:44.969244Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 90bb0cf8-b764-44c2-b0b9-72284b77475c · outbound

This paper cites Learning-Augmented Streaming Algorithms for Approximating MAX-CUT.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Learning-Augmented Streaming Algorithms for Approximating MAX-CUT

Reference 28

Resolution: verified exact; doi, observed 2026-08-07T10:39:41.233927Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f514ba88-cb22-43e3-a2cd-9ae9954c8e9b · outbound

This paper cites G., and Svensson, O.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors G., and Svensson, O

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:44.826416Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 706c6fda-619b-4683-ad79-ac2a2bb782c6 · outbound

This paper cites o lke, L., and Schl \.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors o lke, L., and Schl \

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:44.673983Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 282a24ff-573b-4ef4-a9b2-9eef02b9ec83 · outbound

This paper cites Online paging with a vanishing regret.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online paging with a vanishing regret

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:44.476881Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 1ee02c53-9178-4e1f-ae87-be7f114d7b25 · outbound

This paper cites Competitive k-server algorithms (extended abstract).

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Competitive k-server algorithms (extended abstract)

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:44.315927Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 65e328a1-496e-4afe-af7e-81c4a8e1ecf1 · outbound

This paper cites M., Luby, M., McGeoch, L.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors M., Luby, M., McGeoch, L

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.121215Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3766784-34c5-4e6b-a844-22df25f8eea9 · outbound

This paper cites and Schapire, R.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Schapire, R

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.124432Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff3affd6-04cb-4b8b-8ad0-d598942cb0f1 · outbound

This paper cites and Panigrahi, D.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Panigrahi, D

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:44.111258Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation b63b6d8f-b79e-4056-b310-98bf554c5c39 · outbound

This paper cites and Warmuth, M.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Warmuth, M

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:43.899880Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 8b6d63eb-752f-4c70-beab-bf12efa47298 · outbound

This paper cites Parsimonious learning-augmented caching.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Parsimonious learning-augmented caching

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:43.719017Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 1a327b53-6adc-4bdb-9431-153087e8d5fb · outbound

This paper cites Online Covering with Multiple Experts.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online Covering with Multiple Experts

Reference 38

Resolution: verified exact; local_arxiv, observed 2026-08-07T10:39:41.435845Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5b72d37e-66b2-4eb1-bf5f-5e350d091b5d · outbound

This paper cites Randomized online computation with high probability guarantees.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Randomized online computation with high probability guarantees

Reference 39

Resolution: verified exact; doi, observed 2026-08-07T10:39:41.222846Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e89156a1-b2c3-498b-b3a2-eb9bc6e82944 · outbound

This paper cites H., Dean, J., and Polyzotis, N.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors H., Dean, J., and Polyzotis, N

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.145682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20298c3c-7026-49db-b1bb-42009bd74800 · outbound

This paper cites and Szepesvari, C.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Szepesvari, C

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:43.528455Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 881a32a6-a226-4436-92df-ce2cf3e7be2d · outbound

This paper cites and Megow, N.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Megow, N

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:43.360265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation a6833a60-86a4-4dd5-bff3-1750e0ff842a · outbound

This paper cites and Megow, N.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Megow, N

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:43.153604Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 6ab12ffe-d992-4a1c-abeb-6fbe3a4b1bc5 · outbound

This paper cites and Vassilvitskii, S.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Vassilvitskii, S

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:42.971769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d738ae40-d381-4426-bdde-da68256b7533 · outbound

This paper cites and Vassilvitskii, S.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors and Vassilvitskii, S

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.162757Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 934a0d8c-c90c-4643-8372-592e09e8319b · outbound

This paper cites Near-optimal bounds for online caching with machine learned advice.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Near-optimal bounds for online caching with machine learned advice

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:42.737226Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation d8f45bfe-77d5-4c12-b6c1-1f99ed6bb280 · outbound

This paper cites An algorithm for stochastic and adversarial bandits with switching costs.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors An algorithm for stochastic and adversarial bandits with switching costs

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:42.562960Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 9610e551-e4ac-47c2-8992-ca44fe99390c · outbound

This paper cites an unresolved cited work.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Unresolved cited work

Reference 48

Resolution: unresolved; raw_fallback, observed 2026-08-07T10:39:42.396814Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation f02301b1-2537-4d3f-9122-eb26a2218a95 · outbound

This paper cites Introduction to Multi-Armed Bandits.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Introduction to Multi-Armed Bandits

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-07T10:39:41.176891Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af0c299b-5a0c-4498-a7b5-d76eada86903 · outbound

This paper cites Online algorithms for multi-shop ski rental with machine learned advice.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Online algorithms for multi-shop ski rental with machine learned advice

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:42.223987Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 4e26eb1b-7a8e-4352-966d-30dab213a129 · outbound

This paper cites Better and simpler learning-augmented online caching.

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors Better and simpler learning-augmented online caching

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T10:39:42.043034Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Pith citing papers

No inbound Pith citation observations are available.