{"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/rssm","entry":"RSSM","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":2,"n_papers_ran_no_instrument_failure":2,"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":10,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":3,"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":4,"unverified":6},"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":"2603.18202","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-18202","title":"R2-Dreamer: Redundancy-Reduced World Models without Decoders or Augmentation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"NM512/r2dreamer","path":"dreamer.py","file_url":"https://github.com/NM512/r2dreamer/blob/HEAD/dreamer.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":"c96d50956593ba0a","code_sha256_prefix":"c96d50956593ba0a","mcp_get_code":{"code_sha256":"c96d50956593ba0a"}},{"arxiv_id":"2312.02019","arxiv_id_is_arxiv":true,"paper":"/paper/action-inference-by-maximising-evidence-zero-1","title":"Action Inference by Maximising Evidence: Zero-Shot Imitation from Observation with World Models","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"argmax-ai/aime","path":"aime/models/ssm.py","file_url":"https://github.com/argmax-ai/aime/blob/HEAD/aime/models/ssm.py","status":"unverified","verification_level":0,"contract_check":null,"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, argmax-ai/aime (NOASSERTION)","code_sha256":"518be015fb96eae9","code_sha256_prefix":"518be015fb96eae9","mcp_get_code":{"code_sha256":"518be015fb96eae9"}},{"arxiv_id":"2305.15260","arxiv_id_is_arxiv":true,"paper":"/paper/collaborative-world-models-an-online-offline","title":"Making Offline RL Online: Collaborative World Models for Offline Visual Reinforcement Learning","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiwang067/CoWorld","path":"models.py","file_url":"https://github.com/qiwang067/CoWorld/blob/HEAD/models.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, qiwang067/CoWorld when it was checked","code_sha256":"03954e42255f0941","code_sha256_prefix":"03954e42255f0941","mcp_get_code":{"code_sha256":"03954e42255f0941"}},{"arxiv_id":"2301.04104","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-diverse-domains-through-world","title":"Mastering Diverse Domains through World Models","date":"2023-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nm512/dreamerv3-torch","path":"dreamer.py","file_url":"https://github.com/nm512/dreamerv3-torch/blob/HEAD/dreamer.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":"795c1fe9da508672","code_sha256_prefix":"795c1fe9da508672","mcp_get_code":{"code_sha256":"795c1fe9da508672"}},{"arxiv_id":"2210.07729","arxiv_id_is_arxiv":true,"paper":"/paper/model-based-imitation-learning-for-urban","title":"Model-Based Imitation Learning for Urban Driving","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wayveai/mile","path":"mile/models/mile.py","file_url":"https://github.com/wayveai/mile/blob/HEAD/mile/models/mile.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":"86c73d56030a9b3b","code_sha256_prefix":"86c73d56030a9b3b","mcp_get_code":{"code_sha256":"86c73d56030a9b3b"}},{"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":"RajGhugare19/dreamerv2","path":"dreamerv2/models/rssm.py","file_url":"https://github.com/RajGhugare19/dreamerv2/blob/HEAD/dreamerv2/models/rssm.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":"11fa7e68493b760d","code_sha256_prefix":"11fa7e68493b760d","mcp_get_code":{"code_sha256":"11fa7e68493b760d"}},{"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":"chamorajg/pl-dreamer","path":"planet.py","file_url":"https://github.com/chamorajg/pl-dreamer/blob/HEAD/planet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, chamorajg/pl-dreamer when it was checked","code_sha256":"5fd2e204f8b1686c","code_sha256_prefix":"5fd2e204f8b1686c","mcp_get_code":{"code_sha256":"5fd2e204f8b1686c"}},{"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":"zhixuan-lin/dreamer-pytorch","path":"dreamer.py","file_url":"https://github.com/zhixuan-lin/dreamer-pytorch/blob/HEAD/dreamer.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":"d0fb3df4884ed3da","code_sha256_prefix":"d0fb3df4884ed3da","mcp_get_code":{"code_sha256":"d0fb3df4884ed3da"}},{"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":"adityabingi/Dreamer","path":"dreamer.py","file_url":"https://github.com/adityabingi/Dreamer/blob/HEAD/dreamer.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":"6ed93a3bd0b35bbd","code_sha256_prefix":"6ed93a3bd0b35bbd","mcp_get_code":{"code_sha256":"6ed93a3bd0b35bbd"}},{"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":"Eclectic-Sheep/sheeprl","path":"sheeprl/algos/dreamer_v1/agent.py","file_url":"https://github.com/Eclectic-Sheep/sheeprl/blob/HEAD/sheeprl/algos/dreamer_v1/agent.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":"6f6fbb1df0959d34","code_sha256_prefix":"6f6fbb1df0959d34","mcp_get_code":{"code_sha256":"6f6fbb1df0959d34"}}],"record_sha256":"80610932d557b3def1525ac87f4192fa2bca923d0483a0502dccd5cece0aa8e7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}