{"as_of":"2026-08-10T00:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:29c8962421fe50dbe1a603b38ec8c49928a539d2730cfbf99ba4fa30e7b9ee35","coverage":[{"denominator":1,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:32:06.912116Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:32:06.912116Z","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-07-04T08:39:41.960930Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":"2508.14544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-04T08:39:41.960930Z","title":"arXiv preprint arXiv:2508.14544 , year=","venue":null,"work_id":"b19c7b2a-7546-4f4e-9d37-9a09354b13e5","year":2025},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T19:44:35.756018Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2504.11320"},"observation_digest":"sha256:008f08cdb45bbd667ef445ca299c095fd51aac90f01925a23e1c515274d6959d","observation_id":"398b6823-6c97-49d2-9b90-32344c985696","resolution":{"observed_at":"2026-05-22T19:45:03.962594Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:31:39.149369Z","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-08-05T18:32:06.912116Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:32:06.912116Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2508.14544"},"observation_digest":"sha256:536731be3f4459671f2d024dd0021d5ca06301cf716a60b2ce89cea7ff51c535","observation_id":"2364bd48-0ec8-4483-bfe5-0d3429bd138e","resolution":{"observed_at":"2026-08-05T18:32:06.912116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","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-08-03T15:10:13.735040Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.18020","last_updated":"2025-12-19T19:24:56Z","snapshot_observed_at":"2026-08-05T16:53:40.020414Z","submitted_at":"2025-12-19T19:24:56Z","title":"Specification and Detection of LLM Code Smells","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T15:10:13.735040Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2512.18020"},"observation_digest":"sha256:b3acc99fbbcd8f56805fc5539c73cd1cff81241b25d64193ba30d12dc89ca8e2","observation_id":"d24e55a9-0a15-445b-b298-3a9e0da065dc","resolution":{"observed_at":"2026-08-03T15:10:13.735040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","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-08-03T05:15:41.936426Z","title":"mixed-mode time units","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02987","last_updated":"2026-06-04T03:39:17Z","snapshot_observed_at":"2026-08-03T05:15:11.229579Z","submitted_at":"2026-02-03T01:47:37Z","title":"Large-Scale LLM Inference with Heterogeneous Workloads: Prefill-Decode Contention and Asymptotically Optimal Control","version":2},"reference_index":2147,"source":"pdf_text","source_observed_at":"2026-08-03T05:15:41.936426Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2602.02987"},"observation_digest":"sha256:6247937dff1b554a388e9b99a710f0ba65e3f837432ff4cf4137157dbca573e0","observation_id":"9d61e3fd-b5a2-45cb-afd7-64a69c392c9c","resolution":{"observed_at":"2026-08-03T05:15:41.936426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":"2508.14544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-04T08:39:41.960930Z","title":"arXiv preprint arXiv:2508.14544 , year=","venue":null,"work_id":"b19c7b2a-7546-4f4e-9d37-9a09354b13e5","year":2025},"citing_paper":{"arxiv_id":"2604.11001","last_updated":"2026-04-13T05:03:16Z","snapshot_observed_at":"2026-08-08T18:06:41.472244Z","submitted_at":"2026-04-13T05:03:16Z","title":"Flow-Controlled Scheduling for LLM Inference with Provable Stability Guarantees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T15:51:11.343200Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2604.11001"},"observation_digest":"sha256:b964437c3fc9b9c5acb9e10b64a10e277975679fbf826857b229baa8e744266c","observation_id":"538e34e0-18b7-409b-a606-b326e43a94f8","resolution":{"observed_at":"2026-05-11T09:46:03.143427Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":"2508.14544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-04T08:39:41.960930Z","title":"arXiv preprint arXiv:2508.14544 , year=","venue":null,"work_id":"b19c7b2a-7546-4f4e-9d37-9a09354b13e5","year":2025},"citing_paper":{"arxiv_id":"2605.01280","last_updated":"2026-05-02T06:31:11Z","snapshot_observed_at":"2026-08-03T03:47:16.035466Z","submitted_at":"2026-05-02T06:31:11Z","title":"Position: LLM Serving Needs Mathematical Optimization and Algorithmic Foundations, Not Just Heuristics","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-09T18:53:29.089882Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2605.01280"},"observation_digest":"sha256:246129c8ce945281580ef328e7829fc41bd58216d72137e1b3d8c443b75c0dc6","observation_id":"b4fd064d-1469-496a-b75f-ffcec00dd40d","resolution":{"observed_at":"2026-05-11T16:01:20.727050Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":"2508.14544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-04T08:39:41.960930Z","title":"arXiv preprint arXiv:2508.14544 , year=","venue":null,"work_id":"b19c7b2a-7546-4f4e-9d37-9a09354b13e5","year":2025},"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":18,"source":"arxiv_source","source_observed_at":"2026-05-08T17:28:05.492863Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2605.04595"},"observation_digest":"sha256:68ed4ae0f23ef3cab3d1bfb18f15db37e7be923c801dd24f35a9eca7e79aefe1","observation_id":"67cc1538-809b-41c1-9d0f-e5736c3ebfeb","resolution":{"observed_at":"2026-05-11T17:31:08.948886Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":"2508.14544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-04T08:39:41.960930Z","title":"arXiv preprint arXiv:2508.14544 , year=","venue":null,"work_id":"b19c7b2a-7546-4f4e-9d37-9a09354b13e5","year":2025},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-08T05:22:14.122156Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:37837cf535288eb7e38b4906619604328b1e8b6a180f586e531f2996bc0cf535","observation_id":"46dbc344-2864-467d-9ef2-9cb4eb6f4030","resolution":{"observed_at":"2026-05-11T21:31:14.005214Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":"2508.14544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-04T08:39:41.960930Z","title":"arXiv preprint arXiv:2508.14544 , year=","venue":null,"work_id":"b19c7b2a-7546-4f4e-9d37-9a09354b13e5","year":2025},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-11T00:59:57.639525Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:6613d9b4f92be5a53ae714ee502ccb5a6f507cfbe4ef6417a34d0a2652497a03","observation_id":"5ac618de-be4f-4d9d-afed-6cf8f7695a58","resolution":{"observed_at":"2026-05-11T04:55:56.980096Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"cited_work":{"arxiv_id":"2508.14544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.14544","snapshot_observed_at":"2026-07-04T08:39:41.960930Z","title":"arXiv preprint arXiv:2508.14544 , year=","venue":null,"work_id":"b19c7b2a-7546-4f4e-9d37-9a09354b13e5","year":2025},"citing_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},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T11:17:35.860286Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2606.22327"},"observation_digest":"sha256:67cb8f1fafc082e1c79c277e7a901c5e2cbd65433a6738eabc46648faace7a74","observation_id":"8aaedffc-3e69-4479-b002-03ec1705dbda","resolution":{"observed_at":"2026-07-04T08:39:41.962503Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-05T18:31:39.149369Z","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-08T07:42:04.363588Z","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:3fcafa6259d19b864a535adab859f0d745fbc4d2cff4b9f5a43b74a8bba1d7a0","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":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","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-08-04T10:54:01.285290Z","title":"Aakanksha Chowdhery, Sharan Narang, Jacob Devlin, Maarten Bosma, Gaurav Mishra, Adam Roberts, Paul Barham, Hyung Won Chung, Charles Sutton, Sebastian Gehrmann, et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02244","last_updated":"2026-08-03T13:55:20Z","snapshot_observed_at":"2026-08-08T06:39:19.636143Z","submitted_at":"2026-08-03T13:55:20Z","title":"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T10:54:01.285290Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2608.02244"},"observation_digest":"sha256:8e8ffe23bf7a89d956afb0a8802bea1f3f3be83e94ab333af9ccfb97e94b4fc8","observation_id":"df53f8bc-474a-4790-9a86-10abbd444944","resolution":{"observed_at":"2026-08-04T10:54:01.285290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.14544/citation-record","integrity":"/paper/2508.14544/integrity","json":"/paper/2508.14544/citation-record.json","paper":"/paper/2508.14544"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","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-08-05T18:32:06.912116Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:32:06.912116Z"},"links":{"cited_paper":"/paper/2508.14544","citing_paper":"/paper/2508.14544"},"observation_digest":"sha256:536731be3f4459671f2d024dd0021d5ca06301cf716a60b2ce89cea7ff51c535","observation_id":"2364bd48-0ec8-4483-bfe5-0d3429bd138e","resolution":{"observed_at":"2026-08-05T18:32:06.912116Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.14544","last_updated":"2025-09-01T07:38:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T18:31:39.149369Z","submitted_at":"2025-08-20T08:55:26Z","title":"Adaptively Robust LLM Inference Optimization under Prediction Uncertainty"},"reference_resolution":{"displayed":1,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":1},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 1 of 1 outbound references and 12 inbound Pith citation observations for arXiv:2508.14544."}