{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/get-env","entry":"get_env","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":13,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":5,"unverified":4},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6b09fab045b9e75","code_sha256_prefix":"c6b09fab045b9e75","mcp_get_code":{"code_sha256":"c6b09fab045b9e75"}},{"arxiv_id":"2602.16012","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f85cae57b28101a3","code_sha256_prefix":"f85cae57b28101a3","mcp_get_code":{"code_sha256":"f85cae57b28101a3"}},{"arxiv_id":"2405.02797","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, guliisgreat/vdpg when it was checked","code_sha256":"c528212c4e32fc9d","code_sha256_prefix":"c528212c4e32fc9d","mcp_get_code":{"code_sha256":"c528212c4e32fc9d"}},{"arxiv_id":"2312.14472","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b54e9f49009c2aaa","code_sha256_prefix":"b54e9f49009c2aaa","mcp_get_code":{"code_sha256":"b54e9f49009c2aaa"}},{"arxiv_id":"2306.12370","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ea229fa5e083a401","code_sha256_prefix":"ea229fa5e083a401","mcp_get_code":{"code_sha256":"ea229fa5e083a401"}},{"arxiv_id":"2305.00508","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pairlab/iclr-23-sea when it was checked","code_sha256":"51bd77263839a71f","code_sha256_prefix":"51bd77263839a71f","mcp_get_code":{"code_sha256":"51bd77263839a71f"}},{"arxiv_id":"2303.18223","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0ad95ef49376f579","code_sha256_prefix":"0ad95ef49376f579","mcp_get_code":{"code_sha256":"0ad95ef49376f579"}},{"arxiv_id":"2210.07553","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25778383e06d1014","code_sha256_prefix":"25778383e06d1014","mcp_get_code":{"code_sha256":"25778383e06d1014"}},{"arxiv_id":"2204.10348","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25a60b695464e797","code_sha256_prefix":"25a60b695464e797","mcp_get_code":{"code_sha256":"25a60b695464e797"}},{"arxiv_id":"2204.01205","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aba0e88e58008856","code_sha256_prefix":"aba0e88e58008856","mcp_get_code":{"code_sha256":"aba0e88e58008856"}},{"arxiv_id":"2202.07789","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"25778383e06d1014","code_sha256_prefix":"25778383e06d1014","mcp_get_code":{"code_sha256":"25778383e06d1014"}},{"arxiv_id":"2110.06197","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00e20379657c554c","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","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"df90d35503ca70dc","code_sha256_prefix":"df90d35503ca70dc","mcp_get_code":{"code_sha256":"df90d35503ca70dc"}}],"record_sha256":"e82921e04511dd12b3cc0e07bf3e445c14236572a03ebe5561cdeea37d275ac6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}