{"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":"/paper/self-imitation-learning-via-generalized-lower","title":"Self-Imitation Learning via Generalized Lower Bound Q-learning","arxiv_id":"2006.07442","date":"2020-06-12","proceeding":"NeurIPS 2020 12","authors":["Yunhao Tang"],"abstract":"Self-imitation learning motivated by lower-bound Q-learning is a novel and effective approach for off-policy learning. In this work, we propose a n-step lower bound which generalizes the original return-based lower-bound Q-learning, and introduce a new family of self-imitation learning algorithms. To provide a formal motivation for the potential performance gains provided by self-imitation learning, we show that n-step lower bound Q-learning achieves a trade-off between fixed point bias and contraction rate, drawing close connections to the popular uncorrected n-step Q-learning. We finally show that n-step lower bound Q-learning is a more robust alternative to return-based self-imitation learning and uncorrected n-step, over a wide range of continuous control benchmark tasks.","url_abs":"https://arxiv.org/abs/2006.07442v3","url_pdf":"https://arxiv.org/pdf/2006.07442v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"continuous-control","task_name":"Continuous Control"},{"task_slug":"imitation-learning","task_name":"Imitation Learning"},{"task_slug":"q-learning","task_name":"Q-Learning"},{"task_slug":"continuous-control","task_name":"continuous-control"}],"methods":[{"method_slug":"q-learning","method_name":"Q-Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2006.07442","atlas_url":"https://app.syntology.ai/?focus=2006.07442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07442"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.07442"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.07442"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.07442\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2006.07442"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2006.07442\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2006.07442"},"call":"get_concepts_for_paper(arxiv_id=\"2006.07442\")"}],"by_repo":[{"repo":"openai/spinningup","kind":"found_in_text","samples":13,"ran":11,"instrument":7,"unverified":2},{"repo":"junhyukoh/self-imitation-learning","kind":"found_in_text","samples":7,"ran":5,"instrument":0,"unverified":2}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"0fcd3ca13b6cecad","source_kind":"harvested","method_name":"n-step lower bound Q-learning","realizes_method":"n-step lower bound Q-learning","graph_method":"n-step lower bound Q-learning","realizes_severed":false,"claim":"The code implements a self-imitation learning algorithm motivated by a generalized n-step lower bound Q-learning method to improve off-policy learning.","centrality":"contribution","entry":"SelfImitation","entry_sha256":"1a23890f034cf35a","n_bricks":7,"bricks":[{"entry":"SelfImitation","code_sha256":"1a23890f034cf35a","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"PrioritizedReplayBuffer","code_sha256":"3d40ed2237ec8f20","role":"sampler","order":1,"level":0,"status":"unverified"},{"entry":"discount_with_dones","code_sha256":"874462e54e7cc379","role":"helper","order":2,"level":1,"status":"ran_violates"},{"entry":"MinSegmentTree","code_sha256":"ae840f19840ded1e","role":"helper","order":3,"level":1,"status":"ran"},{"entry":"ReplayBuffer","code_sha256":"92fcff634a9f6c9e","role":"sampler","order":4,"level":1,"status":"ran"},{"entry":"SumSegmentTree","code_sha256":"7d650bc8cab9fa52","role":"helper","order":5,"level":1,"status":"ran"},{"entry":"SegmentTree","code_sha256":"a8ec19e70d73f9c2","role":"helper","order":6,"level":1,"status":"ran"}],"ran_individually":5,"ran_individually_constructed":4,"ran_individually_by_status":{"ran":4,"ran_violates":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"c97ce645689a","n_siblings":0,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"c97ce645689a","realizes_method":"n-step lower bound Q-learning","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["0fcd3ca13b6cecad"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2006.07442"},"call":"assembly(arxiv_id=\"2006.07442\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2006.07442.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2006.07442.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/openai/spinningup","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/junhyukoh/self-imitation-learning","reach":null}],"summary":{"ran":4,"ran_violates":3,"ran_draft_wrong":7,"ran_honours":2,"unverified":4},"n_samples":20,"n_ran":16,"n_constructed":4,"n_ran_checked":9,"n_instrument":7,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"found_in_text":{"samples":20,"ran":16,"n_ran_checked":9,"n_instrument":7,"repositories":2}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":11,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":11,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":16,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"ae840f19840ded1e","code_sha256_prefix":"ae840f19840ded1e","entry":"MinSegmentTree","repo":"junhyukoh/self-imitation-learning","repo_kind":"found_in_text","path":"baselines/common/self_imitation.py","file_url":"https://github.com/junhyukoh/self-imitation-learning/blob/HEAD/baselines/common/self_imitation.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"MinSegmentTree","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"ae840f19840ded1e"}},{"code_sha256":"92fcff634a9f6c9e","code_sha256_prefix":"92fcff634a9f6c9e","entry":"ReplayBuffer","repo":"junhyukoh/self-imitation-learning","repo_kind":"found_in_text","path":"baselines/common/self_imitation.py","file_url":"https://github.com/junhyukoh/self-imitation-learning/blob/HEAD/baselines/common/self_imitation.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"ReplayBuffer","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/replaybuffer","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"92fcff634a9f6c9e"}},{"code_sha256":"a8ec19e70d73f9c2","code_sha256_prefix":"a8ec19e70d73f9c2","entry":"SegmentTree","repo":"junhyukoh/self-imitation-learning","repo_kind":"found_in_text","path":"baselines/common/self_imitation.py","file_url":"https://github.com/junhyukoh/self-imitation-learning/blob/HEAD/baselines/common/self_imitation.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"SegmentTree","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a8ec19e70d73f9c2"}},{"code_sha256":"7d650bc8cab9fa52","code_sha256_prefix":"7d650bc8cab9fa52","entry":"SumSegmentTree","repo":"junhyukoh/self-imitation-learning","repo_kind":"found_in_text","path":"baselines/common/self_imitation.py","file_url":"https://github.com/junhyukoh/self-imitation-learning/blob/HEAD/baselines/common/self_imitation.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"SumSegmentTree","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7d650bc8cab9fa52"}},{"code_sha256":"2103e65a90ce7a04","code_sha256_prefix":"2103e65a90ce7a04","entry":"all_bools","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/run_utils.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/run_utils.py","link_basis":"harvester_set","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"vals:list/1/bool","fixture_out_type":"bool","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"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","mcp_get_code":{"code_sha256":"2103e65a90ce7a04"}},{"code_sha256":"7e36f1c357c4618d","code_sha256_prefix":"7e36f1c357c4618d","entry":"colorize","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/logx.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/logx.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"string:str/0/str, color:str/0/str, bold:bool/0/bool, highlight:bool/0/bool","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/colorize","census":null,"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","mcp_get_code":{"code_sha256":"7e36f1c357c4618d"}},{"code_sha256":"57542f87e248db45","code_sha256_prefix":"57542f87e248db45","entry":"combined_shape","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/algos/pytorch/ddpg/core.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/algos/pytorch/ddpg/core.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"length:int/0/int, shape:NoneType/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"57542f87e248db45"},"code_page":"/code/combined-shape","census":null,"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 yinglunxu/reward_poisoning_attack_drl, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"57542f87e248db45"}},{"code_sha256":"fbc505a5dac82646","code_sha256_prefix":"fbc505a5dac82646","entry":"convert_json","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/serialization_utils.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/serialization_utils.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"obj:dict/0/?","fixture_out_type":"dict","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/convert-json","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"fbc505a5dac82646"}},{"code_sha256":"4cca5e460067b900","code_sha256_prefix":"4cca5e460067b900","entry":"count_vars","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/algos/pytorch/ddpg/core.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/algos/pytorch/ddpg/core.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"module:callable/0/?","fixture_out_type":"int64","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/count-vars","census":null,"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","mcp_get_code":{"code_sha256":"4cca5e460067b900"}},{"code_sha256":"874462e54e7cc379","code_sha256_prefix":"874462e54e7cc379","entry":"discount_with_dones","repo":"junhyukoh/self-imitation-learning","repo_kind":"found_in_text","path":"baselines/common/self_imitation.py","file_url":"https://github.com/junhyukoh/self-imitation-learning/blob/HEAD/baselines/common/self_imitation.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"signature":"rewards:list/1/float, dones:list/1/float, gamma:float/0/float","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"874462e54e7cc379"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"874462e54e7cc379"}},{"code_sha256":"f29202d8108bccd3","code_sha256_prefix":"f29202d8108bccd3","entry":"flat_concat","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/mpi_tf.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/mpi_tf.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"xs:list/1/EagerTensor","fixture_out_type":"EagerTensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/flat-concat","census":null,"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","mcp_get_code":{"code_sha256":"f29202d8108bccd3"}},{"code_sha256":"62314e3b8ca6edfc","code_sha256_prefix":"62314e3b8ca6edfc","entry":"get_all_datasets","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/plot.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/plot.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"all_logdirs:list/1/str, legend:list/1/str, select:NoneType/0/?, exclude:NoneType/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/get-all-datasets","census":null,"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","mcp_get_code":{"code_sha256":"62314e3b8ca6edfc"}},{"code_sha256":"e642bb98eca55069","code_sha256_prefix":"e642bb98eca55069","entry":"get_datasets","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/plot.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/plot.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"logdir:str/0/str, condition:NoneType/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/get-datasets","census":null,"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","mcp_get_code":{"code_sha256":"e642bb98eca55069"}},{"code_sha256":"9ca8b8e45f7fbebf","code_sha256_prefix":"9ca8b8e45f7fbebf","entry":"is_json_serializable","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/serialization_utils.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/serialization_utils.py","link_basis":"harvester_set","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"v:dict/0/?","fixture_out_type":"bool","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/is-json-serializable","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9ca8b8e45f7fbebf"}},{"code_sha256":"7569e2a512ec417c","code_sha256_prefix":"7569e2a512ec417c","entry":"mlp","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/algos/pytorch/ddpg/core.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/algos/pytorch/ddpg/core.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"sizes:list/1/int, activation:callable/0/?, output_activation:callable/0/?","fixture_out_type":"Sequential","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/mlp-2","census":null,"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 idsia/policyevaluator, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"7569e2a512ec417c"}},{"code_sha256":"c6bdd181afa1fdf7","code_sha256_prefix":"c6bdd181afa1fdf7","entry":"valid_str","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/run_utils.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/run_utils.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"v:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"c6bdd181afa1fdf7"},"code_page":"/code/valid-str","census":null,"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","mcp_get_code":{"code_sha256":"c6bdd181afa1fdf7"}},{"code_sha256":"3d40ed2237ec8f20","code_sha256_prefix":"3d40ed2237ec8f20","entry":"PrioritizedReplayBuffer","repo":"junhyukoh/self-imitation-learning","repo_kind":"found_in_text","path":"baselines/common/self_imitation.py","file_url":"https://github.com/junhyukoh/self-imitation-learning/blob/HEAD/baselines/common/self_imitation.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3d40ed2237ec8f20"}},{"code_sha256":"1a23890f034cf35a","code_sha256_prefix":"1a23890f034cf35a","entry":"SelfImitation","repo":"junhyukoh/self-imitation-learning","repo_kind":"found_in_text","path":"baselines/common/self_imitation.py","file_url":"https://github.com/junhyukoh/self-imitation-learning/blob/HEAD/baselines/common/self_imitation.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1a23890f034cf35a"}},{"code_sha256":"042875cf711accd0","code_sha256_prefix":"042875cf711accd0","entry":"assign_params_from_flat","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/mpi_tf.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/mpi_tf.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/assign-params-from-flat","census":null,"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","mcp_get_code":{"code_sha256":"042875cf711accd0"}},{"code_sha256":"8a70bbd1276e274c","code_sha256_prefix":"8a70bbd1276e274c","entry":"restore_tf_graph","repo":"openai/spinningup","repo_kind":"found_in_text","path":"spinup/utils/logx.py","file_url":"https://github.com/openai/spinningup/blob/HEAD/spinup/utils/logx.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/restore-tf-graph","census":null,"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","mcp_get_code":{"code_sha256":"8a70bbd1276e274c"}}]},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"713afd3c28c69587c5f7e16759120af8ffbb9ac6a951011ca4c8cdb28a512617","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}