{"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/load-policy","entry":"load_policy","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":2,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":10,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"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":0,"ran":2,"unverified":8},"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":"2608.25419","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-25419","title":"BVR Sim: An Open and High-Throughput Environment for Heterogeneous Air-Combat Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"lizi-Margin/bvr_sim","path":"bvr_sim_rl/evaluate.py","file_url":"https://github.com/lizi-Margin/bvr_sim/blob/HEAD/bvr_sim_rl/evaluate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, lizi-Margin/bvr_sim, is not in the permissive set Syntology serves inline","code_sha256":"7dad9e7a7ddc77b3","code_sha256_prefix":"7dad9e7a7ddc77b3","mcp_get_code":{"code_sha256":"7dad9e7a7ddc77b3"}},{"arxiv_id":"2605.21311","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21311","title":"DeCoR: Design and Control Co-Optimization for Urban Streets Using Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"poudel-bibek/DeCoR","path":"utils.py","file_url":"https://github.com/poudel-bibek/DeCoR/blob/HEAD/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":"a8fe218a1db0a77a","code_sha256_prefix":"a8fe218a1db0a77a","mcp_get_code":{"code_sha256":"a8fe218a1db0a77a"}},{"arxiv_id":"2605.09638","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09638","title":"Plan2Cleanse: Test-Time Backdoor Defense via Monte-Carlo Planning in Deep Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"rl-bandits-lab/RL-Backdoor","path":"backdoor_attack/multiagent_competition/zoo_agent_pytorch.py","file_url":"https://github.com/rl-bandits-lab/RL-Backdoor/blob/HEAD/backdoor_attack/multiagent_competition/zoo_agent_pytorch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, rl-bandits-lab/RL-Backdoor, is not in the permissive set Syntology serves inline","code_sha256":"0b5387c253c3fea7","code_sha256_prefix":"0b5387c253c3fea7","mcp_get_code":{"code_sha256":"0b5387c253c3fea7"}},{"arxiv_id":"2409.05344","arxiv_id_is_arxiv":true,"paper":"/paper/gopt-generalizable-online-3d-bin-packing-via","title":"GOPT: Generalizable Online 3D Bin Packing via Transformer-based Deep Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2024-09","title_source":"archive","repo":"xiong5heng/gopt","path":"tools.py","file_url":"https://github.com/xiong5heng/gopt/blob/HEAD/tools.py","status":"unverified","verification_level":0,"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, xiong5heng/gopt when it was checked","code_sha256":"dc0bd7d5c02cdbf3","code_sha256_prefix":"dc0bd7d5c02cdbf3","mcp_get_code":{"code_sha256":"dc0bd7d5c02cdbf3"}},{"arxiv_id":"2210.04839","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-reinforcement-learning-1","title":"Benchmarking Reinforcement Learning Techniques for Autonomous Navigation","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Daffan/ros_jackal","path":"rl_algos/tester.py","file_url":"https://github.com/Daffan/ros_jackal/blob/HEAD/rl_algos/tester.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":"c51ea62545640750","code_sha256_prefix":"c51ea62545640750","mcp_get_code":{"code_sha256":"c51ea62545640750"}},{"arxiv_id":"2210.04839","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-reinforcement-learning-1","title":"Benchmarking Reinforcement Learning Techniques for Autonomous Navigation","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Daffan/ros_jackal","path":"actor.py","file_url":"https://github.com/Daffan/ros_jackal/blob/HEAD/actor.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":"8883a16afb4b4d46","code_sha256_prefix":"8883a16afb4b4d46","mcp_get_code":{"code_sha256":"8883a16afb4b4d46"}},{"arxiv_id":"2004.07219","arxiv_id_is_arxiv":true,"paper":"/paper/datasets-for-data-driven-reinforcement","title":"D4RL: Datasets for Deep Data-Driven Reinforcement Learning","date":"2020-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"farama-foundation/d4rl","path":"scripts/generation/generate_ant_maze_datasets.py","file_url":"https://github.com/farama-foundation/d4rl/blob/HEAD/scripts/generation/generate_ant_maze_datasets.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":"3cf6d03023b905d7","code_sha256_prefix":"3cf6d03023b905d7","mcp_get_code":{"code_sha256":"3cf6d03023b905d7"}},{"arxiv_id":"1910.04700","arxiv_id_is_arxiv":true,"paper":"/paper/assistive-gym-a-physics-simulation-framework","title":"Assistive Gym: A Physics Simulation Framework for Assistive Robotics","date":"2019-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"titardrew/assistive-gym","path":"assistive_gym/learn.py","file_url":"https://github.com/titardrew/assistive-gym/blob/HEAD/assistive_gym/learn.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":"46a922fa94ebb95a","code_sha256_prefix":"46a922fa94ebb95a","mcp_get_code":{"code_sha256":"46a922fa94ebb95a"}},{"arxiv_id":"1812.06298","arxiv_id_is_arxiv":true,"paper":"/paper/residual-policy-learning","title":"Residual Policy Learning","date":"2018-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"k-r-allen/residual-policy-learning","path":"tensorflow/experiment/train_residual_base.py","file_url":"https://github.com/k-r-allen/residual-policy-learning/blob/HEAD/tensorflow/experiment/train_residual_base.py","status":"unverified","verification_level":0,"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, k-r-allen/residual-policy-learning when it was checked","code_sha256":"d7f89832be19bfa8","code_sha256_prefix":"d7f89832be19bfa8","mcp_get_code":{"code_sha256":"d7f89832be19bfa8"}},{"arxiv_id":"1810.02274","arxiv_id_is_arxiv":true,"paper":"/paper/episodic-curiosity-through-reachability","title":"Episodic Curiosity through Reachability","date":"2018-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/episodic-curiosity","path":"episodic_curiosity/curiosity_evaluation.py","file_url":"https://github.com/google-research/episodic-curiosity/blob/HEAD/episodic_curiosity/curiosity_evaluation.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":"c2bbba3d603b4193","code_sha256_prefix":"c2bbba3d603b4193","mcp_get_code":{"code_sha256":"c2bbba3d603b4193"}}],"record_sha256":"d3a12741af319065ae809457bca56417c98a976dfe06ae359c1d16525e9d52e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}