{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/parse-stories","entry":"parse_stories","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":9,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":9},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"1612.03969","paper":"/paper/tracking-the-world-state-with-recurrent","title":"Tracking the World State with Recurrent Entity Networks","date":"2016-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimfleming/recurrent-entity-networks","path":"entity_networks/prep_data.py","file_url":"https://github.com/jimfleming/recurrent-entity-networks/blob/HEAD/entity_networks/prep_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7c074f00ba51e7e9","mcp_get_code":{"code_sha256":"7c074f00ba51e7e9"}},{"arxiv_id":"1610.04211","paper":"/paper/gated-end-to-end-memory-networks","title":"Gated End-to-End Memory Networks","date":"2016-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cstghitpku/GateMemN2N","path":"data_utils.py","file_url":"https://github.com/cstghitpku/GateMemN2N/blob/HEAD/data_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7b8d93ebc22035a3","mcp_get_code":{"code_sha256":"7b8d93ebc22035a3"}},{"arxiv_id":"1503.08895","paper":"/paper/end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9d142ef2a5e220be","mcp_get_code":{"code_sha256":"9d142ef2a5e220be"}},{"arxiv_id":"1503.08895","paper":"/paper/end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nbansal90/bAbi_QA","path":"memnn.py","file_url":"https://github.com/nbansal90/bAbi_QA/blob/HEAD/memnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0753ec8f5509e983","mcp_get_code":{"code_sha256":"0753ec8f5509e983"}},{"arxiv_id":"1503.08895","paper":"/paper/end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dare0021/MemN2N_Bench","path":"data_process.py","file_url":"https://github.com/dare0021/MemN2N_Bench/blob/HEAD/data_process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e94421d72e63a32e","mcp_get_code":{"code_sha256":"e94421d72e63a32e"}},{"arxiv_id":"1503.08895","paper":"/paper/end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dare0021/MemN2N_Bench","path":"kerasTeam.py","file_url":"https://github.com/dare0021/MemN2N_Bench/blob/HEAD/kerasTeam.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"86ebfb268b5ff1d1","mcp_get_code":{"code_sha256":"86ebfb268b5ff1d1"}},{"arxiv_id":"1503.08895","paper":"/paper/end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dare0021/MemN2N_Bench","path":"src/babi_baseline.py","file_url":"https://github.com/dare0021/MemN2N_Bench/blob/HEAD/src/babi_baseline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"31d3313b31e0ce05","mcp_get_code":{"code_sha256":"31d3313b31e0ce05"}},{"arxiv_id":"1503.08895","paper":"/paper/end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dare0021/MemN2N_Bench","path":"src/single_layer_v5.py","file_url":"https://github.com/dare0021/MemN2N_Bench/blob/HEAD/src/single_layer_v5.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d59d30f527e3ff33","mcp_get_code":{"code_sha256":"d59d30f527e3ff33"}},{"arxiv_id":"1502.05698","paper":"/paper/towards-ai-complete-question-answering-a-set","title":"Towards AI-Complete Question Answering: A Set of Prerequisite Toy Tasks","date":"2015-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prashil2792/Question-Answering-System-Deep-Learning","path":"memorynetwork.py","file_url":"https://github.com/prashil2792/Question-Answering-System-Deep-Learning/blob/HEAD/memorynetwork.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9d142ef2a5e220be","mcp_get_code":{"code_sha256":"9d142ef2a5e220be"}},{"arxiv_id":"1410.3916","paper":"/paper/memory-networks","title":"Memory Networks","date":"2014-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"0753ec8f5509e983","mcp_get_code":{"code_sha256":"0753ec8f5509e983"}},{"arxiv_id":"1410.3916","paper":"/paper/memory-networks","title":"Memory Networks","date":"2014-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nbansal90/bAbi_QA","path":"LSTM_RNN_GRU.py","file_url":"https://github.com/nbansal90/bAbi_QA/blob/HEAD/LSTM_RNN_GRU.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1cfbf9b7ae909610","mcp_get_code":{"code_sha256":"1cfbf9b7ae909610"}}]}