{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F4GADWCCSD2AOH56P5VIHQBDZJ","short_pith_number":"pith:F4GADWCC","canonical_record":{"source":{"id":"1811.01001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T17:37:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dc284ea3dc4ad581270d3aa9ecb1d8d8e6a51235193cad43c725204aefea4357","abstract_canon_sha256":"55b9072767ddea4d0af0c767c103015f90e7256239c53932507833354525a44b"},"schema_version":"1.0"},"canonical_sha256":"2f0c01d84290f4071fbe7f6a83c023ca5b4cfb1d55e85f49f388dc683a90e976","source":{"kind":"arxiv","id":"1811.01001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01001","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01001v1","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01001","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"F4GADWCCSD2A","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4GADWCCSD2AOH56","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4GADWCC","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F4GADWCCSD2AOH56P5VIHQBDZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T17:37:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dc284ea3dc4ad581270d3aa9ecb1d8d8e6a51235193cad43c725204aefea4357","abstract_canon_sha256":"55b9072767ddea4d0af0c767c103015f90e7256239c53932507833354525a44b"},"schema_version":"1.0"},"canonical_sha256":"2f0c01d84290f4071fbe7f6a83c023ca5b4cfb1d55e85f49f388dc683a90e976","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.694039Z","signature_b64":"VX57U3VohuG5+ndZZcnmgiA4h1g1KI4YiEpjHbbkLYo/vw4/iX1pcQZI/Aa/NXmjEVBxoX2okB/lu6X6WpqIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f0c01d84290f4071fbe7f6a83c023ca5b4cfb1d55e85f49f388dc683a90e976","last_reissued_at":"2026-05-18T00:01:39.693409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.693409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01001","source_version":1,"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-05-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URtgWIfOXH45ebpjf7HZ44xMjJFTZmSeJwQv3p6Rsxe+ZRAWoQ6h7PcYOqF5jbHSKqufws+zb6mPshz4fubHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:23:28.352745Z"},"content_sha256":"6410b0ca18e2c56d85297ab61239771bb4afd0eabe7048dda2805884c93a343e","schema_version":"1.0","event_id":"sha256:6410b0ca18e2c56d85297ab61239771bb4afd0eabe7048dda2805884c93a343e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F4GADWCCSD2AOH56P5VIHQBDZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Evaluating the Generalization of LSTM Models in Formal Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Mirac Suzgun, Stuart M. Shieber, Yonatan Belinkov","submitted_at":"2018-11-02T17:37:39Z","abstract_excerpt":"Recurrent Neural Networks (RNNs) are theoretically Turing-complete and established themselves as a dominant model for language processing. Yet, there still remains an uncertainty regarding their language learning capabilities. In this paper, we empirically evaluate the inductive learning capabilities of Long Short-Term Memory networks, a popular extension of simple RNNs, to learn simple formal languages, in particular $a^nb^n$, $a^nb^nc^n$, and $a^nb^nc^nd^n$. We investigate the influence of various aspects of learning, such as training data regimes and model capacity, on the generalization to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01001","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skZVMOp8xoZh3rIB9oXs3FKS1zQ0KVY5zGOiz7nNEM/VcmcVri+PIByy+01v3O2TqveNMekAH0R4SAUAI7pjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:23:28.353098Z"},"content_sha256":"0561d47149563a07dcd2337aa52744c4c3217445dc3a81ac7cb8dbee4b928c4a","schema_version":"1.0","event_id":"sha256:0561d47149563a07dcd2337aa52744c4c3217445dc3a81ac7cb8dbee4b928c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4GADWCCSD2AOH56P5VIHQBDZJ/bundle.json","state_url":"https://pith.science/pith/F4GADWCCSD2AOH56P5VIHQBDZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4GADWCCSD2AOH56P5VIHQBDZJ/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-06-03T05:23:28Z","links":{"resolver":"https://pith.science/pith/F4GADWCCSD2AOH56P5VIHQBDZJ","bundle":"https://pith.science/pith/F4GADWCCSD2AOH56P5VIHQBDZJ/bundle.json","state":"https://pith.science/pith/F4GADWCCSD2AOH56P5VIHQBDZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4GADWCCSD2AOH56P5VIHQBDZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F4GADWCCSD2AOH56P5VIHQBDZJ","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":"55b9072767ddea4d0af0c767c103015f90e7256239c53932507833354525a44b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T17:37:39Z","title_canon_sha256":"dc284ea3dc4ad581270d3aa9ecb1d8d8e6a51235193cad43c725204aefea4357"},"schema_version":"1.0","source":{"id":"1811.01001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01001","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01001v1","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01001","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"F4GADWCCSD2A","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4GADWCCSD2AOH56","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4GADWCC","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:0561d47149563a07dcd2337aa52744c4c3217445dc3a81ac7cb8dbee4b928c4a","target":"graph","created_at":"2026-05-18T00:01:39Z","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"},"paper":{"abstract_excerpt":"Recurrent Neural Networks (RNNs) are theoretically Turing-complete and established themselves as a dominant model for language processing. Yet, there still remains an uncertainty regarding their language learning capabilities. In this paper, we empirically evaluate the inductive learning capabilities of Long Short-Term Memory networks, a popular extension of simple RNNs, to learn simple formal languages, in particular $a^nb^n$, $a^nb^nc^n$, and $a^nb^nc^nd^n$. We investigate the influence of various aspects of learning, such as training data regimes and model capacity, on the generalization to","authors_text":"Mirac Suzgun, Stuart M. Shieber, Yonatan Belinkov","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T17:37:39Z","title":"On Evaluating the Generalization of LSTM Models in Formal Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01001","kind":"arxiv","version":1},"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:6410b0ca18e2c56d85297ab61239771bb4afd0eabe7048dda2805884c93a343e","target":"record","created_at":"2026-05-18T00:01:39Z","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":"55b9072767ddea4d0af0c767c103015f90e7256239c53932507833354525a44b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-02T17:37:39Z","title_canon_sha256":"dc284ea3dc4ad581270d3aa9ecb1d8d8e6a51235193cad43c725204aefea4357"},"schema_version":"1.0","source":{"id":"1811.01001","kind":"arxiv","version":1}},"canonical_sha256":"2f0c01d84290f4071fbe7f6a83c023ca5b4cfb1d55e85f49f388dc683a90e976","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f0c01d84290f4071fbe7f6a83c023ca5b4cfb1d55e85f49f388dc683a90e976","first_computed_at":"2026-05-18T00:01:39.693409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:39.693409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VX57U3VohuG5+ndZZcnmgiA4h1g1KI4YiEpjHbbkLYo/vw4/iX1pcQZI/Aa/NXmjEVBxoX2okB/lu6X6WpqIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:39.694039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6410b0ca18e2c56d85297ab61239771bb4afd0eabe7048dda2805884c93a343e","sha256:0561d47149563a07dcd2337aa52744c4c3217445dc3a81ac7cb8dbee4b928c4a"],"state_sha256":"f793c4fa6e8342ffabe4d10b7d4814871c3e1607ddbad06d26b633423067a2f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPtiD8LCgu5ZR80lTm9xbBesp40qGDTeXpdj67onA0ep+1KR/4cWxiDCSaQrxTCxi5a/TvOjh1b3Uw+hqq9eBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:23:28.355128Z","bundle_sha256":"ed1659ff6efdbecb26d2c74051861ee2158ca41ac9b12a528dd8dc7938bfb619"}}