{"as_of":"2026-08-12T08:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a24cc35608018cb1ba1c58edc277e3be2e4dbce30dacafc843d828c9e919a5d1","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-12T06:34:41.77262+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-07-13T01:39:09.857731Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.08544","last_updated":"2022-09-02T15:49:05Z","snapshot_observed_at":"2026-08-09T21:09:23.157918Z","submitted_at":"2022-02-17T09:39:26Z","title":"Efficient Classification of Locally Checkable Problems in Regular Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.08544","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Efficient classification of locally checkable problems in regular trees.arXiv preprint arXiv:2202.08544,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09626","last_updated":"2026-07-10T17:25:22Z","snapshot_observed_at":"2026-08-08T20:37:28.838822Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2202.08544","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:a247f1e71a8d8c9558b4abd213f442d4a58352f8257fb4fdd1ac9bcd1dc5ac14","observation_id":"2db79d65-350f-4732-81ab-b0727646204f","resolution":{"observed_at":"2026-07-13T01:39:09.857731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2202.08544/citation-record","integrity":"/paper/2202.08544/integrity","json":"/paper/2202.08544/citation-record.json","paper":"/paper/2202.08544"},"outbound":[],"paper":{"arxiv_id":"2202.08544","last_updated":"2022-09-02T15:49:05Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-09T21:09:23.157918Z","submitted_at":"2022-02-17T09:39:26Z","title":"Efficient Classification of Locally Checkable Problems in Regular Trees"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2202.08544."}