{"as_of":"2026-08-18T09:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b0267faad8d39a354aa929702ca2de49ffa893ff6c66c22123420bb3f6acbcb","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:28:39.498321Z","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.985001Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.08804","last_updated":"2024-02-13T21:21:32Z","snapshot_observed_at":"2026-08-17T12:29:31.870884Z","submitted_at":"2024-02-13T21:21:32Z","title":"When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08804","snapshot_observed_at":"2026-08-10T15:28:39.498321Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14155","last_updated":"2025-01-24T00:46:52Z","snapshot_observed_at":"2026-08-16T17:02:13.017234Z","submitted_at":"2025-01-24T00:46:52Z","title":"Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T15:28:39.498321Z"},"links":{"cited_paper":"/paper/2402.08804","citing_paper":"/paper/2501.14155"},"observation_digest":"sha256:f7be410c6c359f950c866ea60a57b1ae7b4d619d752a13de7c5ee9fa30c04e8d","observation_id":"c62928e9-d09e-4b28-a309-b84a49c81ed7","resolution":{"observed_at":"2026-08-10T15:28:39.498321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08804","last_updated":"2024-02-13T21:21:32Z","snapshot_observed_at":"2026-08-17T12:29:31.870884Z","submitted_at":"2024-02-13T21:21:32Z","title":"When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation","version":1},"cited_work":{"arxiv_id":"2402.08804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.08804","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2402.08804 , year=","venue":null,"work_id":"73e74ff1-344d-41f8-a715-817b4a7d4906","year":null},"citing_paper":{"arxiv_id":"2605.04595","last_updated":"2026-05-06T07:42:26Z","snapshot_observed_at":"2026-08-12T18:42:17.240938Z","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":32,"source":"arxiv_source","source_observed_at":"2026-05-08T17:28:05.492863Z"},"links":{"cited_paper":"/paper/2402.08804","citing_paper":"/paper/2605.04595"},"observation_digest":"sha256:626b4f71a9c8cebe3f899de7f9afb2d62a26e3f5a8992e70cb40acb1acfe0364","observation_id":"9ac9f29c-27ee-44ea-a331-1a273461ee2d","resolution":{"observed_at":"2026-05-11T17:31:08.987076Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.08804/citation-record","integrity":"/paper/2402.08804/integrity","json":"/paper/2402.08804/citation-record.json","paper":"/paper/2402.08804"},"outbound":[],"paper":{"arxiv_id":"2402.08804","last_updated":"2024-02-13T21:21:32Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-17T12:29:31.870884Z","submitted_at":"2024-02-13T21:21:32Z","title":"When Should you Offer an Upgrade: Online Upgrading Mechanisms for Resource Allocation"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.08804."}