{"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":"/task/language-modelling/papers/ran/25","list_of":"/task/language-modelling","task":"Language Modelling","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":25,"pages_in_order":25,"rows_per_page":100,"rows":[2401,2428],"of":2428,"counts":{"archive_papers_tagged":17610,"with_a_code_link":7012,"where_syntology_ran_a_sample":2428,"not_listed_spam_title":0,"listed":17610,"listed_where_code_ran":2428,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2027,"every_run_a_failure_of_syntologys_instrument":401,"listed_with_a_run_with_no_instrument_failure":2027,"listed_every_run_a_failure_of_syntologys_instrument":401,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/language-modelling/papers/ran/1","prev":"/task/language-modelling/papers/ran/24","next":null,"papers":[{"url":"/paper/quasi-recurrent-neural-networks","slug":"quasi-recurrent-neural-networks","title":"Quasi-Recurrent Neural Networks","date":"2016-11-05","arxiv_id":"1611.01576","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quasi-recurrent-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1611.01576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01576"}},"official":null}},{"url":"/paper/neural-architecture-search-with-reinforcement","slug":"neural-architecture-search-with-reinforcement","title":"Neural Architecture Search with Reinforcement Learning","date":"2016-11-05","arxiv_id":"1611.01578","repositories_listed":12,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-architecture-search-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1611.01578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01578"}},"official":{"repos":["tensorflow/models"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/topicrnn-a-recurrent-neural-network-with-long","slug":"topicrnn-a-recurrent-neural-network-with-long","title":"TopicRNN: A Recurrent Neural Network with Long-Range Semantic Dependency","date":"2016-11-05","arxiv_id":"1611.01702","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/topicrnn-a-recurrent-neural-network-with-long#ran","syntology_url":"https://syntology.ai/paper/1611.01702","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01702"}},"official":null}},{"url":"/paper/compressing-neural-language-models-by-sparse","slug":"compressing-neural-language-models-by-sparse","title":"Compressing Neural Language Models by Sparse Word Representations","date":"2016-10-13","arxiv_id":"1610.03950","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/compressing-neural-language-models-by-sparse#ran","syntology_url":"https://syntology.ai/paper/1610.03950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.03950"}},"official":{"repos":["chenych11/lm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hypernetworks","slug":"hypernetworks","title":"HyperNetworks","date":"2016-09-27","arxiv_id":"1609.09106","repositories_listed":10,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hypernetworks#ran","syntology_url":"https://syntology.ai/paper/1609.09106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.09106"}},"official":null}},{"url":"/paper/pointer-sentinel-mixture-models","slug":"pointer-sentinel-mixture-models","title":"Pointer Sentinel Mixture Models","date":"2016-09-26","arxiv_id":"1609.07843","repositories_listed":10,"syntology":{"n":9,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/pointer-sentinel-mixture-models#ran","syntology_url":"https://syntology.ai/paper/1609.07843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.07843"}},"official":null}},{"url":"/paper/recurrent-highway-networks","slug":"recurrent-highway-networks","title":"Recurrent Highway Networks","date":"2016-07-12","arxiv_id":"1607.03474","repositories_listed":6,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/recurrent-highway-networks#ran","syntology_url":"https://syntology.ai/paper/1607.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.03474"}},"official":{"repos":["julian121266/RecurrentHighwayNetworks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-segmental-framework-for-fully-unsupervised","slug":"a-segmental-framework-for-fully-unsupervised","title":"A segmental framework for fully-unsupervised large-vocabulary speech recognition","date":"2016-06-22","arxiv_id":"1606.06950","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-segmental-framework-for-fully-unsupervised#ran","syntology_url":"https://syntology.ai/paper/1606.06950","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.06950"}},"official":{"repos":["kamperh/bucktsong_segmentalist"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/matching-networks-for-one-shot-learning","slug":"matching-networks-for-one-shot-learning","title":"Matching Networks for One Shot Learning","date":"2016-06-13","arxiv_id":"1606.04080","repositories_listed":26,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":5,"n_instrument":6,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":6,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/matching-networks-for-one-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1606.04080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.04080"}},"official":null}},{"url":"/paper/sequence-to-sequence-learning-as-beam-search","slug":"sequence-to-sequence-learning-as-beam-search","title":"Sequence-to-Sequence Learning as Beam-Search Optimization","date":"2016-06-09","arxiv_id":"1606.02960","repositories_listed":6,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequence-to-sequence-learning-as-beam-search#ran","syntology_url":"https://syntology.ai/paper/1606.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.02960"}},"official":{"repos":["harvardnlp/BSO"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recurrent-batch-normalization#ran","syntology_url":"https://syntology.ai/paper/1603.09025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09025"}},"official":null}},{"url":"/paper/adaptive-computation-time-for-recurrent","slug":"adaptive-computation-time-for-recurrent","title":"Adaptive Computation Time for Recurrent Neural Networks","date":"2016-03-29","arxiv_id":"1603.08983","repositories_listed":5,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-computation-time-for-recurrent#ran","syntology_url":"https://syntology.ai/paper/1603.08983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.08983"}},"official":null}},{"url":"/paper/recurrent-neural-network-grammars","slug":"recurrent-neural-network-grammars","title":"Recurrent Neural Network Grammars","date":"2016-02-25","arxiv_id":"1602.07776","repositories_listed":6,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/recurrent-neural-network-grammars#ran","syntology_url":"https://syntology.ai/paper/1602.07776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07776"}},"official":{"repos":["clab/rnng"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/exploring-the-limits-of-language-modeling","slug":"exploring-the-limits-of-language-modeling","title":"Exploring the Limits of Language Modeling","date":"2016-02-07","arxiv_id":"1602.02410","repositories_listed":10,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exploring-the-limits-of-language-modeling#ran","syntology_url":"https://syntology.ai/paper/1602.02410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.02410"}},"official":null}},{"url":"/paper/long-short-term-memory-networks-for-machine","slug":"long-short-term-memory-networks-for-machine","title":"Long Short-Term Memory-Networks for Machine Reading","date":"2016-01-25","arxiv_id":"1601.06733","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/long-short-term-memory-networks-for-machine#ran","syntology_url":"https://syntology.ai/paper/1601.06733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1601.06733"}},"official":null}},{"url":"/paper/a-theoretically-grounded-application-of","slug":"a-theoretically-grounded-application-of","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","date":"2015-12-16","arxiv_id":"1512.05287","repositories_listed":14,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-theoretically-grounded-application-of#ran","syntology_url":"https://syntology.ai/paper/1512.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.05287"}},"official":null}},{"url":"/paper/improving-neural-machine-translation-models","slug":"improving-neural-machine-translation-models","title":"Improving Neural Machine Translation Models with Monolingual Data","date":"2015-11-20","arxiv_id":"1511.06709","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-neural-machine-translation-models#ran","syntology_url":"https://syntology.ai/paper/1511.06709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06709"}},"official":null}},{"url":"/paper/generating-sentences-from-a-continuous-space","slug":"generating-sentences-from-a-continuous-space","title":"Generating Sentences from a Continuous Space","date":"2015-11-19","arxiv_id":"1511.06349","repositories_listed":17,"syntology":{"n":31,"n_ran":14,"n_constructed":6,"n_ran_checked":12,"n_instrument":2,"n_unverified":17,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":19,"phrase":"14 ran (of which 6 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/generating-sentences-from-a-continuous-space#ran","syntology_url":"https://syntology.ai/paper/1511.06349","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.06349"}},"official":null}},{"url":"/paper/a-neural-algorithm-of-artistic-style","slug":"a-neural-algorithm-of-artistic-style","title":"A Neural Algorithm of Artistic Style","date":"2015-08-26","arxiv_id":"1508.06576","repositories_listed":284,"syntology":{"n":110,"n_ran":76,"n_constructed":0,"n_ran_checked":44,"n_instrument":32,"n_unverified":34,"n_honours":7,"n_violates":3,"n_no_contract":34,"n_pointer_only":41,"phrase":"76 ran (of which 0 constructed an object rather than computing a result; 44 with no instrument failure: 7 honoured, 3 violated, 34 with no contract checked; 32 where Syntology's instrument failed) · 34 unverified","sample_list":"/paper/a-neural-algorithm-of-artistic-style#ran","syntology_url":"https://syntology.ai/paper/1508.06576","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.06576"}},"official":null}},{"url":"/paper/character-aware-neural-language-models","slug":"character-aware-neural-language-models","title":"Character-Aware Neural Language Models","date":"2015-08-26","arxiv_id":"1508.06615","repositories_listed":14,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/character-aware-neural-language-models#ran","syntology_url":"https://syntology.ai/paper/1508.06615","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.06615"}},"official":{"repos":["yoonkim/lstm-char-cnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/listen-attend-and-spell","slug":"listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","arxiv_id":"1508.01211","repositories_listed":40,"syntology":{"n":51,"n_ran":30,"n_constructed":0,"n_ran_checked":20,"n_instrument":10,"n_unverified":21,"n_honours":1,"n_violates":1,"n_no_contract":18,"n_pointer_only":9,"phrase":"30 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 1 violated, 18 with no contract checked; 10 where Syntology's instrument failed) · 21 unverified","sample_list":"/paper/listen-attend-and-spell#ran","syntology_url":"https://syntology.ai/paper/1508.01211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.01211"}},"official":null}},{"url":"/paper/end-to-end-memory-networks","slug":"end-to-end-memory-networks","title":"End-To-End Memory Networks","date":"2015-03-31","arxiv_id":"1503.08895","repositories_listed":44,"syntology":{"n":15,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/end-to-end-memory-networks#ran","syntology_url":"https://syntology.ai/paper/1503.08895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1503.08895"}},"official":{"repos":["facebook/MemNN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/from-captions-to-visual-concepts-and-back","slug":"from-captions-to-visual-concepts-and-back","title":"From Captions to Visual Concepts and Back","date":"2014-11-18","arxiv_id":"1411.4952","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/from-captions-to-visual-concepts-and-back#ran","syntology_url":"https://syntology.ai/paper/1411.4952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1411.4952"}},"official":{"repos":["s-gupta/visual-concepts"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/recurrent-neural-network-regularization","slug":"recurrent-neural-network-regularization","title":"Recurrent Neural Network Regularization","date":"2014-09-08","arxiv_id":"1409.2329","repositories_listed":21,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/recurrent-neural-network-regularization#ran","syntology_url":"https://syntology.ai/paper/1409.2329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.2329"}},"official":{"repos":["wojzaremba/lstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/temporal-analysis-of-language-through-neural","slug":"temporal-analysis-of-language-through-neural","title":"Temporal Analysis of Language through Neural Language Models","date":"2014-05-14","arxiv_id":"1405.3515","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/temporal-analysis-of-language-through-neural#ran","syntology_url":"https://syntology.ai/paper/1405.3515","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1405.3515"}},"official":null}},{"url":"/paper/deepwalk-online-learning-of-social","slug":"deepwalk-online-learning-of-social","title":"DeepWalk: Online Learning of Social Representations","date":"2014-03-26","arxiv_id":"1403.6652","repositories_listed":14,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deepwalk-online-learning-of-social#ran","syntology_url":"https://syntology.ai/paper/1403.6652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1403.6652"}},"official":null}},{"url":"/paper/word2vec-explained-deriving-mikolov-et-als","slug":"word2vec-explained-deriving-mikolov-et-als","title":"word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding method","date":"2014-02-15","arxiv_id":"1402.3722","repositories_listed":5,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/word2vec-explained-deriving-mikolov-et-als#ran","syntology_url":"https://syntology.ai/paper/1402.3722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1402.3722"}},"official":null}},{"url":"/paper/generating-sequences-with-recurrent-neural","slug":"generating-sequences-with-recurrent-neural","title":"Generating Sequences With Recurrent Neural Networks","date":"2013-08-04","arxiv_id":"1308.0850","repositories_listed":59,"syntology":{"n":37,"n_ran":31,"n_constructed":0,"n_ran_checked":28,"n_instrument":3,"n_unverified":6,"n_honours":4,"n_violates":0,"n_no_contract":24,"n_pointer_only":4,"phrase":"31 ran (of which 0 constructed an object rather than computing a result; 28 with no instrument failure: 4 honoured, 0 violated, 24 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/generating-sequences-with-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/1308.0850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1308.0850"}},"official":null}}],"record_sha256":"8153ffdb52debebd9ec04ea7b4fb8097fe81b8fdfde10325b0a9f1a1575969d2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}