{"as_of":"2026-08-16T18:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8663da9ed1835fd4e9c3fdfa4123216800cf2fb56c581a27f16f8afce86a8311","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.526391Z","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:02.080576Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1607.04911","last_updated":"2016-07-21T20:40:49Z","snapshot_observed_at":"2026-08-16T15:27:48.609219Z","submitted_at":"2016-07-17T19:45:01Z","title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs","version":2},"cited_work":{"arxiv_id":"1607.04911","doi":null,"metadata_source":"pith","pith_arxiv_id":"1607.04911","snapshot_observed_at":"2026-08-14T14:27:02.080576Z","title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs","venue":"cs.DS","work_id":"69edeb79-3b71-45e0-89ea-7c00a47fa3c7","year":2016},"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":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:27:00.526391Z"},"links":{"cited_paper":"/paper/1607.04911","citing_paper":"/paper/1908.03341"},"observation_digest":"sha256:f89d37524a60463f2ce4fbdf87c5c84580d315ce18e2493f0f4ef454b76eb028","observation_id":"bdbe79b7-2acc-4ca6-9e2d-c82bff6686ca","resolution":{"observed_at":"2026-08-14T14:27:02.085915Z","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/1607.04911/citation-record","integrity":"/paper/1607.04911/integrity","json":"/paper/1607.04911/citation-record.json","paper":"/paper/1607.04911"},"outbound":[],"paper":{"arxiv_id":"1607.04911","last_updated":"2016-07-21T20:40:49Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:27:48.609219Z","submitted_at":"2016-07-17T19:45:01Z","title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs"},"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:1607.04911."}