{"as_of":"2026-08-14T12:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3705cf8019b8c8a2ff2bd15c1d83dda16c242911a399bd736843ae99cd6d5e92","coverage":[{"denominator":108,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:46:00.536543Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2505.21331/citation-record","integrity":"/paper/2505.21331/integrity","json":"/paper/2505.21331/citation-record.json","paper":"/paper/2505.21331"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:45:49.382484Z","title":"A broader view of designing the liver allocation system","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.382484Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:5496ee6c25ef86b6e8578e27acebebacafed2e0ab77d8a57fbfab3ab794899a1","observation_id":"b5dbc94f-618e-4621-b1d5-5ac30c0ed4db","resolution":{"observed_at":"2026-08-07T13:45:49.382484Z","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-07T13:45:49.451496Z","title":"Whittle index approach to multiserver scheduling with impatient customers and dhr service times","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.451496Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:8163f13b3b9250e6bed693b7b77d651eec823444dc18fb58a421d4056a7632ff","observation_id":"63fc87d9-01d2-4e20-a279-8df67fe56f91","resolution":{"observed_at":"2026-08-07T13:45:49.451496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.06516","last_updated":"2022-11-11T23:55:53Z","snapshot_observed_at":"2026-08-14T05:10:12.548927Z","submitted_at":"2022-11-11T23:55:53Z","title":"Bandits for Online Calibration: An Application to Content Moderation on Social Media Platforms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.06516","snapshot_observed_at":"2026-08-07T13:45:49.556745Z","title":"Bandits for online calibration: An application to content moderation on social media platforms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.556745Z"},"links":{"cited_paper":"/paper/2211.06516","citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:235b38dadda86b00bec89162fe5e313c33e7978784e9928d9fecb02908bc91a2","observation_id":"e6737b5a-984c-4405-95cb-f3472de96d49","resolution":{"observed_at":"2026-08-07T13:45:49.556745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.12641","last_updated":"2025-12-30T19:29:33Z","snapshot_observed_at":"2026-08-10T21:26:57.464394Z","submitted_at":"2024-12-17T08:03:53Z","title":"Lagrangian Index Policy for Restless Bandits with Average Reward","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.12641","snapshot_observed_at":"2026-08-07T13:45:49.623980Z","title":"Lagrangian index policy for restless bandits with average reward","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.623980Z"},"links":{"cited_paper":"/paper/2412.12641","citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:73aef5433bbec0805bb1dce82736971607def7befde61139100b7376ca70a1fa","observation_id":"d045f31e-10ad-4fb2-bf8d-b2a4c13f78f0","resolution":{"observed_at":"2026-08-07T13:45:49.623980Z","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-07T13:45:49.704616Z","title":"Finite-time analysis of the multiarmed bandit problem","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.704616Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:0f6cdbc60ff870953c4690d43891118b43f773abba86c0788f44f58e2e028807","observation_id":"69473ada-2209-44c2-aff8-050749ec4271","resolution":{"observed_at":"2026-08-07T13:45:49.704616Z","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-07T13:45:49.790014Z","title":"Diagnostic accuracy under congestion","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.790014Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:2fbe756a87069f07efe8ad84625ff634b4f4e9cb0177e0fbb72987ac96a9433e","observation_id":"68466842-81c5-4164-8c7e-9bcfa27d5d7a","resolution":{"observed_at":"2026-08-07T13:45:49.790014Z","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-07T13:45:49.879845Z","title":"The c / rule for many-server queues with abandonment","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.879845Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:1a84cd590ed638055cff54464517a15b98a162e264e2618c579c07281818d34f","observation_id":"8f09f8a3-699c-4057-b93e-11b71ec48576","resolution":{"observed_at":"2026-08-07T13:45:49.879845Z","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-07T13:45:49.886643Z","title":"On the asymptotic optimality of the c / rule under ergodic cost","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.886643Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:da96d8cea90ad89422a93825061992d830eb0e006d686f9659205966cef9c130","observation_id":"adb1a6c9-1ae8-4969-acb5-48027caf983c","resolution":{"observed_at":"2026-08-07T13:45:49.886643Z","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-07T13:45:49.929984Z","title":"Budget pacing for targeted online advertisements at linkedin","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:49.929984Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:5481823120ebd7e79e2472d768671f194ca3a4cd47a13a1bfe1c6894b3f9fa7c","observation_id":"54b11608-b7b7-4406-9770-3e90fbc2b03f","resolution":{"observed_at":"2026-08-07T13:45:49.929984Z","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-07T13:45:50.028869Z","title":"On patient flow in hospitals: A data-based queueing-science perspective","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:50.028869Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:d868ea7de2aa32954cac9fcb78b30e203334de9fb902508c5d19d82bab82edd1","observation_id":"9f8c12ff-8a09-427c-baf6-79dba2402ebd","resolution":{"observed_at":"2026-08-07T13:45:50.028869Z","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-07T13:45:50.164539Z","title":"Scheduling of multi-class multi-server queueing systems with abandonments","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:50.164539Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:5f7baa5ebf028da72a7dcf7908ae10ee346462d61cc7e3ccb9184f664402f589","observation_id":"ce5fd7c4-c3ce-4e38-8c18-91b81eb7c524","resolution":{"observed_at":"2026-08-07T13:45:50.164539Z","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-07T13:45:50.287552Z","title":"Fair allocation over time, with applications to content moderation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:50.287552Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:cf9a16b97c280463d015ef21f61d85263856f48daa8df4c47b1332b4c3223c63","observation_id":"d5f05f95-2dbf-4320-9b0a-42620e20ae86","resolution":{"observed_at":"2026-08-07T13:45:50.287552Z","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-07T13:45:50.382173Z","title":"Conditions for indexability of restless bandits and an algorithm to compute whittle index","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:50.382173Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:edc2daa3095ba47419fe0565c5d1100aab1304d2df8b4da3b520a8daa17acdfd","observation_id":"bad105d8-2517-42e8-9303-12d645c6746b","resolution":{"observed_at":"2026-08-07T13:45:50.382173Z","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-07T13:45:50.538833Z","title":"Performance of multiclass markovian queueing networks via piecewise linear lyapunov functions","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:50.538833Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:f23b6dce6ed278ad7e1ee2d487554a7501f56a0635eaef6a9a34471e10f85c41","observation_id":"276bc6da-6d3f-4469-8f03-71d410b92ef8","resolution":{"observed_at":"2026-08-07T13:45:50.538833Z","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-07T13:45:50.716731Z","title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:50.716731Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:e39c353bd9575c93ba9c80a93b089b9c1ec6243ea01b43f748d5c53f1893b0d2","observation_id":"5083b794-01de-4f35-aac5-2d6bc36a4b1a","resolution":{"observed_at":"2026-08-07T13:45:50.716731Z","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-07T13:45:50.827936Z","title":"What makes online content viral? Journal of marketing research , 49(2):192--205, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:50.827936Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:e62404db3394c7ba7410fdc38f2882cfddc982db95f03c5c6f175257fe903cc2","observation_id":"b88b8e75-2f73-46d0-889b-36d177c001c6","resolution":{"observed_at":"2026-08-07T13:45:50.827936Z","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-07T13:45:51.036460Z","title":"Learning and hierarchies in service systems","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:51.036460Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:2e38bb42aac00075ca7e23241a82d68684a336d41c2216d6b3efd725d48950be","observation_id":"915e3d83-9bb7-4732-acb4-a3e69006a181","resolution":{"observed_at":"2026-08-07T13:45:51.036460Z","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-07T13:45:51.221563Z","title":"Restless bandits, linear programming relaxations, and a primal-dual index heuristic","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:51.221563Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:b7c506e46699c6c9c3bd677484ca3217a13a4336ceb0c3d4c83b49de642f7e68","observation_id":"8bd4b8f8-7e52-4dd7-95ff-409aca49f6b4","resolution":{"observed_at":"2026-08-07T13:45:51.221563Z","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-07T13:45:51.371874Z","title":"Scheduling homogeneous impatient customers","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:51.371874Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:18eccf1860439dcdd5369ef037a041d564900f3cd593f1bfbe2698fd6d7bd3eb","observation_id":"4e6e4a28-ade8-484e-a59f-5fb86bffeaed","resolution":{"observed_at":"2026-08-07T13:45:51.371874Z","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-07T13:45:51.600377Z","title":"Optimally scheduling heterogeneous impatient customers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:51.600377Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:1efa726f2ceb592f0f147886182ba4ccbc86261f73a56ac49e45c8d7f77ba896","observation_id":"be6f77ac-e82c-4917-9487-d10adf4f32a7","resolution":{"observed_at":"2026-08-07T13:45:51.600377Z","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-07T13:45:51.758616Z","title":"Index policies and performance bounds for dynamic selection problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:51.758616Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:3e552546e8fbb4810b94ec74f2329d0f93afbfb34a9534201a7761b97447f523","observation_id":"ff5b9ea8-1c6c-4d90-98ba-f1dab312403b","resolution":{"observed_at":"2026-08-07T13:45:51.758616Z","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-07T13:45:51.926822Z","title":"Can cascades be predicted? In Proceedings of the 23rd international conference on World wide web , pages 925--936, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:51.926822Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:4bdf8ce8173ad31347fa651fb8caeb1d04bc2d4219a4ddf47c303bb56e2a5358","observation_id":"15873ace-83fa-44f5-80f9-e482c3e4e4fb","resolution":{"observed_at":"2026-08-07T13:45:51.926822Z","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-07T13:45:52.065289Z","title":"Xgboost: A scalable tree boosting system","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:52.065289Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c04b1ff70e7ceb2965482d8a449f7d6a1c55d0bff3cadf038c87f6cecd5133ec","observation_id":"36c8faf2-ba4e-4298-afe4-5feba767aefb","resolution":{"observed_at":"2026-08-07T13:45:52.065289Z","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-07T13:45:52.268921Z","title":"Augmenting our content moderation efforts through machine learning and dynamic content prioritization, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:52.268921Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c959680d3a02fdcf83333c3b22a4f7d048fee171fdc61caf67ab7e71a523128b","observation_id":"271ea013-4fc8-4824-bed0-f0edab8fb908","resolution":{"observed_at":"2026-08-07T13:45:52.268921Z","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-07T13:45:52.428927Z","title":"Analyzing the video popularity characteristics of large-scale user generated content systems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:52.428927Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:01c5c9b6f338cf37e01b2be0af69f1d7d9785fed476b735459decebfb05355d5","observation_id":"af0d2903-970c-4bfa-a6b2-a98909a87694","resolution":{"observed_at":"2026-08-07T13:45:52.428927Z","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-07T13:45:52.580259Z","title":"Mortal multi-armed bandits","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:52.580259Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:9a196606980ec4773f7ec5354870ab3c8d9714454217fa4366a98f5047e66876","observation_id":"e82f9a9b-5929-444a-a557-e4ec07ed1e59","resolution":{"observed_at":"2026-08-07T13:45:52.580259Z","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-07T13:45:52.655090Z","title":"Complex graphs and networks","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:52.655090Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:0ad06afe6e0151e1c73015ef6cc69af4ec49e7d9b2c6ebf3385a7408bee768c7","observation_id":"1c1bf678-6d26-4160-871c-936891307a8e","resolution":{"observed_at":"2026-08-07T13:45:52.655090Z","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-07T13:45:52.737496Z","title":"An online learning approach to dynamic pricing and capacity sizing in service systems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:52.737496Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:b75298990878a2f13987bf228ea341e68edc8261e056047e665ced9a414a2c3c","observation_id":"9e59b50f-18bf-47a4-bb18-c1eecfc66074","resolution":{"observed_at":"2026-08-07T13:45:52.737496Z","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-07T13:45:52.915106Z","title":"Cox and Walter L","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:52.915106Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:9a7443b8acbe9ef6b29a354d77e7f79ef9972085aa1a54ad2117e2c65a2dfc10","observation_id":"d381134c-8e96-4c8b-aedc-05640d3d0d9b","resolution":{"observed_at":"2026-08-07T13:45:52.915106Z","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-07T13:45:53.052904Z","title":"Detecting offensive language in social media to protect adolescent online safety","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:53.052904Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:039a61b60ae66f22b7120475dcaeefdf6df83689f786ed377c9c034c67e3e7d3","observation_id":"d7bb7c51-dd13-48c0-b043-fbc3a793f793","resolution":{"observed_at":"2026-08-07T13:45:53.052904Z","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-07T13:46:13.158361Z","title":"The comparison and evaluation of forecasters","venue":null,"work_id":"e8b5f551-a5b4-46d6-93ab-8c6256a1f027","year":1983},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:53.249770Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:2278c22014010557df3a5986e1a109ec55cd1767bfd71c5ed99bd7e8d0e80b05","observation_id":"c98a5cd6-aaba-4db5-a639-9e9504faa6ad","resolution":{"observed_at":"2026-08-07T13:46:13.213278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:13.053299Z","title":"The n-network model with upgrades","venue":null,"work_id":"7178c02b-3640-4219-83af-1b2ba7d78cb0","year":2010},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:53.367246Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:b6eaba25fc7a5461bd0a9b32ca22d29ca85cda3762f2daa773faab2100ec4260","observation_id":"adc79354-bae5-49be-825f-5be0534b6a96","resolution":{"observed_at":"2026-08-07T13:46:13.086885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:12.952274Z","title":"Hate speech detection with comment embeddings","venue":null,"work_id":"6b4bee8c-81a2-4cff-82b3-350a9b4712de","year":2015},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:53.574360Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:81f2e69875fc486a35c53786a01716ededb4f255bf16504249c493d1339181e9","observation_id":"d3aa87e0-aaac-49cd-b2fd-01f63b2cba7c","resolution":{"observed_at":"2026-08-07T13:46:13.015840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:12.794953Z","title":"Asymptotically tight steady-state queue length bounds implied by drift conditions","venue":null,"work_id":"b7068e25-3364-41e3-8b9d-2e5aad4a1608","year":2012},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:53.720132Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:bb871facb3cb19a065e2e2b4c56250e67574b53e9c69bad9ad54c400d2da5cd9","observation_id":"9d37f0f4-7898-44a7-b53f-d187c1a5a57e","resolution":{"observed_at":"2026-08-07T13:46:12.855177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:12.685961Z","title":"Stability of decentralized queueing networks beyond complete bipartite cases","venue":null,"work_id":"478306b5-d438-4bbf-9ae8-816a98f385de","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:53.846556Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:8b62c32c5fead7896d772516ae213a15a26706146e2b639a6af3ea2836cd0bad","observation_id":"cf0d7601-d5b2-494e-b882-d2da37cf02a5","resolution":{"observed_at":"2026-08-07T13:46:12.727135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:12.575645Z","title":"Quantifying the cost of learning in queueing systems","venue":null,"work_id":"14cd5db3-0235-4655-8c8b-cd29207b5597","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.051782Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:4ebb5e342ac8c6759f63b0a180e5c7366f11b2d743cb4a41a491a202dd7d0ab2","observation_id":"bd5436c5-70fc-4a7a-9d19-b22523a74bd7","resolution":{"observed_at":"2026-08-07T13:46:12.618963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:12.452703Z","title":"Efficient decentralized multi-agent learning in asymmetric bipartite queueing systems","venue":null,"work_id":"80d7fe32-0254-45d1-b3d1-4a5769193d07","year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.131853Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:0d4ddc711347596b5fde32a2fdc5d26f02201a3d3fcaca2ca64af67b716eaedd","observation_id":"58520179-6029-4482-ae42-3bb82778022c","resolution":{"observed_at":"2026-08-07T13:46:12.519044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:12.362543Z","title":"Optimal routing to parallel servers with unknown utilities—multi-armed bandit with queues","venue":null,"work_id":"7a3b7580-a702-44b6-96a0-33e5bc40b804","year":1997},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.212249Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:ef8adf1c92ebf474baedefe69fdd92324d18713110c6f53e4e7502a2d1e0df83","observation_id":"edb69a6b-912d-4be9-a79d-c68b78ccdf26","resolution":{"observed_at":"2026-08-07T13:46:12.388619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:45:54.323527Z","title":"Algorithmic content moderation: Technical and political challenges in the automation of platform governance","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.323527Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:a74a6a0db41abca42cb3667cd1defa5764d06d1a498f8b1546401c5fe69c1224","observation_id":"d999c3de-3e1f-4bb5-b1b3-7b8dfed215b2","resolution":{"observed_at":"2026-08-07T13:45:54.323527Z","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-07T13:46:12.162421Z","title":"Linear program-based policies for restless bandits: Necessary and sufficient conditions for (exponentially fast) asymptotic optimality","venue":null,"work_id":"24a6a04a-a7d4-453d-b2d2-402ff15f4a46","year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.411042Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:baab0d4b442ba4b581309df53f975f2f38c03abc63db1f90a9a266a9d5212c48","observation_id":"e5c5bb1b-3a57-4cbe-bb7a-951da7d7aa45","resolution":{"observed_at":"2026-08-07T13:46:12.219304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:45:54.524245Z","title":"Custodians of the Internet: Platforms, content moderation, and the hidden decisions that shape social media","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.524245Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:4970bc122914b3f393e2a6ae5e41bb676889c79cecbf367efec3cdc8ed2a4126","observation_id":"87c3d147-7ce3-4d6d-b440-15d3bd4b9a11","resolution":{"observed_at":"2026-08-07T13:45:54.524245Z","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-07T13:46:12.044809Z","title":"Walking in facebook: A case study of unbiased sampling of osns","venue":null,"work_id":"8f790eb6-d0a4-40c4-9591-23a1a4ab59c3","year":2010},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.681907Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:f644fbeb9255532ef0f816e803e69d2651579f2922f2312632adb42012083137","observation_id":"1d0c8d71-3caa-4dbd-898d-1dc449cf94b2","resolution":{"observed_at":"2026-08-07T13:46:12.101483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.937347Z","title":"Telephone call centers: Tutorial, review, and research prospects","venue":null,"work_id":"83e362bc-1b05-4c72-9e06-7c2bee529a35","year":2003},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.772684Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:b4f96285387b9b60babe2d6e5758ee70e186e576fa08b5d408031494d33de15a","observation_id":"74b30fea-0d1a-4da7-9930-6611b8ebf81c","resolution":{"observed_at":"2026-08-07T13:46:11.992173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.842224Z","title":"Can q-learning be improved with advice? In Conference on Learning Theory , pages 4548--4619","venue":null,"work_id":"ca9c3f29-c69c-406a-ab1a-8ec7d14abd14","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:54.857339Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:0abbd2dddc47ef2f0b4766e7e55dc791e809e5047f21af1aacec8b690fb0fa46","observation_id":"deeefc6c-8e9d-4ec6-9bdc-81b70bd005fd","resolution":{"observed_at":"2026-08-07T13:46:11.903621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.749699Z","title":"The price of anarchy of strategic queuing systems","venue":null,"work_id":"3209592c-9f14-453e-9bb6-04d29c7d91b2","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.009510Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:836abfdbdbed538890ae3d4f11cb57f4831c0b3439bd0d58979db4579642e4e5","observation_id":"d00c0832-eacd-4367-9132-656950ca8904","resolution":{"observed_at":"2026-08-07T13:46:11.802345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.634372Z","title":"Hitting-time and occupation-time bounds implied by drift analysis with applications","venue":null,"work_id":"0e2e043c-cfcf-4963-8ddd-92c291b566bf","year":1982},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.105017Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:403b578408c95d1c4ddd190ec6b8435c8be7bd0db7525b58dcc3a1abbeceec55","observation_id":"e904e4fe-7a8a-4f31-b2e1-d18803915079","resolution":{"observed_at":"2026-08-07T13:46:11.667624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.577754Z","title":"Performance modeling and design of computer systems: queueing theory in action","venue":null,"work_id":"24153f5c-ca2a-4e25-beba-19a7a5b75da9","year":2013},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.179208Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:78668c8ccaa9ce8e7d9040b7b5431ab9a7cb1b12af9b39ba61b81b5b1d9a00ad","observation_id":"22fa0bc9-9761-4bf8-8e21-ecf320f20937","resolution":{"observed_at":"2026-08-07T13:46:11.596188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.443525Z","title":"Optimal scheduling of proactive service with customer deterioration and improvement","venue":null,"work_id":"8bb72902-5505-42a1-8d8a-d9d66944a248","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.277702Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:7a2a8f74c0f5461190d28ff7bdabb4954c61b70a9ebc25bd1ec30e0b01cc8815","observation_id":"ed8181ce-6c4b-439f-b6e1-648377d44615","resolution":{"observed_at":"2026-08-07T13:46:11.545424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.352186Z","title":"Preserving integrity in online social networks","venue":null,"work_id":"65d1d030-18f9-4a2f-8e04-99f611073a20","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.390617Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:a664b3e735c4984ddca7bbfe74d2030b97cf1839f7bba28b060912d7db2ff7aa","observation_id":"6854e347-19bc-4880-8be9-3626fbe54cff","resolution":{"observed_at":"2026-08-07T13:46:11.386173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.230800Z","title":"Popularity prediction for social media over arbitrary time horizons","venue":null,"work_id":"e4780564-a5d5-498a-acb7-63b6c9460521","year":2021},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.469179Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:fa28574eba9fc9991472a4643673379530005c10e494685129c075d3d7f133a0","observation_id":"70ac897e-dee2-43bc-ac50-f9ede47bcf25","resolution":{"observed_at":"2026-08-07T13:46:11.290372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:11.115410Z","title":"Restless bandits with average reward: Breaking the uniform global attractor assumption","venue":null,"work_id":"2aea1b18-f4bc-40fd-aeea-6e00ce9999e9","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.571779Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:16ea3dc49ddd06d82b45ab7cd1cbcb96abdaf9507f15b1cde9124a700b69fa0b","observation_id":"a6372a73-8dd3-4b45-a1ff-2711fb117342","resolution":{"observed_at":"2026-08-07T13:46:11.165801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17882","last_updated":"2024-10-17T17:28:16Z","snapshot_observed_at":"2026-08-12T23:56:28.495876Z","submitted_at":"2024-05-28T07:08:29Z","title":"Achieving Exponential Asymptotic Optimality in Average-Reward Restless Bandits without Global Attractor Assumption","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17882","snapshot_observed_at":"2026-08-07T13:45:55.710927Z","title":"Achieving exponential asymptotic optimality in average-reward restless bandits without global attractor assumption","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.710927Z"},"links":{"cited_paper":"/paper/2405.17882","citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:7d0e3f55638692006d29d08e12f8594f92f9b653ec1a8f27eefb09b422301b70","observation_id":"e0a9f7c1-82dc-4fec-8702-b4778b3b6ba8","resolution":{"observed_at":"2026-08-07T13:45:55.710927Z","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":"2402.05689","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:46:02.035944Z","title":"Unichain and aperiodicity are sufficient for asymptotic optimality of average-reward restless bandits","venue":null,"work_id":"a8e94362-c18c-4956-9962-c52a5e8c3244","year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.816881Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:2b278b8a14842dedd41ceecb82d7c1f3ea01a0e3d2960fecbe30c9eabd52b10e","observation_id":"25e97a56-c9c5-4550-a067-af5f13814ec0","resolution":{"observed_at":"2026-08-07T13:46:02.133423Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.981967Z","title":"Integrated online learning and adaptive control in queueing systems with uncertain payoffs","venue":null,"work_id":"75b64962-a7c0-42b4-80e9-d128db1b6d53","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:55.880015Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:922b77b4820bbb796156d2c374fc01e697a75cfbaa422de79436a835944f6bfc","observation_id":"09ba6ee8-8e6a-49bc-83b1-4d0a0c16d56c","resolution":{"observed_at":"2026-08-07T13:46:11.039653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.873458Z","title":"Online learning and pricing for service systems with reusable resources","venue":null,"work_id":"e53c6897-f2fb-460c-ba10-001b3491bc4e","year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.035911Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c6a9793fe7d3c391dda9ef041c6a6551c17054454db201b1fb2c4b024775cf5a","observation_id":"ee77a9b0-21ef-41b4-877c-80ea9dc9467b","resolution":{"observed_at":"2026-08-07T13:46:10.917330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.804679Z","title":"Watch your language: Investigating content moderation with large language models","venue":null,"work_id":"715fcacf-8cff-4406-9da0-36ff5c16a74c","year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.118920Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:6fa424d9ec3796736a4a084a4509e1c2f91ae88524cc7749d1d866f53b18b774","observation_id":"a09518cc-a93b-42a9-bb64-4c5ee73b03d8","resolution":{"observed_at":"2026-08-07T13:46:10.853408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.731678Z","title":"On learning the c rule in single and parallel server networks","venue":null,"work_id":"a5ff93f7-a50b-4848-8ccd-217dd353ea62","year":2018},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.176342Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:da9eefd06c58a97142050fd5deb9bbf7976cbfa47338679e764388c2c01476c8","observation_id":"123c0843-7ec0-4e9c-899c-52826c1a5927","resolution":{"observed_at":"2026-08-07T13:46:10.761955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.663592Z","title":"Dynamic tcp acknowledgement and other stories about e/(e-1)","venue":null,"work_id":"a886c6a0-74c1-4d72-a638-320915205f69","year":2001},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.236902Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:44e61a9af72856c4c9348d2c34c292aeea3e0bd005bd23b96130851ad27be9e8","observation_id":"86cee725-7ed8-418e-99de-cabe94001ba7","resolution":{"observed_at":"2026-08-07T13:46:10.694432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.634260Z","title":"Learning unknown service rates in queues: A multiarmed bandit approach","venue":null,"work_id":"01bb3c8f-35db-432c-9a3d-81bfa03d9fc6","year":2021},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.341180Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:0e238e69c0aae7baafd817a18514dd9ab0df2cf1524eb2ffbf5df284e1e3c690","observation_id":"ad62d0db-a9ce-4a7d-b4f9-c8390bd0ed1b","resolution":{"observed_at":"2026-08-07T13:46:10.646305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.462702Z","title":"Asymptotically optimal index policies for an abandonment queue with convex holding cost","venue":null,"work_id":"b0d55dd2-d214-416a-b215-862f9d0d1d5e","year":2015},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.463617Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c58c44e107cbd2888e58912217854b7c9c7ed3d58947432904fb5ce0eb694904","observation_id":"cbbdd873-4a08-4a1f-ad8e-2eed7b60e66a","resolution":{"observed_at":"2026-08-07T13:46:10.526860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.10622","last_updated":"2025-04-14T18:22:15Z","snapshot_observed_at":"2026-08-13T04:13:50.050131Z","submitted_at":"2025-04-14T18:22:15Z","title":"Improving Upon the generalized c-mu rule: a Whittle approach","version":1},"cited_work":{"arxiv_id":"2504.10622","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.10622","snapshot_observed_at":"2026-08-07T13:46:01.748590Z","title":"Improving Upon the generalized c-mu rule: a Whittle approach","venue":"cs.PF","work_id":"84369035-fe2b-42ca-b5e1-2a58ba4c8040","year":2025},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.531036Z"},"links":{"cited_paper":"/paper/2504.10622","citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:3769e2ee947a7c43c0aa9c6b4d90007efd17329450ff61e45bff2fc794647a4f","observation_id":"fcc8882d-4ea0-486a-a0a6-dbb7b59fe3a6","resolution":{"observed_at":"2026-08-07T13:46:01.839276Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:10.241476Z","title":"Beyond black-box advice: Learning-augmented algorithms for mdps with q-value predictions","venue":null,"work_id":"af2cda36-497f-4deb-9409-c02e498f2e0f","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.617703Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c785ce8d6fb7844799348e91c8e9726f6235829f4310b59913a96cb3a571dff0","observation_id":"7fd2c17a-13b7-4bef-92c2-df659862f59d","resolution":{"observed_at":"2026-08-07T13:46:10.341497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:45:56.781298Z","title":"Design and scheduling of an ai-based queueing system","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.781298Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:27a5e6a044e47d45b9ca48e5a3aebda55efb12ce519f9474e4b622cc8f1711ff","observation_id":"24cf6fd6-ad99-40fd-93da-08e71fab13fb","resolution":{"observed_at":"2026-08-07T13:45:56.781298Z","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-07T13:46:10.049066Z","title":"Dynamic scheduling of multiclass many-server queues with abandonment: The generalized c /h rule","venue":null,"work_id":"5f710ab4-09b9-4972-9dd9-a3eae3018f82","year":2020},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.873834Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:b671a6fe5d6ef68c377db18c613560e2299368cf1ef3f8846e234998a445f2aa","observation_id":"2843ec99-d606-471b-955c-5b5a358b3ad2","resolution":{"observed_at":"2026-08-07T13:46:10.149411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12237","last_updated":"2025-08-12T21:03:31Z","snapshot_observed_at":"2026-08-13T04:15:19.136500Z","submitted_at":"2024-02-19T15:47:47Z","title":"Learning to Defer in Congested Systems: The AI-Human Interplay","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12237","snapshot_observed_at":"2026-08-07T13:45:56.960372Z","title":"Learning to defer in content moderation: The human-ai interplay","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:56.960372Z"},"links":{"cited_paper":"/paper/2402.12237","citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:f26129fb78fb8bc87d8db689977a871db5149b2eaca69312d24ac4ab5a340cc2","observation_id":"b0447c20-2de7-455f-815e-50e496646dbf","resolution":{"observed_at":"2026-08-07T13:45:56.960372Z","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-07T13:46:09.886992Z","title":"Steady-state analysis of load-balancing algorithms in the sub-halfin--whitt regime","venue":null,"work_id":"037775e5-c099-49fa-a894-7a53645620f7","year":2020},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.074382Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:991a90c46a1944813c6547ac23ca719aac801fadae35f750ad39ae9b78806ed6","observation_id":"5de4bd59-e471-4a0b-82ab-08b71dd38df8","resolution":{"observed_at":"2026-08-07T13:46:09.931790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:09.662501Z","title":"The supermarket model with known and predicted service times","venue":null,"work_id":"4feedf53-3c37-4143-bbf2-ec327cff901c","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.196671Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:6acd0ca6b9367f711051aeca37069ceb6187ad7eb5e107355001050bbabfcc68","observation_id":"7d88199e-6920-4d7a-afb6-e7b594c6eb69","resolution":{"observed_at":"2026-08-07T13:46:09.756397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:09.480181Z","title":"The people behind meta's review teams, 2022","venue":null,"work_id":"a27aa5ae-0a5d-45dc-9960-2723e3486d03","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.282683Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:ae93271f153e65983ae036716664eec3673445aeb33e26b64e589f940b5bca1b","observation_id":"92f52b45-a0a3-4635-8916-83b08dfbcd5a","resolution":{"observed_at":"2026-08-07T13:46:09.580119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:09.254962Z","title":"Community standards, 2025","venue":null,"work_id":"9ee12742-bc26-432c-8ad0-5b7042a45512","year":2025},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.372498Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:e5c627ac5ae0f2a92ad5d53c603e9714a2897544ceeb0dd460bc8f9c883ebbc1","observation_id":"d9d944a1-1885-4dd6-93eb-0953dc5f20de","resolution":{"observed_at":"2026-08-07T13:46:09.354608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:45:57.523489Z","title":"Human-level control through deep reinforcement learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.523489Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c7d8c632b01e6674c2de5e78f0b7316135bd511b3c899d1a3353954a3d312484","observation_id":"7e51c5d9-8116-4d41-bef1-71da1365a749","resolution":{"observed_at":"2026-08-07T13:45:57.523489Z","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-07T13:46:09.075737Z","title":"Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized c -rule","venue":null,"work_id":"1f87d339-5255-4dd5-aa86-02fa09035724","year":2004},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.662504Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:09980ebae65f69c78b9ed0be1d98ccb4f83ed10a97bd900bc9a9ed28a55de440","observation_id":"f2b2acc5-e1be-480c-844f-845c4477272e","resolution":{"observed_at":"2026-08-07T13:46:09.154865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:08.881535Z","title":"Heavy traffic queue length behavior in a switch under the maxweight algorithm","venue":null,"work_id":"66c539b8-ea5a-44d7-a3eb-6fa705a7e004","year":2016},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.777612Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:e06a380eaa9e2b34e1ec1da2ade635a6ff428e9a94d8e30acb52565cdf06e1d7","observation_id":"e31e4f8d-ceba-4163-827f-83e82e5111a9","resolution":{"observed_at":"2026-08-07T13:46:08.969280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2103.16816","last_updated":"2021-03-31T05:20:28Z","snapshot_observed_at":"2026-08-13T19:48:36.620937Z","submitted_at":"2021-03-31T05:20:28Z","title":"QUEST: Queue Simulation for Content Moderation at Scale","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.16816","snapshot_observed_at":"2026-08-07T13:45:57.898950Z","title":"Stier-Moses, and Julián Mestre","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:57.898950Z"},"links":{"cited_paper":"/paper/2103.16816","citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:45da897d6bbc2ad5ed86616fc324ac12d0398b80e286896426b0ee0a69416aa2","observation_id":"3a35f3c3-ac70-428a-ad33-e38ec30774f5","resolution":{"observed_at":"2026-08-07T13:45:57.898950Z","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-07T13:46:08.708870Z","title":"On the capacity of information processing systems","venue":null,"work_id":"805893a8-3fcd-42bb-86a6-350cad593a71","year":2016},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.001627Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:b898902bd59577c53ebc9cd87a8271033d2cf278a2ca552be04125bdfb22dcf5","observation_id":"7e278a54-c70c-454b-bb17-0aef6bbb9baa","resolution":{"observed_at":"2026-08-07T13:46:08.794589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:08.491306Z","title":"Learning to schedule in non-stationary wireless networks with unknown statistics","venue":null,"work_id":"c0250b4c-9e2b-4538-9af1-bc9ec6ab0940","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.094527Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:f54ae46f9f9330da6e6181d710d7b544887bb4d9b38e5f84123effdb6f525e08","observation_id":"03d3c52b-7718-44ee-93bd-1969d4498caa","resolution":{"observed_at":"2026-08-07T13:46:08.602078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:08.282896Z","title":"Markovian restless bandits and index policies: A review","venue":null,"work_id":"5d07db40-d254-4591-84a5-f3f08d44aefa","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.215289Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:2ce719852c319f6e16a2c12e46bd87bec3ea058cf325e99d6dc0a225e0753651","observation_id":"b0756a20-d26f-4cac-8e0b-3df28e719ed2","resolution":{"observed_at":"2026-08-07T13:46:08.386622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:08.070014Z","title":"Max weight learning algorithms for scheduling in unknown environments","venue":null,"work_id":"f0bed43f-edf0-4bcd-9aa9-a1dd8bc3a2a9","year":2012},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.323381Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c2853c834f2b9ea2349b829715b2d3822e0cc12d5c441603ba3f64685d187a79","observation_id":"bafffb12-3ffa-42ee-9ad2-722d2be5f6e6","resolution":{"observed_at":"2026-08-07T13:46:08.168038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:07.775124Z","title":"Ties: temporal interaction embeddings for enhancing social media integrity at facebook","venue":null,"work_id":"248e6b7e-633a-4e76-a9dd-e02faf135fac","year":2020},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.431877Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:e11041773f19991ddd009c139f37897ebe9df83919164d3bca3b0d107559dc88","observation_id":"8e161f56-86bd-4ead-b849-b89daa1dbdae","resolution":{"observed_at":"2026-08-07T13:46:07.947671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:07.382814Z","title":"Scheduling , volume 29","venue":null,"work_id":"4c857c1c-6b50-4796-8996-3d4b7ff5b5bc","year":2012},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.553724Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:7dc15ea95131c8cfc6e4de59668c1304b421fc11cbcb4d823b46d94b8b0c9923","observation_id":"c99cfc6b-9c33-4cd1-b1d6-67e38873ac4b","resolution":{"observed_at":"2026-08-07T13:46:07.569798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:07.194048Z","title":"Fluid limits for multiclass many-server queues with general reneging distributions and head-of-the-line scheduling","venue":null,"work_id":"b9b1eee3-2a20-4a5f-99d3-c50048f55ba9","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.669825Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:8c6b4420385cdd39a1bbb4bb4a598371488df05afc3c223911f2c558594fabd1","observation_id":"5ee14d75-b7bd-4c08-80d4-1ba5f6fd8d8b","resolution":{"observed_at":"2026-08-07T13:46:07.270444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:07.024861Z","title":"Behind the screen","venue":null,"work_id":"5b0bfc75-973d-44bc-8b53-03c59b76b304","year":2019},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.748753Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:24e9f4968990c3f0a590b43ae9b9062452ae6a48f4ea057b38728c776120a7e4","observation_id":"0545a106-2d8d-4953-aa3d-0da3055650c7","resolution":{"observed_at":"2026-08-07T13:46:07.099522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:06.879439Z","title":"Expecting to be hip: Hawkes intensity processes for social media popularity","venue":null,"work_id":"7b6a7e24-8dfc-474d-b068-5b5398487309","year":2017},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.881531Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:8e9938fcea88d3805bc04bf5695641d9680e9b18ffad79c71b1b461d4b7098c2","observation_id":"bc68e9d6-2476-4e9e-b4cf-2368014b1fa2","resolution":{"observed_at":"2026-08-07T13:46:06.949340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:06.568497Z","title":"Customer acquisition via display advertising using multi-armed bandit experiments","venue":null,"work_id":"759a7372-497b-49a5-b0da-5110ae500cd5","year":2017},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:58.965162Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:5b4f966dbe5fff13e9e12a71e65930c5fc3b54e2b2b8b7607dbbf1bd2c56c882","observation_id":"fb03b212-82f4-4d78-9671-8f49f956ee87","resolution":{"observed_at":"2026-08-07T13:46:06.639144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:06.381552Z","title":"Decentralized learning in online queuing systems","venue":null,"work_id":"a34d235a-cf9e-4f4a-9e41-c65be24b6b8b","year":2021},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.027127Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:e16906d53edfa74277500926dd03edf6cc67238c53b51a984fd678eeca7b507a","observation_id":"b7a13a1d-dddc-4d61-8fcc-20ed6a455553","resolution":{"observed_at":"2026-08-07T13:46:06.481969Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:06.225036Z","title":"Experimental study of inequality and unpredictability in an artificial cultural market","venue":null,"work_id":"62b082cf-47dc-4ef9-8746-70b3a6cc1f4a","year":2006},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.122939Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:ce116c644b45f21e955d05a0625d7554767785160f3113326622d430b6944a97","observation_id":"f51c22dc-2420-4729-af28-c92d37d10a68","resolution":{"observed_at":"2026-08-07T13:46:06.293359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:06.069232Z","title":"Hindsight learning for mdps with exogenous inputs","venue":null,"work_id":"cf946d02-913b-4cda-8fe5-8f73655538c7","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.220863Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:8f92bf41afe04a56426402301af731b426b7cc5afe1df916f37f9e7f132cc25a","observation_id":"92e85aeb-29a6-4dfc-b7ea-55d436807535","resolution":{"observed_at":"2026-08-07T13:46:06.149087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:05.923295Z","title":"Uniform bounds for scheduling with job size estimates","venue":null,"work_id":"2a1cc742-8f27-4a63-812e-88f1fdea7329","year":2022},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.332202Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c710666a150b159b73e4e089ab52471514203c013144542659e59421d08352a2","observation_id":"073b4853-a0f5-405b-94f1-3cbd0aafcd6e","resolution":{"observed_at":"2026-08-07T13:46:05.981602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:05.757023Z","title":"Adaptive matching for expert systems with uncertain task types","venue":null,"work_id":"2d9881cc-951e-41ff-b150-e8cb803f60d3","year":2020},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.406620Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:0a0b99c22dbc384c6daee5a807b1803917cf760792c508da26a75af4ac18e07f","observation_id":"b8cf08ba-7068-456a-8427-0040a001a58b","resolution":{"observed_at":"2026-08-07T13:46:05.846085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:05.590555Z","title":"Backlogged bandits: Cost-effective learning for utility maximization in queueing networks","venue":null,"work_id":"d39287cf-44ab-4c17-876c-edc380669caf","year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.450606Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c02c62ab82e5ef8011dcec20342edd4e94fb025bee8db256f79c9e3e27eecb98","observation_id":"6245a312-3b5e-4da2-be8e-621212236612","resolution":{"observed_at":"2026-08-07T13:46:05.661778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:05.378723Z","title":"Learning algorithms for minimizing queue length regret","venue":null,"work_id":"3e4d538f-d41e-4ade-b9d2-ae1fe5fa5d19","year":2021},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.512779Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:a7479b2bbb6408b14759c6601e4fa903d4f9aa37e66df5d7f707530fd27958d0","observation_id":"cce8cebb-ac2e-4512-8953-1c43e905f302","resolution":{"observed_at":"2026-08-07T13:46:05.482931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:05.211113Z","title":"Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic","venue":null,"work_id":"fe808acf-e499-40d2-825a-b19b8a78f34d","year":2004},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.616722Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:ec7f54e934ffaba0a610775b0e3196a6d194c0523f36dae25b526570409a1d0d","observation_id":"99e0e45f-f737-4beb-9761-6063507aa345","resolution":{"observed_at":"2026-08-07T13:46:05.294560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:05.015396Z","title":"Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks","venue":null,"work_id":"c83b8d65-0b41-4092-9537-bf23470adc01","year":1936},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.718955Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:83131ddd20e33a7f2182d8d2dbfeece2d75a0a33f9a513f4d8cd3e32e9541772","observation_id":"91eef488-266e-4e76-a2e4-a0b669287a0b","resolution":{"observed_at":"2026-08-07T13:46:05.108650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:04.837370Z","title":"Community guidelines, 2025","venue":null,"work_id":"387694b4-008a-47a9-9829-eabee641293b","year":2025},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.824399Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:4727851590b0b3052abf9ba856cb105a49cecd917b0d147d774482e0e8a6fd5a","observation_id":"22558de6-7f9e-402d-bb35-62ecd30bed9d","resolution":{"observed_at":"2026-08-07T13:46:04.935024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:04.707618Z","title":"Our approach to content moderation, 2025","venue":null,"work_id":"c1be3c8b-1dfc-46db-b651-9ead1649f854","year":2025},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-07T13:45:59.940814Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:c4bbb60312dc88cdc2ce039543d02c0af6d4ca1b1979b9a15626355b5bb2c789","observation_id":"f79e36e8-ec34-4354-b176-79a99df6cc57","resolution":{"observed_at":"2026-08-07T13:46:04.764569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:04.491303Z","title":"Power-of-d choices load balancing in the sub-halfin whitt regime","venue":null,"work_id":"5ecc1be1-83e3-4803-b090-780cfb1783cb","year":2023},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-07T13:46:00.037337Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:78315915c1ec60e1d1175f4b0bd0f72310dc674f8af735bdb0293a40978a8599","observation_id":"63c7e425-66f1-4c6a-b5c4-4ba8966df6b4","resolution":{"observed_at":"2026-08-07T13:46:04.598494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:04.261972Z","title":null,"venue":null,"work_id":"29c6c208-21ca-4ba9-ac77-1988ec683320","year":1947},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-07T13:46:00.145589Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:88b68bcc8809c734942892d19510e10d59b7d31cf32cb5c9eb3bfdfbcbd48d68","observation_id":"9c926caf-809c-4d7c-b6d1-cba6059bad07","resolution":{"observed_at":"2026-08-07T13:46:04.374943Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.10168","last_updated":"2024-12-13T14:33:50Z","snapshot_observed_at":"2026-08-13T13:36:02.786172Z","submitted_at":"2024-12-13T14:33:50Z","title":"Learning payoffs while routing in skill-based queues","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.10168","snapshot_observed_at":"2026-08-07T13:46:00.227032Z","title":"Learning payoffs while routing in skill-based queues","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-07T13:46:00.227032Z"},"links":{"cited_paper":"/paper/2412.10168","citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:2114920a403946eabe97a3f565b6eba72986bf71d4fd7aa7d97c673555fc7be4","observation_id":"bf0f1e4f-ee91-4b15-a295-f475393b3914","resolution":{"observed_at":"2026-08-07T13:46:00.227032Z","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-07T13:46:04.130311Z","title":"Dynamic scheduling with convex delay costs: The generalized c| mu rule","venue":null,"work_id":"7c8bdf1e-12e2-43e6-9f1d-bb3e6c2c7b4e","year":1995},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-07T13:46:00.317862Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:befa43f56a5e368d4677abff78ba81fa6af89ccc9c77e1c70ea5e2d6bcbf7b04","observation_id":"20261945-8d38-48ea-8b71-5855f0b6abf6","resolution":{"observed_at":"2026-08-07T13:46:04.183790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:03.986604Z","title":"Restless bandits: Activity allocation in a changing world","venue":null,"work_id":"61bd1206-0406-4b32-bf41-1f4435a6f1d7","year":1988},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-07T13:46:00.393588Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:b160e6de7eb5b48ffad2137e87462d7f71cd7230739ddc59a701899d3d103493","observation_id":"49ae4b6b-9ac2-40c1-8ffc-01c25d8c0bff","resolution":{"observed_at":"2026-08-07T13:46:04.058656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T13:46:03.805161Z","title":"On an index policy for restless bandits","venue":null,"work_id":"fb66efcb-b9c5-418c-8b72-1a42993f0266","year":1990},"citing_paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs","version":2},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-07T13:46:00.536543Z"},"links":{"citing_paper":"/paper/2505.21331"},"observation_digest":"sha256:0d919022713dd8a42ec7130eb98169a7e4f3c84dcbeee06f12a67ac6263a8d0e","observation_id":"b7281378-5566-403e-9b68-33e4b1da7700","resolution":{"observed_at":"2026-08-07T13:46:03.883453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21331","last_updated":"2026-06-02T18:46:22Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T06:29:08.725865Z","submitted_at":"2025-05-27T15:26:24Z","title":"Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":2,"verified_fuzzy":59},"total_outbound_references":108},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 108 outbound references and 0 inbound Pith citation observations for arXiv:2505.21331."}