{"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/count-vars","entry":"count_vars","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":9,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":9,"n_places_pointer_only_link_open":6,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2605.11975","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11975","title":"Stochastic Minimum-Cost Reach-Avoid Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"milanganai/milanganai.github.io","path":"NeurIPS2023/code/core_respo.py","file_url":"https://github.com/milanganai/milanganai.github.io/blob/HEAD/NeurIPS2023/code/core_respo.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, milanganai/milanganai.github.io when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"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/fast_failing/train/ppo_core.py","file_url":"https://github.com/rl-bandits-lab/RL-Backdoor/blob/HEAD/backdoor_attack/multiagent_competition/fast_failing/train/ppo_core.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"arxiv_id":"2310.05858","arxiv_id_is_arxiv":true,"paper":"/paper/dsac-t-distributional-soft-actor-critic-with","title":"Distributional Soft Actor-Critic with Three Refinements","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jingliang-duan/dsac-t","path":"networks/mlp.py","file_url":"https://github.com/jingliang-duan/dsac-t/blob/HEAD/networks/mlp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, jingliang-duan/dsac-t when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"arxiv_id":"2210.07573","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-safe-deep-reinforcement-learning","title":"Model-based Safe Deep Reinforcement Learning via a Constrained Proximal Policy Optimization Algorithm","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"akjayant/mbppol","path":"src/core.py","file_url":"https://github.com/akjayant/mbppol/blob/HEAD/src/core.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from milanganai/milanganai.github.io, and GitHub detected no licence in that repository when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"arxiv_id":"2110.01219","arxiv_id_is_arxiv":true,"paper":"/paper/hit-and-lead-discovery-with-explorative-rl","title":"Hit and Lead Discovery with Explorative RL and Fragment-based Molecule Generation","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AITRICS/FREED","path":"core_motif.py","file_url":"https://github.com/AITRICS/FREED/blob/HEAD/core_motif.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from milanganai/milanganai.github.io, and GitHub detected no licence in that repository when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"arxiv_id":"2109.12286","arxiv_id_is_arxiv":true,"paper":"/paper/stackelberg-actor-critic-game-theoretic","title":"Stackelberg Actor-Critic: Game-Theoretic Reinforcement Learning Algorithms","date":"2021-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leozhengzly/stackelberg-actor-critic-algos","path":"spinup/algos/pytorch/ddpg/core.py","file_url":"https://github.com/leozhengzly/stackelberg-actor-critic-algos/blob/HEAD/spinup/algos/pytorch/ddpg/core.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from milanganai/milanganai.github.io, and GitHub detected no licence in that repository when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"arxiv_id":"2106.09110","arxiv_id_is_arxiv":true,"paper":"/paper/safe-reinforcement-learning-using-advantage","title":"Safe Reinforcement Learning Using Advantage-Based Intervention","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nolanwagener/safe_rl","path":"safe_rl/algos/cppo/core.py","file_url":"https://github.com/nolanwagener/safe_rl/blob/HEAD/safe_rl/algos/cppo/core.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from milanganai/milanganai.github.io, and GitHub detected no licence in that repository when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"arxiv_id":"2010.09635","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-population","title":"Deep Reinforcement Learning with Population-Coded Spiking Neural Network for Continuous Control","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"combra-lab/pop-spiking-deep-rl","path":"popsan_drl/popsan_sac/core_cuda.py","file_url":"https://github.com/combra-lab/pop-spiking-deep-rl/blob/HEAD/popsan_drl/popsan_sac/core_cuda.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from milanganai/milanganai.github.io, and GitHub detected no licence in that repository when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"arxiv_id":"2006.07442","arxiv_id_is_arxiv":true,"paper":"/paper/self-imitation-learning-via-generalized-lower","title":"Self-Imitation Learning via Generalized Lower Bound Q-learning","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/spinningup","path":"spinup/algos/pytorch/ddpg/core.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/algos/pytorch/ddpg/core.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from milanganai/milanganai.github.io, and GitHub detected no licence in that repository when it was checked","code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","mcp_get_code":{"code_sha256":"4cca5e460067b900"}}],"record_sha256":"766bc1aa2f1a7512ce8178bb8222d33867c58c9362e3bcff30952484d45d8747","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}