{"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/target-update","entry":"target_update","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":9,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":0,"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":10,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":9,"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":1,"ran_fixture":0,"ran":0,"unverified":9},"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.11711","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11711","title":"Debiased Model-based Representations for Sample-efficient Continuous Control","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"nothingbutbut/FoG","path":"jaxrl/agents/obac/obac_learner.py","file_url":"https://github.com/nothingbutbut/FoG/blob/HEAD/jaxrl/agents/obac/obac_learner.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, nothingbutbut/FoG when it was checked","code_sha256":"a183b9c35691ddd9","code_sha256_prefix":"a183b9c35691ddd9","mcp_get_code":{"code_sha256":"a183b9c35691ddd9"}},{"arxiv_id":"2406.00645","arxiv_id_is_arxiv":true,"paper":"/paper/furl-visual-language-models-as-fuzzy-rewards","title":"FuRL: Visual-Language Models as Fuzzy Rewards for Reinforcement Learning","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fuyw/furl","path":"models/furl.py","file_url":"https://github.com/fuyw/furl/blob/HEAD/models/furl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, fuyw/furl when it was checked","code_sha256":"88369aa7aff57906","code_sha256_prefix":"88369aa7aff57906","mcp_get_code":{"code_sha256":"88369aa7aff57906"}},{"arxiv_id":"2405.16158","arxiv_id_is_arxiv":true,"paper":"/paper/bigger-regularized-optimistic-scaling-for","title":"Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous control","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"proceduralia/high_replay_ratio_continuous_control","path":"jaxrl/agents/sac/sac_learner.py","file_url":"https://github.com/proceduralia/high_replay_ratio_continuous_control/blob/HEAD/jaxrl/agents/sac/sac_learner.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":"804f231f90e60d49","code_sha256_prefix":"804f231f90e60d49","mcp_get_code":{"code_sha256":"804f231f90e60d49"}},{"arxiv_id":"2405.16158","arxiv_id_is_arxiv":true,"paper":"/paper/bigger-regularized-optimistic-scaling-for","title":"Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous control","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naumix/BiggerRegularizedOptimistic","path":"jaxrl/bro/bro_learner.py","file_url":"https://github.com/naumix/BiggerRegularizedOptimistic/blob/HEAD/jaxrl/bro/bro_learner.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":"ce51f9f65a9e0a89","code_sha256_prefix":"ce51f9f65a9e0a89","mcp_get_code":{"code_sha256":"ce51f9f65a9e0a89"}},{"arxiv_id":"2405.04342","arxiv_id_is_arxiv":true,"paper":"/paper/the-curse-of-diversity-in-ensemble-based","title":"The Curse of Diversity in Ensemble-Based Exploration","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/ensemble-rl-continuous","path":"jaxrl/agents/cel/cel_learner.py","file_url":"https://github.com/zhixuan-lin/ensemble-rl-continuous/blob/HEAD/jaxrl/agents/cel/cel_learner.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":"d7b5436efe6a474c","code_sha256_prefix":"d7b5436efe6a474c","mcp_get_code":{"code_sha256":"d7b5436efe6a474c"}},{"arxiv_id":"2402.17135","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-zero-shot-reinforcement-learning","title":"Unsupervised Zero-Shot Reinforcement Learning via Functional Reward Encodings","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kvfrans/fre","path":"common/train_state.py","file_url":"https://github.com/kvfrans/fre/blob/HEAD/common/train_state.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, kvfrans/fre when it was checked","code_sha256":"b10ceb550bad20ce","code_sha256_prefix":"b10ceb550bad20ce","mcp_get_code":{"code_sha256":"b10ceb550bad20ce"}},{"arxiv_id":"2310.17966","arxiv_id_is_arxiv":true,"paper":"/paper/train-once-get-a-family-state-adaptive-1","title":"Train Once, Get a Family: State-Adaptive Balances for Offline-to-Online Reinforcement Learning","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leaplabthu/famo2o","path":"jax_iql/family_learner.py","file_url":"https://github.com/leaplabthu/famo2o/blob/HEAD/jax_iql/family_learner.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":"958fa187e9bfa7b1","code_sha256_prefix":"958fa187e9bfa7b1","mcp_get_code":{"code_sha256":"958fa187e9bfa7b1"}},{"arxiv_id":"2210.04251","arxiv_id_is_arxiv":true,"paper":"/paper/state-advantage-weighting-for-offline-rl","title":"State Advantage Weighting for Offline RL","date":"2022-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikostrikov/implicit_q_learning","path":"learner.py","file_url":"https://github.com/ikostrikov/implicit_q_learning/blob/HEAD/learner.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":"87e5a6628edb14db","code_sha256_prefix":"87e5a6628edb14db","mcp_get_code":{"code_sha256":"87e5a6628edb14db"}},{"arxiv_id":"2110.01528","arxiv_id_is_arxiv":true,"paper":"/paper/large-batch-experience-replay","title":"Large Batch Experience Replay","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xavierchanglingli/regularized-optimal-experience-replay","path":"sac_learner.py","file_url":"https://github.com/xavierchanglingli/regularized-optimal-experience-replay/blob/HEAD/sac_learner.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":"e85be23fbac3d092","code_sha256_prefix":"e85be23fbac3d092","mcp_get_code":{"code_sha256":"e85be23fbac3d092"}},{"arxiv_id":"1801.01290","arxiv_id_is_arxiv":true,"paper":"/paper/soft-actor-critic-off-policy-maximum-entropy","title":"Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor","date":"2018-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikostrikov/jax-rl","path":"jaxrl/agents/sac/sac_learner.py","file_url":"https://github.com/ikostrikov/jax-rl/blob/HEAD/jaxrl/agents/sac/sac_learner.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":"f62b5d3c6983e5aa","code_sha256_prefix":"f62b5d3c6983e5aa","mcp_get_code":{"code_sha256":"f62b5d3c6983e5aa"}}],"record_sha256":"4cb7f6fca7d321bef72208f0e3546507997a612f14a02abf75cdf329bb9d09f0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}