{"as_of":"2026-08-08T00:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4e9dabc6851599a1fde0f32110628e56797664d578357c4b9221ec4a2457bc59","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:30:56.983686Z","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-06-30T02:54:10.871277Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04166","snapshot_observed_at":"2026-08-07T15:30:56.983686Z","title":"Graph classes through the lens of logic","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15288","last_updated":"2025-05-21T09:17:10Z","snapshot_observed_at":"2026-08-07T15:18:24.629980Z","submitted_at":"2025-05-21T09:17:10Z","title":"Strong odd colorings in graph classes of bounded expansion","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:30:56.983686Z"},"links":{"cited_paper":"/paper/2501.04166","citing_paper":"/paper/2505.15288"},"observation_digest":"sha256:63e1901d8a5caab25808d8629fc26aa75d39a17b72a7deb5059f6ef64613a445","observation_id":"40c2f002-05bc-459f-99c3-1c8fb7f223f0","resolution":{"observed_at":"2026-08-07T15:30:56.983686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04166","snapshot_observed_at":"2026-08-07T15:22:48.350737Z","title":"Graph classes through the lens of logic","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15655","last_updated":"2025-05-21T15:31:33Z","snapshot_observed_at":"2026-08-07T15:10:57.715180Z","submitted_at":"2025-05-21T15:31:33Z","title":"First-order transducibility among classes of sparse graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:48.350737Z"},"links":{"cited_paper":"/paper/2501.04166","citing_paper":"/paper/2505.15655"},"observation_digest":"sha256:3d7405d52944459449331c4da7cb955ea717957a4856d80de9ae00e178fc35ab","observation_id":"0e2e4f6a-8260-4722-bec0-c6e80c144fe6","resolution":{"observed_at":"2026-08-07T15:22:48.350737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04166","snapshot_observed_at":"2026-08-07T11:06:02.870726Z","title":"Graph classes through the lens of logic","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03973","last_updated":"2025-06-04T14:02:26Z","snapshot_observed_at":"2026-08-07T10:47:55.657912Z","submitted_at":"2025-06-04T14:02:26Z","title":"The Erd\\H{o}s-P\\'{o}sa property for circle graphs as vertex-minors","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T11:06:02.870726Z"},"links":{"cited_paper":"/paper/2501.04166","citing_paper":"/paper/2506.03973"},"observation_digest":"sha256:c92d6f462aa9d635ed18d252553c1028222d80ed69d9bfe1c9e3d1f67bf73f1b","observation_id":"ebd0792c-6355-473d-8ffc-e910997d33b5","resolution":{"observed_at":"2026-08-07T11:06:02.870726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04166","snapshot_observed_at":"2026-08-07T05:24:42.690840Z","title":"Pilipczuk","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08585","last_updated":"2026-06-29T16:44:21Z","snapshot_observed_at":"2026-08-07T05:04:30.792265Z","submitted_at":"2025-06-10T08:54:08Z","title":"k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:24:42.690840Z"},"links":{"cited_paper":"/paper/2501.04166","citing_paper":"/paper/2506.08585"},"observation_digest":"sha256:16a1af7b6da4dddb787e6d044dcc0bf151a801081e10570038c58f5adb5fda98","observation_id":"2d4c8942-497b-435d-9ead-4d1d68c11345","resolution":{"observed_at":"2026-08-07T05:24:42.690840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic","version":1},"cited_work":{"arxiv_id":"2501.04166","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.04166","snapshot_observed_at":"2026-06-30T02:54:10.871277Z","title":"Graph classes through the lens of logic","venue":null,"work_id":"43bc5c2e-a0f8-409e-8ad0-f4e64dbb17f9","year":2025},"citing_paper":{"arxiv_id":"2606.29336","last_updated":"2026-06-28T11:09:28Z","snapshot_observed_at":"2026-07-07T00:03:16.968118Z","submitted_at":"2026-06-28T11:09:28Z","title":"An FPT algorithm for cycle rank on semi-complete digraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-30T02:04:12.183555Z"},"links":{"cited_paper":"/paper/2501.04166","citing_paper":"/paper/2606.29336"},"observation_digest":"sha256:798e5179c56645022a63859da8537ecb8ec10ad7ab3c097ce44af5f9cbc0e7f8","observation_id":"6061886a-d972-4262-9508-775be2a3f0a3","resolution":{"observed_at":"2026-06-30T02:54:10.873176Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04166","snapshot_observed_at":"2026-07-30T13:40:47.874750Z","title":"arXiv preprint arXiv:2501.04166 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23754","last_updated":"2026-07-26T16:58:48Z","snapshot_observed_at":"2026-08-07T10:26:58.145293Z","submitted_at":"2026-07-26T16:58:48Z","title":"Set-defined graph classes: $\\chi$-boundedness meets tropical algebra","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-30T13:40:47.874750Z"},"links":{"cited_paper":"/paper/2501.04166","citing_paper":"/paper/2607.23754"},"observation_digest":"sha256:c4e36a9a7f8a59454324a8edae3d1a30bdd63730a94d674787858b62d33c9fdd","observation_id":"60709a72-3c19-4a70-9832-f414fb248eaf","resolution":{"observed_at":"2026-07-30T13:40:47.874750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.04166/citation-record","integrity":"/paper/2501.04166/integrity","json":"/paper/2501.04166/citation-record.json","paper":"/paper/2501.04166"},"outbound":[],"paper":{"arxiv_id":"2501.04166","last_updated":"2025-01-07T22:27:31Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T07:39:32.603815Z","submitted_at":"2025-01-07T22:27:31Z","title":"Graph classes through the lens of logic"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2501.04166."}