{"as_of":"2026-08-20T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3558dcd060fffea173894f36f7ee5a20d94612cd0cced7abe9ff90d6e4e0d059","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-19T06:32:44.657259+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-07-30T20:06:15.074603Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.00657","last_updated":"2021-09-02T00:36:16Z","snapshot_observed_at":"2026-08-20T00:57:53.313989Z","submitted_at":"2021-09-02T00:36:16Z","title":"Multi-Queues Can Be State-of-the-Art Priority Schedulers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00657","snapshot_observed_at":"2026-07-30T20:06:15.074603Z","title":"Multi-queues can be state-of-the-art priority schedulers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26821","last_updated":"2026-07-29T12:15:35Z","snapshot_observed_at":"2026-08-13T14:31:56.374310Z","submitted_at":"2026-07-29T12:15:35Z","title":"Mind the Gap: The Disconnect Between Synthetic and Natural Edge Weights in Parallel Single-Source Shortest Path","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-30T20:06:15.074603Z"},"links":{"cited_paper":"/paper/2109.00657","citing_paper":"/paper/2607.26821"},"observation_digest":"sha256:a3fcab2a2dce7626a2899b8e5389126096e16ac2062e6e40cd4acc28a6db7006","observation_id":"3cd018a8-fb1b-4388-b3df-4c4a675ba852","resolution":{"observed_at":"2026-07-30T20:06:15.074603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2109.00657/citation-record","integrity":"/paper/2109.00657/integrity","json":"/paper/2109.00657/citation-record.json","paper":"/paper/2109.00657"},"outbound":[],"paper":{"arxiv_id":"2109.00657","last_updated":"2021-09-02T00:36:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T00:57:53.313989Z","submitted_at":"2021-09-02T00:36:16Z","title":"Multi-Queues Can Be State-of-the-Art Priority Schedulers"},"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 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2109.00657."}