{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZS6ZKXMMSZIZ3AP3X37GIAOZ3F","short_pith_number":"pith:ZS6ZKXMM","canonical_record":{"source":{"id":"1606.05029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-16T02:20:04Z","cross_cats_sorted":[],"title_canon_sha256":"023dd1ac7ec39aa529984a862573b8d7aa7baa36a5c35dc5855de77df2f7b1c6","abstract_canon_sha256":"f3013902e9814ab5427555e0791087fea0c6ee443efcc5453aecbecf884a4f1b"},"schema_version":"1.0"},"canonical_sha256":"ccbd955d8c96519d81fbbefe6401d9d95504b26af07a2c5458f0cc92fa5c8292","source":{"kind":"arxiv","id":"1606.05029","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05029","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05029v2","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05029","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZS6ZKXMMSZIZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZS6ZKXMMSZIZ3AP3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZS6ZKXMM","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZS6ZKXMMSZIZ3AP3X37GIAOZ3F","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-16T02:20:04Z","cross_cats_sorted":[],"title_canon_sha256":"023dd1ac7ec39aa529984a862573b8d7aa7baa36a5c35dc5855de77df2f7b1c6","abstract_canon_sha256":"f3013902e9814ab5427555e0791087fea0c6ee443efcc5453aecbecf884a4f1b"},"schema_version":"1.0"},"canonical_sha256":"ccbd955d8c96519d81fbbefe6401d9d95504b26af07a2c5458f0cc92fa5c8292","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.342346Z","signature_b64":"Nm9b3FseLmlfLx+LwaOMZdjU2BHKjChMXxbYJndUb0fIiR2wruB5TVviD1SqTyLLXHnmQaswU8HmJ2euWmgwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccbd955d8c96519d81fbbefe6401d9d95504b26af07a2c5458f0cc92fa5c8292","last_reissued_at":"2026-05-18T00:39:18.341678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.341678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05029","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-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"la6udcgKQn/45XESE2FBlQg+vTJx2oGiIlQRx0NANpap6Q4GlquwxEC2OEcioxZ8pqDnjK7ZQLwreflsMpREDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:35:54.114520Z"},"content_sha256":"dffd2fc7f270b3d265e3da64387ac6482ca00e95f2065e93146f889f009cece1","schema_version":"1.0","event_id":"sha256:dffd2fc7f270b3d265e3da64387ac6482ca00e95f2065e93146f889f009cece1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZS6ZKXMMSZIZ3AP3X37GIAOZ3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No Need to Pay Attention: Simple Recurrent Neural Networks Work! (for Answering \"Simple\" Questions)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ferhan Ture, Oliver Jojic","submitted_at":"2016-06-16T02:20:04Z","abstract_excerpt":"First-order factoid question answering assumes that the question can be answered by a single fact in a knowledge base (KB). While this does not seem like a challenging task, many recent attempts that apply either complex linguistic reasoning or deep neural networks achieve 65%-76% accuracy on benchmark sets. Our approach formulates the task as two machine learning problems: detecting the entities in the question, and classifying the question as one of the relation types in the KB. We train a recurrent neural network to solve each problem. On the SimpleQuestions dataset, our approach yields sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05029","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-18T00:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKa5y1m1oxk/8g6CQiHbfMzi63a4TQIx7KJln3/1n7BL0kWCROO6uRe9sWHABY+wIic8ZMk8fmZ2eak3DeE4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:35:54.114878Z"},"content_sha256":"1bad8bba01114cbb41d60a2d481a330ae5000501f4ded3ad3c1351835b15f3c1","schema_version":"1.0","event_id":"sha256:1bad8bba01114cbb41d60a2d481a330ae5000501f4ded3ad3c1351835b15f3c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZS6ZKXMMSZIZ3AP3X37GIAOZ3F/bundle.json","state_url":"https://pith.science/pith/ZS6ZKXMMSZIZ3AP3X37GIAOZ3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZS6ZKXMMSZIZ3AP3X37GIAOZ3F/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-24T08:35:54Z","links":{"resolver":"https://pith.science/pith/ZS6ZKXMMSZIZ3AP3X37GIAOZ3F","bundle":"https://pith.science/pith/ZS6ZKXMMSZIZ3AP3X37GIAOZ3F/bundle.json","state":"https://pith.science/pith/ZS6ZKXMMSZIZ3AP3X37GIAOZ3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZS6ZKXMMSZIZ3AP3X37GIAOZ3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZS6ZKXMMSZIZ3AP3X37GIAOZ3F","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":"f3013902e9814ab5427555e0791087fea0c6ee443efcc5453aecbecf884a4f1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-16T02:20:04Z","title_canon_sha256":"023dd1ac7ec39aa529984a862573b8d7aa7baa36a5c35dc5855de77df2f7b1c6"},"schema_version":"1.0","source":{"id":"1606.05029","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05029","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05029v2","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05029","created_at":"2026-05-18T00:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZS6ZKXMMSZIZ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZS6ZKXMMSZIZ3AP3","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZS6ZKXMM","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:1bad8bba01114cbb41d60a2d481a330ae5000501f4ded3ad3c1351835b15f3c1","target":"graph","created_at":"2026-05-18T00:39:18Z","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":"First-order factoid question answering assumes that the question can be answered by a single fact in a knowledge base (KB). While this does not seem like a challenging task, many recent attempts that apply either complex linguistic reasoning or deep neural networks achieve 65%-76% accuracy on benchmark sets. Our approach formulates the task as two machine learning problems: detecting the entities in the question, and classifying the question as one of the relation types in the KB. We train a recurrent neural network to solve each problem. On the SimpleQuestions dataset, our approach yields sub","authors_text":"Ferhan Ture, Oliver Jojic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-16T02:20:04Z","title":"No Need to Pay Attention: Simple Recurrent Neural Networks Work! (for Answering \"Simple\" Questions)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05029","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:dffd2fc7f270b3d265e3da64387ac6482ca00e95f2065e93146f889f009cece1","target":"record","created_at":"2026-05-18T00:39:18Z","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":"f3013902e9814ab5427555e0791087fea0c6ee443efcc5453aecbecf884a4f1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-16T02:20:04Z","title_canon_sha256":"023dd1ac7ec39aa529984a862573b8d7aa7baa36a5c35dc5855de77df2f7b1c6"},"schema_version":"1.0","source":{"id":"1606.05029","kind":"arxiv","version":2}},"canonical_sha256":"ccbd955d8c96519d81fbbefe6401d9d95504b26af07a2c5458f0cc92fa5c8292","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccbd955d8c96519d81fbbefe6401d9d95504b26af07a2c5458f0cc92fa5c8292","first_computed_at":"2026-05-18T00:39:18.341678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:18.341678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nm9b3FseLmlfLx+LwaOMZdjU2BHKjChMXxbYJndUb0fIiR2wruB5TVviD1SqTyLLXHnmQaswU8HmJ2euWmgwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:18.342346Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05029","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dffd2fc7f270b3d265e3da64387ac6482ca00e95f2065e93146f889f009cece1","sha256:1bad8bba01114cbb41d60a2d481a330ae5000501f4ded3ad3c1351835b15f3c1"],"state_sha256":"3e19eeb5a6a79cf0ac04a220225c3622c8dec728df97637c8232d51485c5d8a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoVBJo1QfZyeFq1/Kf6+fN78QwB9yIRZqN9Y9SCGb0fxe4XE0fZrmmx4sRxgXOokE43eweHHyUIf+TKvbYnMAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:35:54.116815Z","bundle_sha256":"7f06b16b5f727a9da6bcbba1dcb11d45c2383637a3fb3874462df15ca7fc4d18"}}