{"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/rng","entry":"rng","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":0,"n_papers_ran_no_instrument_failure":0,"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":2,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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":"2403.12309","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-from-delayed","title":"Reinforcement Learning from Delayed Observations via World Models","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"indylab/delayeddreamer","path":"dreamerv3/ninjax.py","file_url":"https://github.com/indylab/delayeddreamer/blob/HEAD/dreamerv3/ninjax.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":"45b97b51433849a7","code_sha256_prefix":"45b97b51433849a7","mcp_get_code":{"code_sha256":"45b97b51433849a7"}},{"arxiv_id":"2403.04253","arxiv_id_is_arxiv":true,"paper":"/paper/mastering-memory-tasks-with-world-models","title":"Mastering Memory Tasks with World Models","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/Recall2Imagine","path":"recall2imagine/ninjax.py","file_url":"https://github.com/chandar-lab/Recall2Imagine/blob/HEAD/recall2imagine/ninjax.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":"45b97b51433849a7","code_sha256_prefix":"45b97b51433849a7","mcp_get_code":{"code_sha256":"45b97b51433849a7"}},{"arxiv_id":"2310.00344","arxiv_id_is_arxiv":true,"paper":"/paper/harmony-world-models-boosting-sample","title":"HarmonyDream: Task Harmonization Inside World Models","date":"2023-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/HarmonyDream","path":"dreamerv3-jax/dreamerv3/ninjax.py","file_url":"https://github.com/thuml/HarmonyDream/blob/HEAD/dreamerv3-jax/dreamerv3/ninjax.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":"45b97b51433849a7","code_sha256_prefix":"45b97b51433849a7","mcp_get_code":{"code_sha256":"45b97b51433849a7"}},{"arxiv_id":"2307.07176","arxiv_id_is_arxiv":true,"paper":"/paper/safe-dreamerv3-safe-reinforcement-learning","title":"SafeDreamer: Safe Reinforcement Learning with World Models","date":"2023-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PKU-Alignment/SafeDreamer","path":"SafeDreamer/ninjax.py","file_url":"https://github.com/PKU-Alignment/SafeDreamer/blob/HEAD/SafeDreamer/ninjax.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":"45b97b51433849a7","code_sha256_prefix":"45b97b51433849a7","mcp_get_code":{"code_sha256":"45b97b51433849a7"}},{"arxiv_id":"2306.11488","arxiv_id_is_arxiv":true,"paper":"/paper/informed-pomdp-leveraging-additional","title":"Informed POMDP: Leveraging Additional Information in Model-Based RL","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"glambrechts/informed-dreamer","path":"dreamerv3/ninjax.py","file_url":"https://github.com/glambrechts/informed-dreamer/blob/HEAD/dreamerv3/ninjax.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":"45b97b51433849a7","code_sha256_prefix":"45b97b51433849a7","mcp_get_code":{"code_sha256":"45b97b51433849a7"}},{"arxiv_id":"2305.14343","arxiv_id_is_arxiv":true,"paper":"/paper/video-prediction-models-as-rewards-for","title":"Video Prediction Models as Rewards for Reinforcement Learning","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alescontrela/viper_rl","path":"viper_rl/dreamerv3/ninjax.py","file_url":"https://github.com/Alescontrela/viper_rl/blob/HEAD/viper_rl/dreamerv3/ninjax.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":"a03f3f2133e3fcee","code_sha256_prefix":"a03f3f2133e3fcee","mcp_get_code":{"code_sha256":"a03f3f2133e3fcee"}},{"arxiv_id":"2303.03226","arxiv_id_is_arxiv":true,"paper":"/paper/safe-reinforcement-learning-via-probabilistic","title":"Safe Reinforcement Learning via Probabilistic Logic Shields","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sacktock/ambs","path":"dreamerV3-base/ninjax.py","file_url":"https://github.com/sacktock/ambs/blob/HEAD/dreamerV3-base/ninjax.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":"45b97b51433849a7","code_sha256_prefix":"45b97b51433849a7","mcp_get_code":{"code_sha256":"45b97b51433849a7"}}],"record_sha256":"0ed2b0b146ed54bdb702e063d022a1542571698f41acf2423a7ca5014ad4f4c4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}