{"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/discount","entry":"discount","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":10,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":11,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":2,"ran":6,"unverified":1},"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":"2210.17375","arxiv_id_is_arxiv":true,"paper":"/paper/erl-re-2-efficient-evolutionary-reinforcement","title":"ERL-Re$^2$: Efficient Evolutionary Reinforcement Learning with Shared State Representation and Individual Policy Representation","date":"2022-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeshenpy/ERL-Re2","path":"core/agent.py","file_url":"https://github.com/yeshenpy/ERL-Re2/blob/HEAD/core/agent.py","status":"ran_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yeshenpy/ERL-Re2 when it was checked","code_sha256":"adb1e03f78b84980","code_sha256_prefix":"adb1e03f78b84980","mcp_get_code":{"code_sha256":"adb1e03f78b84980"}},{"arxiv_id":"2010.07916","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-trust-region-policy-optimization","title":"Multi-Agent Trust Region Policy Optimization","date":"2020-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hepengli/matrpo","path":"matrpo/common/math_util.py","file_url":"https://github.com/hepengli/matrpo/blob/HEAD/matrpo/common/math_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"973bd4eccef85757","code_sha256_prefix":"973bd4eccef85757","mcp_get_code":{"code_sha256":"973bd4eccef85757"}},{"arxiv_id":"1907.02874","arxiv_id_is_arxiv":true,"paper":"/paper/attentive-multi-task-deep-reinforcement","title":"Attentive Multi-Task Deep Reinforcement Learning","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"braemt/attentive-multi-task-deep-reinforcement-learning","path":"a3c.py","file_url":"https://github.com/braemt/attentive-multi-task-deep-reinforcement-learning/blob/HEAD/a3c.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, braemt/attentive-multi-task-deep-reinforcement-learning, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"0ca7ce32a4f2492c","code_sha256_prefix":"0ca7ce32a4f2492c","mcp_get_code":{"code_sha256":"0ca7ce32a4f2492c"}},{"arxiv_id":"1906.05226","arxiv_id_is_arxiv":true,"paper":"/paper/continual-and-multi-task-architecture-search","title":"Continual and Multi-Task Architecture Search","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ramakanth-pasunuru/CAS-MAS","path":"trainer.py","file_url":"https://github.com/ramakanth-pasunuru/CAS-MAS/blob/HEAD/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc015b361f3178c7","code_sha256_prefix":"cc015b361f3178c7","mcp_get_code":{"code_sha256":"cc015b361f3178c7"}},{"arxiv_id":"1904.10729","arxiv_id_is_arxiv":true,"paper":"/paper/neural-logic-reinforcement-learning","title":"Neural Logic Reinforcement Learning","date":"2019-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhengyaoJiang/NLRL","path":"core/rl.py","file_url":"https://github.com/ZhengyaoJiang/NLRL/blob/HEAD/core/rl.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":"7767b1b80f46ddeb","code_sha256_prefix":"7767b1b80f46ddeb","mcp_get_code":{"code_sha256":"7767b1b80f46ddeb"}},{"arxiv_id":"1904.09981","arxiv_id_is_arxiv":true,"paper":"/paper/graphnas-graph-neural-architecture-search","title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GraphNAS/GraphNAS-simple","path":"graphnas/trainer.py","file_url":"https://github.com/GraphNAS/GraphNAS-simple/blob/HEAD/graphnas/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35a7fa611d2a624f","code_sha256_prefix":"35a7fa611d2a624f","mcp_get_code":{"code_sha256":"35a7fa611d2a624f"}},{"arxiv_id":"1810.12894","arxiv_id_is_arxiv":true,"paper":"/paper/exploration-by-random-network-distillation","title":"Exploration by Random Network Distillation","date":"2018-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/strategically_efficient_rl","path":"algorithms/agents/intrinsic.py","file_url":"https://github.com/microsoft/strategically_efficient_rl/blob/HEAD/algorithms/agents/intrinsic.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"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 braemt/attentive-multi-task-deep-reinforcement-learning, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"0ca7ce32a4f2492c","code_sha256_prefix":"0ca7ce32a4f2492c","mcp_get_code":{"code_sha256":"0ca7ce32a4f2492c"}},{"arxiv_id":"1706.01905","arxiv_id_is_arxiv":true,"paper":"/paper/parameter-space-noise-for-exploration","title":"Parameter Space Noise for Exploration","date":"2017-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aspk/Tensorflow_Deep_RL","path":"param_noise_mlp.py","file_url":"https://github.com/aspk/Tensorflow_Deep_RL/blob/HEAD/param_noise_mlp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aspk/Tensorflow_Deep_RL when it was checked","code_sha256":"c80e4e6524f7b68e","code_sha256_prefix":"c80e4e6524f7b68e","mcp_get_code":{"code_sha256":"c80e4e6524f7b68e"}},{"arxiv_id":"1703.01988","arxiv_id_is_arxiv":true,"paper":"/paper/neural-episodic-control","title":"Neural Episodic Control","date":"2017-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mjacar/pytorch-nec","path":"utils/math_utils.py","file_url":"https://github.com/mjacar/pytorch-nec/blob/HEAD/utils/math_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"59e3e825c388becc","code_sha256_prefix":"59e3e825c388becc","mcp_get_code":{"code_sha256":"59e3e825c388becc"}},{"arxiv_id":"1611.05763","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-reinforcement-learn","title":"Learning to reinforcement learn","date":"2016-11-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awjuliani/Meta-RL","path":"helper.py","file_url":"https://github.com/awjuliani/Meta-RL/blob/HEAD/helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb210a4cf2658a85","code_sha256_prefix":"fb210a4cf2658a85","mcp_get_code":{"code_sha256":"fb210a4cf2658a85"}},{"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":"openai/universe-starter-agent","path":"a3c.py","file_url":"https://github.com/openai/universe-starter-agent/blob/HEAD/a3c.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"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 braemt/attentive-multi-task-deep-reinforcement-learning, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"0ca7ce32a4f2492c","code_sha256_prefix":"0ca7ce32a4f2492c","mcp_get_code":{"code_sha256":"0ca7ce32a4f2492c"}}],"record_sha256":"7fdf6e7ade82c6ddb34a7917793b3d65b5183e091502e05d523dac97aafb36a6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}