{"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/extend-and-repeat","entry":"extend_and_repeat","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":5,"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":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":11,"n_places_pointer_only_link_open":7,"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":2,"ran_fixture":0,"ran":1,"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":"2412.18855","arxiv_id_is_arxiv":true,"paper":"/paper/optimistic-critic-reconstruction-and","title":"Optimistic Critic Reconstruction and Constrained Fine-Tuning for General Offline-to-Online RL","date":"2024-12-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"QinwenLuo/OCR-CFT","path":"net.py","file_url":"https://github.com/QinwenLuo/OCR-CFT/blob/HEAD/net.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, QinwenLuo/OCR-CFT when it was checked","code_sha256":"a4d39c2adb56e8ce","code_sha256_prefix":"a4d39c2adb56e8ce","mcp_get_code":{"code_sha256":"a4d39c2adb56e8ce"}},{"arxiv_id":"2405.16907","arxiv_id_is_arxiv":true,"paper":"/paper/gta-generative-trajectory-augmentation-with","title":"GTA: Generative Trajectory Augmentation with Guidance for Offline Reinforcement Learning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jaewoopudding/GTA","path":"corl/algorithms/cql.py","file_url":"https://github.com/Jaewoopudding/GTA/blob/HEAD/corl/algorithms/cql.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 QinwenLuo/OCR-CFT, and GitHub detected no licence in that repository when it was checked","code_sha256":"a4d39c2adb56e8ce","code_sha256_prefix":"a4d39c2adb56e8ce","mcp_get_code":{"code_sha256":"a4d39c2adb56e8ce"}},{"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":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"1e5f5f635bdf773a","code_sha256_prefix":"1e5f5f635bdf773a","mcp_get_code":{"code_sha256":"1e5f5f635bdf773a"}},{"arxiv_id":"2310.08558","arxiv_id_is_arxiv":true,"paper":"/paper/offline-retraining-for-online-rl-decoupled","title":"Offline Retraining for Online RL: Decoupled Policy Learning to Mitigate Exploration Bias","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MaxSobolMark/OOO","path":"OOO_for_calql/jax_utils.py","file_url":"https://github.com/MaxSobolMark/OOO/blob/HEAD/OOO_for_calql/jax_utils.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, MaxSobolMark/OOO when it was checked","code_sha256":"d2f199c948f2a9ed","code_sha256_prefix":"d2f199c948f2a9ed","mcp_get_code":{"code_sha256":"d2f199c948f2a9ed"}},{"arxiv_id":"2309.10790","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2309.10790","date":null,"month_inferred_from_arxiv_id":"2023-09","title_source":null,"repo":"csmile-1006/ARP","path":"arp_dt/utils.py","file_url":"https://github.com/csmile-1006/ARP/blob/HEAD/arp_dt/utils.py","status":"ran","verification_level":1,"contract_check":null,"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 MaxSobolMark/OOO, and GitHub detected no licence in that repository when it was checked","code_sha256":"d2f199c948f2a9ed","code_sha256_prefix":"d2f199c948f2a9ed","mcp_get_code":{"code_sha256":"d2f199c948f2a9ed"}},{"arxiv_id":"2210.13431","arxiv_id_is_arxiv":true,"paper":"/paper/instruction-following-agents-with-jointly-pre","title":"Instruction-Following Agents with Multimodal Transformer","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhao499/instructrl","path":"instructrl/utils.py","file_url":"https://github.com/lhao499/instructrl/blob/HEAD/instructrl/utils.py","status":"ran","verification_level":1,"contract_check":null,"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 MaxSobolMark/OOO, and GitHub detected no licence in that repository when it was checked","code_sha256":"d2f199c948f2a9ed","code_sha256_prefix":"d2f199c948f2a9ed","mcp_get_code":{"code_sha256":"d2f199c948f2a9ed"}},{"arxiv_id":"2210.07484","arxiv_id_is_arxiv":true,"paper":"/paper/mutual-information-regularized-offline-1","title":"Mutual Information Regularized Offline Reinforcement Learning","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/MISA","path":"utilities/jax_utils.py","file_url":"https://github.com/sail-sg/MISA/blob/HEAD/utilities/jax_utils.py","status":"ran","verification_level":1,"contract_check":null,"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 MaxSobolMark/OOO, and GitHub detected no licence in that repository when it was checked","code_sha256":"d2f199c948f2a9ed","code_sha256_prefix":"d2f199c948f2a9ed","mcp_get_code":{"code_sha256":"d2f199c948f2a9ed"}},{"arxiv_id":"2210.06518","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-offline-reinforcement-1","title":"Semi-Supervised Offline Reinforcement Learning with Action-Free Trajectories","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scottemmons/youngs-cql","path":"SimpleSAC/model.py","file_url":"https://github.com/scottemmons/youngs-cql/blob/HEAD/SimpleSAC/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 zexusun/oilca-neurips23, and GitHub detected no licence in that repository when it was checked","code_sha256":"1e5f5f635bdf773a","code_sha256_prefix":"1e5f5f635bdf773a","mcp_get_code":{"code_sha256":"1e5f5f635bdf773a"}},{"arxiv_id":"2207.10050","arxiv_id_is_arxiv":true,"paper":"/paper/discriminator-weighted-offline-imitation-1","title":"Discriminator-Weighted Offline Imitation Learning from Suboptimal Demonstrations","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zexusun/oilca-neurips23","path":"algos/augment_DWBC.py","file_url":"https://github.com/zexusun/oilca-neurips23/blob/HEAD/algos/augment_DWBC.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zexusun/oilca-neurips23 when it was checked","code_sha256":"1e5f5f635bdf773a","code_sha256_prefix":"1e5f5f635bdf773a","mcp_get_code":{"code_sha256":"1e5f5f635bdf773a"}},{"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":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 zexusun/oilca-neurips23, and GitHub detected no licence in that repository when it was checked","code_sha256":"1e5f5f635bdf773a","code_sha256_prefix":"1e5f5f635bdf773a","mcp_get_code":{"code_sha256":"1e5f5f635bdf773a"}},{"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/jax_utils.py","file_url":"https://github.com/young-geng/jaxcql/blob/HEAD/JaxCQL/jax_utils.py","status":"ran","verification_level":1,"contract_check":null,"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 MaxSobolMark/OOO, and GitHub detected no licence in that repository when it was checked","code_sha256":"d2f199c948f2a9ed","code_sha256_prefix":"d2f199c948f2a9ed","mcp_get_code":{"code_sha256":"d2f199c948f2a9ed"}}],"record_sha256":"b66d5683f6ab3026dd466e6c609df24837ec567f2a4efab69298ca04706d751b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}