{"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/run-episode","entry":"run_episode","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":11,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":1,"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":1,"ran_violates":1,"ran_draft_wrong":0,"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":"2606.23603","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-23603","title":"MORL-A2C: Multi-Objective Reinforcement Learning Reranker for Optimizing Healthiness in MOPI-HFRS","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"JoshZ411/MOPI-HFRS-SLC","path":"code/morl/training.py","file_url":"https://github.com/JoshZ411/MOPI-HFRS-SLC/blob/HEAD/code/morl/training.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":"5f992cad961a11bb","code_sha256_prefix":"5f992cad961a11bb","mcp_get_code":{"code_sha256":"5f992cad961a11bb"}},{"arxiv_id":"2605.18454","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18454","title":"Scheduling That Speaks: An Interpretable Programmatic Reinforcement Learning Framework","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"HcPlu/ProRL","path":"optimisation/pdr/evaluate.py","file_url":"https://github.com/HcPlu/ProRL/blob/HEAD/optimisation/pdr/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, HcPlu/ProRL (NOASSERTION)","code_sha256":"948517dad8d0fdab","code_sha256_prefix":"948517dad8d0fdab","mcp_get_code":{"code_sha256":"948517dad8d0fdab"}},{"arxiv_id":"2309.07388","arxiv_id_is_arxiv":true,"paper":"/paper/on-autonomous-agents-in-a-cyber-defence","title":"On Autonomous Agents in a Cyber Defence Environment","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":"archive","repo":"ilyaorson/cyberdreamcatcher","path":"cyberdreamcatcher/sampler.py","file_url":"https://github.com/ilyaorson/cyberdreamcatcher/blob/HEAD/cyberdreamcatcher/sampler.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":"0b1a16f5749dcc3a","code_sha256_prefix":"0b1a16f5749dcc3a","mcp_get_code":{"code_sha256":"0b1a16f5749dcc3a"}},{"arxiv_id":"2011.07831","arxiv_id_is_arxiv":true,"paper":"/paper/learning-associative-inference-using-fast-1","title":"Learning Associative Inference Using Fast Weight Memory","date":"2020-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ischlag/Fast-Weight-Memory-public","path":"metaRL/train_agent.py","file_url":"https://github.com/ischlag/Fast-Weight-Memory-public/blob/HEAD/metaRL/train_agent.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":"83dc00c2fe9d0ac2","code_sha256_prefix":"83dc00c2fe9d0ac2","mcp_get_code":{"code_sha256":"83dc00c2fe9d0ac2"}},{"arxiv_id":"2006.13760","arxiv_id_is_arxiv":true,"paper":"/paper/the-nethack-learning-environment","title":"The NetHack Learning Environment","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Pieter-Cawood/Reinforcement-Learning","path":"NLE_Method_Comparison/A2C_1/evaluation.py","file_url":"https://github.com/Pieter-Cawood/Reinforcement-Learning/blob/HEAD/NLE_Method_Comparison/A2C_1/evaluation.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":"38d19bc77768e47c","code_sha256_prefix":"38d19bc77768e47c","mcp_get_code":{"code_sha256":"38d19bc77768e47c"}},{"arxiv_id":"2006.07815","arxiv_id_is_arxiv":true,"paper":"/paper/optimistic-distributionally-robust-policy","title":"Optimistic Distributionally Robust Policy Optimization","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadysongbb/dr-trpo","path":"tabular/train_helper.py","file_url":"https://github.com/kadysongbb/dr-trpo/blob/HEAD/tabular/train_helper.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":"376d051ff6f4515b","code_sha256_prefix":"376d051ff6f4515b","mcp_get_code":{"code_sha256":"376d051ff6f4515b"}},{"arxiv_id":"1904.00370","arxiv_id_is_arxiv":true,"paper":"/paper/variational-adversarial-active-learning","title":"Variational Adversarial Active Learning","date":"2019-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johntiger1/vaal_querying","path":"rl/sample_cartpole.py","file_url":"https://github.com/johntiger1/vaal_querying/blob/HEAD/rl/sample_cartpole.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"baf11f4c9088b555","code_sha256_prefix":"baf11f4c9088b555","mcp_get_code":{"code_sha256":"baf11f4c9088b555"}},{"arxiv_id":"1902.01378","arxiv_id_is_arxiv":true,"paper":"/paper/obstacle-tower-a-generalization-challenge-in","title":"Obstacle Tower: A Generalization Challenge in Vision, Control, and Planning","date":"2019-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Unity-Technologies/obstacle-tower-env","path":"examples/evaluation.py","file_url":"https://github.com/Unity-Technologies/obstacle-tower-env/blob/HEAD/examples/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"448599b47d160e4f","code_sha256_prefix":"448599b47d160e4f","mcp_get_code":{"code_sha256":"448599b47d160e4f"}},{"arxiv_id":"1805.01956","arxiv_id_is_arxiv":true,"paper":"/paper/motion-planning-among-dynamic-decision-making","title":"Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-acl/gym-collision-avoidance","path":"gym_collision_avoidance/experiments/src/env_utils.py","file_url":"https://github.com/mit-acl/gym-collision-avoidance/blob/HEAD/gym_collision_avoidance/experiments/src/env_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":"5494e1762df206ef","code_sha256_prefix":"5494e1762df206ef","mcp_get_code":{"code_sha256":"5494e1762df206ef"}},{"arxiv_id":"1710.11198","arxiv_id_is_arxiv":true,"paper":"/paper/action-depedent-control-variates-for-policy","title":"Action-depedent Control Variates for Policy Optimization via Stein's Identity","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DartML/PPO-Stein-Control-Variate","path":"evaluation/main_algo.py","file_url":"https://github.com/DartML/PPO-Stein-Control-Variate/blob/HEAD/evaluation/main_algo.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":"fe515a034e675f33","code_sha256_prefix":"fe515a034e675f33","mcp_get_code":{"code_sha256":"fe515a034e675f33"}},{"arxiv_id":"1710.11198","arxiv_id_is_arxiv":true,"paper":"/paper/action-depedent-control-variates-for-policy","title":"Action-depedent Control Variates for Policy Optimization via Stein's Identity","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DartML/PPO-Stein-Control-Variate","path":"optimization/main_algo.py","file_url":"https://github.com/DartML/PPO-Stein-Control-Variate/blob/HEAD/optimization/main_algo.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":"d65e0044847c6ca7","code_sha256_prefix":"d65e0044847c6ca7","mcp_get_code":{"code_sha256":"d65e0044847c6ca7"}}],"record_sha256":"f4efecb3504559d1a39391a5d2fa75b995218918c80e9c2e30270ad1d6c0f70d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}