{"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/multiple-action-q-function","entry":"multiple_action_q_function","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":5,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":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":"2502.05450","arxiv_id_is_arxiv":true,"paper":"/paper/conrft-a-reinforced-fine-tuning-method-for","title":"ConRFT: A Reinforced Fine-tuning Method for VLA Models via Consistency Policy","date":"2025-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cccedric/conrft","path":"serl_launcher/serl_launcher/networks/actor_critic_nets.py","file_url":"https://github.com/cccedric/conrft/blob/HEAD/serl_launcher/serl_launcher/networks/actor_critic_nets.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":"c3ca7e8bfa98a6a6","code_sha256_prefix":"c3ca7e8bfa98a6a6","mcp_get_code":{"code_sha256":"c3ca7e8bfa98a6a6"}},{"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":"model.py","file_url":"https://github.com/yassineCh/PGS/blob/HEAD/model.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, yassineCh/PGS when it was checked","code_sha256":"d06ff25d52ad20f5","code_sha256_prefix":"d06ff25d52ad20f5","mcp_get_code":{"code_sha256":"d06ff25d52ad20f5"}},{"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_cql/JaxCQL/model.py","file_url":"https://github.com/LeapLabTHU/FamO2O/blob/HEAD/jax_cql/JaxCQL/model.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":"18c566cc009ddb07","code_sha256_prefix":"18c566cc009ddb07","mcp_get_code":{"code_sha256":"18c566cc009ddb07"}},{"arxiv_id":"2303.00957","arxiv_id_is_arxiv":true,"paper":"/paper/preference-transformer-modeling-human","title":"Preference Transformer: Modeling Human Preferences using Transformers for RL","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csmile-1006/preferencetransformer","path":"JaxPref/model.py","file_url":"https://github.com/csmile-1006/preferencetransformer/blob/HEAD/JaxPref/model.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":"18c566cc009ddb07","code_sha256_prefix":"18c566cc009ddb07","mcp_get_code":{"code_sha256":"18c566cc009ddb07"}},{"arxiv_id":"2301.12842","arxiv_id_is_arxiv":true,"paper":"/paper/direct-preference-based-policy-optimization-1","title":"Direct Preference-based Policy Optimization without Reward Modeling","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snu-mllab/DPPO","path":"JaxPref/model.py","file_url":"https://github.com/snu-mllab/DPPO/blob/HEAD/JaxPref/model.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":"18c566cc009ddb07","code_sha256_prefix":"18c566cc009ddb07","mcp_get_code":{"code_sha256":"18c566cc009ddb07"}},{"arxiv_id":"2006.04779","arxiv_id_is_arxiv":true,"paper":"/paper/conservative-q-learning-for-offline","title":"Conservative Q-Learning for Offline Reinforcement Learning","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"young-geng/cql","path":"SimpleSAC/model.py","file_url":"https://github.com/young-geng/cql/blob/HEAD/SimpleSAC/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from yassineCh/PGS, and GitHub detected no licence in that repository when it was checked","code_sha256":"d06ff25d52ad20f5","code_sha256_prefix":"d06ff25d52ad20f5","mcp_get_code":{"code_sha256":"d06ff25d52ad20f5"}},{"arxiv_id":"2006.04779","arxiv_id_is_arxiv":true,"paper":"/paper/conservative-q-learning-for-offline","title":"Conservative Q-Learning for Offline Reinforcement Learning","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"young-geng/jaxcql","path":"JaxCQL/model.py","file_url":"https://github.com/young-geng/jaxcql/blob/HEAD/JaxCQL/model.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":"18c566cc009ddb07","code_sha256_prefix":"18c566cc009ddb07","mcp_get_code":{"code_sha256":"18c566cc009ddb07"}}],"record_sha256":"dc2de60aaa86f34d67882ddd2988d5d4febab5cae751da524952e2092cb30bd9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}