{"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/lstm-2","entry":"lstm","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":6,"n_papers_ran":4,"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_fingerprinted":2,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"unverified":2},"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","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,"code_sha256_prefix":"ef7adb5972287dde","mcp_get_code":{"code_sha256":"ef7adb5972287dde"}},{"arxiv_id":"2004.01339","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,"code_sha256_prefix":"7adc90aced43e4d6","mcp_get_code":{"code_sha256":"7adc90aced43e4d6"}},{"arxiv_id":"1904.11088","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,"code_sha256_prefix":"266925fcd482144b","mcp_get_code":{"code_sha256":"266925fcd482144b"}},{"arxiv_id":"1806.07857","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,"code_sha256_prefix":"0ea019126f4921fd","mcp_get_code":{"code_sha256":"0ea019126f4921fd"}},{"arxiv_id":"1802.03268","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,"code_sha256_prefix":"266925fcd482144b","mcp_get_code":{"code_sha256":"266925fcd482144b"}},{"arxiv_id":"Xu_Learning_To_Anticipate_Future_With_Dynamic_Context_Removal_CVPR_2022_paper","paper":null,"title":"arXiv: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,"code_sha256_prefix":"592c46f9a3629524","mcp_get_code":{"code_sha256":"592c46f9a3629524"}}]}