{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6GPMTOKJP4RBDW7QW4TV5PWTON","short_pith_number":"pith:6GPMTOKJ","canonical_record":{"source":{"id":"1805.00327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T13:37:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"511b53e21824703b744ac1c2c1b269b8459b32e89bd7569948c7a10ddbc1a4e6","abstract_canon_sha256":"b7534352cd962f9fc042d3558ec06bd4b43fdf9c91aa2ea834e9f9039630369a"},"schema_version":"1.0"},"canonical_sha256":"f19ec9b9497f2211dbf0b7275ebed373650d8b892408d8c458965c4b3cce98e6","source":{"kind":"arxiv","id":"1805.00327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00327","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00327v1","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00327","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"6GPMTOKJP4RB","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"pith_short_16","alias_value":"6GPMTOKJP4RBDW7Q","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"pith_short_8","alias_value":"6GPMTOKJ","created_at":"2026-07-05T02:50:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6GPMTOKJP4RBDW7QW4TV5PWTON","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T13:37:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"511b53e21824703b744ac1c2c1b269b8459b32e89bd7569948c7a10ddbc1a4e6","abstract_canon_sha256":"b7534352cd962f9fc042d3558ec06bd4b43fdf9c91aa2ea834e9f9039630369a"},"schema_version":"1.0"},"canonical_sha256":"f19ec9b9497f2211dbf0b7275ebed373650d8b892408d8c458965c4b3cce98e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:35.916135Z","signature_b64":"25T52JDnGL2WrW8rBY9V+HXJZZuvbQ0RCPFhFJifG/vZ9bQlh/6XjlUvA3FWjgHSSFjbtJpHBceDD+RoOkvHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19ec9b9497f2211dbf0b7275ebed373650d8b892408d8c458965c4b3cce98e6","last_reissued_at":"2026-07-05T02:50:35.915692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:35.915692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00327","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-07-05T02:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbtchG9Kw2iB0TgX5llxy/dZ+0rX2EaBPlBfUtvtThbm7+O2hvNNbjrHfIUbaTVnC+ZhIY+TKL5eJoXMuU1VDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:06:10.041549Z"},"content_sha256":"4b6bd7fca17d5a33a8f20e7b16cbb2ecbd7ded7dee9446807910cb1389f88a5e","schema_version":"1.0","event_id":"sha256:4b6bd7fca17d5a33a8f20e7b16cbb2ecbd7ded7dee9446807910cb1389f88a5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6GPMTOKJP4RBDW7QW4TV5PWTON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Taxonomy for Neural Memory Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jose Principe, Ying Ma","submitted_at":"2018-05-01T13:37:37Z","abstract_excerpt":"In this paper, a taxonomy for memory networks is proposed based on their memory organization. The taxonomy includes all the popular memory networks: vanilla recurrent neural network (RNN), long short term memory (LSTM ), neural stack and neural Turing machine and their variants. The taxonomy puts all these networks under a single umbrella and shows their relative expressive power , i.e. vanilla RNN <=LSTM<=neural stack<=neural RAM. The differences and commonality between these networks are analyzed. These differences are also connected to the requirements of different tasks which can give the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00327","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.00327/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-05T02:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avjagmFLrtVzeZlnoyYzMDKZtvr9eWE2st0xwk2m2uDS6unlQJgqO9ALE6L0l0TWBY03yu57wTZ9+kEEwNBJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T05:06:10.042102Z"},"content_sha256":"65feee34f97c08afef4dab96a2ad227939d529fc4acbe2944d3a2717e650a24e","schema_version":"1.0","event_id":"sha256:65feee34f97c08afef4dab96a2ad227939d529fc4acbe2944d3a2717e650a24e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GPMTOKJP4RBDW7QW4TV5PWTON/bundle.json","state_url":"https://pith.science/pith/6GPMTOKJP4RBDW7QW4TV5PWTON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GPMTOKJP4RBDW7QW4TV5PWTON/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-20T05:06:10Z","links":{"resolver":"https://pith.science/pith/6GPMTOKJP4RBDW7QW4TV5PWTON","bundle":"https://pith.science/pith/6GPMTOKJP4RBDW7QW4TV5PWTON/bundle.json","state":"https://pith.science/pith/6GPMTOKJP4RBDW7QW4TV5PWTON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GPMTOKJP4RBDW7QW4TV5PWTON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6GPMTOKJP4RBDW7QW4TV5PWTON","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":"b7534352cd962f9fc042d3558ec06bd4b43fdf9c91aa2ea834e9f9039630369a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T13:37:37Z","title_canon_sha256":"511b53e21824703b744ac1c2c1b269b8459b32e89bd7569948c7a10ddbc1a4e6"},"schema_version":"1.0","source":{"id":"1805.00327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00327","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00327v1","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00327","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"6GPMTOKJP4RB","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"pith_short_16","alias_value":"6GPMTOKJP4RBDW7Q","created_at":"2026-07-05T02:50:35Z"},{"alias_kind":"pith_short_8","alias_value":"6GPMTOKJ","created_at":"2026-07-05T02:50:35Z"}],"graph_snapshots":[{"event_id":"sha256:65feee34f97c08afef4dab96a2ad227939d529fc4acbe2944d3a2717e650a24e","target":"graph","created_at":"2026-07-05T02:50:35Z","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/1805.00327/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, a taxonomy for memory networks is proposed based on their memory organization. The taxonomy includes all the popular memory networks: vanilla recurrent neural network (RNN), long short term memory (LSTM ), neural stack and neural Turing machine and their variants. The taxonomy puts all these networks under a single umbrella and shows their relative expressive power , i.e. vanilla RNN <=LSTM<=neural stack<=neural RAM. The differences and commonality between these networks are analyzed. These differences are also connected to the requirements of different tasks which can give the ","authors_text":"Jose Principe, Ying Ma","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T13:37:37Z","title":"A Taxonomy for Neural Memory Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00327","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:4b6bd7fca17d5a33a8f20e7b16cbb2ecbd7ded7dee9446807910cb1389f88a5e","target":"record","created_at":"2026-07-05T02:50:35Z","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":"b7534352cd962f9fc042d3558ec06bd4b43fdf9c91aa2ea834e9f9039630369a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-01T13:37:37Z","title_canon_sha256":"511b53e21824703b744ac1c2c1b269b8459b32e89bd7569948c7a10ddbc1a4e6"},"schema_version":"1.0","source":{"id":"1805.00327","kind":"arxiv","version":1}},"canonical_sha256":"f19ec9b9497f2211dbf0b7275ebed373650d8b892408d8c458965c4b3cce98e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f19ec9b9497f2211dbf0b7275ebed373650d8b892408d8c458965c4b3cce98e6","first_computed_at":"2026-07-05T02:50:35.915692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:50:35.915692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"25T52JDnGL2WrW8rBY9V+HXJZZuvbQ0RCPFhFJifG/vZ9bQlh/6XjlUvA3FWjgHSSFjbtJpHBceDD+RoOkvHDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:50:35.916135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b6bd7fca17d5a33a8f20e7b16cbb2ecbd7ded7dee9446807910cb1389f88a5e","sha256:65feee34f97c08afef4dab96a2ad227939d529fc4acbe2944d3a2717e650a24e"],"state_sha256":"7b4e2e44ca62dee8883291f147585f12206de1dccda3529095913acde6b860d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1p74OmPqXGB3RYIW1v4P3xs5q2fX3lwkmpEso3Jusk1aabwqMgLTOXHSfg5BTVg8SgpiP68ALg29lJZx+EiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T05:06:10.045721Z","bundle_sha256":"4dc66d797fcc1ba83a03fe89e4facb5ea79e96e33c075a221cf99db8aa27fc44"}}