{"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/compute-baseline-loss","entry":"compute_baseline_loss","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":12,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":7,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":13,"n_places_pointer_only":10,"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":2,"ran_fixture":0,"ran":2,"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":"2211.00539","arxiv_id_is_arxiv":true,"paper":"/paper/dungeons-and-data-a-large-scale-nethack","title":"Dungeons and Data: A Large-Scale NetHack Dataset","date":"2022-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e624e7bc82f85ecd","code_sha256_prefix":"e624e7bc82f85ecd","mcp_get_code":{"code_sha256":"e624e7bc82f85ecd"}},{"arxiv_id":"2210.00066","arxiv_id_is_arxiv":true,"paper":"/paper/improving-policy-learning-via-language","title":"Improving Policy Learning via Language Dynamics Distillation","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e624e7bc82f85ecd","code_sha256_prefix":"e624e7bc82f85ecd","mcp_get_code":{"code_sha256":"e624e7bc82f85ecd"}},{"arxiv_id":"2201.03544","arxiv_id_is_arxiv":true,"paper":"/paper/the-effects-of-reward-misspecification-1","title":"The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Models","date":"2022-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aypan17/reward-misspecification","path":"atari/torchbeast/monobeast.py","file_url":"https://github.com/aypan17/reward-misspecification/blob/HEAD/atari/torchbeast/monobeast.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9123707cba84b2c","code_sha256_prefix":"e9123707cba84b2c","mcp_get_code":{"code_sha256":"e9123707cba84b2c"}},{"arxiv_id":"2111.13119","arxiv_id_is_arxiv":true,"paper":"/paper/interesting-object-curious-agent-learning-1","title":"Interesting Object, Curious Agent: Learning Task-Agnostic Exploration","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"dde95c495d2752d6","code_sha256_prefix":"dde95c495d2752d6","mcp_get_code":{"code_sha256":"dde95c495d2752d6"}},{"arxiv_id":"2110.10661","arxiv_id_is_arxiv":true,"paper":"/paper/silg-the-multi-environment-symbolic","title":"SILG: The Multi-environment Symbolic Interactive Language Grounding Benchmark","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"dde95c495d2752d6","code_sha256_prefix":"dde95c495d2752d6","mcp_get_code":{"code_sha256":"dde95c495d2752d6"}},{"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":"facebookresearch/nle","path":"nle/agent/agent.py","file_url":"https://github.com/facebookresearch/nle/blob/HEAD/nle/agent/agent.py","status":"unverified","verification_level":0,"contract_check":"RAISES","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, facebookresearch/nle (NOASSERTION)","code_sha256":"e624e7bc82f85ecd","code_sha256_prefix":"e624e7bc82f85ecd","mcp_get_code":{"code_sha256":"e624e7bc82f85ecd"}},{"arxiv_id":"2006.12122","arxiv_id_is_arxiv":true,"paper":"/paper/learning-with-amigo-adversarially-motivated","title":"Learning with AMIGo: Adversarially Motivated Intrinsic Goals","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/adversarially-motivated-intrinsic-goals","path":"monobeast/minigrid/monobeast_amigo.py","file_url":"https://github.com/facebookresearch/adversarially-motivated-intrinsic-goals/blob/HEAD/monobeast/minigrid/monobeast_amigo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/adversarially-motivated-intrinsic-goals (NOASSERTION)","code_sha256":"dde95c495d2752d6","code_sha256_prefix":"dde95c495d2752d6","mcp_get_code":{"code_sha256":"dde95c495d2752d6"}},{"arxiv_id":"1910.08210","arxiv_id_is_arxiv":true,"paper":"/paper/rtfm-generalising-to-novel-environment","title":"RTFM: Generalising to Novel Environment Dynamics via Reading","date":"2019-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"dde95c495d2752d6","code_sha256_prefix":"dde95c495d2752d6","mcp_get_code":{"code_sha256":"dde95c495d2752d6"}},{"arxiv_id":"1910.03552","arxiv_id_is_arxiv":true,"paper":"/paper/torchbeast-a-pytorch-platform-for-distributed","title":"TorchBeast: A PyTorch Platform for Distributed RL","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e9123707cba84b2c","code_sha256_prefix":"e9123707cba84b2c","mcp_get_code":{"code_sha256":"e9123707cba84b2c"}},{"arxiv_id":"1910.03552","arxiv_id_is_arxiv":true,"paper":"/paper/torchbeast-a-pytorch-platform-for-distributed","title":"TorchBeast: A PyTorch Platform for Distributed RL","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heiner/scalable_agent","path":"experiment.py","file_url":"https://github.com/heiner/scalable_agent/blob/HEAD/experiment.py","status":"ran","verification_level":1,"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":"777b5a676e76d593","code_sha256_prefix":"777b5a676e76d593","mcp_get_code":{"code_sha256":"777b5a676e76d593"}},{"arxiv_id":"1903.01292","arxiv_id_is_arxiv":true,"paper":"/paper/the-streetlearn-environment-and-dataset","title":"The StreetLearn Environment and Dataset","date":"2019-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/streetlearn","path":"streetlearn/python/experiment.py","file_url":"https://github.com/deepmind/streetlearn/blob/HEAD/streetlearn/python/experiment.py","status":"ran","verification_level":1,"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":"c4621788cdb91119","code_sha256_prefix":"c4621788cdb91119","mcp_get_code":{"code_sha256":"c4621788cdb91119"}},{"arxiv_id":"1809.04474","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-deep-reinforcement-learning-with","title":"Multi-task Deep Reinforcement Learning with PopArt","date":"2018-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e9123707cba84b2c","code_sha256_prefix":"e9123707cba84b2c","mcp_get_code":{"code_sha256":"e9123707cba84b2c"}},{"arxiv_id":"1708.04782","arxiv_id_is_arxiv":true,"paper":"/paper/starcraft-ii-a-new-challenge-for","title":"StarCraft II: A New Challenge for Reinforcement Learning","date":"2017-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"e9123707cba84b2c","code_sha256_prefix":"e9123707cba84b2c","mcp_get_code":{"code_sha256":"e9123707cba84b2c"}}],"record_sha256":"e22d1238a0f266e7e54c526a048b1e25b06252d5e3fae3e04ebbfd11f00ff74f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}