{"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/worldmodel","entry":"WorldModel","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":13,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":14,"n_samples_ran":1,"n_samples_constructed":1,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":13,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":6,"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":1,"unverified":13},"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":"2606.21173","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-21173","title":"Inverting the Bellman Equation: From Q-Values to World Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"aletcher/inverting-bellman","path":"training/wm.py","file_url":"https://github.com/aletcher/inverting-bellman/blob/HEAD/training/wm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f3428c1d86ea919","code_sha256_prefix":"7f3428c1d86ea919","mcp_get_code":{"code_sha256":"7f3428c1d86ea919"}},{"arxiv_id":"2605.16692","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16692","title":"EfficientTDMPC: Improved MPC Objectives for Sample-Efficient Continuous Control","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"carlosferrazza/humanoid-bench","path":"tdmpc2/tdmpc2/tdmpc2.py","file_url":"https://github.com/carlosferrazza/humanoid-bench/blob/HEAD/tdmpc2/tdmpc2/tdmpc2.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, carlosferrazza/humanoid-bench (NOASSERTION)","code_sha256":"671c9319d1eb04fc","code_sha256_prefix":"671c9319d1eb04fc","mcp_get_code":{"code_sha256":"671c9319d1eb04fc"}},{"arxiv_id":"2605.16692","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16692","title":"EfficientTDMPC: Improved MPC Objectives for Sample-Efficient Continuous Control","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"molumitu/BOOM_MBRL","path":"boom/boom_alg.py","file_url":"https://github.com/molumitu/BOOM_MBRL/blob/HEAD/boom/boom_alg.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, molumitu/BOOM_MBRL when it was checked","code_sha256":"22cac6d774940011","code_sha256_prefix":"22cac6d774940011","mcp_get_code":{"code_sha256":"22cac6d774940011"}},{"arxiv_id":"2601.08955","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-08955","title":"Imagine-then-Plan: Agent Learning from Adaptive Lookahead with World Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"loyiv/ITP","path":"itp/orchestrator.py","file_url":"https://github.com/loyiv/ITP/blob/HEAD/itp/orchestrator.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":"7e7128e9ce87c11f","code_sha256_prefix":"7e7128e9ce87c11f","mcp_get_code":{"code_sha256":"7e7128e9ce87c11f"}},{"arxiv_id":"2506.08441","arxiv_id_is_arxiv":true,"paper":"/paper/2506-08441","title":"Time-Aware World Model for Adaptive Prediction and Control","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anh-nn01/time-aware-world-model","path":"tawm/common/world_model.py","file_url":"https://github.com/anh-nn01/time-aware-world-model/blob/HEAD/tawm/common/world_model.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, anh-nn01/time-aware-world-model when it was checked","code_sha256":"846e35d94ef67f0c","code_sha256_prefix":"846e35d94ef67f0c","mcp_get_code":{"code_sha256":"846e35d94ef67f0c"}},{"arxiv_id":"2506.02612","arxiv_id_is_arxiv":true,"paper":"/paper/simple-good-fast-self-supervised-world-models","title":"Simple, Good, Fast: Self-Supervised World Models Free of Baggage","date":"2025-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jrobine/sgf","path":"src/wm.py","file_url":"https://github.com/jrobine/sgf/blob/HEAD/src/wm.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":"71323f43911a356d","code_sha256_prefix":"71323f43911a356d","mcp_get_code":{"code_sha256":"71323f43911a356d"}},{"arxiv_id":"2501.18922","arxiv_id_is_arxiv":true,"paper":"/paper/kbqa-o1-agentic-knowledge-base-question","title":"KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhrlab/kbqa-o1","path":"reasoners/algorithm/mcts.py","file_url":"https://github.com/lhrlab/kbqa-o1/blob/HEAD/reasoners/algorithm/mcts.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":"a3c3ee14a429c8f2","code_sha256_prefix":"a3c3ee14a429c8f2","mcp_get_code":{"code_sha256":"a3c3ee14a429c8f2"}},{"arxiv_id":"2410.14081","arxiv_id_is_arxiv":true,"paper":"/paper/reward-free-world-models-for-online-imitation","title":"Reward-free World Models for Online Imitation Learning","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobyleelsz/iqmpc","path":"tdmpc2/common/world_model.py","file_url":"https://github.com/tobyleelsz/iqmpc/blob/HEAD/tdmpc2/common/world_model.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, tobyleelsz/iqmpc when it was checked","code_sha256":"c13cd9b577cdb046","code_sha256_prefix":"c13cd9b577cdb046","mcp_get_code":{"code_sha256":"c13cd9b577cdb046"}},{"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":"2c89a891f4485238","code_sha256_prefix":"2c89a891f4485238","mcp_get_code":{"code_sha256":"2c89a891f4485238"}},{"arxiv_id":"2305.10601","arxiv_id_is_arxiv":true,"paper":"/paper/tree-of-thoughts-deliberate-problem-solving-1","title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","date":"2023-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huiwy/reflection-on-trees","path":"reasoners/algorithm/mcts.py","file_url":"https://github.com/huiwy/reflection-on-trees/blob/HEAD/reasoners/algorithm/mcts.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":"a843c8ac332d4291","code_sha256_prefix":"a843c8ac332d4291","mcp_get_code":{"code_sha256":"a843c8ac332d4291"}},{"arxiv_id":"2303.07109","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-based-world-models-are-happy-with","title":"Transformer-based World Models Are Happy With 100k Interactions","date":"2023-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jrobine/twm","path":"twm/world_model.py","file_url":"https://github.com/jrobine/twm/blob/HEAD/twm/world_model.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":"dd79139c2de865e1","code_sha256_prefix":"dd79139c2de865e1","mcp_get_code":{"code_sha256":"dd79139c2de865e1"}},{"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":"536e51c6e29f6a5b","code_sha256_prefix":"536e51c6e29f6a5b","mcp_get_code":{"code_sha256":"536e51c6e29f6a5b"}},{"arxiv_id":"2209.12016","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-model-based-pre-training-for","title":"Mastering the Unsupervised Reinforcement Learning Benchmark from Pixels","date":"2022-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mazpie/mastering-urlb","path":"agent/dreamer.py","file_url":"https://github.com/mazpie/mastering-urlb/blob/HEAD/agent/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":"5fb819938bf3f347","code_sha256_prefix":"5fb819938bf3f347","mcp_get_code":{"code_sha256":"5fb819938bf3f347"}},{"arxiv_id":"2209.00588","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-are-sample-efficient-world","title":"Transformers are Sample-Efficient World Models","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eloialonso/iris","path":"src/models/world_model.py","file_url":"https://github.com/eloialonso/iris/blob/HEAD/src/models/world_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, eloialonso/iris, is not in the permissive set Syntology serves inline","code_sha256":"cfb3154cdccd72da","code_sha256_prefix":"cfb3154cdccd72da","mcp_get_code":{"code_sha256":"cfb3154cdccd72da"}}],"record_sha256":"ed18ee71d8a2b72d4dfebf5e5454846ff3e22e31204ec264847e14e693a4d58b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}