{"as_of":"2026-08-17T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47d2b68f2bef3dc935049cd5301c4068d985988b313ad919816c1be90925dd3f","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T22:49:10.064714Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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.03948/citation-record","integrity":"/paper/2607.03948/integrity","json":"/paper/2607.03948/citation-record.json","paper":"/paper/2607.03948"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"Langley , title =","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:5dec76daaf8f88c87082b7a562544f85359b6575b59ccb20833c1b6676cd8923","observation_id":"cbc982bc-f723-4aba-8482-27391a8b0bd1","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:76065e3b6368a1d9e96777604dadf4fac983dc9745b87a0ed6a16116dde74683","observation_id":"c6ec67f6-7d8a-487b-a684-48698f60d760","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:420261fe73be7d86864f73344b8c49422920c8c32c7704eff7a4345541dcc1aa","observation_id":"65ca804f-5e39-4c99-884d-81e14ec03b37","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"parse_uncertain"},"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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:0025ff904eb9d7bb16ecd9dc7d17a064a35d9e50f6aa9d3de7bf7a34e500382c","observation_id":"a7bba7da-b8d5-41ed-a518-f90d08be645a","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:073e3538c2cf4cfe5fe7c396011e4e50382e7a1caf9d69bbf6fd4cc5cc027aca","observation_id":"5444ce36-d41f-4f49-8350-05b2085cc1c2","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:27e0561e561a2a6384f5e23aff2b2552ba7a68f61d2800830df81a36efe3c9a0","observation_id":"450ed111-d793-44bb-9b97-a9ef8ce06587","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Newell and P","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:e14b3a8195ba3a1bc688e469d536f6cabc160b382a77db9a2f1a5a23f2de5112","observation_id":"dbd82cfd-ec93-4ad9-b6ca-3f13acc9cd90","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:af698d4ce872a362716aa8bddfa4fe69f0f1e0013470ecf0e0ff5f170e2b9d0b","observation_id":"fd17d795-df08-47c6-a5c0-c232222d83f4","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Proceedings of the 29th Symposium on Operating Systems Principles , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:94869b6bc363021ffa4cf20039f8c10df8a12f97f6efb09a49bc21ec598f6e18","observation_id":"d1b9ac3e-a94d-4f42-8983-6fc792fdcd1f","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:6154f25c8f6248d71f5560001aad4c1461a9360d7e7c90cb9f349b460eabbe06","observation_id":"96d24c35-9b3d-4799-8947-ba37935ca673","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-16T14:01:24.379484Z","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-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2404.08509 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2404.08509","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:28582219f3ba6ddbdc89f537baf4ac6b7e3242a9be18e2f2337d5df5f0490372","observation_id":"144f9d3b-2a0f-4c9f-ae40-97a4e2c6276b","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-16T13:23:12.114483Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2408.15792 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:eee36328822ecc039dd7eccef7d58d8501c92bf1490a7525082c2fb6d3fd144a","observation_id":"350e49ef-b6b2-471d-b256-6e98cc0f76a4","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.14743","last_updated":"2024-12-13T21:54:16Z","snapshot_observed_at":"2026-08-15T04:43:16.853454Z","submitted_at":"2024-12-13T21:54:16Z","title":"KVDirect: Distributed Disaggregated LLM Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14743","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2501.14743 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2501.14743","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:e2591433e08079b79fd9a2b95a23ebd396857eae5fc532f5139b2be511faf88e","observation_id":"68adcf41-e90a-4c1d-8498-0b26a7706746","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-16T13:13:35.887314Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:59e268a1af0c6336fd81b0d1c4f9462a5f404c5da7e7778162dcb59c3f10b75c","observation_id":"e8703276-6d49-4fb0-825f-01d8bf30b3c3","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Management science , volume=","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:ad1a7d492a622e5b20e3cfa7238483f07a0defea7a8bf6054bce6b8ba5d06082","observation_id":"98bd45a3-927e-40c5-a0a8-2fc540941546","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Mathematics of Operations Research , volume=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:0b0599d670b35ef510ebb21c4b8a7a79a3d299b3a5c1be7872524a8a9a445c61","observation_id":"b5268156-c55b-402c-bdc3-8d5dd4724b75","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:a628627759cf57f583870c49325b07d8c410c3d35968303a6b39f1d99c40656c","observation_id":"4ca93d06-7268-4cbe-82d5-829c1e23b1aa","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Proceedings of the 20th international conference on machine learning (icml-03) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:80cc698bbe9b5105356287423c9088235e145575171c2c5327395ebebd883a37","observation_id":"03a20e5f-e3b9-433a-8d6a-e379e1df5d25","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.06327","last_updated":"2022-07-06T18:38:54Z","snapshot_observed_at":"2026-08-16T19:06:21.479394Z","submitted_at":"2020-11-12T11:50:06Z","title":"Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.06327","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2011.06327 , year=","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2011.06327","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:abd848ca6ecb8f3487a50367430eaa22f21997e6056a05a9eee1249970530d94","observation_id":"f064ae84-8182-4e31-8e48-e359e7607cd9","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Operations Research , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:830e98e5c77ae4e0afb6758ae595c64e018d3d1b3b2ad649ff5ffd528ecf5431","observation_id":"bc36a13a-a506-4797-9b7b-8aa48a5856c6","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"https://www.theverge.com/news/710867/openai-chatgpt-daily-prompts-2-billionutmsource=chatgpt.com , url=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:5565f4ecef2561a45c73cb34f186d72413f605c3b3b4a9ee9310ae21a6dc4fcc","observation_id":"b9c73e53-9387-4afb-bb80-050257b3efdd","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Vidur: A Large-Scale Simulation Framework For","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:5c3ae465e88c94c5e47df5d64df391690b95465942466bf7ee81b7c5eab07004","observation_id":"adf9b2a7-240e-47e0-b543-4eb46a0d4c99","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Taming throughput-latency tradeoff in","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:1979d84c981c8c2c1d4e284e09fbfa1164e8463f70e88ab5cdffa816f34f20c1","observation_id":"cbbc352f-1ad4-4a51-900d-0b6d72af4b31","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Proceedings of Machine Learning and Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:88c44c497b98cad0694dfaeaa73a7e497cceece1ccd84f01f703a9f93e1a5920","observation_id":"b56f48df-ac87-4134-992f-aaa507a6c698","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Flexgen: High-throughput generative inference of large language models with a single","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:b647a3189feeabff9373e5eac2b23cad334847df927067c9bc0101a42f267bde","observation_id":"321fbd9d-5104-4e16-a8cd-735d2a213f3a","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22) , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:5a3f186b531fd86c7b80560fe38522c3d93706d23454e5e809cf0bd964437458","observation_id":"c1fca40c-3168-40fe-8599-868268c9b79d","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09670","last_updated":"2024-06-06T15:50:51Z","snapshot_observed_at":"2026-08-16T14:26:37.115667Z","submitted_at":"2024-01-18T01:03:38Z","title":"DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Serving","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09670","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2401.09670 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2401.09670","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:7e691da35967b3ee5a2dbb57c0d6fc81227f75e3d5e127f07a0768a398ed744c","observation_id":"4e0c021e-9380-46e9-ae8a-92cfbf000312","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2509.02718 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:5109230571c1cf123e386b98937985410a5c085c0f479ca149728197fe9bd3fd","observation_id":"25a0bf96-1e0a-4ac8-9659-0e8ff102485e","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"ACM SIGKDD Explorations Newsletter , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:ff3f3ecd15d0c1f52b0f114b189ea85c4c315aa28b5d884bf5efe7311787ebca","observation_id":"a58c6786-52da-4d77-b3ec-ab5ca9ca98ee","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13510","last_updated":"2025-01-07T18:16:17Z","snapshot_observed_at":"2026-08-16T13:24:09.977171Z","submitted_at":"2024-08-24T08:12:22Z","title":"Intelligent Router for LLM Workloads: Improving Performance Through Workload-Aware Load Balancing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13510","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2408.13510 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2408.13510","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:e0e1cd8154dc5cd800fc20345f135d00d95f286020860921be7b523514006e00","observation_id":"dd6e5118-e57f-48dd-9695-7b07919121fd","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"1984 , publisher=","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:c38a7cf9c425e92e16785b2b92d09bb60809b7908f7bf71cc6f8f4c5e456dda2","observation_id":"3af7f191-546f-4828-8e96-50dc486da223","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Operations research , volume=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:ac84529c8050bf68403866cba3b93d9dcfa32451c80507cf0cd11abefbe79ecf","observation_id":"e9065610-3b58-4174-8898-c2343fe82cde","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:e627fdf82fdd1c971df4a5e2e42dc5df9c017dc6215c43c187c1d153633313a6","observation_id":"9e1dca89-641d-4dfd-9a32-8a3e7c357eb0","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:9b27d4abc44d7d2bad6c548860e6fcb9f68656d211a8e853328ec31ae328ed1b","observation_id":"5109ea52-2ce1-4f53-8fa0-4045d7b22107","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":"2025 , month = mar, note =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:3dd59cdba1325ed304bb52ee43fcad8c6b40b95e0f082f76733181348bc06b93","observation_id":"8ca2644f-d4e0-4ca1-8497-ace98514fd89","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","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-11T22:49:10.064714Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:b275190cc4df3a6d3e19faa1b1603e8d2a58b9a84a32cbc1fd05bb8b58773007","observation_id":"804aef8b-8fe8-453f-9a43-6271d67f298b","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-17T02:57:19.224733Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":35,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":36},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.03948."}