{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NXSQHZRRWOCWAHQ225D6OTASNT","short_pith_number":"pith:NXSQHZRR","schema_version":"1.0","canonical_sha256":"6de503e631b385601e1ad747e74c126cf5c0656da54b3fa9a0b3216a7dff64a9","source":{"kind":"arxiv","id":"2310.12942","version":5},"attestation_state":"computed","paper":{"title":"On the Representational Capacity of Recurrent Neural Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Anej Svete, Franz Nowak, Li Du, Ryan Cotterell","submitted_at":"2023-10-19T17:39:47Z","abstract_excerpt":"This work investigates the computational expressivity of language models (LMs) based on recurrent neural networks (RNNs). Siegelmann and Sontag (1992) famously showed that RNNs with rational weights and hidden states and unbounded computation time are Turing complete. However, LMs define weightings over strings in addition to just (unweighted) language membership and the analysis of the computational power of RNN LMs (RLMs) should reflect this. We extend the Turing completeness result to the probabilistic case, showing how a rationally weighted RLM with unbounded computation time can simulate "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.12942","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-19T17:39:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23d28972e308a46ff0a9e41f735a72a83e8a3d8f39ace10dd610c317f000d605","abstract_canon_sha256":"705626aa4f9dcb71a18728eec915188ba1d3098c0b011d7277df3732ccd405b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:57.884143Z","signature_b64":"Ma1S6D4eejzNplCWBrqMbV37l7hLGCkKV6SM9Y//OffVSYo+rPbmrf4//Ib271Dj8I07NO20FI0pAESnPDs3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6de503e631b385601e1ad747e74c126cf5c0656da54b3fa9a0b3216a7dff64a9","last_reissued_at":"2026-07-05T08:24:57.883691Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:57.883691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Representational Capacity of Recurrent Neural Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Anej Svete, Franz Nowak, Li Du, Ryan Cotterell","submitted_at":"2023-10-19T17:39:47Z","abstract_excerpt":"This work investigates the computational expressivity of language models (LMs) based on recurrent neural networks (RNNs). Siegelmann and Sontag (1992) famously showed that RNNs with rational weights and hidden states and unbounded computation time are Turing complete. However, LMs define weightings over strings in addition to just (unweighted) language membership and the analysis of the computational power of RNN LMs (RLMs) should reflect this. We extend the Turing completeness result to the probabilistic case, showing how a rationally weighted RLM with unbounded computation time can simulate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12942","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.12942/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.12942","created_at":"2026-07-05T08:24:57.883746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.12942v5","created_at":"2026-07-05T08:24:57.883746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12942","created_at":"2026-07-05T08:24:57.883746+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXSQHZRRWOCW","created_at":"2026-07-05T08:24:57.883746+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXSQHZRRWOCWAHQ2","created_at":"2026-07-05T08:24:57.883746+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXSQHZRR","created_at":"2026-07-05T08:24:57.883746+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01765","citing_title":"An Algebraic View of the Expressivity of Recurrent Language Models","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT","json":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT.json","graph_json":"https://pith.science/api/pith-number/NXSQHZRRWOCWAHQ225D6OTASNT/graph.json","events_json":"https://pith.science/api/pith-number/NXSQHZRRWOCWAHQ225D6OTASNT/events.json","paper":"https://pith.science/paper/NXSQHZRR"},"agent_actions":{"view_html":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT","download_json":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT.json","view_paper":"https://pith.science/paper/NXSQHZRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.12942&json=true","fetch_graph":"https://pith.science/api/pith-number/NXSQHZRRWOCWAHQ225D6OTASNT/graph.json","fetch_events":"https://pith.science/api/pith-number/NXSQHZRRWOCWAHQ225D6OTASNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/action/storage_attestation","attest_author":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/action/author_attestation","sign_citation":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/action/citation_signature","submit_replication":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/action/replication_record"}},"created_at":"2026-07-05T08:24:57.883746+00:00","updated_at":"2026-07-05T08:24:57.883746+00:00"}