{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D7W5KBACFSEOG6IJ2V3MXXK3KO","short_pith_number":"pith:D7W5KBAC","schema_version":"1.0","canonical_sha256":"1fedd504022c88e37909d576cbdd5b53a9449a318c3c5c3ad9a0531d6ca6b1c9","source":{"kind":"arxiv","id":"1606.03126","version":2},"attestation_state":"computed","paper":{"title":"Key-Value Memory Networks for Directly Reading Documents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Adam Fisch, Alexander Miller, Amir-Hossein Karimi, Antoine Bordes, Jason Weston, Jesse Dodge","submitted_at":"2016-06-09T21:33:55Z","abstract_excerpt":"Directly reading documents and being able to answer questions from them is an unsolved challenge. To avoid its inherent difficulty, question answering (QA) has been directed towards using Knowledge Bases (KBs) instead, which has proven effective. Unfortunately KBs often suffer from being too restrictive, as the schema cannot support certain types of answers, and too sparse, e.g. Wikipedia contains much more information than Freebase. In this work we introduce a new method, Key-Value Memory Networks, that makes reading documents more viable by utilizing different encodings in the addressing and"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.03126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-06-09T21:33:55Z","cross_cats_sorted":[],"title_canon_sha256":"f6ba6ea2627a0eedf12a70b713ce43abe2aebc65d90daffbd1f17476b869fc3a","abstract_canon_sha256":"35792f8532d4af2f5bb7c2200db28f5ff480ab719b340be7dea7231d279f1aa8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:49.769543Z","signature_b64":"z6cb3TTjceXfZh+LfWgTPqdqEAJUDJQRUzX5sDEA0i9yD/faGb4NJwdCcXzJWjaPJvTrmKi3STKI7YYrj2u3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fedd504022c88e37909d576cbdd5b53a9449a318c3c5c3ad9a0531d6ca6b1c9","last_reissued_at":"2026-05-18T01:02:49.769087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:49.769087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Key-Value Memory Networks for Directly Reading Documents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Adam Fisch, Alexander Miller, Amir-Hossein Karimi, Antoine Bordes, Jason Weston, Jesse Dodge","submitted_at":"2016-06-09T21:33:55Z","abstract_excerpt":"Directly reading documents and being able to answer questions from them is an unsolved challenge. To avoid its inherent difficulty, question answering (QA) has been directed towards using Knowledge Bases (KBs) instead, which has proven effective. Unfortunately KBs often suffer from being too restrictive, as the schema cannot support certain types of answers, and too sparse, e.g. Wikipedia contains much more information than Freebase. In this work we introduce a new method, Key-Value Memory Networks, that makes reading documents more viable by utilizing different encodings in the addressing and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03126","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.03126","created_at":"2026-05-18T01:02:49.769163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03126v2","created_at":"2026-05-18T01:02:49.769163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03126","created_at":"2026-05-18T01:02:49.769163+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7W5KBACFSEO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7W5KBACFSEOG6IJ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7W5KBAC","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.01066","citing_title":"Language Models as Knowledge Bases?","ref_index":295,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12340","citing_title":"Online Learning-to-Defer with Varying Experts","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11193","citing_title":"TRACE: An Experiential Framework for Coherent Multi-hop Knowledge Graph Question Answering","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO","json":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO.json","graph_json":"https://pith.science/api/pith-number/D7W5KBACFSEOG6IJ2V3MXXK3KO/graph.json","events_json":"https://pith.science/api/pith-number/D7W5KBACFSEOG6IJ2V3MXXK3KO/events.json","paper":"https://pith.science/paper/D7W5KBAC"},"agent_actions":{"view_html":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO","download_json":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO.json","view_paper":"https://pith.science/paper/D7W5KBAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03126&json=true","fetch_graph":"https://pith.science/api/pith-number/D7W5KBACFSEOG6IJ2V3MXXK3KO/graph.json","fetch_events":"https://pith.science/api/pith-number/D7W5KBACFSEOG6IJ2V3MXXK3KO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO/action/storage_attestation","attest_author":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO/action/author_attestation","sign_citation":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO/action/citation_signature","submit_replication":"https://pith.science/pith/D7W5KBACFSEOG6IJ2V3MXXK3KO/action/replication_record"}},"created_at":"2026-05-18T01:02:49.769163+00:00","updated_at":"2026-05-18T01:02:49.769163+00:00"}