{"as_of":"2026-08-12T07:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cfb68478fe2c8cd707cc021ae1722760d585cbed4939320c9a6363fbcd27f489","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:39:41.184336Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.05479/citation-record","integrity":"/paper/2506.05479/integrity","json":"/paper/2506.05479/citation-record.json","paper":"/paper/2506.05479"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:47.110431Z","title":"Online facility location with multiple advice","venue":null,"work_id":"286fb411-9753-4ab9-becc-06432bb80bde","year":2021},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.001138Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:e236644c29e97b323926f738d2d19e594ba596eaa27f48ab8abb95ac1af86978","observation_id":"af7ec60d-6b78-41b0-860f-94a9b54a6146","resolution":{"observed_at":"2026-08-07T10:39:47.151122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:46.962419Z","title":"Better best of both worlds bounds for bandits with switching costs","venue":null,"work_id":"080fc634-d693-40fa-a8e9-e6a318db75be","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.005900Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:169424f5b3fc0cc51591ca44023772cf83c5e274fa07b85e38c2b11c291e98a6","observation_id":"e2912d51-06dc-406e-a1c3-a54a8efd6be6","resolution":{"observed_at":"2026-08-07T10:39:46.999314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:46.822816Z","title":"Online algorithms with multiple predictions","venue":null,"work_id":"afc8bf08-0dab-4618-961b-774f281eccad","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.010223Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:2c110f0ead0345f65cc7d137240ab202d5f123c044a539b7cc836b2c4be6957e","observation_id":"fe61be8b-4bce-4895-9aa3-078e329928ab","resolution":{"observed_at":"2026-08-07T10:39:46.862527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:46.667954Z","title":"Learning-augmented dynamic power management with multiple states via new ski rental bounds","venue":null,"work_id":"d5f68ade-6e02-4b06-9497-db1c7366a67a","year":2021},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.014233Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:b4ea3cd784eece25097f679af9168eea5f65a90bb21c073a6e855c5f7377a310","observation_id":"0dd520ea-96f0-480d-a5b3-ee19234067bc","resolution":{"observed_at":"2026-08-07T10:39:46.749300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.01781","last_updated":"2023-12-15T20:24:55Z","snapshot_observed_at":"2026-08-09T04:18:48.051233Z","submitted_at":"2023-04-04T13:18:00Z","title":"Mixing predictions for online metric algorithms","version":2},"cited_work":{"arxiv_id":"2304.01781","doi":"10.48550/arxiv.2304.01781","metadata_source":"pith","pith_arxiv_id":"2304.01781","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Mixing predictions for online metric algorithms","venue":"cs.LG","work_id":"049d889a-3463-4359-bc53-dff3198b0812","year":2023},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.017806Z"},"links":{"cited_paper":"/paper/2304.01781","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:60e24b5a3558b7c8bc19327d18a3b5b6ca270e77c1376725a33b757931551e7d","observation_id":"b39154a2-623e-40a0-928c-8b223e40ee60","resolution":{"observed_at":"2026-08-07T10:39:41.322171Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.026279Z","title":"Learning-augmented dynamic power management with multiple states via new ski rental bounds","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.026279Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:d1273ae3a34192a8907e6919a8499d08088a746b8b8c5622bb9849fca5351ba8","observation_id":"c0bc08ec-2278-4d9c-a9bc-18950c49b7e1","resolution":{"observed_at":"2026-08-07T10:39:41.026279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:46.524629Z","title":"Online bandit learning against an adaptive adversary: from regret to policy regret","venue":null,"work_id":"9bae2bda-04b7-4bb2-922e-716d214a8480","year":2012},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.030314Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:7e8ddb51c9e9d260f1e73efe872ffc10ecefd82653fdaed5bc4cd5f4ce8e3421","observation_id":"c2aa3d4b-31a5-4b54-b4ac-126740a96708","resolution":{"observed_at":"2026-08-07T10:39:46.598956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.033153Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.033153Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:c555446dd571569b1623fad709d5ac850dc88ab5c209d98045d7bed2a343371d","observation_id":"3d8e37f3-ba3f-4eab-9b47-3607e48f5370","resolution":{"observed_at":"2026-08-07T10:39:41.033153Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:46.419025Z","title":"Z., and Manasse, M","venue":null,"work_id":"fed72623-1f4c-4531-97aa-ec1d4abba3b4","year":1993},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.036511Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:c13743130941bd4b5b3c635991e07dee0a2101d855299178dc838010e0a678d9","observation_id":"c4f7c672-436e-418a-8440-e4036d1d9b75","resolution":{"observed_at":"2026-08-07T10:39:46.491521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:46.263550Z","title":"Energy-efficient scheduling with predictions","venue":null,"work_id":"e401eb6c-ca38-435c-8c52-66bdeb3f37b5","year":2023},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.039959Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:6e98da33acfe216145ff20ee8a4b59999709648c88250d412c5c8b3ae54f8efa","observation_id":"470b7cbf-a328-40cd-a2c4-bd762c9459bd","resolution":{"observed_at":"2026-08-07T10:39:46.345819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:46.132814Z","title":"Learning augmented energy minimization via speed scaling","venue":null,"work_id":"65d3e241-9954-422b-a6f3-73b316160292","year":2020},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.043412Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:e7c6a0f8ad16b4d534bd6750971ceab42e616d33437fbdc4428a351a8efd6813","observation_id":"428f325b-0356-4a85-947a-541284c7772b","resolution":{"observed_at":"2026-08-07T10:39:46.190700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.046785Z","title":"Ramsey-type theorems for metric spaces with applications to online problems","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.046785Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:fb6cdd2847ad0bd2f325dfdf132bd0f6aaf84375977c03d89c3af5e227661d34","observation_id":"d89f00e3-7bec-497e-b482-9aef050ce1c0","resolution":{"observed_at":"2026-08-07T10:39:41.046785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:45.967722Z","title":"and Perchet, V","venue":null,"work_id":"d7adcd0c-396f-44f0-9746-bd8ca262f5c2","year":2024},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.050014Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:41b201695def29de3e2fe69c3adb178fd5cd3dcff0980da39ba1e9175aa4cd79","observation_id":"ea4da7b2-24b4-448e-ab59-acedc39aacf8","resolution":{"observed_at":"2026-08-07T10:39:46.036272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:45.841205Z","title":"and Perchet, V","venue":null,"work_id":"fe36fecb-b714-49c5-bd45-87c68c53dfdf","year":2024},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.052926Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:cbdd207a519e349f50cd5f5d28bec2477a3e26b8b9822f3814bdc39e1045e6d5","observation_id":"fdc126ae-19e4-4486-ac92-4bb4e15f93c8","resolution":{"observed_at":"2026-08-07T10:39:45.902073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.12850","last_updated":"2022-10-10T06:53:25Z","snapshot_observed_at":"2026-07-06T13:13:55.421435Z","submitted_at":"2022-05-25T15:24:03Z","title":"A Universal Error Measure for Input Predictions Applied to Online Graph Problems","version":2},"cited_work":{"arxiv_id":"2205.12850","doi":"10.48550/arxiv.2205.12850","metadata_source":"pith","pith_arxiv_id":"2205.12850","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"A Universal Error Measure for Input Predictions Applied to Online Graph Problems","venue":"cs.DS","work_id":"dfd8a282-709f-4846-bfcb-6856fa09c68d","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.056008Z"},"links":{"cited_paper":"/paper/2205.12850","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:4f7e1854a7e41f7b9d8d17b5aa56887c2cdbb640d715be23b2584dee8a6c3412","observation_id":"86a528dc-f153-47eb-b8d0-858cab502a7c","resolution":{"observed_at":"2026-08-07T10:39:41.290289Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:45.658751Z","title":"Online linear optimization with many hints","venue":null,"work_id":"003bd00a-5f4f-4518-a04c-dd0f74f701b1","year":2020},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.060024Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:7af1d8fc56b29a5ea58656c5a47cfe590a3aab935292e238081e825236822368","observation_id":"72c61ec5-a5d6-464a-a42d-4df4306aedd0","resolution":{"observed_at":"2026-08-07T10:39:45.747541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1023/a:1007621832648","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"and Burch, C","venue":"Machine Learning","work_id":"c0759a1f-03e1-4992-a160-bb90fc3d2cce","year":2000},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.063235Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:b5324470e81eaa18e8132312b587b22a27c64eec3358b71ec5658ca84ed158f5","observation_id":"527fa86b-9ed6-4260-a2c7-de68dd8f5f12","resolution":{"observed_at":"2026-08-07T10:39:41.275404Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:45.504895Z","title":"and Mansour, Y","venue":null,"work_id":"76602bc6-3a00-4f50-9ce7-ba8c4c73c9c1","year":2007},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.066671Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:1915ed3db950fe7b2825d10b9b35e32512b6747b2b491d12665379b32b257d31","observation_id":"831a8818-758b-43de-b698-d4c0f418d85a","resolution":{"observed_at":"2026-08-07T10:39:45.577009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6585.14658","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.812517Z","title":null,"venue":null,"work_id":"6d052227-8170-481a-ae11-68d3ba254ab6","year":1992},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.069761Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:143abbd814731147cfc7eea0097171f4abeb037d36292b28acb8aa70ec1110f0","observation_id":"40dd8757-087e-4d74-83e8-b5f047c2cc76","resolution":{"observed_at":"2026-08-07T10:39:41.858675Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611975482.6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"B., Lee, J","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"87b2a8d4-801c-4fa5-8a1e-ac3f62a210be","year":2019},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.073037Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:31b867bc5f4853a83faf939cdeb639b0dfa7ac02e94df8582cd072a50cfa3324","observation_id":"80742736-28d3-430b-a96b-9147e3c6cdd1","resolution":{"observed_at":"2026-08-07T10:39:41.264953Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.05753","last_updated":"2023-07-06T17:21:27Z","snapshot_observed_at":"2026-08-06T19:41:24.401159Z","submitted_at":"2022-11-10T18:41:42Z","title":"The Randomized $k$-Server Conjecture is False!","version":2},"cited_work":{"arxiv_id":"2211.05753","doi":"10.48550/arxiv.2211.05753","metadata_source":"pith","pith_arxiv_id":"2211.05753","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"The Randomized $k$-Server Conjecture is False!","venue":"cs.DS","work_id":"2bb2fb6a-b692-4363-aa9c-481833855ef5","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.076073Z"},"links":{"cited_paper":"/paper/2211.05753","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:eec3c0bcbc80f3d7f939c83e5b20f98c418052cd98692b1ba89613b1a4ec23b2","observation_id":"db0d7e90-f1b2-421b-b89f-1af18e8e1a93","resolution":{"observed_at":"2026-08-07T10:39:41.254700Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:45.378405Z","title":"Shortest paths without a map, but with an entropic regularizer","venue":null,"work_id":"ce34d1ff-cc22-469a-998c-de7b27430c8e","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.080282Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:e333ec99607eecce4a4327db845f5ff485da1ea40b896642cf0ec6155052a1d8","observation_id":"ae9443bd-7f72-42b9-9408-4e4389aff1af","resolution":{"observed_at":"2026-08-07T10:39:45.439309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.084206Z","title":"and Lugosi, G","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.084206Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:6d6ccb2942ff1ee518498d9d9bdad6f6346719b9a8027cac6c924ca7284d8d04","observation_id":"11342830-ba19-48b2-948e-f6963b158c23","resolution":{"observed_at":"2026-08-07T10:39:41.084206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1302.4387","last_updated":"2013-06-01T09:35:15Z","snapshot_observed_at":"2026-08-09T10:33:46.236793Z","submitted_at":"2013-02-18T18:46:37Z","title":"Online Learning with Switching Costs and Other Adaptive Adversaries","version":2},"cited_work":{"arxiv_id":"1302.4387","doi":null,"metadata_source":"pith","pith_arxiv_id":"1302.4387","snapshot_observed_at":"2026-08-07T10:39:41.579697Z","title":"Online Learning with Switching Costs and Other Adaptive Adversaries","venue":"cs.LG","work_id":"ef5d3e4b-6e66-43cd-aa20-5c71bb8dc194","year":2013},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.088293Z"},"links":{"cited_paper":"/paper/1302.4387","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:e858b203ffb293c85feb576cd3ad12c887dfd76fdbb893e82c15a0279a65ec23","observation_id":"22640ebc-bd14-4d02-8ea7-d8c5ca0e911b","resolution":{"observed_at":"2026-08-07T10:39:41.635304Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:45.202377Z","title":"Predictive flows for faster ford-fulkerson","venue":null,"work_id":"fdd5587a-e4f9-40ee-ba25-f276d90588da","year":2023},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.092472Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:f41bddb13b13b2394547682053efb1c86f97a0f62fc180b22883e886962f9398","observation_id":"2bc80d97-638b-43be-8dde-b256f58341f8","resolution":{"observed_at":"2026-08-07T10:39:45.289489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:45.055185Z","title":"Bandits with switching costs: T2/3 regret","venue":null,"work_id":"32de86e1-f9e3-494e-abf7-2b5767633e6d","year":2013},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.095688Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:90ce83d27e9d47f9dbe4ea1784aab07c8c1ac393c1f261c2aa0d1f9ab7831d1b","observation_id":"c9145c88-a496-429f-a54b-11fb9e783844","resolution":{"observed_at":"2026-08-07T10:39:45.120453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:44.899231Z","title":"Algorithms with prediction portfolios","venue":null,"work_id":"208a9700-1f6f-4df4-82bc-39655fc03392","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.098647Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:31401f4ce3dc8a113071b22fc972aaf3813520744a1173d225deec24276973ca","observation_id":"042ba525-fc8f-4887-a555-1de7bef523db","resolution":{"observed_at":"2026-08-07T10:39:44.969244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2025.44","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"f7f7acf8-cd80-4b12-9156-b12e5a1037e4","year":2025},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.102941Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:8b0e74c6300de40a4a224cc04de3430c7741acad81242f58b9d37861dac7d0bc","observation_id":"90bb0cf8-b764-44c2-b0b9-72284b77475c","resolution":{"observed_at":"2026-08-07T10:39:41.233927Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:44.747923Z","title":"G., and Svensson, O","venue":null,"work_id":"517c3372-237d-4e4a-990c-9fba059ca021","year":2023},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.106505Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:8436377f285bc55e28fa3ce503a7994fee1bd404f021127a00b2999d8a71df3e","observation_id":"f514ba88-cb22-43e3-a2cd-9ae9954c8e9b","resolution":{"observed_at":"2026-08-07T10:39:44.826416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:44.573558Z","title":"o lke, L., and Schl \\","venue":null,"work_id":"f51c3490-d764-4dba-a87c-ef3e82044d39","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.110423Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:334e8a5f97ed14bb88dda2250e62b6f708d4acd05d67004cbe6f2f4d33221e41","observation_id":"706c6fda-619b-4683-ad79-ac2a2bb782c6","resolution":{"observed_at":"2026-08-07T10:39:44.673983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:44.374008Z","title":"Online paging with a vanishing regret","venue":null,"work_id":"4ca9849c-298e-452b-9b05-c37f06c3b40e","year":2021},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.114552Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:05ba7efa5b2a92e701872706364a8d4088cc62996269200ddb8c1fed1cdd73d2","observation_id":"282a24ff-573b-4ef4-a9b2-9eef02b9ec83","resolution":{"observed_at":"2026-08-07T10:39:44.476881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:44.209074Z","title":"Competitive k-server algorithms (extended abstract)","venue":null,"work_id":"1d9d4d5c-0c74-4c41-8599-8e3f9b3d19dc","year":1990},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.117868Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:564998bc1c9aa0c6dad665a467264ee6b2af90b2b52fe85ef421e3c6e9e8ea34","observation_id":"1ee02c53-9178-4e1f-ae87-be7f114d7b25","resolution":{"observed_at":"2026-08-07T10:39:44.315927Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.121215Z","title":"M., Luby, M., McGeoch, L","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.121215Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:4aeafdfbc235d5ce20a0233939ef0ffbc2c5b4c6137c790b1664648e16175b5c","observation_id":"65e328a1-496e-4afe-af7e-81c4a8e1ecf1","resolution":{"observed_at":"2026-08-07T10:39:41.121215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.124432Z","title":"and Schapire, R","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.124432Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:bfdbdbaae82ecad0034b88e267103cb818ccc00b68347b62a3e3326d5d9dcd56","observation_id":"b3766784-34c5-4e6b-a844-22df25f8eea9","resolution":{"observed_at":"2026-08-07T10:39:41.124432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:44.010491Z","title":"and Panigrahi, D","venue":null,"work_id":"ddbdb60c-cd2a-4cd9-a4cb-c7a329d1777c","year":2019},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.128192Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:a31b6022c1cc4a6311e6b162d0305a6952e036b80d51c4207a1916169e5f0796","observation_id":"ff3affd6-04cb-4b8b-8ad0-d598942cb0f1","resolution":{"observed_at":"2026-08-07T10:39:44.111258Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:43.802534Z","title":"and Warmuth, M","venue":null,"work_id":"e3e0910c-028c-49b1-b788-1442f8353edc","year":1998},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.131950Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:a8b73b59b0fcdc56f30d29e7723defc3f05f872fbda369e65d6e6ccfc96777d0","observation_id":"b63b6d8f-b79e-4056-b310-98bf554c5c39","resolution":{"observed_at":"2026-08-07T10:39:43.899880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:43.633212Z","title":"Parsimonious learning-augmented caching","venue":null,"work_id":"1fbad93e-4db6-4576-afff-d206c9dc6f2e","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.135185Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:57f3525115bf8f5d2145af6e3db3b8a1007c32101d7eda8ab1e102acf26529ec","observation_id":"8b6d63eb-752f-4c70-beab-bf12efa47298","resolution":{"observed_at":"2026-08-07T10:39:43.719017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14564","last_updated":"2023-12-22T09:48:45Z","snapshot_observed_at":"2026-08-10T07:06:47.252554Z","submitted_at":"2023-12-22T09:48:45Z","title":"Online Covering with Multiple Experts","version":1},"cited_work":{"arxiv_id":"2312.14564","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.14564","snapshot_observed_at":"2026-08-07T10:39:41.425360Z","title":"Online Covering with Multiple Experts","venue":"cs.DS","work_id":"027d17f2-b97d-485a-952b-0af74bafac50","year":2023},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.138247Z"},"links":{"cited_paper":"/paper/2312.14564","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:acc460362781bee5500aceed16ac2456111ff1b9ab398520b58ad9fc5d5bd5fb","observation_id":"1a327b53-6adc-4bdb-9431-153087e8d5fb","resolution":{"observed_at":"2026-08-07T10:39:41.435845Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-022-00925-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T00:03:40.895421Z","title":"Randomized online computation with high probability guarantees","venue":"Algorithmica","work_id":"3c1c919f-696b-4c7d-ac2f-4c1b83b06c6c","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.142407Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:126674b48e3d34c9fea29b49d464bf581a828c233689093ff0ed2648798534e4","observation_id":"5b72d37e-66b2-4eb1-bf5f-5e350d091b5d","resolution":{"observed_at":"2026-08-07T10:39:41.222846Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.145682Z","title":"H., Dean, J., and Polyzotis, N","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.145682Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:aac215f44e32823a2866831b70a192df1d8e6128f27e08de637662e649dc0a1f","observation_id":"e89156a1-b2c3-498b-b3a2-eb9bc6e82944","resolution":{"observed_at":"2026-08-07T10:39:41.145682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:43.456218Z","title":"and Szepesvari, C","venue":null,"work_id":"5aee2150-ebbe-40f3-abbb-eae551b4bc9d","year":2017},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.149654Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:2f9d86f84ccfa3de8935b40c1a07607bb4e87aba273fedf4f5f98fc48778d642","observation_id":"20298c3c-7026-49db-b1bb-42009bd74800","resolution":{"observed_at":"2026-08-07T10:39:43.528455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:43.290150Z","title":"and Megow, N","venue":null,"work_id":"cd9a9a4a-0ece-43f2-b383-8c11580b30f9","year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.152844Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:11d0fc439a3af3ccd7db0306c7dff4074382838fe4a1cf6afeaab5126860c561","observation_id":"881a32a6-a226-4436-92df-ce2cf3e7be2d","resolution":{"observed_at":"2026-08-07T10:39:43.360265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:43.086234Z","title":"and Megow, N","venue":null,"work_id":"d39e79be-ff33-48be-bf53-2734a89ae5f1","year":2023},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.156016Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:6faea35f07eefb81340cc61d9fb5d066737a96112c7a9e22de7067c92c1491bc","observation_id":"a6833a60-86a4-4dd5-bff3-1750e0ff842a","resolution":{"observed_at":"2026-08-07T10:39:43.153604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:42.845254Z","title":"and Vassilvitskii, S","venue":null,"work_id":"9f28aa7c-6dc9-45a9-bd15-27a49d1f5fb9","year":2021},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.159662Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:36f5d86c429883cbfe97d95c37d918405078d9d745cafdab23b5a56075fd1d35","observation_id":"6ab12ffe-d992-4a1c-abeb-6fbe3a4b1bc5","resolution":{"observed_at":"2026-08-07T10:39:42.971769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.162757Z","title":"and Vassilvitskii, S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.162757Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:4a314f36c409db348926f96eed1828519a214a97bf60e1c2e8ffcd9630d8195f","observation_id":"d738ae40-d381-4426-bdde-da68256b7533","resolution":{"observed_at":"2026-08-07T10:39:41.162757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:42.653591Z","title":"Near-optimal bounds for online caching with machine learned advice","venue":null,"work_id":"139cd4b3-63c5-405f-ab52-5cbe72bc9b93","year":2020},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.166517Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:2507916828e8534b4d8494616c086bd7635383a5c591bc2724903df00bd2febb","observation_id":"934a0d8c-c90c-4643-8372-592e09e8319b","resolution":{"observed_at":"2026-08-07T10:39:42.737226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:42.485786Z","title":"An algorithm for stochastic and adversarial bandits with switching costs","venue":null,"work_id":"620524cb-45bb-43a1-ba14-bfe7b0ff3834","year":2021},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.169691Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:d4ba9b0c339abd24afaeab192545fc4d7f61000c9b4bf3924ca46fd291017e04","observation_id":"d8f45bfe-77d5-4c12-b6c1-1f99ed6bb280","resolution":{"observed_at":"2026-08-07T10:39:42.562960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:42.315309Z","title":null,"venue":null,"work_id":"bf1ac03d-468f-40f1-be2a-33010e586de0","year":2024},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.173445Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:12ba20111df4ef878d5d89fbed4ea30609f0eb3ee36e934f3a1213178357d32c","observation_id":"9610e551-e4ac-47c2-8992-ca44fe99390c","resolution":{"observed_at":"2026-08-07T10:39:42.396814Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07272","last_updated":"2024-04-03T21:32:42Z","snapshot_observed_at":"2026-08-11T23:26:11.274786Z","submitted_at":"2019-04-15T18:17:01Z","title":"Introduction to Multi-Armed Bandits","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07272","snapshot_observed_at":"2026-08-07T10:39:41.176891Z","title":"Introduction to multi-armed bandits","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.176891Z"},"links":{"cited_paper":"/paper/1904.07272","citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:ac0ece14878375a79aa6c06d6e1352e86882a65155ba3c0f8e8906244eff3aa4","observation_id":"f02301b1-2537-4d3f-9122-eb26a2218a95","resolution":{"observed_at":"2026-08-07T10:39:41.176891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:42.139098Z","title":"Online algorithms for multi-shop ski rental with machine learned advice","venue":null,"work_id":"6dabe399-5436-48bd-8346-0ca8a29cd585","year":2020},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.180581Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:f06dd9a7f81738d04d77bb312626cb45fa2ca510dd298025c96cbca7c97c1585","observation_id":"af0c299b-5a0c-4498-a7b5-d76eada86903","resolution":{"observed_at":"2026-08-07T10:39:42.223987Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:39:41.973318Z","title":"Better and simpler learning-augmented online caching","venue":null,"work_id":"2249ad35-2e76-44c5-a4c2-a108fc6c127a","year":2020},"citing_paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:39:41.184336Z"},"links":{"citing_paper":"/paper/2506.05479"},"observation_digest":"sha256:1920ac8425694304567931dc3aca0ecd2b8c5b29d7d6afd6e0fcf535ba8d4f28","observation_id":"4e26eb1b-7a8e-4352-966d-30dab213a129","resolution":{"observed_at":"2026-08-07T10:39:42.043034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.05479","last_updated":"2025-06-05T18:00:37Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T10:18:20.703500Z","submitted_at":"2025-06-05T18:00:37Z","title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":9,"verified_fuzzy":31},"total_outbound_references":51},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2506.05479."}