{"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","entry":"get_env","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":13,"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":12,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":9},"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":"2607.09298","paper":"/paper/arxiv-2607-09298","title":"Risk-Aware General-Utility Markov Decision Processes","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"gh0stwin/risk-aware-gumdp","path":"src/risk_aware_gumdp/simulations/envs.py","file_url":"https://github.com/gh0stwin/risk-aware-gumdp/blob/HEAD/src/risk_aware_gumdp/simulations/envs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c6b09fab045b9e75","mcp_get_code":{"code_sha256":"c6b09fab045b9e75"}},{"arxiv_id":"2602.16012","paper":"/paper/arxiv-2602-16012","title":"Towards Efficient Constraint Handling in Neural Solvers for Routing Problems","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jieyibi/CaR-constraint","path":"utils.py","file_url":"https://github.com/jieyibi/CaR-constraint/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f85cae57b28101a3","mcp_get_code":{"code_sha256":"f85cae57b28101a3"}},{"arxiv_id":"2405.02797","paper":"/paper/adapting-to-distribution-shift-by-visual","title":"Adapting to Distribution Shift by Visual Domain Prompt Generation","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guliisgreat/vdpg","path":"src/lightning/utils.py","file_url":"https://github.com/guliisgreat/vdpg/blob/HEAD/src/lightning/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c528212c4e32fc9d","mcp_get_code":{"code_sha256":"c528212c4e32fc9d"}},{"arxiv_id":"2312.14472","paper":"/paper/not-all-tasks-are-equally-difficult-multi","title":"Not All Tasks Are Equally Difficult: Multi-Task Deep Reinforcement Learning with Dynamic Depth Routing","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DarkDawn233/D2R_MTRL","path":"torchrl/env/get_env.py","file_url":"https://github.com/DarkDawn233/D2R_MTRL/blob/HEAD/torchrl/env/get_env.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b54e9f49009c2aaa","mcp_get_code":{"code_sha256":"b54e9f49009c2aaa"}},{"arxiv_id":"2306.12370","paper":"/paper/priorband-practical-hyperparameter-1","title":"PriorBand: Practical Hyperparameter Optimization in the Age of Deep Learning","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/neps","path":"neps/env.py","file_url":"https://github.com/automl/neps/blob/HEAD/neps/env.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ea229fa5e083a401","mcp_get_code":{"code_sha256":"ea229fa5e083a401"}},{"arxiv_id":"2305.00508","paper":"/paper/learning-achievement-structure-for-structured","title":"Learning Achievement Structure for Structured Exploration in Domains with Sparse Reward","date":"2023-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pairlab/iclr-23-sea","path":"torchbeast/models/baseline.py","file_url":"https://github.com/pairlab/iclr-23-sea/blob/HEAD/torchbeast/models/baseline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"51bd77263839a71f","mcp_get_code":{"code_sha256":"51bd77263839a71f"}},{"arxiv_id":"2303.18223","paper":"/paper/a-survey-of-large-language-models","title":"A Survey of Large Language Models","date":"2023-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xusenlinzy/api-for-open-llm","path":"api/config.py","file_url":"https://github.com/xusenlinzy/api-for-open-llm/blob/HEAD/api/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0ad95ef49376f579","mcp_get_code":{"code_sha256":"0ad95ef49376f579"}},{"arxiv_id":"2210.07553","paper":"/paper/safe-model-based-reinforcement-learning-with-2","title":"Safe Model-Based Reinforcement Learning with an Uncertainty-Aware Reachability Certificate","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ManUtdMoon/Safe_MBRL","path":"src/shared.py","file_url":"https://github.com/ManUtdMoon/Safe_MBRL/blob/HEAD/src/shared.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"25778383e06d1014","mcp_get_code":{"code_sha256":"25778383e06d1014"}},{"arxiv_id":"2204.10348","paper":"/paper/simulate-time-integrated-coarse-grained","title":"Simulate Time-integrated Coarse-grained Molecular Dynamics with Multi-Scale Graph Networks","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyonofx/mlcgmd","path":"graphwm/common/env_init.py","file_url":"https://github.com/kyonofx/mlcgmd/blob/HEAD/graphwm/common/env_init.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"25a60b695464e797","mcp_get_code":{"code_sha256":"25a60b695464e797"}},{"arxiv_id":"2204.01205","paper":"/paper/towards-large-scale-learned-solvers-for","title":"Model-Parallel Fourier Neural Operators as Learned Surrogates for Large-Scale Parametric PDEs","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slimgroup/dfno","path":"dfno/utils.py","file_url":"https://github.com/slimgroup/dfno/blob/HEAD/dfno/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aba0e88e58008856","mcp_get_code":{"code_sha256":"aba0e88e58008856"}},{"arxiv_id":"2202.07789","paper":"/paper/safe-reinforcement-learning-by-imagining-the-1","title":"Safe Reinforcement Learning by Imagining the Near Future","date":"2022-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gwthomas/Safe-MBPO","path":"src/shared.py","file_url":"https://github.com/gwthomas/Safe-MBPO/blob/HEAD/src/shared.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"25778383e06d1014","mcp_get_code":{"code_sha256":"25778383e06d1014"}},{"arxiv_id":"2110.06197","paper":"/paper/crystal-diffusion-variational-autoencoder-for-1","title":"Crystal Diffusion Variational Autoencoder for Periodic Material Generation","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"knc6/cdvae","path":"cdvae/common/utils.py","file_url":"https://github.com/knc6/cdvae/blob/HEAD/cdvae/common/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"00e20379657c554c","mcp_get_code":{"code_sha256":"00e20379657c554c"}},{"arxiv_id":"Zeng_MPCViT_Searching_for_Accurate_and_Efficient_MPC-Friendly_Vision_Transformer_with_ICCV_2023_paper","paper":null,"title":"arXiv:Zeng_MPCViT_Searching_for_Accurate_and_Efficient_MPC-Friendly_Vision_Transformer_with_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"secretflow/secretflow","path":"secretflow/component/core/envs.py","file_url":"https://github.com/secretflow/secretflow/blob/HEAD/secretflow/component/core/envs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"df90d35503ca70dc","mcp_get_code":{"code_sha256":"df90d35503ca70dc"}}]}