{"as_of":"2026-08-10T04:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9812f250d507f6a79ddd80b817cf9124b3662f6c7fd5455220632a739c3ac216","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T03:21:49.612233Z","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-07-02T01:26:23.970241Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1906.06349","last_updated":"2019-06-19T02:04:08Z","snapshot_observed_at":"2026-08-09T23:23:43.692966Z","submitted_at":"2019-06-14T18:04:39Z","title":"On the Computational Power of RNNs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06349","snapshot_observed_at":"2026-08-03T03:21:49.612233Z","title":"On the computational power of RNNs.arXiv preprint arXiv:1906.06349, 2019","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2602.08640","last_updated":"2026-07-20T12:14:43Z","snapshot_observed_at":"2026-08-06T10:33:55.722711Z","submitted_at":"2026-02-09T13:35:02Z","title":"Universal Approximation Theorems for Dynamical Systems with Infinite-Time Horizon Guarantees","version":3},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-03T03:21:49.612233Z"},"links":{"cited_paper":"/paper/1906.06349","citing_paper":"/paper/2602.08640"},"observation_digest":"sha256:9142c7e2a7761dc1b7d9c7c8c9d85956371d8d00cbba42236877dc55cc9f5068","observation_id":"0b9235d5-5556-49e7-b5de-2d67b1d9af0b","resolution":{"observed_at":"2026-08-03T03:21:49.612233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06349","last_updated":"2019-06-19T02:04:08Z","snapshot_observed_at":"2026-08-09T23:23:43.692966Z","submitted_at":"2019-06-14T18:04:39Z","title":"On the Computational Power of RNNs","version":2},"cited_work":{"arxiv_id":"1906.06349","doi":null,"metadata_source":"pith","pith_arxiv_id":"1906.06349","snapshot_observed_at":"2026-07-02T01:26:23.970241Z","title":"On the Computational Power of RNNs","venue":"cs.CL","work_id":"fa6ebe43-6f3a-40e8-9447-ee1b83abcd6a","year":2019},"citing_paper":{"arxiv_id":"2606.01765","last_updated":"2026-06-05T15:53:13Z","snapshot_observed_at":"2026-08-08T05:26:51.963003Z","submitted_at":"2026-06-01T06:47:58Z","title":"An Algebraic View of the Expressivity of Recurrent Language Models","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-28T12:07:18.365897Z"},"links":{"cited_paper":"/paper/1906.06349","citing_paper":"/paper/2606.01765"},"observation_digest":"sha256:adf2da71f2ac3bdb7b304a85bbd1a4d4269379d089a7115d0828ce7bb75495fc","observation_id":"a03f228a-4b1a-4b88-966a-e4824e1df62c","resolution":{"observed_at":"2026-07-02T01:26:23.971494Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.06349","last_updated":"2019-06-19T02:04:08Z","snapshot_observed_at":"2026-08-09T23:23:43.692966Z","submitted_at":"2019-06-14T18:04:39Z","title":"On the Computational Power of RNNs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.06349","snapshot_observed_at":"2026-07-30T14:51:29.577568Z","title":"Korsky and Robert C","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.26988","last_updated":"2026-07-29T14:47:19Z","snapshot_observed_at":"2026-08-09T16:30:25.899595Z","submitted_at":"2026-07-29T14:47:19Z","title":"A Compositional Theory of Causally Masked Transformers","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-30T14:51:29.577568Z"},"links":{"cited_paper":"/paper/1906.06349","citing_paper":"/paper/2607.26988"},"observation_digest":"sha256:6c74fef81f70c86ec5521b58de7da092b9b35a2844b703fccda721a8fa41e17b","observation_id":"47134af1-86a9-405d-a3d5-975132a0f458","resolution":{"observed_at":"2026-07-30T14:51:29.577568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1906.06349/citation-record","integrity":"/paper/1906.06349/integrity","json":"/paper/1906.06349/citation-record.json","paper":"/paper/1906.06349"},"outbound":[],"paper":{"arxiv_id":"1906.06349","last_updated":"2019-06-19T02:04:08Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T23:23:43.692966Z","submitted_at":"2019-06-14T18:04:39Z","title":"On the Computational Power of RNNs"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1906.06349."}