{"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/get-flat-params","entry":"get_flat_params","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":5,"n_places_pointer_only_link_open":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2608.02332","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-02332","title":"Diffusion Policy with Behavioral Advantage Correction for Offline Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"aviralkumar2907/CQL","path":"d4rl/rlkit/core/batch_rl_algorithm.py","file_url":"https://github.com/aviralkumar2907/CQL/blob/HEAD/d4rl/rlkit/core/batch_rl_algorithm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, aviralkumar2907/CQL when it was checked","code_sha256":"9b9a51e3e3be7a6e","code_sha256_prefix":"9b9a51e3e3be7a6e","mcp_get_code":{"code_sha256":"9b9a51e3e3be7a6e"}},{"arxiv_id":"2605.14779","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-14779","title":"PENG'S Q(λ) FOR CONSERVATIVE VALUE ESTIMATION IN OFFLINE REINFORCEMENT LEARNING","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hyeon1996/EPQ","path":"rlkit/core/batch_rl_algorithm.py","file_url":"https://github.com/hyeon1996/EPQ/blob/HEAD/rlkit/core/batch_rl_algorithm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, hyeon1996/EPQ when it was checked","code_sha256":"9b9a51e3e3be7a6e","code_sha256_prefix":"9b9a51e3e3be7a6e","mcp_get_code":{"code_sha256":"9b9a51e3e3be7a6e"}},{"arxiv_id":"2311.05067","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-exploration-with-unlabeled-prior-1","title":"Accelerating Exploration with Unlabeled Prior Data","date":"2023-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"avisingh599/cog","path":"rlkit/core/batch_rl_algorithm.py","file_url":"https://github.com/avisingh599/cog/blob/HEAD/rlkit/core/batch_rl_algorithm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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 aviralkumar2907/CQL, and GitHub detected no licence in that repository when it was checked","code_sha256":"9b9a51e3e3be7a6e","code_sha256_prefix":"9b9a51e3e3be7a6e","mcp_get_code":{"code_sha256":"9b9a51e3e3be7a6e"}},{"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":"ikostrikov/cql-results","path":"d4rl/rlkit/core/batch_rl_algorithm.py","file_url":"https://github.com/ikostrikov/cql-results/blob/HEAD/d4rl/rlkit/core/batch_rl_algorithm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from aviralkumar2907/CQL, and GitHub detected no licence in that repository when it was checked","code_sha256":"9b9a51e3e3be7a6e","code_sha256_prefix":"9b9a51e3e3be7a6e","mcp_get_code":{"code_sha256":"9b9a51e3e3be7a6e"}},{"arxiv_id":"1705.10528","arxiv_id_is_arxiv":true,"paper":"/paper/constrained-policy-optimization","title":"Constrained Policy Optimization","date":"2017-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bigpig4396/PyTorch-Constrained-Policy-Optimization-CPO","path":"CPO.py","file_url":"https://github.com/Bigpig4396/PyTorch-Constrained-Policy-Optimization-CPO/blob/HEAD/CPO.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Bigpig4396/PyTorch-Constrained-Policy-Optimization-CPO when it was checked","code_sha256":"f0d38d6259a00367","code_sha256_prefix":"f0d38d6259a00367","mcp_get_code":{"code_sha256":"f0d38d6259a00367"}}],"record_sha256":"38a1882f1e33ed59bd170040024e4e39f6b6fb72c64b9910f76aa566e74541af","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}