{"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/wrap-env","entry":"wrap_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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":7,"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":0,"ran_fixture":4,"ran":3,"unverified":0},"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":"2411.04138","arxiv_id_is_arxiv":true,"paper":"/paper/networkgym-reinforcement-learning","title":"NetworkGym: Reinforcement Learning Environments for Multi-Access Traffic Management in Network Simulation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmomin/CORL-compare","path":"algorithms/finetune/awac.py","file_url":"https://github.com/hmomin/CORL-compare/blob/HEAD/algorithms/finetune/awac.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":"80f4da28d1c7ef4f","code_sha256_prefix":"80f4da28d1c7ef4f","mcp_get_code":{"code_sha256":"80f4da28d1c7ef4f"}},{"arxiv_id":"2411.04138","arxiv_id_is_arxiv":true,"paper":"/paper/networkgym-reinforcement-learning","title":"NetworkGym: Reinforcement Learning Environments for Multi-Access Traffic Management in Network Simulation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmomin/CORL-compare","path":"algorithms/finetune/cal_ql.py","file_url":"https://github.com/hmomin/CORL-compare/blob/HEAD/algorithms/finetune/cal_ql.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4dd56ecf0f797666","code_sha256_prefix":"4dd56ecf0f797666","mcp_get_code":{"code_sha256":"4dd56ecf0f797666"}},{"arxiv_id":"2411.04138","arxiv_id_is_arxiv":true,"paper":"/paper/networkgym-reinforcement-learning","title":"NetworkGym: Reinforcement Learning Environments for Multi-Access Traffic Management in Network Simulation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmomin/CORL-compare","path":"algorithms/finetune/iql.py","file_url":"https://github.com/hmomin/CORL-compare/blob/HEAD/algorithms/finetune/iql.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a8341f5e34d50ae6","code_sha256_prefix":"a8341f5e34d50ae6","mcp_get_code":{"code_sha256":"a8341f5e34d50ae6"}},{"arxiv_id":"2410.22728","arxiv_id_is_arxiv":true,"paper":"/paper/offline-behavior-distillation","title":"Offline Behavior Distillation","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeavesLei/OBD","path":"utils.py","file_url":"https://github.com/LeavesLei/OBD/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, LeavesLei/OBD when it was checked","code_sha256":"6f4380c7d15b6e42","code_sha256_prefix":"6f4380c7d15b6e42","mcp_get_code":{"code_sha256":"6f4380c7d15b6e42"}},{"arxiv_id":"2408.04190","arxiv_id_is_arxiv":true,"paper":"/paper/listwise-reward-estimation-for-offline","title":"Listwise Reward Estimation for Offline Preference-based Reinforcement Learning","date":"2024-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chwoong/LiRE","path":"algorithms/iql.py","file_url":"https://github.com/chwoong/LiRE/blob/HEAD/algorithms/iql.py","status":"ran","verification_level":1,"contract_check":null,"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, chwoong/LiRE when it was checked","code_sha256":"16878a0a5d56824b","code_sha256_prefix":"16878a0a5d56824b","mcp_get_code":{"code_sha256":"16878a0a5d56824b"}},{"arxiv_id":"2407.12448","arxiv_id_is_arxiv":true,"paper":"/paper/energy-guided-diffusion-sampling-for-offline","title":"Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuxhym/edis","path":"algorithms/cal_ql_edis.py","file_url":"https://github.com/liuxhym/edis/blob/HEAD/algorithms/cal_ql_edis.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, liuxhym/edis when it was checked","code_sha256":"4dd56ecf0f797666","code_sha256_prefix":"4dd56ecf0f797666","mcp_get_code":{"code_sha256":"4dd56ecf0f797666"}},{"arxiv_id":"2407.12448","arxiv_id_is_arxiv":true,"paper":"/paper/energy-guided-diffusion-sampling-for-offline","title":"Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuxhym/edis","path":"algorithms/iql_edis.py","file_url":"https://github.com/liuxhym/edis/blob/HEAD/algorithms/iql_edis.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, liuxhym/edis when it was checked","code_sha256":"a8341f5e34d50ae6","code_sha256_prefix":"a8341f5e34d50ae6","mcp_get_code":{"code_sha256":"a8341f5e34d50ae6"}},{"arxiv_id":"2405.16907","arxiv_id_is_arxiv":true,"paper":"/paper/gta-generative-trajectory-augmentation-with","title":"GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"conglu1997/SynthER","path":"synther/corl/algorithms/cql.py","file_url":"https://github.com/conglu1997/SynthER/blob/HEAD/synther/corl/algorithms/cql.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4dd56ecf0f797666","code_sha256_prefix":"4dd56ecf0f797666","mcp_get_code":{"code_sha256":"4dd56ecf0f797666"}},{"arxiv_id":"2405.16907","arxiv_id_is_arxiv":true,"paper":"/paper/gta-generative-trajectory-augmentation-with","title":"GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jaewoopudding/GTA","path":"corl/algorithms/dt.py","file_url":"https://github.com/Jaewoopudding/GTA/blob/HEAD/corl/algorithms/dt.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"637dc1e936615e64","code_sha256_prefix":"637dc1e936615e64","mcp_get_code":{"code_sha256":"637dc1e936615e64"}},{"arxiv_id":"2405.16907","arxiv_id_is_arxiv":true,"paper":"/paper/gta-generative-trajectory-augmentation-with","title":"GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jaewoopudding/GTA","path":"corl/shared/utils.py","file_url":"https://github.com/Jaewoopudding/GTA/blob/HEAD/corl/shared/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92425c08adf4c962","code_sha256_prefix":"92425c08adf4c962","mcp_get_code":{"code_sha256":"92425c08adf4c962"}},{"arxiv_id":"2405.06192","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-representation-for-data-filtering","title":"Contrastive Representation for Data Filtering in Cross-Domain Offline Reinforcement Learning","date":"2024-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"battlewen/igdf","path":"algorithms/igdf/igdf.py","file_url":"https://github.com/battlewen/igdf/blob/HEAD/algorithms/igdf/igdf.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, battlewen/igdf when it was checked","code_sha256":"a8341f5e34d50ae6","code_sha256_prefix":"a8341f5e34d50ae6","mcp_get_code":{"code_sha256":"a8341f5e34d50ae6"}},{"arxiv_id":"2310.14550","arxiv_id_is_arxiv":true,"paper":"/paper/corruption-robust-offline-reinforcement-2","title":"Corruption-Robust Offline Reinforcement Learning with General Function Approximation","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangrui2015/uwmsg","path":"UWMSG.py","file_url":"https://github.com/yangrui2015/uwmsg/blob/HEAD/UWMSG.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, yangrui2015/uwmsg when it was checked","code_sha256":"4dd56ecf0f797666","code_sha256_prefix":"4dd56ecf0f797666","mcp_get_code":{"code_sha256":"4dd56ecf0f797666"}},{"arxiv_id":"2309.16973","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-offline-to-online","title":"Towards Robust Offline-to-Online Reinforcement Learning via Uncertainty and Smoothness","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"battlewen/ro2o","path":"algorithms/finetune/ro2o_ft_ant_LCB.py","file_url":"https://github.com/battlewen/ro2o/blob/HEAD/algorithms/finetune/ro2o_ft_ant_LCB.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, battlewen/ro2o when it was checked","code_sha256":"4dd56ecf0f797666","code_sha256_prefix":"4dd56ecf0f797666","mcp_get_code":{"code_sha256":"4dd56ecf0f797666"}},{"arxiv_id":"2305.09836","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-minimalist-approach-to-offline","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adamjelley/efficientofflinerl","path":"algorithms/awac.py","file_url":"https://github.com/adamjelley/efficientofflinerl/blob/HEAD/algorithms/awac.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":"80f4da28d1c7ef4f","code_sha256_prefix":"80f4da28d1c7ef4f","mcp_get_code":{"code_sha256":"80f4da28d1c7ef4f"}},{"arxiv_id":"2305.09836","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-minimalist-approach-to-offline","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adamjelley/efficientofflinerl","path":"algorithms/any_percent_bc.py","file_url":"https://github.com/adamjelley/efficientofflinerl/blob/HEAD/algorithms/any_percent_bc.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4dd56ecf0f797666","code_sha256_prefix":"4dd56ecf0f797666","mcp_get_code":{"code_sha256":"4dd56ecf0f797666"}},{"arxiv_id":"2305.09836","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-minimalist-approach-to-offline","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adamjelley/efficientofflinerl","path":"algorithms/iql.py","file_url":"https://github.com/adamjelley/efficientofflinerl/blob/HEAD/algorithms/iql.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a8341f5e34d50ae6","code_sha256_prefix":"a8341f5e34d50ae6","mcp_get_code":{"code_sha256":"a8341f5e34d50ae6"}},{"arxiv_id":"2305.09836","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-minimalist-approach-to-offline","title":"Revisiting the Minimalist Approach to Offline Reinforcement Learning","date":"2023-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adamjelley/efficientofflinerl","path":"algorithms/dt.py","file_url":"https://github.com/adamjelley/efficientofflinerl/blob/HEAD/algorithms/dt.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"637dc1e936615e64","code_sha256_prefix":"637dc1e936615e64","mcp_get_code":{"code_sha256":"637dc1e936615e64"}}],"record_sha256":"67b9be2ba13abb9b3732508b84cf37fb01e3a5210d949441fc3ab40655c5df5d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}