{"as_of":"2026-08-12T08:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6a7e278d6d7817712e6d1a75e0821a30b54e0de69bb91bad0ecffa6a5dbbda6c","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-08-04T10:57:24.087188Z","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":"2201.00549","last_updated":"2022-05-17T16:00:55Z","snapshot_observed_at":"2026-08-05T10:31:14.384551Z","submitted_at":"2022-01-03T09:41:09Z","title":"Efficient Enumeration Algorithms for Annotated Grammars","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.00549","snapshot_observed_at":"2026-08-04T10:57:24.087188Z","title":"https://arxiv.org/abs/2201.00549 Efficient enumeration algorithms for annotated grammars","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.087188Z"},"links":{"cited_paper":"/paper/2201.00549","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:f054bbe6f698b17e19cc55b7e3145a8f059de40fa239f4cbbb8669cbe48dd2b2","observation_id":"4482c865-2296-470e-8f6c-88b21e409ce7","resolution":{"observed_at":"2026-08-04T10:57:24.087188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2201.00549/citation-record","integrity":"/paper/2201.00549/integrity","json":"/paper/2201.00549/citation-record.json","paper":"/paper/2201.00549"},"outbound":[],"paper":{"arxiv_id":"2201.00549","last_updated":"2022-05-17T16:00:55Z","latest_version":2,"primary_category":"cs.FL","snapshot_observed_at":"2026-08-05T10:31:14.384551Z","submitted_at":"2022-01-03T09:41:09Z","title":"Efficient Enumeration Algorithms for Annotated Grammars"},"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:2201.00549."}