{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NXSQHZRRWOCWAHQ225D6OTASNT","short_pith_number":"pith:NXSQHZRR","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"},"canonical_sha256":"6de503e631b385601e1ad747e74c126cf5c0656da54b3fa9a0b3216a7dff64a9","source":{"kind":"arxiv","id":"2310.12942","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.12942","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"2310.12942v5","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12942","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"NXSQHZRRWOCW","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"pith_short_16","alias_value":"NXSQHZRRWOCWAHQ2","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"pith_short_8","alias_value":"NXSQHZRR","created_at":"2026-07-05T08:24:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NXSQHZRRWOCWAHQ225D6OTASNT","target":"record","payload":{"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"},"canonical_sha256":"6de503e631b385601e1ad747e74c126cf5c0656da54b3fa9a0b3216a7dff64a9","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"},"source_kind":"arxiv","source_id":"2310.12942","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5QmQylvxuchPIhEFGE05M99wau/wbu+WWQx6XTt6lOFpeD8nZSUJ4cbNTvZkAIxZVuVS9UlLcNzecrFf1ipEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:27:14.159664Z"},"content_sha256":"16e8d7505e089fa96c3d8eea4ad8d7acd055645af45c6608a9769b2577d4bf34","schema_version":"1.0","event_id":"sha256:16e8d7505e089fa96c3d8eea4ad8d7acd055645af45c6608a9769b2577d4bf34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NXSQHZRRWOCWAHQ225D6OTASNT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8tPTNRTT79PO/kmPeFxT86SU6i0WWe3PkjbrdIuXrg/0NvtNj5+Bfu56ghSaBGARNcsL3wOu4M8CEA17Cr0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:27:14.160171Z"},"content_sha256":"b1c4adc9e763497605a6709917c254fff6aa06a61c661cdd9b0862613c734270","schema_version":"1.0","event_id":"sha256:b1c4adc9e763497605a6709917c254fff6aa06a61c661cdd9b0862613c734270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/bundle.json","state_url":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXSQHZRRWOCWAHQ225D6OTASNT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T10:27:14Z","links":{"resolver":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT","bundle":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/bundle.json","state":"https://pith.science/pith/NXSQHZRRWOCWAHQ225D6OTASNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXSQHZRRWOCWAHQ225D6OTASNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NXSQHZRRWOCWAHQ225D6OTASNT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"705626aa4f9dcb71a18728eec915188ba1d3098c0b011d7277df3732ccd405b9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-19T17:39:47Z","title_canon_sha256":"23d28972e308a46ff0a9e41f735a72a83e8a3d8f39ace10dd610c317f000d605"},"schema_version":"1.0","source":{"id":"2310.12942","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.12942","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"2310.12942v5","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.12942","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"NXSQHZRRWOCW","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"pith_short_16","alias_value":"NXSQHZRRWOCWAHQ2","created_at":"2026-07-05T08:24:57Z"},{"alias_kind":"pith_short_8","alias_value":"NXSQHZRR","created_at":"2026-07-05T08:24:57Z"}],"graph_snapshots":[{"event_id":"sha256:b1c4adc9e763497605a6709917c254fff6aa06a61c661cdd9b0862613c734270","target":"graph","created_at":"2026-07-05T08:24:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.12942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Anej Svete, Franz Nowak, Li Du, Ryan Cotterell","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-19T17:39:47Z","title":"On the Representational Capacity of Recurrent Neural Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.12942","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:16e8d7505e089fa96c3d8eea4ad8d7acd055645af45c6608a9769b2577d4bf34","target":"record","created_at":"2026-07-05T08:24:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"705626aa4f9dcb71a18728eec915188ba1d3098c0b011d7277df3732ccd405b9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-10-19T17:39:47Z","title_canon_sha256":"23d28972e308a46ff0a9e41f735a72a83e8a3d8f39ace10dd610c317f000d605"},"schema_version":"1.0","source":{"id":"2310.12942","kind":"arxiv","version":5}},"canonical_sha256":"6de503e631b385601e1ad747e74c126cf5c0656da54b3fa9a0b3216a7dff64a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6de503e631b385601e1ad747e74c126cf5c0656da54b3fa9a0b3216a7dff64a9","first_computed_at":"2026-07-05T08:24:57.883691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:57.883691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ma1S6D4eejzNplCWBrqMbV37l7hLGCkKV6SM9Y//OffVSYo+rPbmrf4//Ib271Dj8I07NO20FI0pAESnPDs3Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:57.884143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.12942","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e8d7505e089fa96c3d8eea4ad8d7acd055645af45c6608a9769b2577d4bf34","sha256:b1c4adc9e763497605a6709917c254fff6aa06a61c661cdd9b0862613c734270"],"state_sha256":"e143806f54fc947fe93d6c887489fc1f2511ad2d59ad0ff5b7f8173a68abfd71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKpWWBuvGbl0adczgkytc259/r6PVb/A/L/Mu5v2NPjUMp1XHXWBSMOKv8nxJn0ErFXQOcILAISolDO262ELAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T10:27:14.164557Z","bundle_sha256":"aa7153655c701c196a49b679ca879320b5a13a169d85ddb73d5068aa3935cfd4"}}