{"as_of":"2026-08-17T02:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:65bacbd426251511504efee523158a4448555c077d1196a1b6d2ccdd635b5dc3","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-16T06:30:59.297886+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-14T14:27:00.625401Z","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-14T04:57:22.594607Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.05269","last_updated":"2022-01-20T21:26:29Z","snapshot_observed_at":"2026-08-14T16:48:34.953864Z","submitted_at":"2019-04-10T16:13:30Z","title":"Planar graphs have bounded nonrepetitive chromatic number","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.05269","snapshot_observed_at":"2026-08-14T14:27:00.625401Z","title":"Dujmovi\\' c , L","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"1908.03341","last_updated":"2020-04-17T13:25:26Z","snapshot_observed_at":"2026-08-16T15:27:39.754317Z","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.625401Z"},"links":{"cited_paper":"/paper/1904.05269","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:04928480290363c041c5ef25388c9982a71afad572151d5a3c1f54ac9422a6ad","observation_id":"4cf1fa06-c4fd-40bb-abc5-64d619560f20","resolution":{"observed_at":"2026-08-14T14:27:00.625401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.05269","last_updated":"2022-01-20T21:26:29Z","snapshot_observed_at":"2026-08-14T16:48:34.953864Z","submitted_at":"2019-04-10T16:13:30Z","title":"Planar graphs have bounded nonrepetitive chromatic number","version":4},"cited_work":{"arxiv_id":"1904.05269","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.05269","snapshot_observed_at":"2026-08-14T04:57:22.594607Z","title":"Planar graphs have bounded nonrepetitive chromatic number","venue":"math.CO","work_id":"6090370c-0f20-4949-9ee7-8ea0f4f02285","year":2019},"citing_paper":{"arxiv_id":"1909.02612","last_updated":"2019-09-05T19:38:29Z","snapshot_observed_at":"2026-08-16T18:28:28.187556Z","submitted_at":"2019-09-05T19:38:29Z","title":"A note about online nonrepetitive coloring $k$-trees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T04:57:22.544821Z"},"links":{"cited_paper":"/paper/1904.05269","citing_paper":"/paper/1909.02612"},"observation_digest":"sha256:e8ff7f895824e49b45760bfb30df63a6c5cddf0fdaaefd42d0856a59dcdbb13a","observation_id":"4530298b-64f3-46d0-aed6-6318426749f6","resolution":{"observed_at":"2026-08-14T04:57:22.600280Z","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.05269/citation-record","integrity":"/paper/1904.05269/integrity","json":"/paper/1904.05269/citation-record.json","paper":"/paper/1904.05269"},"outbound":[],"paper":{"arxiv_id":"1904.05269","last_updated":"2022-01-20T21:26:29Z","latest_version":4,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T16:48:34.953864Z","submitted_at":"2019-04-10T16:13:30Z","title":"Planar graphs have bounded nonrepetitive chromatic 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 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1904.05269."}