{"as_of":"2026-08-17T22:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d3cac8bbc44808ec35810bfb2b0a5bd004f7e4b543015235abe7b559bcb1deb2","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T17:36:57.291220Z","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.556803Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.07746","last_updated":"2023-07-15T08:55:37Z","snapshot_observed_at":"2026-08-16T15:16:03.536026Z","submitted_at":"2023-07-15T08:55:37Z","title":"Optimal Queue Design","version":1},"cited_work":{"arxiv_id":"2307.07746","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.07746","snapshot_observed_at":"2026-08-08T17:36:57.556803Z","title":"Optimal Queue Design","venue":"econ.TH","work_id":"5311d979-6d3b-42ae-8ebb-f0e3f3d8935a","year":2023},"citing_paper":{"arxiv_id":"2502.05906","last_updated":"2026-07-08T06:06:12Z","snapshot_observed_at":"2026-08-13T06:19:54.528225Z","submitted_at":"2025-02-09T13:54:35Z","title":"Strategic Queues with Priority Classes","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T17:36:57.291220Z"},"links":{"cited_paper":"/paper/2307.07746","citing_paper":"/paper/2502.05906"},"observation_digest":"sha256:9c373f3a1bc29cd697318b249fedd97aaa3936db1b9a76ce667d63aa756306b5","observation_id":"96a06cea-f910-47cb-97e0-d0c42a3db928","resolution":{"observed_at":"2026-08-08T17:36:57.561490Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2307.07746/citation-record","integrity":"/paper/2307.07746/integrity","json":"/paper/2307.07746/citation-record.json","paper":"/paper/2307.07746"},"outbound":[],"paper":{"arxiv_id":"2307.07746","last_updated":"2023-07-15T08:55:37Z","latest_version":1,"primary_category":"econ.TH","snapshot_observed_at":"2026-08-16T15:16:03.536026Z","submitted_at":"2023-07-15T08:55:37Z","title":"Optimal Queue Design"},"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-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 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2307.07746."}