{"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/replaymemory","entry":"ReplayMemory","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":11,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":21,"n_samples_ran":13,"n_samples_constructed":13,"n_samples_ran_checked":13,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":9,"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":13,"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":"2606.20832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20832","title":"ReLaTS: a Reinforcement Learning-based method for dynamically determining the coupling Time Step in multi-scale simulations of self-gravitating systems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"veronicasaz/RL_bridgedCluster","path":"TrainRL.py","file_url":"https://github.com/veronicasaz/RL_bridgedCluster/blob/HEAD/TrainRL.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, veronicasaz/RL_bridgedCluster when it was checked","code_sha256":"fa3dff8c2ace4d3a","code_sha256_prefix":"fa3dff8c2ace4d3a","mcp_get_code":{"code_sha256":"fa3dff8c2ace4d3a"}},{"arxiv_id":"2306.05764","arxiv_id_is_arxiv":true,"paper":"/paper/fair-yet-asymptotically-equal-collaborative","title":"Fair yet Asymptotically Equal Collaborative Learning","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xqlin98/fair-yet-equal-cml","path":"utils/RL_Environment.py","file_url":"https://github.com/xqlin98/fair-yet-equal-cml/blob/HEAD/utils/RL_Environment.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":"d2cebae41fcbd2cd","code_sha256_prefix":"d2cebae41fcbd2cd","mcp_get_code":{"code_sha256":"d2cebae41fcbd2cd"}},{"arxiv_id":"2203.03535","arxiv_id_is_arxiv":true,"paper":"/paper/influencing-long-term-behavior-in-multiagent","title":"Influencing Long-Term Behavior in Multiagent Reinforcement Learning","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dkkim93/further","path":"algorithm/further/agent.py","file_url":"https://github.com/dkkim93/further/blob/HEAD/algorithm/further/agent.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":"6cc0afec8e5e5562","code_sha256_prefix":"6cc0afec8e5e5562","mcp_get_code":{"code_sha256":"6cc0afec8e5e5562"}},{"arxiv_id":"2010.08830","arxiv_id_is_arxiv":true,"paper":"/paper/mesa-boost-ensemble-imbalanced-learning-with","title":"MESA: Boost Ensemble Imbalanced Learning with MEta-SAmpler","date":"2020-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NeurIPS2020AnonymousSubmission/mesa","path":"mesa.py","file_url":"https://github.com/NeurIPS2020AnonymousSubmission/mesa/blob/HEAD/mesa.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":"c4cf549ba24993c4","code_sha256_prefix":"c4cf549ba24993c4","mcp_get_code":{"code_sha256":"c4cf549ba24993c4"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajaysub110/rl-pytorch","path":"sac/models/soft_actor_critic.py","file_url":"https://github.com/ajaysub110/rl-pytorch/blob/HEAD/sac/models/soft_actor_critic.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, ajaysub110/rl-pytorch when it was checked","code_sha256":"995a5d6382ee476d","code_sha256_prefix":"995a5d6382ee476d","mcp_get_code":{"code_sha256":"995a5d6382ee476d"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"llSourcell/OpenAI_Five_vs_Dota2_Explained","path":"ppo.py","file_url":"https://github.com/llSourcell/OpenAI_Five_vs_Dota2_Explained/blob/HEAD/ppo.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":"7539f57b4803c98e","code_sha256_prefix":"7539f57b4803c98e","mcp_get_code":{"code_sha256":"7539f57b4803c98e"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isp1tze/MAProj","path":"algo/maddpg/maddpg_agent.py","file_url":"https://github.com/isp1tze/MAProj/blob/HEAD/algo/maddpg/maddpg_agent.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, isp1tze/MAProj when it was checked","code_sha256":"14185602fbb4fa11","code_sha256_prefix":"14185602fbb4fa11","mcp_get_code":{"code_sha256":"14185602fbb4fa11"}},{"arxiv_id":"1706.02275","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuehy/pytorch-maddpg","path":"MADDPG.py","file_url":"https://github.com/xuehy/pytorch-maddpg/blob/HEAD/MADDPG.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, xuehy/pytorch-maddpg when it was checked","code_sha256":"535c542a4e41bb65","code_sha256_prefix":"535c542a4e41bb65","mcp_get_code":{"code_sha256":"535c542a4e41bb65"}},{"arxiv_id":"1602.01783","arxiv_id_is_arxiv":true,"paper":"/paper/asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brett-daley/fast-dqn","path":"fast_dqn/worker.py","file_url":"https://github.com/brett-daley/fast-dqn/blob/HEAD/fast_dqn/worker.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":"6b7e1cbca8de3a03","code_sha256_prefix":"6b7e1cbca8de3a03","mcp_get_code":{"code_sha256":"6b7e1cbca8de3a03"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SimonRamstedt/ddpg","path":"replay_memory.py","file_url":"https://github.com/SimonRamstedt/ddpg/blob/HEAD/replay_memory.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b683309331178dc","code_sha256_prefix":"5b683309331178dc","mcp_get_code":{"code_sha256":"5b683309331178dc"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzheng51/rl-dino-run","path":"memory.py","file_url":"https://github.com/yzheng51/rl-dino-run/blob/HEAD/memory.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":"1707b7c98445e28d","code_sha256_prefix":"1707b7c98445e28d","mcp_get_code":{"code_sha256":"1707b7c98445e28d"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Clement-Hui/Q-Learning","path":"replaymemory.py","file_url":"https://github.com/Clement-Hui/Q-Learning/blob/HEAD/replaymemory.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, Clement-Hui/Q-Learning when it was checked","code_sha256":"176c97171a30da8b","code_sha256_prefix":"176c97171a30da8b","mcp_get_code":{"code_sha256":"176c97171a30da8b"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunfex/weighted-sac","path":"replay_memory.py","file_url":"https://github.com/sunfex/weighted-sac/blob/HEAD/replay_memory.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":"d72a76b37a40fe81","code_sha256_prefix":"d72a76b37a40fe81","mcp_get_code":{"code_sha256":"d72a76b37a40fe81"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eddynelson/dqn","path":"dqn/replay_memory/replay_memory.py","file_url":"https://github.com/eddynelson/dqn/blob/HEAD/dqn/replay_memory/replay_memory.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":"64f1fd20f4b6af5d","code_sha256_prefix":"64f1fd20f4b6af5d","mcp_get_code":{"code_sha256":"64f1fd20f4b6af5d"}},{"arxiv_id":"1511.05952","arxiv_id_is_arxiv":true,"paper":"/paper/prioritized-experience-replay","title":"Prioritized Experience Replay","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSCI4850/S20-team3-project","path":"DoubleQ/Prioritized/ReplayMemory.py","file_url":"https://github.com/CSCI4850/S20-team3-project/blob/HEAD/DoubleQ/Prioritized/ReplayMemory.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":"8735a7421b0a382d","code_sha256_prefix":"8735a7421b0a382d","mcp_get_code":{"code_sha256":"8735a7421b0a382d"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kmdanielduan/DQN_Family_PyTorch","path":"agent.py","file_url":"https://github.com/kmdanielduan/DQN_Family_PyTorch/blob/HEAD/agent.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, kmdanielduan/DQN_Family_PyTorch when it was checked","code_sha256":"1a174f4ed5cef5f4","code_sha256_prefix":"1a174f4ed5cef5f4","mcp_get_code":{"code_sha256":"1a174f4ed5cef5f4"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OscarHuangWind/Preference-Guided-DQN-Atari","path":"DRL.py","file_url":"https://github.com/OscarHuangWind/Preference-Guided-DQN-Atari/blob/HEAD/DRL.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":"61d763d7c26919c1","code_sha256_prefix":"61d763d7c26919c1","mcp_get_code":{"code_sha256":"61d763d7c26919c1"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssainz/reinforcement_learning_algorithms","path":"non_jupyter/Frozen_Lake_DDQN.py","file_url":"https://github.com/ssainz/reinforcement_learning_algorithms/blob/HEAD/non_jupyter/Frozen_Lake_DDQN.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, ssainz/reinforcement_learning_algorithms when it was checked","code_sha256":"1d2063c27405ec4e","code_sha256_prefix":"1d2063c27405ec4e","mcp_get_code":{"code_sha256":"1d2063c27405ec4e"}},{"arxiv_id":"1509.06461","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-with-double-q","title":"Deep Reinforcement Learning with Double Q-learning","date":"2015-09-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HussonnoisMaxence/RL_Algorithms","path":"QLearning/D2QN/D2QN.py","file_url":"https://github.com/HussonnoisMaxence/RL_Algorithms/blob/HEAD/QLearning/D2QN/D2QN.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, HussonnoisMaxence/RL_Algorithms when it was checked","code_sha256":"fd50d6e813cead15","code_sha256_prefix":"fd50d6e813cead15","mcp_get_code":{"code_sha256":"fd50d6e813cead15"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Souphis/mobile_robot_rl","path":"mobile_robot_rl/agents/sac.py","file_url":"https://github.com/Souphis/mobile_robot_rl/blob/HEAD/mobile_robot_rl/agents/sac.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":"0d87c7101b2953f2","code_sha256_prefix":"0d87c7101b2953f2","mcp_get_code":{"code_sha256":"0d87c7101b2953f2"}},{"arxiv_id":"1509.02971","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-control-with-deep-reinforcement","title":"Continuous control with deep reinforcement learning","date":"2015-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tilkb/thermoai","path":"controller/RL/DDPG.py","file_url":"https://github.com/tilkb/thermoai/blob/HEAD/controller/RL/DDPG.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, tilkb/thermoai when it was checked","code_sha256":"9d5ea952455199bc","code_sha256_prefix":"9d5ea952455199bc","mcp_get_code":{"code_sha256":"9d5ea952455199bc"}}],"record_sha256":"d7194523d5a4c4761f82f7376ff381c1625d25365ef3f26567c342fa24080ab9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}