{"as_of":"2026-08-09T09:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f263576c1eeecc38ba7e7682e001f154d4bbb7f16a6172f081e785275ee369d","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-09T06:31:02.800959+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-02T07:20:41.452821Z","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":"1902.10297","last_updated":"2019-02-27T01:45:01Z","snapshot_observed_at":"2026-07-06T07:35:43.313450Z","submitted_at":"2019-02-27T01:45:01Z","title":"Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.10297","snapshot_observed_at":"2026-08-02T07:20:41.452821Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11953","last_updated":"2026-07-15T13:05:53Z","snapshot_observed_at":"2026-08-08T05:16:44.265065Z","submitted_at":"2026-07-11T21:33:32Z","title":"When Does Reward Teach State? A Hidden-Automaton Instrument and the Group-Language Boundary","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-02T07:20:41.452821Z"},"links":{"cited_paper":"/paper/1902.10297","citing_paper":"/paper/2607.11953"},"observation_digest":"sha256:eea90988e7f4b84f93595c3bac770c67e0a5ea6383213d5060f78cf1d74c944a","observation_id":"b11b8231-fb1b-49e1-9804-6c6e4dec6508","resolution":{"observed_at":"2026-08-02T07:20:41.452821Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1902.10297/citation-record","integrity":"/paper/1902.10297/integrity","json":"/paper/1902.10297/citation-record.json","paper":"/paper/1902.10297"},"outbound":[],"paper":{"arxiv_id":"1902.10297","last_updated":"2019-02-27T01:45:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T07:35:43.313450Z","submitted_at":"2019-02-27T01:45:01Z","title":"Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1902.10297."}