{"as_of":"2026-08-11T19:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05f73f4852bba3ca3849ae4f1e35a0d9fc0bba2988fcd49a1525feaa0b89756b","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-11T06:34:44.6726+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-10T15:43:38.111187Z","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-08T05:05:50.681614Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.13953","last_updated":"2021-09-02T11:53:26Z","snapshot_observed_at":"2026-07-06T11:33:39.654146Z","submitted_at":"2021-07-29T13:28:46Z","title":"Separator logic and star-free expressions for graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.13953","snapshot_observed_at":"2026-08-10T15:43:38.111187Z","title":"Separator logic and star-free expressions for graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13903","last_updated":"2025-01-23T18:31:33Z","snapshot_observed_at":"2026-08-10T15:27:09.677506Z","submitted_at":"2025-01-23T18:31:33Z","title":"Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T15:43:38.111187Z"},"links":{"cited_paper":"/paper/2107.13953","citing_paper":"/paper/2501.13903"},"observation_digest":"sha256:79ec7cfb1248dc82776ec544c14811e1e5a86e1d4d6be1f862a9f34af43f2c69","observation_id":"851be43e-ce8f-4c89-bd9d-6a0a69a77fa6","resolution":{"observed_at":"2026-08-10T15:43:38.111187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.13953","last_updated":"2021-09-02T11:53:26Z","snapshot_observed_at":"2026-07-06T11:33:39.654146Z","submitted_at":"2021-07-29T13:28:46Z","title":"Separator logic and star-free expressions for graphs","version":2},"cited_work":{"arxiv_id":"2107.13953","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.13953","snapshot_observed_at":"2026-08-08T05:05:50.681614Z","title":"Separator logic and star-free expressions for graphs","venue":"cs.LO","work_id":"4bf88045-e466-4111-9c15-ad478c823614","year":2021},"citing_paper":{"arxiv_id":"2502.08476","last_updated":"2025-02-12T15:10:18Z","snapshot_observed_at":"2026-08-08T04:54:10.365472Z","submitted_at":"2025-02-12T15:10:18Z","title":"Low rank MSO","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T05:05:50.497397Z"},"links":{"cited_paper":"/paper/2107.13953","citing_paper":"/paper/2502.08476"},"observation_digest":"sha256:a576870511d21c54075ab408d7bc7f89edb4514b058a915122e1519cbc76c6b9","observation_id":"9a562eed-13b8-45e0-bfdd-487567f8e019","resolution":{"observed_at":"2026-08-08T05:05:50.686443Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.13953/citation-record","integrity":"/paper/2107.13953/integrity","json":"/paper/2107.13953/citation-record.json","paper":"/paper/2107.13953"},"outbound":[],"paper":{"arxiv_id":"2107.13953","last_updated":"2021-09-02T11:53:26Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-07-06T11:33:39.654146Z","submitted_at":"2021-07-29T13:28:46Z","title":"Separator logic and star-free expressions for graphs"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2107.13953."}