{"as_of":"2026-08-22T08:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc9622b154d39e88dab311d4f94a902a2366c4157f7d53b8d58cd9e8d46579f5","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-22T06:32:14.747728+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":"2311.06726","last_updated":"2023-11-12T03:57:22Z","snapshot_observed_at":"2026-08-20T08:09:43.352251Z","submitted_at":"2023-11-12T03:57:22Z","title":"The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.06726","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"The distributed complexity of locally checkable labeling problems beyond paths and trees.arXiv preprint arXiv:2311.06726,","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-14T08:38:10.033615Z","submitted_at":"2026-07-10T17:25:22Z","title":"New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2311.06726","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:09416ab8730a53012b321dcf449ab5391966c716d5d0bb104845c9ff4ae95361","observation_id":"f8219df6-3dd1-4003-a318-7c85449a1b34","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/2311.06726/citation-record","integrity":"/paper/2311.06726/integrity","json":"/paper/2311.06726/citation-record.json","paper":"/paper/2311.06726"},"outbound":[],"paper":{"arxiv_id":"2311.06726","last_updated":"2023-11-12T03:57:22Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-20T08:09:43.352251Z","submitted_at":"2023-11-12T03:57:22Z","title":"The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and 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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2311.06726."}