{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Y46M44QJWC7VAIJGZWDAQIMAV7","short_pith_number":"pith:Y46M44QJ","canonical_record":{"source":{"id":"1606.03864","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-13T09:08:04Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"62fdf285889e22b9b010644af73798629ab28d9b58f413cc03900744e43986bd","abstract_canon_sha256":"c7e9de3649b2d96f56cc9e984ef3f6b788215d924a7a14bd209412de6bbc604c"},"schema_version":"1.0"},"canonical_sha256":"c73cce7209b0bf502126cd86082180afdef91117e1b29578469b833dc2d0b53e","source":{"kind":"arxiv","id":"1606.03864","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03864","created_at":"2026-05-18T01:12:26Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03864v2","created_at":"2026-05-18T01:12:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03864","created_at":"2026-05-18T01:12:26Z"},{"alias_kind":"pith_short_12","alias_value":"Y46M44QJWC7V","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"Y46M44QJWC7VAIJG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"Y46M44QJ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Y46M44QJWC7VAIJGZWDAQIMAV7","target":"record","payload":{"canonical_record":{"source":{"id":"1606.03864","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-13T09:08:04Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"62fdf285889e22b9b010644af73798629ab28d9b58f413cc03900744e43986bd","abstract_canon_sha256":"c7e9de3649b2d96f56cc9e984ef3f6b788215d924a7a14bd209412de6bbc604c"},"schema_version":"1.0"},"canonical_sha256":"c73cce7209b0bf502126cd86082180afdef91117e1b29578469b833dc2d0b53e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:26.081848Z","signature_b64":"vOhJEgFA812idZw+r4lphWREQYgeXbJIF3TSXpHcPFJiqZ4GuHXgI3vBbpFVfOmFWz/anzhdpaOtjm8cDQFEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c73cce7209b0bf502126cd86082180afdef91117e1b29578469b833dc2d0b53e","last_reissued_at":"2026-05-18T01:12:26.081514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:26.081514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.03864","source_version":2,"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-18T01:12:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FivJyH22MeAko+RDT7sj5vLsPbKRDOP2rgO2i3WrodnnRTxmo+VjqWlaOu9Je1ibsKi2jjFhR8IQRUlOuQ6ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:28:21.504991Z"},"content_sha256":"a42aa4c37060a2b7e59b74a82d8012dca5f852d9ced5923365e251c7a13aaf00","schema_version":"1.0","event_id":"sha256:a42aa4c37060a2b7e59b74a82d8012dca5f852d9ced5923365e251c7a13aaf00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Y46M44QJWC7VAIJGZWDAQIMAV7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Associative Memory for Dual-Sequence Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.NE","authors_text":"Dirk Weissenborn","submitted_at":"2016-06-13T09:08:04Z","abstract_excerpt":"Many important NLP problems can be posed as dual-sequence or sequence-to-sequence modeling tasks. Recent advances in building end-to-end neural architectures have been highly successful in solving such tasks. In this work we propose a new architecture for dual-sequence modeling that is based on associative memory. We derive AM-RNNs, a recurrent associative memory (AM) which augments generic recurrent neural networks (RNN). This architecture is extended to the Dual AM-RNN which operates on two AMs at once. Our models achieve very competitive results on textual entailment. A qualitative analysis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03864","kind":"arxiv","version":2},"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-18T01:12:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bL91/s4AN8zAk95G2A3XI7GYCHCRjgImxWITTdQ3NBjXrvDl1mYWyPMw/7kfggIUSdqbkGjGLNNpVKzrXtucCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:28:21.505351Z"},"content_sha256":"ce3b7954ab54300d5472524c05f455e9443e640fb8e45fcd415f621babedba5c","schema_version":"1.0","event_id":"sha256:ce3b7954ab54300d5472524c05f455e9443e640fb8e45fcd415f621babedba5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y46M44QJWC7VAIJGZWDAQIMAV7/bundle.json","state_url":"https://pith.science/pith/Y46M44QJWC7VAIJGZWDAQIMAV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y46M44QJWC7VAIJGZWDAQIMAV7/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-24T04:28:21Z","links":{"resolver":"https://pith.science/pith/Y46M44QJWC7VAIJGZWDAQIMAV7","bundle":"https://pith.science/pith/Y46M44QJWC7VAIJGZWDAQIMAV7/bundle.json","state":"https://pith.science/pith/Y46M44QJWC7VAIJGZWDAQIMAV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y46M44QJWC7VAIJGZWDAQIMAV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y46M44QJWC7VAIJGZWDAQIMAV7","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":"c7e9de3649b2d96f56cc9e984ef3f6b788215d924a7a14bd209412de6bbc604c","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-13T09:08:04Z","title_canon_sha256":"62fdf285889e22b9b010644af73798629ab28d9b58f413cc03900744e43986bd"},"schema_version":"1.0","source":{"id":"1606.03864","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03864","created_at":"2026-05-18T01:12:26Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03864v2","created_at":"2026-05-18T01:12:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03864","created_at":"2026-05-18T01:12:26Z"},{"alias_kind":"pith_short_12","alias_value":"Y46M44QJWC7V","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"Y46M44QJWC7VAIJG","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"Y46M44QJ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ce3b7954ab54300d5472524c05f455e9443e640fb8e45fcd415f621babedba5c","target":"graph","created_at":"2026-05-18T01:12:26Z","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":"Many important NLP problems can be posed as dual-sequence or sequence-to-sequence modeling tasks. Recent advances in building end-to-end neural architectures have been highly successful in solving such tasks. In this work we propose a new architecture for dual-sequence modeling that is based on associative memory. We derive AM-RNNs, a recurrent associative memory (AM) which augments generic recurrent neural networks (RNN). This architecture is extended to the Dual AM-RNN which operates on two AMs at once. Our models achieve very competitive results on textual entailment. A qualitative analysis","authors_text":"Dirk Weissenborn","cross_cats":["cs.AI","cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-13T09:08:04Z","title":"Neural Associative Memory for Dual-Sequence Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03864","kind":"arxiv","version":2},"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:a42aa4c37060a2b7e59b74a82d8012dca5f852d9ced5923365e251c7a13aaf00","target":"record","created_at":"2026-05-18T01:12:26Z","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":"c7e9de3649b2d96f56cc9e984ef3f6b788215d924a7a14bd209412de6bbc604c","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2016-06-13T09:08:04Z","title_canon_sha256":"62fdf285889e22b9b010644af73798629ab28d9b58f413cc03900744e43986bd"},"schema_version":"1.0","source":{"id":"1606.03864","kind":"arxiv","version":2}},"canonical_sha256":"c73cce7209b0bf502126cd86082180afdef91117e1b29578469b833dc2d0b53e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c73cce7209b0bf502126cd86082180afdef91117e1b29578469b833dc2d0b53e","first_computed_at":"2026-05-18T01:12:26.081514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:26.081514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vOhJEgFA812idZw+r4lphWREQYgeXbJIF3TSXpHcPFJiqZ4GuHXgI3vBbpFVfOmFWz/anzhdpaOtjm8cDQFEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:26.081848Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03864","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a42aa4c37060a2b7e59b74a82d8012dca5f852d9ced5923365e251c7a13aaf00","sha256:ce3b7954ab54300d5472524c05f455e9443e640fb8e45fcd415f621babedba5c"],"state_sha256":"a551384312a9136364ff51b406b48c7d5a068293f95674bcf66a7bf5be703f03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XrFcakt3WqJX3eEDlGRzLWHmRGzq68DIMSGzZgfUgqRedsu1dEHVZPUJNQdiZsLXsY5fjbvMO3BnyX+6D/3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:28:21.507228Z","bundle_sha256":"39cd146b79bac33fb276ef910d453a553287b7c62afc5d5200f145bd3675a7be"}}