{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KUXRL4S6I7LD7AJWHQXV5YOJFU","short_pith_number":"pith:KUXRL4S6","canonical_record":{"source":{"id":"1506.02516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-08T14:23:30Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"e6ff986186adc7ccfcedbad76bcdffea9f8270c8d650bd9eaa885995fa9bf75b","abstract_canon_sha256":"866f74db6f35e435e83902929fd690bc19abbcadddb9c05099b51b193161f7f3"},"schema_version":"1.0"},"canonical_sha256":"552f15f25e47d63f81363c2f5ee1c92d3f2ea684ad3e6360f1143b7c5cdf30dd","source":{"kind":"arxiv","id":"1506.02516","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02516","created_at":"2026-05-18T01:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02516v3","created_at":"2026-05-18T01:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02516","created_at":"2026-05-18T01:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"KUXRL4S6I7LD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KUXRL4S6I7LD7AJW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KUXRL4S6","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KUXRL4S6I7LD7AJWHQXV5YOJFU","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-08T14:23:30Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"e6ff986186adc7ccfcedbad76bcdffea9f8270c8d650bd9eaa885995fa9bf75b","abstract_canon_sha256":"866f74db6f35e435e83902929fd690bc19abbcadddb9c05099b51b193161f7f3"},"schema_version":"1.0"},"canonical_sha256":"552f15f25e47d63f81363c2f5ee1c92d3f2ea684ad3e6360f1143b7c5cdf30dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:04.760581Z","signature_b64":"4K3+szkJR40Jvb50lELoq1kgoHxEvCOawW5a1NTiE+Bf8DnPj12u36r5/zFqFUv1WwLq93uqFD4qWgla5GAFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"552f15f25e47d63f81363c2f5ee1c92d3f2ea684ad3e6360f1143b7c5cdf30dd","last_reissued_at":"2026-05-18T01:28:04.759823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:04.759823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02516","source_version":3,"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:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnZ0/euIk+y+MQVHB/XO8qNw7Rx614cs7SKjDz8r1YpxJYnZXAEh0GCoh5QACEQN4/K+bQSkaXYImHcA6WmtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:28:48.847555Z"},"content_sha256":"0f1f733b266456516b656619f1836ea4469f088757ece034ff8f95d81b8371bd","schema_version":"1.0","event_id":"sha256:0f1f733b266456516b656619f1836ea4469f088757ece034ff8f95d81b8371bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KUXRL4S6I7LD7AJWHQXV5YOJFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Transduce with Unbounded Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.NE","authors_text":"Edward Grefenstette, Karl Moritz Hermann, Mustafa Suleyman, Phil Blunsom","submitted_at":"2015-06-08T14:23:30Z","abstract_excerpt":"Recently, strong results have been demonstrated by Deep Recurrent Neural Networks on natural language transduction problems. In this paper we explore the representational power of these models using synthetic grammars designed to exhibit phenomena similar to those found in real transduction problems such as machine translation. These experiments lead us to propose new memory-based recurrent networks that implement continuously differentiable analogues of traditional data structures such as Stacks, Queues, and DeQues. We show that these architectures exhibit superior generalisation performance "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02516","kind":"arxiv","version":3},"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:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCB5ATcLNGrEHtH1zvw6fYNZjAGMxjGOAtGp6tBV+epMXbCh3Hdzj02LE06cfKIuH2oH/WUhLFTTqks2PRlxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:28:48.848187Z"},"content_sha256":"43861bab754a3abe8e61b8ebf2542e01a97afa3b1529cd7c5904a48f2d2a0616","schema_version":"1.0","event_id":"sha256:43861bab754a3abe8e61b8ebf2542e01a97afa3b1529cd7c5904a48f2d2a0616"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUXRL4S6I7LD7AJWHQXV5YOJFU/bundle.json","state_url":"https://pith.science/pith/KUXRL4S6I7LD7AJWHQXV5YOJFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUXRL4S6I7LD7AJWHQXV5YOJFU/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-05-24T15:28:48Z","links":{"resolver":"https://pith.science/pith/KUXRL4S6I7LD7AJWHQXV5YOJFU","bundle":"https://pith.science/pith/KUXRL4S6I7LD7AJWHQXV5YOJFU/bundle.json","state":"https://pith.science/pith/KUXRL4S6I7LD7AJWHQXV5YOJFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUXRL4S6I7LD7AJWHQXV5YOJFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KUXRL4S6I7LD7AJWHQXV5YOJFU","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":"866f74db6f35e435e83902929fd690bc19abbcadddb9c05099b51b193161f7f3","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-08T14:23:30Z","title_canon_sha256":"e6ff986186adc7ccfcedbad76bcdffea9f8270c8d650bd9eaa885995fa9bf75b"},"schema_version":"1.0","source":{"id":"1506.02516","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02516","created_at":"2026-05-18T01:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02516v3","created_at":"2026-05-18T01:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02516","created_at":"2026-05-18T01:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"KUXRL4S6I7LD","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KUXRL4S6I7LD7AJW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KUXRL4S6","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:43861bab754a3abe8e61b8ebf2542e01a97afa3b1529cd7c5904a48f2d2a0616","target":"graph","created_at":"2026-05-18T01:28:04Z","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":"Recently, strong results have been demonstrated by Deep Recurrent Neural Networks on natural language transduction problems. In this paper we explore the representational power of these models using synthetic grammars designed to exhibit phenomena similar to those found in real transduction problems such as machine translation. These experiments lead us to propose new memory-based recurrent networks that implement continuously differentiable analogues of traditional data structures such as Stacks, Queues, and DeQues. We show that these architectures exhibit superior generalisation performance ","authors_text":"Edward Grefenstette, Karl Moritz Hermann, Mustafa Suleyman, Phil Blunsom","cross_cats":["cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-08T14:23:30Z","title":"Learning to Transduce with Unbounded Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02516","kind":"arxiv","version":3},"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:0f1f733b266456516b656619f1836ea4469f088757ece034ff8f95d81b8371bd","target":"record","created_at":"2026-05-18T01:28:04Z","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":"866f74db6f35e435e83902929fd690bc19abbcadddb9c05099b51b193161f7f3","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-08T14:23:30Z","title_canon_sha256":"e6ff986186adc7ccfcedbad76bcdffea9f8270c8d650bd9eaa885995fa9bf75b"},"schema_version":"1.0","source":{"id":"1506.02516","kind":"arxiv","version":3}},"canonical_sha256":"552f15f25e47d63f81363c2f5ee1c92d3f2ea684ad3e6360f1143b7c5cdf30dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"552f15f25e47d63f81363c2f5ee1c92d3f2ea684ad3e6360f1143b7c5cdf30dd","first_computed_at":"2026-05-18T01:28:04.759823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:04.759823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4K3+szkJR40Jvb50lELoq1kgoHxEvCOawW5a1NTiE+Bf8DnPj12u36r5/zFqFUv1WwLq93uqFD4qWgla5GAFAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:04.760581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02516","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f1f733b266456516b656619f1836ea4469f088757ece034ff8f95d81b8371bd","sha256:43861bab754a3abe8e61b8ebf2542e01a97afa3b1529cd7c5904a48f2d2a0616"],"state_sha256":"95ba4c6ab0468e91ea3c4f10881d560fa89a483779b7df60b6afdf7377f354c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQQyvIj759TMg63PPUj7LgjI08lyzZaX8snqekNJAstNF8GsyPkYwWBRAqrHFC2ceeJ+TdIyxh9yCm1jrwWkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T15:28:48.851450Z","bundle_sha256":"f14e9bacca1ab75a16ee56aa6b19d63c83f9e784e8ec1ec7523cc66ff5f6acb7"}}