{"as_of":"2026-08-13T17:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78f63d5b8f154381c6d3406ff54b9e63ad0fe3700587a3819d660729b81d4014","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T04:25:48.447055Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2607.09248/citation-record","integrity":"/paper/2607.09248/integrity","json":"/paper/2607.09248/citation-record.json","paper":"/paper/2607.09248"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3092026","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hardness of approximation for strip packing","venue":"ACM Transactions on Computation Theory","work_id":"be2f974d-3b81-44b8-b07f-73651c789cdb","year":2017},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:f6610dd80b0860c1e7ecd7b88dea1447e4a42e099e425984f04ab12b456bb25a","observation_id":"0e1729fc-9906-44fe-bbfe-bf6c633d3486","resolution":{"observed_at":"2026-07-13T04:29:19.839145Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:05.734193+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:05.734193+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.20382/jocg.v8i1a1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximating minimum-area rectangular and convex containers for packing convex polygons","venue":"Journal of Computational Geometry (Carleton University)","work_id":"0638b0ed-a394-4526-89b1-efd814ebb788","year":2017},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:b85ddaf1b830f03c64537c3d383d1461acc387379dacfbdbc3c8dbeff89d5351","observation_id":"fc67b6b6-8335-4f18-8c1a-67279523a37e","resolution":{"observed_at":"2026-07-13T04:29:19.816409Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:05.986291+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:05.986291+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.11320","last_updated":"2026-05-14T23:11:43Z","snapshot_observed_at":"2026-08-02T11:51:09.028246Z","submitted_at":"2025-04-15T16:00:21Z","title":"Optimizing LLM Inference: Fluid-Guided Online Scheduling with Memory Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.11320","snapshot_observed_at":"2026-07-13T04:25:48.447055Z","title":"Optimizing LLM inference: Fluid-guided online scheduling with memory constraints","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"cited_paper":"/paper/2504.11320","citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:6ce8f46782d3c1cf0e171ccb00afafdb8e31d0b820821e26aee452686b3a630e","observation_id":"afa2f104-74cf-4bbe-99a0-c1f3cc9e89b5","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:7de02329082130c96b031ba4353693906103913fafb6ef7482209ac0618eab2c","observation_id":"774e81f5-d985-4d0f-a4e3-8333668964d5","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1016/j.tcs.2004.05.023","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Semi-clairvoyant scheduling","venue":"Theoretical Computer Science","work_id":"ad75ff5f-28bb-47f3-912a-a6ecf95937d8","year":2004},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:5af3b9ce7b9d673c0b69ebd74e830c4f4e61d5a3da2da9f387209ec1428252b0","observation_id":"72fe8c04-9c58-46ce-abcf-e1cb46906c5a","resolution":{"observed_at":"2026-07-13T04:29:19.769156Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:06.718026+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:06.718026+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:25:48.447055Z","title":"Non-clairvoyant scheduling with partial predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:b74c57e61d8dd059e1dbeac8e5f016e4b6154b91aace1073c8331fae6d16ccbc","observation_id":"b6da8faf-fb51-445d-9a86-2b0440bda17a","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Non-clairvoyant scheduling with progress bars","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:6b5811ca36910c10b6937ab6c399b8994b42bcc9d5e9c094da962949faba7cd3","observation_id":"e42389e6-0710-4bf6-abf0-c4f7545503b6","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1137/s0097539797327180","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Natarajan, and Clifford Stein","venue":"SIAM Journal on Computing","work_id":"76fbaa2a-2353-490b-8ecc-ac11e2b67609","year":2001},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:8005c7471422e9cce58910d7fab26ffe755b43baaa86b11e9424a209160d8afa","observation_id":"3e69b34b-2b98-4f1d-869c-6a98d3d7741e","resolution":{"observed_at":"2026-07-13T04:29:19.790822Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:06.956397+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:06.956397+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611978322.128","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Online scheduling via gradient descent for weighted flow time minimization","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"97a0617b-0c3f-4577-bd9e-9a61c537de68","year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:7a5d21a8b4b8e4a2079d04b04c31841feef9fc6623627c72d5564ffd01728f6b","observation_id":"c70d6550-19a5-4abb-b723-21530623c455","resolution":{"observed_at":"2026-07-13T04:29:19.794518Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:07.208343+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:07.208343+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-12T05:52:43.348832Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-13T04:25:48.447055Z","title":"Adaptively robust LLM inference optimization under prediction uncertainty","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:3340f019ec17757f62ba93403d98c6092aef066fa05d32b4ec8513d16c279d80","observation_id":"a7c914f8-d2fe-4762-8546-eeb4315b3fa5","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1007/s10479-023-05613-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A theoretical and empirical study of job scheduling in cloud computing environments: The weighted completion time minimization problem with capacitated parallel machines","venue":"Annals of Operations Research","work_id":"7f325e82-b9a6-420b-b9ff-33a2ad735f79","year":2024},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:ae0061d0ae01dfa8140b07317165d77611bc0fb6b258ce504087076209286a86","observation_id":"c681334b-2f13-446b-ba5b-39776d95e52a","resolution":{"observed_at":"2026-07-13T04:29:19.743704Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:07.771739+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:07.771739+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07347","last_updated":"2026-05-18T01:04:46Z","snapshot_observed_at":"2026-08-12T13:53:55.914589Z","submitted_at":"2025-04-10T00:12:12Z","title":"Throughput-Optimal Scheduling Algorithms for LLM Inference and AI Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07347","snapshot_observed_at":"2026-07-13T04:25:48.447055Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"cited_paper":"/paper/2504.07347","citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:12683108d50d6b74f0885144cca39f98862ecc11fa0940d999d3b8a469558324","observation_id":"b71c0bbc-ebe6-4d52-99f1-01b1cd670fab","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1016/s0304-3975(02)00488-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lower bounds for on-line single-machine scheduling","venue":"Theoretical Computer Science","work_id":"ccbf18ea-6add-4c28-af53-37bbe14f0d05","year":2003},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:7498a989f2096858070cf569424c085fc935224d1214e3628bfe3bf3a3f8e373","observation_id":"e611eb45-1748-4e5d-bbf6-735384814224","resolution":{"observed_at":"2026-07-13T04:29:19.798953Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:08.305404+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:08.305404+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.22996","doi":"10.48550/arxiv.2601.22996","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive non-clairvoyant kv-cache scheduling for LLM inference","venue":"Open MIND","work_id":"ef2b80ec-2693-4065-a5ae-fe3f5742f9b3","year":2026},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:52b5552dc8aa799f1cb6896c19d0a0ec3c25385a51a73b5083caf0423f1c22b8","observation_id":"27ce7c6f-11b8-4311-8632-bac9e93f1d40","resolution":{"observed_at":"2026-07-13T04:29:19.797671Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:08.541698+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:08.541698+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:25:48.447055Z","title":"Efficient LLM scheduling by learning to rank","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:454ecb4f411f21eddd98ba0fd57cd9f27341bdb4112ce244227b4101fbd44b5b","observation_id":"0acae332-14a2-48fb-8e37-f895883d8c53","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Hall, Andreas S","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:ffb1815b346a3b511a5df361ef671b6d05a5f0614a6b344ee9f1be198d7d2a15","observation_id":"74fa9d91-bc0d-4b54-9663-5cdeb8a2e1a8","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1145/3136754","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive algorithms from competitive equilibria: Non-clairvoyant scheduling under polyhedral constraints","venue":"Journal of the ACM","work_id":"49f3a48d-6603-437b-9ea4-f90799683363","year":2018},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:a25505ce459731192a2019ff9ca8601d254a1702eb316b5dd10076220e53ce0d","observation_id":"58f788a5-2292-430c-9446-9899a5e2c3ac","resolution":{"observed_at":"2026-07-13T04:29:19.723305Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:08.894901+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:08.894901+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3593969","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Non-clairvoyant scheduling with predictions","venue":"ACM Transactions on Parallel Computing","work_id":"485bf6e6-656f-4176-aa29-e2ff184c3a16","year":2023},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:e79851bc1683b9c557847b93c89e5368f612238f191b5a288ab7e9acdada6bc5","observation_id":"7d6462c6-6ff5-4c59-a9e3-796b053b2182","resolution":{"observed_at":"2026-07-13T04:29:19.790086Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:09.140086+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:09.140086+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-024-02118-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling","venue":"Mathematical Programming","work_id":"5c347af5-3600-4b4f-acd3-8b36635c0c23","year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:ae4aacd9367bf850077adc299488cf39ad349d1e458388590a58199ac06b6359","observation_id":"465a669d-adb6-4cc1-ac1f-b7f41aa927e2","resolution":{"observed_at":"2026-07-13T04:29:19.823397Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:09.466944+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:09.466944+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/25m1763974","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The power of proportional fairness for nonclairvoyant polytope scheduling","venue":"SIAM Journal on Computing","work_id":"e38be2b0-d927-4041-8603-03b9a1bb836a","year":2026},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:497b285566987a8d200e66037fe2c74f50ae64a1d0aae2ee75a15fd9b1ef0942","observation_id":"9eed2f10-e4f3-4b2e-91ad-516b23b4cfa1","resolution":{"observed_at":"2026-07-13T04:29:19.765140Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:09.722106+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:09.722106+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:25:48.447055Z","title":"Online scheduling for llm inference with kv cache constraints","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:bbd400454d3d72796d2f4470422cc287b1b73178d75b5010bcef45aab13a7f27","observation_id":"8e926a23-16f9-4ffd-92b2-aec9c1f477fd","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.4230/lipics.esa.2021.53","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Closing the gap for single resource constraint scheduling","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"356e0be3-680a-435b-b366-2a37d599d67a","year":2021},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:d83bc44b888a90f3f23d8c9e2d16af27d8098421ffbc1badcb4e00cc0bc65e09","observation_id":"e8aaf58a-4232-4ba0-985d-6fd9454b8029","resolution":{"observed_at":"2026-07-13T04:29:19.786152Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:09.948386+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:09.948386+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-006-0194-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximizing the total profit of rectangles packed into a rectangle","venue":"Algorithmica","work_id":"057dafa2-30d3-486a-8fec-8d739e755103","year":2007},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:5c8af440914483e72be6a763954d9bec004c821335cac6d52689c735e8754aa5","observation_id":"9ed61de8-d61d-44b7-8191-4737170f32de","resolution":{"observed_at":"2026-07-13T04:29:19.752947Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:10.209433+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:10.209433+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.22327","last_updated":"2026-06-24T14:02:53Z","snapshot_observed_at":"2026-08-07T17:40:04.855669Z","submitted_at":"2026-06-21T04:05:38Z","title":"Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practice","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.22327","snapshot_observed_at":"2026-07-13T04:25:48.447055Z","title":"Geometry-aware online scheduling for llm serving: From theoretical bound to system practice","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"cited_paper":"/paper/2606.22327","citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:c79a6c7b496cd225d799cca6e1460baa7a7b5742ac72434d42e42ab0cd8a3cb8","observation_id":"738b83a8-f866-4f57-b214-b4e83396a075","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.4230/lipics.esa.2023.76","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improved approximations for translational packing of convex polygons","venue":"arXiv (Cornell University)","work_id":"88c28492-2282-4e84-a995-18c326a32ac9","year":2023},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:ae8edd8aaae1e8127bad98b9199f2a4005be1a6bdd8cdc22b0e979bc076663cf","observation_id":"e78edbdb-f06b-4389-8144-f9189e4679e0","resolution":{"observed_at":"2026-07-13T04:29:19.806113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:10.449168+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:10.449168+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:25:48.447055Z","title":"Efficient memory management for large language model serving with pagedattention","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:bd7c87da235077aa747d51f2c7d6a1dd9b7cf9346db023cf5fced0794ea57d88","observation_id":"28d7cf80-ca14-4e5f-92fd-b0991a7741ed","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1137/17m1156332","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations","venue":"SIAM Journal on Computing","work_id":"21e1e7f7-363b-4728-8bdc-3c0985be4ca0","year":2020},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:0298e6a949e357fd196a2e509c2891c55fc20438890121753d5d91be9fb4eeb3","observation_id":"f23e6290-454c-4029-a31f-3df80985a7ee","resolution":{"observed_at":"2026-07-13T04:29:19.740325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:10.698669+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:10.698669+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0377-2217(02)00123-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Two-dimensional packing problems: A survey","venue":"European Journal of Operational Research","work_id":"72255996-fedc-4a63-9d3b-3540fdae6d08","year":2002},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:57b0d84ebf098ebaaa86e0166b8fc289e1d88adf851d019d4b6ac64de99c632b","observation_id":"974bd3cb-17f4-4217-9cbe-e1494f1164dc","resolution":{"observed_at":"2026-07-13T04:29:19.727876Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:11.014968+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:11.014968+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:25:48.447055Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:bcf6e32426b9dc95cd8798ebf69b7fc0dd84d1df1d6ef542410f4773f5164e0d","observation_id":"5317cf91-e59f-4954-8d74-a8172bb47edd","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Phillips, and Eric Torng","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:63ce965c39710541d524d484f2f5416ccedc33260a35bcb98d75877cb38da74b","observation_id":"4694e0f2-bf76-4bbf-ad6a-75288ac1a9bd","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Efficiently scaling transformer inference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:823c2ca86b31230c0aa8fcb2c2ce2ab095a4770a6c2a4ceec5f280d2fdd4be59","observation_id":"c58396ae-bcc3-451d-b332-a50f6898bf4a","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.08509","last_updated":"2024-11-25T17:35:07Z","snapshot_observed_at":"2026-08-13T00:31:53.907277Z","submitted_at":"2024-04-12T14:46:15Z","title":"Efficient Interactive LLM Serving with Proxy Model-based Sequence Length Prediction","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.08509","snapshot_observed_at":"2026-07-13T04:25:48.447055Z","title":"Kalbarczyk, Tamer Basar, and Ravishankar K","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"cited_paper":"/paper/2404.08509","citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:b1b302ad0e6411a234b9b0db5198b229726f6a746a12361b88dd6e5592dd32b4","observation_id":"6074f733-8b52-4ad7-8e45-7b659fd43a4f","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":null,"venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:7cf8d5cfe59576a3ae61915096049d6ed31f532530975bb17ad7a08d726337a3","observation_id":"4cafc7c3-c2d8-4e5a-a639-127d1fc1f4d3","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1137/s0097539793255801","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Steinberg","venue":"SIAM Journal on Computing","work_id":"91609d1d-f699-4a3e-ab46-f7154f620936","year":1997},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:100dbf24e0431ae3616027f67bb9c594a2cb73a208704854c06537653d3a0c7f","observation_id":"66764c2c-d884-44d6-be03-b8ab34747b7b","resolution":{"observed_at":"2026-07-13T04:29:19.779213Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:12.308891+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:12.308891+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:25:48.447055Z","title":"TAPAS: thermal- and power-aware scheduling for LLM inference in cloud platforms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:1943f1385dbdb718a0b6cced9d10eb054d3db494dc9641c8cd3659d39853099b","observation_id":"96f25986-1f4e-4542-848d-b11883258c9d","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Dynamollm: Designing LLM inference clusters for performance and energy efficiency","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:0f91830f5bccd9334eed1f3de94f7cfd3e780a5721ffbf72f7eba0663d914e4d","observation_id":"7b3248fb-9479-4ece-a9d1-3fa3b2e120f8","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Llumnix: Dynamic scheduling for large language model serving","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:44a7b1af20ac06a7ec472ed61db92d19199e1d2aac010dd632b893f0d460dcf3","observation_id":"60ddc9e0-285c-4ce5-aa9f-3883659e50bc","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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":"10.1016/j.jalgor.2004.10.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"La Poutr \\' e","venue":"Journal of Algorithms","work_id":"86894c59-7476-4514-b15e-c24d2f797ce0","year":2005},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:638cd4d786431ff42d88ec3eb9f7781d2e2223c80fe621d75aae73e2b613daa0","observation_id":"eab36816-ebc4-4ae9-be27-476f291be04f","resolution":{"observed_at":"2026-07-13T04:29:19.774934Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-07-13T07:50:13.100109+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T07:50:13.100109+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-13T06:31:53.387327+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-07-13T04:25:48.447055Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:0d93f20224c42505f26cce039ac4010b5669a90c4d07cddadf917345b8f5e0e7","observation_id":"6243f06a-33d0-47e7-b7ef-baa87473d673","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06133","last_updated":"2026-06-28T02:08:15Z","snapshot_observed_at":"2026-08-09T06:10:09.984852Z","submitted_at":"2025-08-08T08:54:21Z","title":"LLM Serving Optimization with Variable Prefill and Decode Lengths","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06133","snapshot_observed_at":"2026-07-13T04:25:48.447055Z","title":"LLM serving optimization with variable prefill and decode lengths","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"cited_paper":"/paper/2508.06133","citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:9d760bfa45350d2f36c8fc0cd83d3a5df1939e5858f19ff91e6adfbe48b65c60","observation_id":"8e3a61ed-affe-44a7-bf55-0e7f4295ef5c","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Orca: A distributed serving system for transformer-based generative models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:0993a0afb9570ae5f4245f90d9eb362597532670f6bfe46dd7f1d4ceccac6208","observation_id":"bfdb213a-7163-4cb2-a16b-689b51f22493","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Gonzalez, Clark W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:f66e1372fdad5f1849b372eb28cf5a1471b96d7fa6e4c606bc6f95d5deb142d2","observation_id":"b0072f54-6d88-40cc-88bd-776aa2ba68a9","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","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-07-13T04:25:48.447055Z","title":"Response length perception and sequence scheduling: An llm-empowered LLM inference pipeline","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-13T04:25:48.447055Z"},"links":{"citing_paper":"/paper/2607.09248"},"observation_digest":"sha256:272b0462c00ff19badb4915e03d443ae5de95abb2d2b914c3a63ecb339b8fa8e","observation_id":"aa74ad44-7261-47bc-a909-3defd7b33739","resolution":{"observed_at":"2026-07-13T04:25:48.447055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09248","last_updated":"2026-07-10T09:52:11Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T11:34:31.912255Z","submitted_at":"2026-07-10T09:52:11Z","title":"General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":19,"verified_fuzzy":0},"total_outbound_references":43},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2607.09248."}