{"as_of":"2026-08-16T08:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:495494dd789ee220eb438a4bd9d0574372cf9384a85f3c524b6a90bdb9e9c9c5","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:25:27.461136Z","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-11T16:34:02.555916Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.04791","last_updated":"2020-04-30T01:39:59Z","snapshot_observed_at":"2026-08-16T07:07:47.897219Z","submitted_at":"2019-04-09T17:11:16Z","title":"Planar graphs have bounded queue-number","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.04791","snapshot_observed_at":"2026-08-14T12:25:27.461136Z","title":"Arxiv report (2019),http://arxiv.org/abs/ 1904.04791","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.07647","last_updated":"2019-08-20T23:52:50Z","snapshot_observed_at":"2026-08-14T11:58:34.045910Z","submitted_at":"2019-08-20T23:52:50Z","title":"Line and Plane Cover Numbers Revisited","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:25:27.461136Z"},"links":{"cited_paper":"/paper/1904.04791","citing_paper":"/paper/1908.07647"},"observation_digest":"sha256:e7a97d644a96851017e3ef67e3db3947f8fa099ce0b16de4d67d059a988f8978","observation_id":"469a5782-0efd-4da9-b178-f1581f0ee4b3","resolution":{"observed_at":"2026-08-14T12:25:27.461136Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.04791","last_updated":"2020-04-30T01:39:59Z","snapshot_observed_at":"2026-08-16T07:07:47.897219Z","submitted_at":"2019-04-09T17:11:16Z","title":"Planar graphs have bounded queue-number","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.04791","snapshot_observed_at":"2026-08-14T11:31:30.647762Z","title":"CoRR abs/1904.04791 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.08938","last_updated":"2019-08-23T17:59:39Z","snapshot_observed_at":"2026-08-14T11:23:13.458915Z","submitted_at":"2019-08-23T17:59:39Z","title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:30.647762Z"},"links":{"cited_paper":"/paper/1904.04791","citing_paper":"/paper/1908.08938"},"observation_digest":"sha256:ba876a0364976030ef4cf41f1eaeef5a7d3fa5a4558cf4797556e076d0b19aab","observation_id":"58687648-26ac-4f5d-a251-5e92474d2175","resolution":{"observed_at":"2026-08-14T11:31:30.647762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.04791","last_updated":"2020-04-30T01:39:59Z","snapshot_observed_at":"2026-08-16T07:07:47.897219Z","submitted_at":"2019-04-09T17:11:16Z","title":"Planar graphs have bounded queue-number","version":5},"cited_work":{"arxiv_id":"1904.04791","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.04791","snapshot_observed_at":"2026-08-11T16:34:02.555916Z","title":"Planar graphs have bounded queue-number","venue":"cs.DM","work_id":"efd819fb-997d-4a43-bb99-f60e5f4f3ed8","year":2019},"citing_paper":{"arxiv_id":"2608.09495","last_updated":"2026-08-10T12:02:50Z","snapshot_observed_at":"2026-08-13T23:44:24.122245Z","submitted_at":"2026-08-10T12:02:50Z","title":"Row pathwidth of complete binary trees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T16:34:02.382930Z"},"links":{"cited_paper":"/paper/1904.04791","citing_paper":"/paper/2608.09495"},"observation_digest":"sha256:3b450d90ae986fda20fa5bb7772168fdfc0fb35a44181519e9403d74d695db66","observation_id":"42f1ec5d-0728-41fd-a383-52f836c1b9b4","resolution":{"observed_at":"2026-08-11T16:34:02.567363Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1904.04791/citation-record","integrity":"/paper/1904.04791/integrity","json":"/paper/1904.04791/citation-record.json","paper":"/paper/1904.04791"},"outbound":[],"paper":{"arxiv_id":"1904.04791","last_updated":"2020-04-30T01:39:59Z","latest_version":5,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T07:07:47.897219Z","submitted_at":"2019-04-09T17:11:16Z","title":"Planar graphs have bounded queue-number"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1904.04791."}