{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MXFACISKIVGZ4ZWJTCUEBNA7UA","short_pith_number":"pith:MXFACISK","canonical_record":{"source":{"id":"1906.03648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-09T14:30:00Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"d51806fc2e7fd0ecb645265b7e83fd13be7477835a515754d1a7e53252f5e1bc","abstract_canon_sha256":"9699539f52e697368bfe2c3d466e09ae73066e5d037d486b8306a108ce516ef4"},"schema_version":"1.0"},"canonical_sha256":"65ca01224a454d9e66c998a840b41fa03a0d460126577dede3d9de681344e897","source":{"kind":"arxiv","id":"1906.03648","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03648","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03648v1","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03648","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"MXFACISKIVGZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MXFACISKIVGZ4ZWJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MXFACISK","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MXFACISKIVGZ4ZWJTCUEBNA7UA","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-09T14:30:00Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"d51806fc2e7fd0ecb645265b7e83fd13be7477835a515754d1a7e53252f5e1bc","abstract_canon_sha256":"9699539f52e697368bfe2c3d466e09ae73066e5d037d486b8306a108ce516ef4"},"schema_version":"1.0"},"canonical_sha256":"65ca01224a454d9e66c998a840b41fa03a0d460126577dede3d9de681344e897","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:45.511034Z","signature_b64":"qaVNdDP8Sf1E7j+B2zptfdOLrfIbeqN99iGUhSDearZxBDToUafA/er+Ug5spPY+9PhS/PVE6HI8sCGA0rE4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65ca01224a454d9e66c998a840b41fa03a0d460126577dede3d9de681344e897","last_reissued_at":"2026-05-17T23:43:45.510504Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:45.510504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03648","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-17T23:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4rn9QXuyExdqcDvGT/NVrw8XMc2SeFNIwOxPDa3SNKG0ZyAqqU5kjzsUVV0XaPRrozjCgnkc6fdjT5KVVEShDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:36:14.854344Z"},"content_sha256":"75179b7ca2e5cbd57f5dff902fd3253bb7a8e3d762341c767c1947d1a83549d4","schema_version":"1.0","event_id":"sha256:75179b7ca2e5cbd57f5dff902fd3253bb7a8e3d762341c767c1947d1a83549d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MXFACISKIVGZ4ZWJTCUEBNA7UA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LSTM Networks Can Perform Dynamic Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.CL","authors_text":"Mirac Suzgun, Sebastian Gehrmann, Stuart M. Shieber, Yonatan Belinkov","submitted_at":"2019-06-09T14:30:00Z","abstract_excerpt":"In this paper, we systematically assess the ability of standard recurrent networks to perform dynamic counting and to encode hierarchical representations. All the neural models in our experiments are designed to be small-sized networks both to prevent them from memorizing the training sets and to visualize and interpret their behaviour at test time. Our results demonstrate that the Long Short-Term Memory (LSTM) networks can learn to recognize the well-balanced parenthesis language (Dyck-$1$) and the shuffles of multiple Dyck-$1$ languages, each defined over different parenthesis-pairs, by emul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03648","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-17T23:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkO6lzYfAUCdkR7YnN5kizSipvZv0hi0UPcYwerFWTLt/L+20kMnix/v0GKeHO1saQebe8+LE/y+YL3tAR90Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:36:14.854699Z"},"content_sha256":"4a765618566bdc9a23b6cc7b0efcb9316948c79a7b2f8396c81c2295b976cd6e","schema_version":"1.0","event_id":"sha256:4a765618566bdc9a23b6cc7b0efcb9316948c79a7b2f8396c81c2295b976cd6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXFACISKIVGZ4ZWJTCUEBNA7UA/bundle.json","state_url":"https://pith.science/pith/MXFACISKIVGZ4ZWJTCUEBNA7UA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXFACISKIVGZ4ZWJTCUEBNA7UA/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-02T17:36:14Z","links":{"resolver":"https://pith.science/pith/MXFACISKIVGZ4ZWJTCUEBNA7UA","bundle":"https://pith.science/pith/MXFACISKIVGZ4ZWJTCUEBNA7UA/bundle.json","state":"https://pith.science/pith/MXFACISKIVGZ4ZWJTCUEBNA7UA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXFACISKIVGZ4ZWJTCUEBNA7UA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MXFACISKIVGZ4ZWJTCUEBNA7UA","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":"9699539f52e697368bfe2c3d466e09ae73066e5d037d486b8306a108ce516ef4","cross_cats_sorted":["cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-09T14:30:00Z","title_canon_sha256":"d51806fc2e7fd0ecb645265b7e83fd13be7477835a515754d1a7e53252f5e1bc"},"schema_version":"1.0","source":{"id":"1906.03648","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03648","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03648v1","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03648","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"MXFACISKIVGZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"MXFACISKIVGZ4ZWJ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"MXFACISK","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:4a765618566bdc9a23b6cc7b0efcb9316948c79a7b2f8396c81c2295b976cd6e","target":"graph","created_at":"2026-05-17T23:43:45Z","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":"In this paper, we systematically assess the ability of standard recurrent networks to perform dynamic counting and to encode hierarchical representations. All the neural models in our experiments are designed to be small-sized networks both to prevent them from memorizing the training sets and to visualize and interpret their behaviour at test time. Our results demonstrate that the Long Short-Term Memory (LSTM) networks can learn to recognize the well-balanced parenthesis language (Dyck-$1$) and the shuffles of multiple Dyck-$1$ languages, each defined over different parenthesis-pairs, by emul","authors_text":"Mirac Suzgun, Sebastian Gehrmann, Stuart M. Shieber, Yonatan Belinkov","cross_cats":["cs.FL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-09T14:30:00Z","title":"LSTM Networks Can Perform Dynamic Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03648","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:75179b7ca2e5cbd57f5dff902fd3253bb7a8e3d762341c767c1947d1a83549d4","target":"record","created_at":"2026-05-17T23:43:45Z","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":"9699539f52e697368bfe2c3d466e09ae73066e5d037d486b8306a108ce516ef4","cross_cats_sorted":["cs.FL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-09T14:30:00Z","title_canon_sha256":"d51806fc2e7fd0ecb645265b7e83fd13be7477835a515754d1a7e53252f5e1bc"},"schema_version":"1.0","source":{"id":"1906.03648","kind":"arxiv","version":1}},"canonical_sha256":"65ca01224a454d9e66c998a840b41fa03a0d460126577dede3d9de681344e897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65ca01224a454d9e66c998a840b41fa03a0d460126577dede3d9de681344e897","first_computed_at":"2026-05-17T23:43:45.510504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:45.510504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qaVNdDP8Sf1E7j+B2zptfdOLrfIbeqN99iGUhSDearZxBDToUafA/er+Ug5spPY+9PhS/PVE6HI8sCGA0rE4BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:45.511034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03648","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75179b7ca2e5cbd57f5dff902fd3253bb7a8e3d762341c767c1947d1a83549d4","sha256:4a765618566bdc9a23b6cc7b0efcb9316948c79a7b2f8396c81c2295b976cd6e"],"state_sha256":"8a33af0bcd92d359b64b30f365cb76a6f53c8e20b9bded1ee80d2a6f3293e0b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7NUPJNhyVqpLtsazrnGHiJimyIUoX3siQIqdNBFbLEa4zTbZvjqFIJrzCum4chUgWbpGsMFTJgneF0bxR3DDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:36:14.856785Z","bundle_sha256":"4b5bc8abc9730bad132a9eb63aca88746e465de8b2ebf282fc1e9269250d9528"}}