{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/tracking-the-world-state-with-recurrent","title":"Tracking the World State with Recurrent Entity Networks","arxiv_id":"1612.03969","date":"2016-12-12","proceeding":null,"authors":["Mikael Henaff","Jason Weston","Arthur Szlam","Antoine Bordes","Yann Lecun"],"abstract":"We introduce a new model, the Recurrent Entity Network (EntNet). It is\nequipped with a dynamic long-term memory which allows it to maintain and update\na representation of the state of the world as it receives new data. For\nlanguage understanding tasks, it can reason on-the-fly as it reads text, not\njust when it is required to answer a question or respond as is the case for a\nMemory Network (Sukhbaatar et al., 2015). Like a Neural Turing Machine or\nDifferentiable Neural Computer (Graves et al., 2014; 2016) it maintains a fixed\nsize memory and can learn to perform location and content-based read and write\noperations. However, unlike those models it has a simple parallel architecture\nin which several memory locations can be updated simultaneously. The EntNet\nsets a new state-of-the-art on the bAbI tasks, and is the first method to solve\nall the tasks in the 10k training examples setting. We also demonstrate that it\ncan solve a reasoning task which requires a large number of supporting facts,\nwhich other methods are not able to solve, and can generalize past its training\nhorizon. It can also be practically used on large scale datasets such as\nChildren's Book Test, where it obtains competitive performance, reading the\nstory in a single pass.","url_abs":"http://arxiv.org/abs/1612.03969v3","url_pdf":"http://arxiv.org/pdf/1612.03969v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"tracking-the-world-state-with-recurrent","repo_url":"https://github.com/facebook/MemNN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"tracking-the-world-state-with-recurrent","repo_url":"https://github.com/akshathaarodi/textual_timetravel_tom","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"tracking-the-world-state-with-recurrent","repo_url":"https://github.com/hsakas/Recurrent-Entity-Network-EntNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"tracking-the-world-state-with-recurrent","repo_url":"https://github.com/jimfleming/recurrent-entity-networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"tracking-the-world-state-with-recurrent","repo_url":"https://github.com/siddk/entity-network","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"procedural-text-understanding","task_name":"Procedural Text Understanding"},{"task_slug":"question-answering","task_name":"Question Answering"}],"methods":[{"method_slug":"content-based-attention","method_name":"Content-based Attention"},{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"location-based-attention","method_name":"Location-based Attention"},{"method_slug":"neural-turing-machine","method_name":"Neural Turing Machine"},{"method_slug":"recurrent-entity-network","method_name":"Recurrent Entity Network"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[{"slug":"recurrent-entity-network","name":"Recurrent Entity Network","full_name":"Recurrent Entity Network"}],"results":[{"leaderboard":"/sota/question-answering-on-babi","task":"Question Answering","dataset":"bAbi","model":"EntNet","rank_in_archive_order":3,"of":14,"metrics":{"Accuracy (trained on 10k)":"99.5%","Accuracy (trained on 1k)":"89.1%","Mean Error Rate":"9.7%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1612.03969","atlas_url":"https://app.syntology.ai/?focus=1612.03969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1612.03969"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.03969"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.03969"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.03969\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1612.03969"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1612.03969\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1612.03969"},"call":"get_concepts_for_paper(arxiv_id=\"1612.03969\")"}],"by_repo":[{"repo":"facebook/MemNN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"akshathaarodi/textual_timetravel_tom","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"hsakas/Recurrent-Entity-Network-EntNet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jimfleming/recurrent-entity-networks","kind":"listed","samples":3,"ran":0,"instrument":0,"unverified":3},{"repo":"siddk/entity-network","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1612.03969.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1612.03969.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/siddk/entity-network","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jimfleming/recurrent-entity-networks","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hsakas/Recurrent-Entity-Network-EntNet","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/facebook/MemNN","reach":{"status":"ok","spdx":"NOASSERTION"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/akshathaarodi/textual_timetravel_tom","reach":{"status":"ok"}}],"summary":{"unverified":3},"n_samples":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":3,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["facebook/MemNN"],"harvested_for_other_papers":[0],"samples_from_other_repositories":3,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"7c074f00ba51e7e9","code_sha256_prefix":"7c074f00ba51e7e9","entry":"parse_stories","repo":"jimfleming/recurrent-entity-networks","repo_kind":"listed","path":"entity_networks/prep_data.py","file_url":"https://github.com/jimfleming/recurrent-entity-networks/blob/HEAD/entity_networks/prep_data.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/parse-stories","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7c074f00ba51e7e9"}},{"code_sha256":"118f16bd1bc27cd3","code_sha256_prefix":"118f16bd1bc27cd3","entry":"tokenize","repo":"jimfleming/recurrent-entity-networks","repo_kind":"listed","path":"entity_networks/prep_data.py","file_url":"https://github.com/jimfleming/recurrent-entity-networks/blob/HEAD/entity_networks/prep_data.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/tokenize","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"118f16bd1bc27cd3"}},{"code_sha256":"f3e927bfb1e03638","code_sha256_prefix":"f3e927bfb1e03638","entry":"tokenize_stories","repo":"jimfleming/recurrent-entity-networks","repo_kind":"listed","path":"entity_networks/prep_data.py","file_url":"https://github.com/jimfleming/recurrent-entity-networks/blob/HEAD/entity_networks/prep_data.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f3e927bfb1e03638"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6ede6144f971ae097ea51b7e8ec9584dae2f9b41b687b841e8ee9a9ce7bb3afe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}