{"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/observationmodel","entry":"ObservationModel","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":6,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":3,"n_samples_constructed":1,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_fixture":0,"ran":2,"unverified":3},"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":"2505.16732","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-monte-carlo-for-policy","title":"Sequential Monte Carlo for Policy Optimization in Continuous POMDPs","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sahel13/particle-pomdp","path":"ppomdp/smc/_smc.py","file_url":"https://github.com/Sahel13/particle-pomdp/blob/HEAD/ppomdp/smc/_smc.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":"c3c32c6451adb09a","code_sha256_prefix":"c3c32c6451adb09a","mcp_get_code":{"code_sha256":"c3c32c6451adb09a"}},{"arxiv_id":"2411.00465","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-based-offline-variational","title":"Uncertainty-based Offline Variational Bayesian Reinforcement Learning for Robustness under Diverse Data Corruptions","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIRALab-USTC/RL-TRACER","path":"algo/model_free/tracer.py","file_url":"https://github.com/MIRALab-USTC/RL-TRACER/blob/HEAD/algo/model_free/tracer.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":"57ef107ba6ccf74c","code_sha256_prefix":"57ef107ba6ccf74c","mcp_get_code":{"code_sha256":"57ef107ba6ccf74c"}},{"arxiv_id":"2311.02227","arxiv_id_is_arxiv":true,"paper":"/paper/state-wise-safe-reinforcement-learning-with","title":"State-Wise Safe Reinforcement Learning With Pixel Observations","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simonzhan-code/step-wise_saferl_pixel","path":"modules/models.py","file_url":"https://github.com/simonzhan-code/step-wise_saferl_pixel/blob/HEAD/modules/models.py","status":"ran","verification_level":1,"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, simonzhan-code/step-wise_saferl_pixel when it was checked","code_sha256":"cd4df7e37f410cf0","code_sha256_prefix":"cd4df7e37f410cf0","mcp_get_code":{"code_sha256":"cd4df7e37f410cf0"}},{"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":"430454696696dc84","code_sha256_prefix":"430454696696dc84","mcp_get_code":{"code_sha256":"430454696696dc84"}},{"arxiv_id":"2005.05960","arxiv_id_is_arxiv":true,"paper":"/paper/planning-to-explore-via-self-supervised-world","title":"Planning to Explore via Self-Supervised World Models","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yusukeurakami/plan2explore-pytorch","path":"models.py","file_url":"https://github.com/yusukeurakami/plan2explore-pytorch/blob/HEAD/models.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"32fa4df355b9a218","code_sha256_prefix":"32fa4df355b9a218","mcp_get_code":{"code_sha256":"32fa4df355b9a218"}},{"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":"Yizhao111/dreamer-pytorch","path":"agent.py","file_url":"https://github.com/Yizhao111/dreamer-pytorch/blob/HEAD/agent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5a219bf8efda66","code_sha256_prefix":"be5a219bf8efda66","mcp_get_code":{"code_sha256":"be5a219bf8efda66"}}],"record_sha256":"23ed1dcb354c0dbae12e2ab66709a920407f206f0c1a75d41248fe3c8582dfd1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}