{"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/load-baselines","entry":"load_baselines","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":7,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":0,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"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":"2210.11698","arxiv_id_is_arxiv":true,"paper":"/paper/learning-robust-dynamics-through-variational","title":"Learning Robust Dynamics through Variational Sparse Gating","date":"2022-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnavkj1995/vsg","path":"plotting.py","file_url":"https://github.com/arnavkj1995/vsg/blob/HEAD/plotting.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":"f5538829a09b5fc7","code_sha256_prefix":"f5538829a09b5fc7","mcp_get_code":{"code_sha256":"f5538829a09b5fc7"}},{"arxiv_id":"2112.05848","arxiv_id_is_arxiv":true,"paper":"/paper/deep-q-network-with-proximal-iteration-1","title":"Faster Deep Reinforcement Learning with Slower Online Network","date":"2021-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/fast-rl-with-slow-updates","path":"dopamine/colab/utils.py","file_url":"https://github.com/amazon-research/fast-rl-with-slow-updates/blob/HEAD/dopamine/colab/utils.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":"ba90a401fa9b20dc","code_sha256_prefix":"ba90a401fa9b20dc","mcp_get_code":{"code_sha256":"ba90a401fa9b20dc"}},{"arxiv_id":"2110.14565","arxiv_id_is_arxiv":true,"paper":"/paper/dreamerpro-reconstruction-free-model-based-1","title":"DreamerPro: Reconstruction-Free Model-Based Reinforcement Learning with Prototypical Representations","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdeng18/dreamer-pro","path":"Dreamer/common/plot.py","file_url":"https://github.com/fdeng18/dreamer-pro/blob/HEAD/Dreamer/common/plot.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":"b3ae56f77b905c0e","code_sha256_prefix":"b3ae56f77b905c0e","mcp_get_code":{"code_sha256":"b3ae56f77b905c0e"}},{"arxiv_id":"2106.07156","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-predictive-coding-for-model-based","title":"Temporal Predictive Coding For Model-Based Planning In Latent Space","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/TPC-tensorflow","path":"plotting.py","file_url":"https://github.com/VinAIResearch/TPC-tensorflow/blob/HEAD/plotting.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f2cf1bbab74e2d7","code_sha256_prefix":"2f2cf1bbab74e2d7","mcp_get_code":{"code_sha256":"2f2cf1bbab74e2d7"}},{"arxiv_id":"2010.02193","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-atari-with-discrete-world-models-1","title":"Mastering Atari with Discrete World Models","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iglu-contest/iglu-builder-baseline-dreamer","path":"common/plot.py","file_url":"https://github.com/iglu-contest/iglu-builder-baseline-dreamer/blob/HEAD/common/plot.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":"b3ae56f77b905c0e","code_sha256_prefix":"b3ae56f77b905c0e","mcp_get_code":{"code_sha256":"b3ae56f77b905c0e"}},{"arxiv_id":"1912.01603","arxiv_id_is_arxiv":true,"paper":"/paper/dream-to-control-learning-behaviors-by-latent","title":"Dream to Control: Learning Behaviors by Latent Imagination","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danijar/dreamer","path":"plotting.py","file_url":"https://github.com/danijar/dreamer/blob/HEAD/plotting.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f2cf1bbab74e2d7","code_sha256_prefix":"2f2cf1bbab74e2d7","mcp_get_code":{"code_sha256":"2f2cf1bbab74e2d7"}},{"arxiv_id":"1812.06110","arxiv_id_is_arxiv":true,"paper":"/paper/dopamine-a-research-framework-for-deep","title":"Dopamine: A Research Framework for Deep Reinforcement Learning","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ACampero/dopamine","path":"dopamine/colab/utils.py","file_url":"https://github.com/ACampero/dopamine/blob/HEAD/dopamine/colab/utils.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":"da193998947f1f00","code_sha256_prefix":"da193998947f1f00","mcp_get_code":{"code_sha256":"da193998947f1f00"}},{"arxiv_id":"1812.06110","arxiv_id_is_arxiv":true,"paper":"/paper/dopamine-a-research-framework-for-deep","title":"Dopamine: A Research Framework for Deep Reinforcement Learning","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GoingMyWay/dopamine_reward_decomposition","path":"dopamine/colab/utils.py","file_url":"https://github.com/GoingMyWay/dopamine_reward_decomposition/blob/HEAD/dopamine/colab/utils.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":"164574e121bef26e","code_sha256_prefix":"164574e121bef26e","mcp_get_code":{"code_sha256":"164574e121bef26e"}},{"arxiv_id":"1812.06110","arxiv_id_is_arxiv":true,"paper":"/paper/dopamine-a-research-framework-for-deep","title":"Dopamine: A Research Framework for Deep Reinforcement Learning","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KatyNTsachi/Hierarchical-RL","path":"dopamine/colab/utils.py","file_url":"https://github.com/KatyNTsachi/Hierarchical-RL/blob/HEAD/dopamine/colab/utils.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":"ffc223b3f87cf2cf","code_sha256_prefix":"ffc223b3f87cf2cf","mcp_get_code":{"code_sha256":"ffc223b3f87cf2cf"}}],"record_sha256":"910b2c1d78af42a05128d056a7af3263e0a96e35ff2b03a780112cf896ab595f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}