{"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/reject-next-to","entry":"reject_next_to","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":6,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2310.01824","paper":"/paper/mini-behavior-a-procedurally-generated","title":"Mini-BEHAVIOR: A Procedurally Generated Benchmark for Long-horizon Decision-Making in Embodied AI","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanfordvl/mini_behavior","path":"mini_behavior/roomgrid.py","file_url":"https://github.com/stanfordvl/mini_behavior/blob/HEAD/mini_behavior/roomgrid.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"beb7d468d5185af5","mcp_get_code":{"code_sha256":"beb7d468d5185af5"}},{"arxiv_id":"2207.00429","paper":"/paper/modular-lifelong-reinforcement-learning-via-1","title":"Modular Lifelong Reinforcement Learning via Neural Composition","date":"2022-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lifelong-ML/Mendez2022ModularLifelongRL","path":"Discrete2D/gym-minigrid/gym_minigrid/roomgrid.py","file_url":"https://github.com/Lifelong-ML/Mendez2022ModularLifelongRL/blob/HEAD/Discrete2D/gym-minigrid/gym_minigrid/roomgrid.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"beb7d468d5185af5","mcp_get_code":{"code_sha256":"beb7d468d5185af5"}},{"arxiv_id":"2205.11184","paper":"/paper/an-evaluation-study-of-intrinsic-motivation","title":"An Evaluation Study of Intrinsic Motivation Techniques applied to Reinforcement Learning over Hard Exploration Environments","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aklein1995/intrinsic_motivation_techniques_study","path":"gym_minigrid/roomgrid.py","file_url":"https://github.com/aklein1995/intrinsic_motivation_techniques_study/blob/HEAD/gym_minigrid/roomgrid.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"beb7d468d5185af5","mcp_get_code":{"code_sha256":"beb7d468d5185af5"}},{"arxiv_id":"2109.12243","paper":"/paper/systematic-generalization-on-gscan-what-is","title":"Systematic Generalization on gSCAN: What is Nearly Solved and What is Next?","date":"2021-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LauraRuis/groundedSCAN","path":"GroundedScan/gym_minigrid/roomgrid.py","file_url":"https://github.com/LauraRuis/groundedSCAN/blob/HEAD/GroundedScan/gym_minigrid/roomgrid.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"beb7d468d5185af5","mcp_get_code":{"code_sha256":"beb7d468d5185af5"}},{"arxiv_id":"2107.03961","paper":"/paper/computational-benefits-of-intermediate","title":"Computational Benefits of Intermediate Rewards for Goal-Reaching Policy Learning","date":"2021-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kebaek/minigrid","path":"gym-minigrid/gym_minigrid/roomgrid.py","file_url":"https://github.com/kebaek/minigrid/blob/HEAD/gym-minigrid/gym_minigrid/roomgrid.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"beb7d468d5185af5","mcp_get_code":{"code_sha256":"beb7d468d5185af5"}},{"arxiv_id":"ijcai2023_0502","paper":null,"title":"arXiv:ijcai2023_0502","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mit-acl/gym-minigrid","path":"gym_minigrid/roomgrid.py","file_url":"https://github.com/mit-acl/gym-minigrid/blob/HEAD/gym_minigrid/roomgrid.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"beb7d468d5185af5","mcp_get_code":{"code_sha256":"beb7d468d5185af5"}}]}