{"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/forwardmodel","entry":"ForwardModel","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":6,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_ran":6,"n_samples_constructed":4,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"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":0,"ran_fixture":0,"ran":6,"unverified":0},"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":"2605.30330","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30330","title":"When, why, and how do diffusion posterior samplers fail? A finite-sample lens","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"voilalab/diagnosing-posterior-sampling","path":"src/scores/fsr.py","file_url":"https://github.com/voilalab/diagnosing-posterior-sampling/blob/HEAD/src/scores/fsr.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":"4a64fd65d09693b1","code_sha256_prefix":"4a64fd65d09693b1","mcp_get_code":{"code_sha256":"4a64fd65d09693b1"}},{"arxiv_id":"2501.11463","arxiv_id_is_arxiv":true,"paper":"/paper/curiosity-driven-reinforcement-learning-from","title":"Curiosity-Driven Reinforcement Learning from Human Feedback","date":"2025-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ernie-research/CD-RLHF","path":"applications/DeepSpeed-Chat/dschat/rlhf/rlhf_engine.py","file_url":"https://github.com/ernie-research/CD-RLHF/blob/HEAD/applications/DeepSpeed-Chat/dschat/rlhf/rlhf_engine.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":"e2af18219f32d31d","code_sha256_prefix":"e2af18219f32d31d","mcp_get_code":{"code_sha256":"e2af18219f32d31d"}},{"arxiv_id":"2405.05349","arxiv_id_is_arxiv":true,"paper":"/paper/offline-model-based-optimization-via-policy","title":"Offline Model-Based Optimization via Policy-Guided Gradient Search","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yassineCh/PGS","path":"coms_cleaned/nets.py","file_url":"https://github.com/yassineCh/PGS/blob/HEAD/coms_cleaned/nets.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, yassineCh/PGS when it was checked","code_sha256":"3a2ee7569ed76374","code_sha256_prefix":"3a2ee7569ed76374","mcp_get_code":{"code_sha256":"3a2ee7569ed76374"}},{"arxiv_id":"2309.15178","arxiv_id_is_arxiv":true,"paper":"/paper/conservative-world-models","title":"Zero-Shot Reinforcement Learning from Low Quality Data","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enjeeneer/conservative-world-models","path":"agents/cfb/agent.py","file_url":"https://github.com/enjeeneer/conservative-world-models/blob/HEAD/agents/cfb/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23d435a38e160c8d","code_sha256_prefix":"23d435a38e160c8d","mcp_get_code":{"code_sha256":"23d435a38e160c8d"}},{"arxiv_id":"2101.11992","arxiv_id_is_arxiv":true,"paper":"/paper/acting-in-delayed-environments-with-non-1","title":"Acting in Delayed Environments with Non-Stationary Markov Policies","date":"2021-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"galdl/rl_delay_basic","path":"dqn_agents.py","file_url":"https://github.com/galdl/rl_delay_basic/blob/HEAD/dqn_agents.py","status":"ran","verification_level":1,"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":"bac53a374bb21edc","code_sha256_prefix":"bac53a374bb21edc","mcp_get_code":{"code_sha256":"bac53a374bb21edc"}},{"arxiv_id":"2002.09505","arxiv_id_is_arxiv":true,"paper":"/paper/estimating-qss-with-deep-deterministic","title":"Estimating Q(s,s') with Deep Deterministic Dynamics Gradients","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uber-research/D3G","path":"D3G/D3G.py","file_url":"https://github.com/uber-research/D3G/blob/HEAD/D3G/D3G.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"22d43d3ff27e6828","code_sha256_prefix":"22d43d3ff27e6828","mcp_get_code":{"code_sha256":"22d43d3ff27e6828"}}],"record_sha256":"66426c362eb7b83ca603b42119375ebcf43429dc81bdfeb42198123ecda1841e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}