{"as_of":"2026-08-11T01:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b099a7bcb21b6cb56520337b5d5b4d87a09cdfce5c75a31e78cf7dfa322e76ae","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:22.565671Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T17:31:08.998185Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.07545","last_updated":"2025-03-10T17:12:47Z","snapshot_observed_at":"2026-08-07T17:16:04.917614Z","submitted_at":"2025-03-10T17:12:47Z","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","version":1},"cited_work":{"arxiv_id":"2503.07545","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.07545","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2503.07545 , year=","venue":null,"work_id":"bf879cd8-2120-4508-aa0a-f6ee44b65ca0","year":null},"citing_paper":{"arxiv_id":"2605.04595","last_updated":"2026-05-06T07:42:26Z","snapshot_observed_at":"2026-08-08T18:04:13.922410Z","submitted_at":"2026-05-06T07:42:26Z","title":"A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraints","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-08T17:28:05.492863Z"},"links":{"cited_paper":"/paper/2503.07545","citing_paper":"/paper/2605.04595"},"observation_digest":"sha256:46bd6f18bb9afc94b432aa0247be4f54d6e65c43f92ed58d83ed8adc4254290a","observation_id":"c9321bc6-2c87-4409-96b3-d1f6342fd0f4","resolution":{"observed_at":"2026-05-11T17:31:09.005785Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07545","last_updated":"2025-03-10T17:12:47Z","snapshot_observed_at":"2026-08-07T17:16:04.917614Z","submitted_at":"2025-03-10T17:12:47Z","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07545","snapshot_observed_at":"2026-08-02T14:08:00.817791Z","title":"Queueing, predictions, and llms: Challenges and open problems, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18253","last_updated":"2026-05-13T20:29:09Z","snapshot_observed_at":"2026-08-08T22:52:01.648545Z","submitted_at":"2026-05-13T20:29:09Z","title":"Beyond Accuracy and Cost: Latency-Aware LLM Query Routing for Dynamic Workloads","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T14:08:00.817791Z"},"links":{"cited_paper":"/paper/2503.07545","citing_paper":"/paper/2607.18253"},"observation_digest":"sha256:cc551fa08b6530cbfa65d553680deed1ddea41402943de9614b405e1fa902739","observation_id":"b1a212d1-eb34-4a51-8ea6-a0bb161ed5b6","resolution":{"observed_at":"2026-08-02T14:08:00.817791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07545","last_updated":"2025-03-10T17:12:47Z","snapshot_observed_at":"2026-08-07T17:16:04.917614Z","submitted_at":"2025-03-10T17:12:47Z","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07545","snapshot_observed_at":"2026-07-31T14:12:11.642314Z","title":"Mitzenmacher and N","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28223","last_updated":"2026-07-30T13:57:45Z","snapshot_observed_at":"2026-08-07T23:28:10.849805Z","submitted_at":"2026-07-30T13:57:45Z","title":"Queue-Theoretic Admission Control for Multi-Tenant GPU Clusters","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T14:12:11.642314Z"},"links":{"cited_paper":"/paper/2503.07545","citing_paper":"/paper/2607.28223"},"observation_digest":"sha256:0aca16d27b702f9c768fe8b50530f69260875b79f2eb2253e553ebefb1789440","observation_id":"a26faee8-2cba-4076-ace8-1f5a8fcd46ed","resolution":{"observed_at":"2026-07-31T14:12:11.642314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.07545","last_updated":"2025-03-10T17:12:47Z","snapshot_observed_at":"2026-08-07T17:16:04.917614Z","submitted_at":"2025-03-10T17:12:47Z","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.07545","snapshot_observed_at":"2026-08-07T14:20:22.565671Z","title":"Mitzenmacher, R","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06135","last_updated":"2026-08-06T15:07:43Z","snapshot_observed_at":"2026-08-09T23:12:59.185361Z","submitted_at":"2026-08-06T15:07:43Z","title":"LLM Inference Under Bursty Workload Distribution: Modifying the WAIT Algorithm","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:22.565671Z"},"links":{"cited_paper":"/paper/2503.07545","citing_paper":"/paper/2608.06135"},"observation_digest":"sha256:1ce6ccf9fa952455ae6495b94bb73ce7c9949b1c1bd0b0d1b76bdedf54b55100","observation_id":"510b626f-eb45-4bd0-a468-aedc791ff6f5","resolution":{"observed_at":"2026-08-07T14:20:22.565671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.07545/citation-record","integrity":"/paper/2503.07545/integrity","json":"/paper/2503.07545/citation-record.json","paper":"/paper/2503.07545"},"outbound":[],"paper":{"arxiv_id":"2503.07545","last_updated":"2025-03-10T17:12:47Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-07T17:16:04.917614Z","submitted_at":"2025-03-10T17:12:47Z","title":"Queueing, Predictions, and LLMs: Challenges and Open Problems"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.07545."}