{"as_of":"2026-08-22T11:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8f0c057c20800035d4f8bff6afacc13ca457f5026c872e44c7c8268b92627fb8","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:03:36.892446Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T13:28:19.170352Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.02066","last_updated":"2021-06-03T18:15:07Z","snapshot_observed_at":"2026-08-16T18:19:50.955073Z","submitted_at":"2021-06-03T18:15:07Z","title":"Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02066","snapshot_observed_at":"2026-08-11T15:03:36.892446Z","title":"B r a n d t, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.11571","last_updated":"2026-05-27T22:59:27Z","snapshot_observed_at":"2026-08-11T14:45:40.509689Z","submitted_at":"2024-12-16T08:56:12Z","title":"Borel Local Lemma: arbitrary random variables and limited exponential growth","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T15:03:36.892446Z"},"links":{"cited_paper":"/paper/2106.02066","citing_paper":"/paper/2412.11571"},"observation_digest":"sha256:b6dd7f64e85a406aba5b81b9a1c4993582d54a7d3bd6a9bab49747ab421a88c5","observation_id":"58c509d5-904d-4967-b16c-db7da3a97a1f","resolution":{"observed_at":"2026-08-11T15:03:36.892446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02066","last_updated":"2021-06-03T18:15:07Z","snapshot_observed_at":"2026-08-16T18:19:50.955073Z","submitted_at":"2021-06-03T18:15:07Z","title":"Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics","version":1},"cited_work":{"arxiv_id":"2106.02066","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.02066","snapshot_observed_at":"2026-07-03T13:28:19.170352Z","title":"Brandt,Y.-J","venue":null,"work_id":"703f3806-5afd-4eea-917b-b3a0d25a64cb","year":2022},"citing_paper":{"arxiv_id":"2606.11558","last_updated":"2026-07-01T05:58:05Z","snapshot_observed_at":"2026-08-21T22:04:59.384780Z","submitted_at":"2026-06-10T01:35:26Z","title":"Measurable matchings in unbalanced graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T07:58:19.731645Z"},"links":{"cited_paper":"/paper/2106.02066","citing_paper":"/paper/2606.11558"},"observation_digest":"sha256:a084ad90b218cbf033d6a7cdf16273686fa603e7519a9f1fbf60672066a3f14a","observation_id":"11f7e418-be50-45a6-a2d9-7791f27da9a4","resolution":{"observed_at":"2026-07-03T13:28:19.172284Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02066","last_updated":"2021-06-03T18:15:07Z","snapshot_observed_at":"2026-08-16T18:19:50.955073Z","submitted_at":"2021-06-03T18:15:07Z","title":"Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics","version":1},"cited_work":{"arxiv_id":"2106.02066","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.02066","snapshot_observed_at":"2026-07-03T13:28:19.170352Z","title":"Brandt,Y.-J","venue":null,"work_id":"703f3806-5afd-4eea-917b-b3a0d25a64cb","year":2022},"citing_paper":{"arxiv_id":"2606.11558","last_updated":"2026-07-01T05:58:05Z","snapshot_observed_at":"2026-08-21T22:04:59.384780Z","submitted_at":"2026-06-10T01:35:26Z","title":"Measurable matchings in unbalanced graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-02T22:41:26.591332Z"},"links":{"cited_paper":"/paper/2106.02066","citing_paper":"/paper/2606.11558"},"observation_digest":"sha256:f16b64e230d63b2c244bb75a052ceeb638afa35fc6b255c67d0d4483b9f3243a","observation_id":"c3c0185a-71fd-4738-abcd-f2e8d0757344","resolution":{"observed_at":"2026-07-02T22:47:25.364761Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02066","last_updated":"2021-06-03T18:15:07Z","snapshot_observed_at":"2026-08-16T18:19:50.955073Z","submitted_at":"2021-06-03T18:15:07Z","title":"Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02066","snapshot_observed_at":"2026-07-13T01:39:09.857731Z","title":"Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics.arXiv preprint arXiv:2106.02066,","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":12,"source":"pdf_text","source_observed_at":"2026-07-13T01:39:09.857731Z"},"links":{"cited_paper":"/paper/2106.02066","citing_paper":"/paper/2607.09626"},"observation_digest":"sha256:4f1e40eeb9d7a88ac1d351d860668b973bbbb9e286b6583e6cfa85c728cf01ce","observation_id":"f825d36a-0ea4-47d6-838a-1dcdaa9076c7","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/2106.02066/citation-record","integrity":"/paper/2106.02066/integrity","json":"/paper/2106.02066/citation-record.json","paper":"/paper/2106.02066"},"outbound":[],"paper":{"arxiv_id":"2106.02066","last_updated":"2021-06-03T18:15:07Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T18:19:50.955073Z","submitted_at":"2021-06-03T18:15:07Z","title":"Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics"},"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 4 inbound Pith citation observations for arXiv:2106.02066."}