{"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/load-environment","entry":"load_environment","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":5,"n_papers_ran":3,"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":3,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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.01624","paper":"/paper/guided-trajectory-generation-with-diffusion","title":"Guided Trajectory Generation with Diffusion Models for Offline Model-based Optimization","date":"2024-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dbsxodud-11/gtg","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/dbsxodud-11/gtg/blob/HEAD/diffuser/datasets/d4rl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69e493e37778664c","mcp_get_code":{"code_sha256":"69e493e37778664c"}},{"arxiv_id":"2405.14790","paper":"/paper/didi-diffusion-guided-diversity-for-offline","title":"DIDI: Diffusion-Guided Diversity for Offline Behavioral Generation","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huey0528/icml24didi","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/huey0528/icml24didi/blob/HEAD/diffuser/datasets/d4rl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"69e493e37778664c","mcp_get_code":{"code_sha256":"69e493e37778664c"}},{"arxiv_id":"2305.18459","paper":"/paper/diffusion-model-is-an-effective-planner-and-1","title":"Diffusion Model is an Effective Planner and Data Synthesizer for Multi-Task Reinforcement Learning","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tinnerhrhe/MTDiff","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/tinnerhrhe/MTDiff/blob/HEAD/diffuser/datasets/d4rl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"69e493e37778664c","mcp_get_code":{"code_sha256":"69e493e37778664c"}},{"arxiv_id":"2305.17330","paper":"/paper/madiff-offline-multi-agent-learning-with","title":"MADiff: Offline Multi-agent Learning with Diffusion Models","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zbzhu99/madiff","path":"diffuser/datasets/d4rl.py","file_url":"https://github.com/zbzhu99/madiff/blob/HEAD/diffuser/datasets/d4rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b79a4ece470de64","mcp_get_code":{"code_sha256":"3b79a4ece470de64"}},{"arxiv_id":"2106.02039","paper":"/paper/reinforcement-learning-as-one-big-sequence","title":"Offline Reinforcement Learning as One Big Sequence Modeling Problem","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JannerM/trajectory-transformer","path":"trajectory/datasets/d4rl.py","file_url":"https://github.com/JannerM/trajectory-transformer/blob/HEAD/trajectory/datasets/d4rl.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8368faab224d9322","mcp_get_code":{"code_sha256":"8368faab224d9322"}}]}