{"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":"/code/lstm-2","entry":"lstm","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":2,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":3,"n_places_pointer_only_link_open":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_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":2},"key_notes":{"n_samples_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_samples_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":{"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":"2407.07723","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-is-compression","title":"Lossless data compression by large models","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcGill-NLP/medal","path":"hubconf.py","file_url":"https://github.com/mcGill-NLP/medal/blob/HEAD/hubconf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mcGill-NLP/medal when it was checked","code_sha256":"ef7adb5972287dde","code_sha256_prefix":"ef7adb5972287dde","mcp_get_code":{"code_sha256":"ef7adb5972287dde"}},{"arxiv_id":"2004.01339","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-reinforcement-learning-for-2","title":"Multi-agent Reinforcement Learning for Networked System Control","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cts198859/deeprl_network","path":"agents/models.py","file_url":"https://github.com/cts198859/deeprl_network/blob/HEAD/agents/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cts198859/deeprl_network when it was checked","code_sha256":"7adc90aced43e4d6","code_sha256_prefix":"7adc90aced43e4d6","mcp_get_code":{"code_sha256":"7adc90aced43e4d6"}},{"arxiv_id":"1904.11088","arxiv_id_is_arxiv":true,"paper":"/paper/d-vae-a-variational-autoencoder-for-directed","title":"D-VAE: A Variational Autoencoder for Directed Acyclic Graphs","date":"2019-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhanzhang/D-VAE","path":"software/enas/src/common_ops.py","file_url":"https://github.com/muhanzhang/D-VAE/blob/HEAD/software/enas/src/common_ops.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"266925fcd482144b","code_sha256_prefix":"266925fcd482144b","mcp_get_code":{"code_sha256":"266925fcd482144b"}},{"arxiv_id":"1806.07857","arxiv_id_is_arxiv":true,"paper":"/paper/rudder-return-decomposition-for-delayed","title":"RUDDER: Return Decomposition for Delayed Rewards","date":"2018-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-jku/baselines-rudder","path":"baselines/ppo2_rudder/policies.py","file_url":"https://github.com/ml-jku/baselines-rudder/blob/HEAD/baselines/ppo2_rudder/policies.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ml-jku/baselines-rudder, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"0ea019126f4921fd","code_sha256_prefix":"0ea019126f4921fd","mcp_get_code":{"code_sha256":"0ea019126f4921fd"}},{"arxiv_id":"1802.03268","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neural-architecture-search-via-1","title":"Efficient Neural Architecture Search via Parameter Sharing","date":"2018-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahundt/renas","path":"enas/cifar10/general_controller.py","file_url":"https://github.com/ahundt/renas/blob/HEAD/enas/cifar10/general_controller.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"266925fcd482144b","code_sha256_prefix":"266925fcd482144b","mcp_get_code":{"code_sha256":"266925fcd482144b"}},{"arxiv_id":"Xu_Learning_To_Anticipate_Future_With_Dynamic_Context_Removal_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Xu_Learning_To_Anticipate_Future_With_Dynamic_Context_Removal_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AllenXuuu/DCR","path":"model/DCR.py","file_url":"https://github.com/AllenXuuu/DCR/blob/HEAD/model/DCR.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"592c46f9a3629524","code_sha256_prefix":"592c46f9a3629524","mcp_get_code":{"code_sha256":"592c46f9a3629524"}}],"record_sha256":"3ba15c34eebffdb68c1614313bd36d5311ec4f0fd372bccacd9bf9e265370d29","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}