{"as_of":"2026-08-16T05:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b78a0d9cf41a4ba43bea446bcc44f572b249b46183ee6955547946c0eef39c69","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-15T06:32:42.880941+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-11T00:46:47.688736Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T20:20:06.873260Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.05161","last_updated":"2023-12-19T10:13:33Z","snapshot_observed_at":"2026-08-14T14:59:12.285849Z","submitted_at":"2023-10-08T13:36:05Z","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.05161","snapshot_observed_at":"2026-08-11T00:46:47.688736Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.19350","last_updated":"2025-07-04T08:39:27Z","snapshot_observed_at":"2026-08-14T14:56:10.245102Z","submitted_at":"2024-12-26T20:53:04Z","title":"On the Expressiveness and Length Generalization of Selective State-Space Models on Regular Languages","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T00:46:47.688736Z"},"links":{"cited_paper":"/paper/2310.05161","citing_paper":"/paper/2412.19350"},"observation_digest":"sha256:46e1a10a0ca322f2ed6c72d1d93a36970e8c23916480f97bf4554e04c35214c5","observation_id":"e2b085b0-9b50-44b5-b0a6-f7c3bff2be4e","resolution":{"observed_at":"2026-08-11T00:46:47.688736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05161","last_updated":"2023-12-19T10:13:33Z","snapshot_observed_at":"2026-08-14T14:59:12.285849Z","submitted_at":"2023-10-08T13:36:05Z","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata","version":4},"cited_work":{"arxiv_id":"2310.05161","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.05161","snapshot_observed_at":"2026-07-04T20:20:06.873260Z","title":"arXiv preprint arXiv:2310.05161 , year=","venue":null,"work_id":"a82870db-59e9-464b-bc52-01227d99100c","year":null},"citing_paper":{"arxiv_id":"2605.14169","last_updated":"2026-05-13T22:48:24Z","snapshot_observed_at":"2026-08-11T05:52:52.990780Z","submitted_at":"2026-05-13T22:48:24Z","title":"BOOKMARKS: Efficient Active Storyline Memory for Role-playing","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-15T04:51:44.394368Z"},"links":{"cited_paper":"/paper/2310.05161","citing_paper":"/paper/2605.14169"},"observation_digest":"sha256:886ec02f8d94bc01ac5017f771711c58a6dead26f322f3979117de164a3847d9","observation_id":"3d58f47d-5e1d-42c3-9ea7-71e43d05d1d4","resolution":{"observed_at":"2026-05-15T04:55:03.724609Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.05161","last_updated":"2023-12-19T10:13:33Z","snapshot_observed_at":"2026-08-14T14:59:12.285849Z","submitted_at":"2023-10-08T13:36:05Z","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata","version":4},"cited_work":{"arxiv_id":"2310.05161","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.05161","snapshot_observed_at":"2026-07-04T20:20:06.873260Z","title":"arXiv preprint arXiv:2310.05161 , year=","venue":null,"work_id":"a82870db-59e9-464b-bc52-01227d99100c","year":null},"citing_paper":{"arxiv_id":"2606.25777","last_updated":"2026-06-24T12:55:34Z","snapshot_observed_at":"2026-08-02T09:24:51.043988Z","submitted_at":"2026-06-24T12:55:34Z","title":"Space-Efficient Language Generation in the Limit","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-25T20:26:09.264043Z"},"links":{"cited_paper":"/paper/2310.05161","citing_paper":"/paper/2606.25777"},"observation_digest":"sha256:6b8a1f33acfc61d8ca4bbe65276e68985a0faf08181b97676082de11d2784366","observation_id":"74a1011b-7fae-4f65-aced-24e539122879","resolution":{"observed_at":"2026-07-04T20:20:06.874896Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.05161/citation-record","integrity":"/paper/2310.05161/integrity","json":"/paper/2310.05161/citation-record.json","paper":"/paper/2310.05161"},"outbound":[],"paper":{"arxiv_id":"2310.05161","last_updated":"2023-12-19T10:13:33Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T14:59:12.285849Z","submitted_at":"2023-10-08T13:36:05Z","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata"},"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 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2310.05161."}