{"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-train-ds-config","entry":"get_train_ds_config","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":9,"n_papers_ran_no_instrument_failure":9,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"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":0,"ran_fixture":0,"ran":7,"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":"2410.07471","arxiv_id_is_arxiv":true,"paper":"/paper/seal-safety-enhanced-aligned-llm-fine-tuning","title":"SEAL: Safety-enhanced Aligned LLM Fine-tuning via Bilevel Data Selection","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanshen95/seal","path":"seal/utils/deepspeed_utils.py","file_url":"https://github.com/hanshen95/seal/blob/HEAD/seal/utils/deepspeed_utils.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":"05904ae9639815b8","code_sha256_prefix":"05904ae9639815b8","mcp_get_code":{"code_sha256":"05904ae9639815b8"}},{"arxiv_id":"2408.12109","arxiv_id_is_arxiv":true,"paper":"/paper/rovrm-a-robust-visual-reward-model-optimized","title":"RoVRM: A Robust Visual Reward Model Optimized via Auxiliary Textual Preference Data","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangclnlp/vision-llm-alignment","path":"training/utils/ds_utils.py","file_url":"https://github.com/wangclnlp/vision-llm-alignment/blob/HEAD/training/utils/ds_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, wangclnlp/vision-llm-alignment when it was checked","code_sha256":"9d10b3b5c4e7a742","code_sha256_prefix":"9d10b3b5c4e7a742","mcp_get_code":{"code_sha256":"9d10b3b5c4e7a742"}},{"arxiv_id":"2406.08434","arxiv_id_is_arxiv":true,"paper":"/paper/taste-teaching-large-language-models-to","title":"TasTe: Teaching Large Language Models to Translate through Self-Reflection","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yutongwang1216/reflectionllmmt","path":"train/trainer/utils/ds_utils.py","file_url":"https://github.com/yutongwang1216/reflectionllmmt/blob/HEAD/train/trainer/utils/ds_utils.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":"bc9a14cb2f220424","code_sha256_prefix":"bc9a14cb2f220424","mcp_get_code":{"code_sha256":"bc9a14cb2f220424"}},{"arxiv_id":"2405.07667","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-removal-for-generative-large","title":"Simulate and Eliminate: Revoke Backdoors for Generative Large Language Models","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/SANDE","path":"deepspeed_utils.py","file_url":"https://github.com/HKUST-KnowComp/SANDE/blob/HEAD/deepspeed_utils.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":"05904ae9639815b8","code_sha256_prefix":"05904ae9639815b8","mcp_get_code":{"code_sha256":"05904ae9639815b8"}},{"arxiv_id":"2402.18150","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-information-refinement-training","title":"Unsupervised Information Refinement Training of Large Language Models for Retrieval-Augmented Generation","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xsc1234/info-rag","path":"utils/ds_utils.py","file_url":"https://github.com/xsc1234/info-rag/blob/HEAD/utils/ds_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, xsc1234/info-rag when it was checked","code_sha256":"0b7ef7574493a1eb","code_sha256_prefix":"0b7ef7574493a1eb","mcp_get_code":{"code_sha256":"0b7ef7574493a1eb"}},{"arxiv_id":"2402.14700","arxiv_id_is_arxiv":true,"paper":"/paper/unveiling-linguistic-regions-in-large","title":"Unveiling Linguistic Regions in Large Language Models","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzhang0179/Unveiling-Linguistic-Regions-in-LLMs","path":"training/utils/ds_utils.py","file_url":"https://github.com/zzhang0179/Unveiling-Linguistic-Regions-in-LLMs/blob/HEAD/training/utils/ds_utils.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":"86613110e9a3611b","code_sha256_prefix":"86613110e9a3611b","mcp_get_code":{"code_sha256":"86613110e9a3611b"}},{"arxiv_id":"2310.20246","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-language-barriers-in-multilingual","title":"Breaking Language Barriers in Multilingual Mathematical Reasoning: Insights and Observations","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/MathOctopus","path":"utils/ds_utils.py","file_url":"https://github.com/microsoft/MathOctopus/blob/HEAD/utils/ds_utils.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":"311aba0a9b717df8","code_sha256_prefix":"311aba0a9b717df8","mcp_get_code":{"code_sha256":"311aba0a9b717df8"}},{"arxiv_id":"2308.02223","arxiv_id_is_arxiv":true,"paper":"/paper/esrl-efficient-sampling-based-reinforcement","title":"ESRL: Efficient Sampling-based Reinforcement Learning for Sequence Generation","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangclnlp/DeepSpeed-Chat-Extension","path":"rlhf_llama/deepspeed_chat/training/utils/ds_utils.py","file_url":"https://github.com/wangclnlp/DeepSpeed-Chat-Extension/blob/HEAD/rlhf_llama/deepspeed_chat/training/utils/ds_utils.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":"0d4552e23174dc98","code_sha256_prefix":"0d4552e23174dc98","mcp_get_code":{"code_sha256":"0d4552e23174dc98"}},{"arxiv_id":"2024.naacl-long.326","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.naacl-long.326","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LanXiu0523/RLHF_instructGPT","path":"applications/utils/ds_utils.py","file_url":"https://github.com/LanXiu0523/RLHF_instructGPT/blob/HEAD/applications/utils/ds_utils.py","status":"ran","verification_level":1,"contract_check":null,"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 xsc1234/info-rag, and GitHub detected no licence in that repository when it was checked","code_sha256":"0b7ef7574493a1eb","code_sha256_prefix":"0b7ef7574493a1eb","mcp_get_code":{"code_sha256":"0b7ef7574493a1eb"}}],"record_sha256":"469001c8417c5fe953fe8faa050d0adce8a595950ae07f5c774a6bcbd8e940b1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}