{"as_of":"2026-08-19T19:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3cd1fa6c5c054ca4a2cec0156a5c1e14d2346852116b28762b71c14e7a769c6e","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-19T06:32:44.657259+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-16T00:48:50.726654Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T17:36:57.533209Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.13812","last_updated":"2026-07-08T06:40:29Z","snapshot_observed_at":"2026-08-16T14:24:44.498086Z","submitted_at":"2024-01-24T21:07:02Z","title":"A Characterization of Universally Optimal Queueing Regimes","version":4},"cited_work":{"arxiv_id":"2401.13812","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.13812","snapshot_observed_at":"2026-08-08T17:36:57.533209Z","title":"A Characterization of Universally Optimal Queueing Regimes","venue":"econ.TH","work_id":"5975aa86-1fb0-4de4-8162-fa36445b735a","year":2024},"citing_paper":{"arxiv_id":"2502.05906","last_updated":"2026-07-08T06:06:12Z","snapshot_observed_at":"2026-08-18T05:19:21.056450Z","submitted_at":"2025-02-09T13:54:35Z","title":"Strategic Queues with Priority Classes","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T17:36:57.481463Z"},"links":{"cited_paper":"/paper/2401.13812","citing_paper":"/paper/2502.05906"},"observation_digest":"sha256:bf711991e5cb32ac64b3f7a862df522163d12b5d090e3f7270b7d4104eff7e53","observation_id":"5dcc7dde-f110-4008-a2b0-9999673a0c9d","resolution":{"observed_at":"2026-08-08T17:36:57.540169Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13812","last_updated":"2026-07-08T06:40:29Z","snapshot_observed_at":"2026-08-16T14:24:44.498086Z","submitted_at":"2024-01-24T21:07:02Z","title":"A Characterization of Universally Optimal Queueing Regimes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.13812","snapshot_observed_at":"2026-08-16T00:48:50.726654Z","title":"arXiv preprint arXiv:2401.13812 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.11710","last_updated":"2026-08-12T06:46:07Z","snapshot_observed_at":"2026-08-16T00:27:38.100463Z","submitted_at":"2026-08-12T06:46:07Z","title":"How to Beat FCFS","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T00:48:50.726654Z"},"links":{"cited_paper":"/paper/2401.13812","citing_paper":"/paper/2608.11710"},"observation_digest":"sha256:a637de931d2de05926839f39f1ffc8e80d9a21d58ea2b2e593fea247022b047e","observation_id":"d302e48a-f801-4207-b1cb-31cd51a9dbda","resolution":{"observed_at":"2026-08-16T00:48:50.726654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.13812/citation-record","integrity":"/paper/2401.13812/integrity","json":"/paper/2401.13812/citation-record.json","paper":"/paper/2401.13812"},"outbound":[],"paper":{"arxiv_id":"2401.13812","last_updated":"2026-07-08T06:40:29Z","latest_version":4,"primary_category":"econ.TH","snapshot_observed_at":"2026-08-16T14:24:44.498086Z","submitted_at":"2024-01-24T21:07:02Z","title":"A Characterization of Universally Optimal Queueing Regimes"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2401.13812."}