{"as_of":"2026-08-16T19:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ce76f8b0e83db20a17fdaac478c6c9074ca85ef289f7a5d92807d91df434f66","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-16T06:30:59.297886+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-14T14:27:00.630238Z","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-14T14:27:01.922203Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.04280","last_updated":"2021-02-04T19:39:41Z","snapshot_observed_at":"2026-08-06T20:54:22.783096Z","submitted_at":"2020-03-09T17:39:55Z","title":"Adjacency Labelling for Planar Graphs (and Beyond)","version":4},"cited_work":{"arxiv_id":"2003.04280","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.04280","snapshot_observed_at":"2026-08-14T14:27:01.922203Z","title":"Adjacency Labelling for Planar Graphs (and Beyond)","venue":"cs.DS","work_id":"6f9998c6-83b4-4112-a8f7-8e613b74bce7","year":2020},"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":22,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.630238Z"},"links":{"cited_paper":"/paper/2003.04280","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:f6f3f448d0b346c103612c5b546cbf4a57378616c3b92c6610124f80ad2b6802","observation_id":"f7fca0a5-3578-4206-a653-d41b4763d086","resolution":{"observed_at":"2026-08-14T14:27:01.927996Z","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/2003.04280/citation-record","integrity":"/paper/2003.04280/integrity","json":"/paper/2003.04280/citation-record.json","paper":"/paper/2003.04280"},"outbound":[],"paper":{"arxiv_id":"2003.04280","last_updated":"2021-02-04T19:39:41Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T20:54:22.783096Z","submitted_at":"2020-03-09T17:39:55Z","title":"Adjacency Labelling for Planar Graphs (and Beyond)"},"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 1 inbound Pith citation observation for arXiv:2003.04280."}