{"as_of":"2026-08-15T23:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fe129e010e0c8d227ebd0284f330c1a9291e5e41c00ad3ab30974e7799441fe5","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-15T06:32:42.880941+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-14T04:18:58.469608Z","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":"2111.02336","last_updated":"2022-08-22T14:34:33Z","snapshot_observed_at":"2026-08-13T17:40:12.285574Z","submitted_at":"2021-11-03T16:38:37Z","title":"An Improved Algorithm for The $k$-Dyck Edit Distance Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.02336","snapshot_observed_at":"2026-08-14T04:18:58.469608Z","title":"Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya.https://arxiv.org/ abs/2111.02336","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.09538","last_updated":"2026-08-13T16:11:12Z","snapshot_observed_at":"2026-08-15T23:14:48.902914Z","submitted_at":"2026-08-10T12:36:16Z","title":"TCS-BENCH: Benchmarking State-of-the-Art Generative AI Theoretical Computer Science Research Ability","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T04:18:58.469608Z"},"links":{"cited_paper":"/paper/2111.02336","citing_paper":"/paper/2608.09538"},"observation_digest":"sha256:ec2f4d7ecdf2e41ec9ab39a543e787dbe33e3e8c6911b086df3af7571373e4d7","observation_id":"03cabc48-192b-4a0b-be05-90802423cd6c","resolution":{"observed_at":"2026-08-14T04:18:58.469608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2111.02336/citation-record","integrity":"/paper/2111.02336/integrity","json":"/paper/2111.02336/citation-record.json","paper":"/paper/2111.02336"},"outbound":[],"paper":{"arxiv_id":"2111.02336","last_updated":"2022-08-22T14:34:33Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-13T17:40:12.285574Z","submitted_at":"2021-11-03T16:38:37Z","title":"An Improved Algorithm for The $k$-Dyck Edit Distance Problem"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2111.02336."}