{"as_of":"2026-08-16T23:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e5dc78a88070830fa10cfe1ff3dc6560c7933d43bb91e46f9fd3774c64ad5ee","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-14T11:34:29.301525Z","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-14T11:34:29.424757Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1903.11062","last_updated":"2019-07-12T06:57:01Z","snapshot_observed_at":"2026-07-06T07:41:49.415532Z","submitted_at":"2019-03-26T10:03:19Z","title":"Testing isomorphism of circular-arc graphs in polynomial time","version":2},"cited_work":{"arxiv_id":"1903.11062","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.11062","snapshot_observed_at":"2026-08-14T11:34:29.424757Z","title":"Testing isomorphism of circular-arc graphs in polynomial time","venue":"cs.DS","work_id":"bda8d71a-5352-41cd-b1db-9c4d48572cba","year":2019},"citing_paper":{"arxiv_id":"1908.09151","last_updated":"2019-08-24T15:17:27Z","snapshot_observed_at":"2026-08-16T23:11:28.517036Z","submitted_at":"2019-08-24T15:17:27Z","title":"Circle Graph Isomorphism in Almost Linear Time","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:34:29.301525Z"},"links":{"cited_paper":"/paper/1903.11062","citing_paper":"/paper/1908.09151"},"observation_digest":"sha256:51d6f03e4002822184aca42748c49c53398c4eb43a64b73cf2c4cbc5f6a3cc96","observation_id":"9273946c-f68e-4587-b6e7-70480ae1cf94","resolution":{"observed_at":"2026-08-14T11:34:29.433682Z","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/1903.11062/citation-record","integrity":"/paper/1903.11062/integrity","json":"/paper/1903.11062/citation-record.json","paper":"/paper/1903.11062"},"outbound":[],"paper":{"arxiv_id":"1903.11062","last_updated":"2019-07-12T06:57:01Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T07:41:49.415532Z","submitted_at":"2019-03-26T10:03:19Z","title":"Testing isomorphism of circular-arc graphs in polynomial time"},"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:1903.11062."}