{"as_of":"2026-08-12T10:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e985f872ccf0e01c970ed642a0aacf0157e5353c3f594c8478a8f28a74d90c19","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":"2109.06593","last_updated":"2022-11-12T21:43:51Z","snapshot_observed_at":"2026-08-04T10:05:32.738079Z","submitted_at":"2021-09-14T11:29:42Z","title":"Locality in online, dynamic, sequential, and distributed graph algorithms","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.06593","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Locality in online, dynamic, sequential, and distributed graph algorithms.arXiv preprint arXiv:2109.06593,","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":1,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2109.06593","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:e51e77277e99fb8200e8e20ea16029c9eacb51deea261b31eb42154ce2b45d11","observation_id":"2193240d-23b2-42c7-8354-d7c1bd473861","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/2109.06593/citation-record","integrity":"/paper/2109.06593/integrity","json":"/paper/2109.06593/citation-record.json","paper":"/paper/2109.06593"},"outbound":[],"paper":{"arxiv_id":"2109.06593","last_updated":"2022-11-12T21:43:51Z","latest_version":4,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-04T10:05:32.738079Z","submitted_at":"2021-09-14T11:29:42Z","title":"Locality in online, dynamic, sequential, and distributed graph algorithms"},"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:2109.06593."}