{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NHMSX4L6ZVZ7BDS5BIW7DC6KD7","short_pith_number":"pith:NHMSX4L6","canonical_record":{"source":{"id":"1811.02611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-06T20:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"1d0a05cbeafce47befac88874b61a469da6f439c41ba7476457ff037b00eba98","abstract_canon_sha256":"83998aa522368279607ee4a2ac7e83e366eb5ef7cab7b954dbce6749f6ef7fac"},"schema_version":"1.0"},"canonical_sha256":"69d92bf17ecd73f08e5d0a2df18bca1fc81a3fac53562d8e9a828d22d564539d","source":{"kind":"arxiv","id":"1811.02611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02611","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02611v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02611","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"NHMSX4L6ZVZ7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHMSX4L6ZVZ7BDS5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHMSX4L6","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NHMSX4L6ZVZ7BDS5BIW7DC6KD7","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-06T20:07:47Z","cross_cats_sorted":[],"title_canon_sha256":"1d0a05cbeafce47befac88874b61a469da6f439c41ba7476457ff037b00eba98","abstract_canon_sha256":"83998aa522368279607ee4a2ac7e83e366eb5ef7cab7b954dbce6749f6ef7fac"},"schema_version":"1.0"},"canonical_sha256":"69d92bf17ecd73f08e5d0a2df18bca1fc81a3fac53562d8e9a828d22d564539d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:21.242233Z","signature_b64":"cSfSp2xybEPXUNtst36iJEMSyraT1T5nmTLuEvgiI+8sWzpCqIGYdqB7sN43nRyUtJHctHOgAFmobvg/BL9YDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69d92bf17ecd73f08e5d0a2df18bca1fc81a3fac53562d8e9a828d22d564539d","last_reissued_at":"2026-05-18T00:01:21.241820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:21.241820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02611","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CQIkilxbZPOMFm6wmHFoMAamt646vducn3f0FMV9r+PtuH4ZN7+hAKgb8Avw0QFfiTiU8QTe+r+ygouSY1qDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:48:28.416567Z"},"content_sha256":"984ce5a87d5060fd432f12724f0dff926c063def773032e1933fc2208ab3528a","schema_version":"1.0","event_id":"sha256:984ce5a87d5060fd432f12724f0dff926c063def773032e1933fc2208ab3528a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NHMSX4L6ZVZ7BDS5BIW7DC6KD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluating the Ability of LSTMs to Learn Context-Free Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Luzi Sennhauser, Robert C. Berwick","submitted_at":"2018-11-06T20:07:47Z","abstract_excerpt":"While long short-term memory (LSTM) neural net architectures are designed to capture sequence information, human language is generally composed of hierarchical structures. This raises the question as to whether LSTMs can learn hierarchical structures. We explore this question with a well-formed bracket prediction task using two types of brackets modeled by an LSTM. Demonstrating that such a system is learnable by an LSTM is the first step in demonstrating that the entire class of CFLs is also learnable. We observe that the model requires exponential memory in terms of the number of characters "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02611","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzPh7dk3z3Ng62Ct5c2XkhR4dU3Rr5HFOMWOMPV0vKx0+wCRa+0jfKFpc6EGzS2fbMjfjE4mh7cUDsdNCpdJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:48:28.417261Z"},"content_sha256":"8273cbb7302cf291b8e8c42b1c147b4b53867bb2bfe0c94d432e9530f681fc8d","schema_version":"1.0","event_id":"sha256:8273cbb7302cf291b8e8c42b1c147b4b53867bb2bfe0c94d432e9530f681fc8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHMSX4L6ZVZ7BDS5BIW7DC6KD7/bundle.json","state_url":"https://pith.science/pith/NHMSX4L6ZVZ7BDS5BIW7DC6KD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHMSX4L6ZVZ7BDS5BIW7DC6KD7/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-09T03:48:28Z","links":{"resolver":"https://pith.science/pith/NHMSX4L6ZVZ7BDS5BIW7DC6KD7","bundle":"https://pith.science/pith/NHMSX4L6ZVZ7BDS5BIW7DC6KD7/bundle.json","state":"https://pith.science/pith/NHMSX4L6ZVZ7BDS5BIW7DC6KD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHMSX4L6ZVZ7BDS5BIW7DC6KD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NHMSX4L6ZVZ7BDS5BIW7DC6KD7","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":"83998aa522368279607ee4a2ac7e83e366eb5ef7cab7b954dbce6749f6ef7fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-06T20:07:47Z","title_canon_sha256":"1d0a05cbeafce47befac88874b61a469da6f439c41ba7476457ff037b00eba98"},"schema_version":"1.0","source":{"id":"1811.02611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02611","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02611v1","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02611","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"NHMSX4L6ZVZ7","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NHMSX4L6ZVZ7BDS5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NHMSX4L6","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:8273cbb7302cf291b8e8c42b1c147b4b53867bb2bfe0c94d432e9530f681fc8d","target":"graph","created_at":"2026-05-18T00:01:21Z","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":"While long short-term memory (LSTM) neural net architectures are designed to capture sequence information, human language is generally composed of hierarchical structures. This raises the question as to whether LSTMs can learn hierarchical structures. We explore this question with a well-formed bracket prediction task using two types of brackets modeled by an LSTM. Demonstrating that such a system is learnable by an LSTM is the first step in demonstrating that the entire class of CFLs is also learnable. We observe that the model requires exponential memory in terms of the number of characters ","authors_text":"Luzi Sennhauser, Robert C. Berwick","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-06T20:07:47Z","title":"Evaluating the Ability of LSTMs to Learn Context-Free Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02611","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:984ce5a87d5060fd432f12724f0dff926c063def773032e1933fc2208ab3528a","target":"record","created_at":"2026-05-18T00:01:21Z","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":"83998aa522368279607ee4a2ac7e83e366eb5ef7cab7b954dbce6749f6ef7fac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-06T20:07:47Z","title_canon_sha256":"1d0a05cbeafce47befac88874b61a469da6f439c41ba7476457ff037b00eba98"},"schema_version":"1.0","source":{"id":"1811.02611","kind":"arxiv","version":1}},"canonical_sha256":"69d92bf17ecd73f08e5d0a2df18bca1fc81a3fac53562d8e9a828d22d564539d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69d92bf17ecd73f08e5d0a2df18bca1fc81a3fac53562d8e9a828d22d564539d","first_computed_at":"2026-05-18T00:01:21.241820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:21.241820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cSfSp2xybEPXUNtst36iJEMSyraT1T5nmTLuEvgiI+8sWzpCqIGYdqB7sN43nRyUtJHctHOgAFmobvg/BL9YDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:21.242233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:984ce5a87d5060fd432f12724f0dff926c063def773032e1933fc2208ab3528a","sha256:8273cbb7302cf291b8e8c42b1c147b4b53867bb2bfe0c94d432e9530f681fc8d"],"state_sha256":"4b876282b9b0b3d7af685aa1fc90b979e177b57bc94579d4f8b0438438c7a88a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuBAe32Ynv+VaDCSMe2goaYL5j103MA4Uv4lw+X+lMr8zmMEZd/1klekR1hO5Izr1k4t5N09JDnVTT3xb5cwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:48:28.421145Z","bundle_sha256":"ea24718d0ad31cc0adedbb9907517c34b84a6e0ec9ba515428cbfe9e68acd0f1"}}