{"as_of":"2026-08-17T15:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3a38587eb5b365b4230ab2dcfca12c825048c623a6e1d0c782694250595c6fdc","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T15:03:37.242032Z","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-05T11:18:33.268640Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2206.08426","last_updated":"2022-06-16T20:03:08Z","snapshot_observed_at":"2026-08-17T04:37:57.546790Z","submitted_at":"2022-06-16T20:03:08Z","title":"Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.08426","snapshot_observed_at":"2026-08-11T15:03:37.242032Z","title":"Q i a n and F","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":38,"source":"pdf_text","source_observed_at":"2026-08-11T15:03:37.242032Z"},"links":{"cited_paper":"/paper/2206.08426","citing_paper":"/paper/2412.11571"},"observation_digest":"sha256:38e69f4304a5377f2798a331ffeb58fc32d72c06710610ce674046a5c2c752a6","observation_id":"b089be30-1d7f-49e3-abed-292689485f43","resolution":{"observed_at":"2026-08-11T15:03:37.242032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08426","last_updated":"2022-06-16T20:03:08Z","snapshot_observed_at":"2026-08-17T04:37:57.546790Z","submitted_at":"2022-06-16T20:03:08Z","title":"Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms","version":1},"cited_work":{"arxiv_id":"2206.08426","doi":null,"metadata_source":"pith","pith_arxiv_id":"2206.08426","snapshot_observed_at":"2026-08-05T11:18:33.268640Z","title":"Descriptive Combinatorics, Computable Combinatorics, and ASI Algorithms","venue":"math.LO","work_id":"4ae33ca1-1349-46e2-acfe-d861fe3a6daf","year":2022},"citing_paper":{"arxiv_id":"2509.03139","last_updated":"2025-09-13T01:17:56Z","snapshot_observed_at":"2026-08-05T11:18:23.256803Z","submitted_at":"2025-09-03T08:49:32Z","title":"Flows with minimal subdynamics","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T11:18:31.970360Z"},"links":{"cited_paper":"/paper/2206.08426","citing_paper":"/paper/2509.03139"},"observation_digest":"sha256:9f85607414d4a614fe0d9be72d15e9351d48d865c4bcbc14aa3fe03512c4a3d9","observation_id":"bdf3b0d5-631b-4b7f-807b-92b6bb5feec0","resolution":{"observed_at":"2026-08-05T11:18:33.367303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2206.08426/citation-record","integrity":"/paper/2206.08426/integrity","json":"/paper/2206.08426/citation-record.json","paper":"/paper/2206.08426"},"outbound":[],"paper":{"arxiv_id":"2206.08426","last_updated":"2022-06-16T20:03:08Z","latest_version":1,"primary_category":"math.LO","snapshot_observed_at":"2026-08-17T04:37:57.546790Z","submitted_at":"2022-06-16T20:03:08Z","title":"Descriptive Combinatorics, Computable Combinatorics, and ASI 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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2206.08426."}