{"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/get-env-params","entry":"get_env_params","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":7,"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":4,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":4},"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":"2307.12063","paper":"/paper/balancing-exploration-and-exploitation-in","title":"Balancing Exploration and Exploitation in Hierarchical Reinforcement Learning via Latent Landmark Graphs","date":"2023-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"papercode2022/hill","path":"HILL/hill/train_hier_sac.py","file_url":"https://github.com/papercode2022/hill/blob/HEAD/HILL/hill/train_hier_sac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9e0ab811443ee074","mcp_get_code":{"code_sha256":"9e0ab811443ee074"}},{"arxiv_id":"2303.11166","paper":"/paper/imitating-graph-based-planning-with-goal","title":"Imitating Graph-Based Planning with Goal-Conditioned Policies","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"junsu-kim97/pig","path":"train_ddpg.py","file_url":"https://github.com/junsu-kim97/pig/blob/HEAD/train_ddpg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f84995c51788ed77","mcp_get_code":{"code_sha256":"f84995c51788ed77"}},{"arxiv_id":"2207.01115","paper":"/paper/usher-unbiased-sampling-for-hindsight","title":"USHER: Unbiased Sampling for Hindsight Experience Replay","date":"2022-07-03","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":"f84995c51788ed77","mcp_get_code":{"code_sha256":"f84995c51788ed77"}},{"arxiv_id":"2105.14750","paper":"/paper/efficient-hierarchical-exploration-with","title":"Active Hierarchical Exploration with Stable Subgoal Representation Learning","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siyuanlee/hess","path":"train_hier_sac.py","file_url":"https://github.com/siyuanlee/hess/blob/HEAD/train_hier_sac.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9e0ab811443ee074","mcp_get_code":{"code_sha256":"9e0ab811443ee074"}},{"arxiv_id":"2002.09253","paper":"/paper/language-as-a-cognitive-tool-to-imagine-goals","title":"Language as a Cognitive Tool to Imagine Goals in Curiosity-Driven Exploration","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flowersteam/playground_env","path":"playground/env_params.py","file_url":"https://github.com/flowersteam/playground_env/blob/HEAD/playground/env_params.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd852d6db686a8ca","mcp_get_code":{"code_sha256":"fd852d6db686a8ca"}},{"arxiv_id":"1912.13465","paper":"/paper/reward-conditioned-policies","title":"Reward-Conditioned Policies","date":"2019-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TrentBrick/RewardConditionedUDRL","path":"envs/gym_params.py","file_url":"https://github.com/TrentBrick/RewardConditionedUDRL/blob/HEAD/envs/gym_params.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bfb0395634961aea","mcp_get_code":{"code_sha256":"bfb0395634961aea"}},{"arxiv_id":"1908.05451","paper":"/paper/mapping-state-space-using-landmarks-for","title":"Mapping State Space using Landmarks for Universal Goal Reaching","date":"2019-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FangchenLiu/map_planner","path":"train_ddpg.py","file_url":"https://github.com/FangchenLiu/map_planner/blob/HEAD/train_ddpg.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f84995c51788ed77","mcp_get_code":{"code_sha256":"f84995c51788ed77"}}]}