{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YFU3HVUDKLRRHG2CKQFHRGACTM","short_pith_number":"pith:YFU3HVUD","canonical_record":{"source":{"id":"1506.07285","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-24T08:27:02Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"e49633d96186ba1610a39e29550bcdbf136e9392b3ad81830ed5413e991ca4b7","abstract_canon_sha256":"aca4be688c7b729628a028c3f78dd3071d289c6507f7b0ffade9fdd797578f01"},"schema_version":"1.0"},"canonical_sha256":"c169b3d68352e3139b42540a7898029b17d9ada028a4214603af965cc8b4379b","source":{"kind":"arxiv","id":"1506.07285","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07285","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07285v5","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07285","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"YFU3HVUDKLRR","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YFU3HVUDKLRRHG2C","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YFU3HVUD","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YFU3HVUDKLRRHG2CKQFHRGACTM","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07285","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-24T08:27:02Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"e49633d96186ba1610a39e29550bcdbf136e9392b3ad81830ed5413e991ca4b7","abstract_canon_sha256":"aca4be688c7b729628a028c3f78dd3071d289c6507f7b0ffade9fdd797578f01"},"schema_version":"1.0"},"canonical_sha256":"c169b3d68352e3139b42540a7898029b17d9ada028a4214603af965cc8b4379b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.357170Z","signature_b64":"VgQsDbq/EKNtudO5RUbi+8hw00tNVs88Qf/scjfhNhysHz18lqTJ+0dOZfKOL9RlwCLkkV5saPWPZJ6Ty5fzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c169b3d68352e3139b42540a7898029b17d9ada028a4214603af965cc8b4379b","last_reissued_at":"2026-05-18T01:19:35.356761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.356761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07285","source_version":5,"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:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vahAMYAfbT0C7Vx6xXNFiGb+JInQdKS98ZNWUIuxxw+gGK00Nfrv6gqYVudPRFPh60xASBZFvKRHZ6DVWJm7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:16:24.108656Z"},"content_sha256":"13c81f02a48400c75fa9db4362f7f45356c1e94bcec254b20c8b525f5b04774b","schema_version":"1.0","event_id":"sha256:13c81f02a48400c75fa9db4362f7f45356c1e94bcec254b20c8b525f5b04774b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YFU3HVUDKLRRHG2CKQFHRGACTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ask Me Anything: Dynamic Memory Networks for Natural Language Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Ankit Kumar, Ishaan Gulrajani, James Bradbury, Mohit Iyyer, Ozan Irsoy, Peter Ondruska, Richard Socher, Romain Paulus, Victor Zhong","submitted_at":"2015-06-24T08:27:02Z","abstract_excerpt":"Most tasks in natural language processing can be cast into question answering (QA) problems over language input. We introduce the dynamic memory network (DMN), a neural network architecture which processes input sequences and questions, forms episodic memories, and generates relevant answers. Questions trigger an iterative attention process which allows the model to condition its attention on the inputs and the result of previous iterations. These results are then reasoned over in a hierarchical recurrent sequence model to generate answers. The DMN can be trained end-to-end and obtains state-o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07285","kind":"arxiv","version":5},"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:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvxtttfwbpCBhAc0G3ImkJl3dG9MPFAAp+U56Vs7kpYpL9sgI5qo9TgEIqAjze6UjOn5Oj36LCit+1lhS3LeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:16:24.109268Z"},"content_sha256":"db8bf2a078ca714d93b2c91e9d40a63659ce99990920d4099de5dee44c27c0de","schema_version":"1.0","event_id":"sha256:db8bf2a078ca714d93b2c91e9d40a63659ce99990920d4099de5dee44c27c0de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFU3HVUDKLRRHG2CKQFHRGACTM/bundle.json","state_url":"https://pith.science/pith/YFU3HVUDKLRRHG2CKQFHRGACTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFU3HVUDKLRRHG2CKQFHRGACTM/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-27T23:16:24Z","links":{"resolver":"https://pith.science/pith/YFU3HVUDKLRRHG2CKQFHRGACTM","bundle":"https://pith.science/pith/YFU3HVUDKLRRHG2CKQFHRGACTM/bundle.json","state":"https://pith.science/pith/YFU3HVUDKLRRHG2CKQFHRGACTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFU3HVUDKLRRHG2CKQFHRGACTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YFU3HVUDKLRRHG2CKQFHRGACTM","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":"aca4be688c7b729628a028c3f78dd3071d289c6507f7b0ffade9fdd797578f01","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-24T08:27:02Z","title_canon_sha256":"e49633d96186ba1610a39e29550bcdbf136e9392b3ad81830ed5413e991ca4b7"},"schema_version":"1.0","source":{"id":"1506.07285","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07285","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07285v5","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07285","created_at":"2026-05-18T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"YFU3HVUDKLRR","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YFU3HVUDKLRRHG2C","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YFU3HVUD","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:db8bf2a078ca714d93b2c91e9d40a63659ce99990920d4099de5dee44c27c0de","target":"graph","created_at":"2026-05-18T01:19: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"},"paper":{"abstract_excerpt":"Most tasks in natural language processing can be cast into question answering (QA) problems over language input. We introduce the dynamic memory network (DMN), a neural network architecture which processes input sequences and questions, forms episodic memories, and generates relevant answers. Questions trigger an iterative attention process which allows the model to condition its attention on the inputs and the result of previous iterations. These results are then reasoned over in a hierarchical recurrent sequence model to generate answers. The DMN can be trained end-to-end and obtains state-o","authors_text":"Ankit Kumar, Ishaan Gulrajani, James Bradbury, Mohit Iyyer, Ozan Irsoy, Peter Ondruska, Richard Socher, Romain Paulus, Victor Zhong","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-24T08:27:02Z","title":"Ask Me Anything: Dynamic Memory Networks for Natural Language Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07285","kind":"arxiv","version":5},"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:13c81f02a48400c75fa9db4362f7f45356c1e94bcec254b20c8b525f5b04774b","target":"record","created_at":"2026-05-18T01:19: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":"aca4be688c7b729628a028c3f78dd3071d289c6507f7b0ffade9fdd797578f01","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-06-24T08:27:02Z","title_canon_sha256":"e49633d96186ba1610a39e29550bcdbf136e9392b3ad81830ed5413e991ca4b7"},"schema_version":"1.0","source":{"id":"1506.07285","kind":"arxiv","version":5}},"canonical_sha256":"c169b3d68352e3139b42540a7898029b17d9ada028a4214603af965cc8b4379b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c169b3d68352e3139b42540a7898029b17d9ada028a4214603af965cc8b4379b","first_computed_at":"2026-05-18T01:19:35.356761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:35.356761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VgQsDbq/EKNtudO5RUbi+8hw00tNVs88Qf/scjfhNhysHz18lqTJ+0dOZfKOL9RlwCLkkV5saPWPZJ6Ty5fzBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:35.357170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07285","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13c81f02a48400c75fa9db4362f7f45356c1e94bcec254b20c8b525f5b04774b","sha256:db8bf2a078ca714d93b2c91e9d40a63659ce99990920d4099de5dee44c27c0de"],"state_sha256":"d620b49688cc39555d5bd3e61f2ba367c93b27901f1ec38777f02b7e488c9f90"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ny3DAu7kypkSDYW84W1TGL6Hm5ALoSiiSJfNMVtY0vLyr1nVvNSohW8B9sv3JpulCx5QYwr8JpvKm2S5mVgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:16:24.111709Z","bundle_sha256":"504ffc1a72958c30e79510b6d03de4656a9b25eebfee8b557646f87ef5954345"}}