{"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/make-supervised-data-module","entry":"make_supervised_data_module","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":15,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":16,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":9,"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":3,"ran_fixture":0,"ran":4,"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.22064","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-22064","title":"Hy-MT2: A Family of Fast, Efficient and Powerful Multilingual Translation Models in the Wild","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Tencent-Hunyuan/Hy-MT2","path":"train/deepspeed_support/train_dense.py","file_url":"https://github.com/Tencent-Hunyuan/Hy-MT2/blob/HEAD/train/deepspeed_support/train_dense.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Tencent-Hunyuan/Hy-MT2 (NOASSERTION)","code_sha256":"8b6d74672adf8116","code_sha256_prefix":"8b6d74672adf8116","mcp_get_code":{"code_sha256":"8b6d74672adf8116"}},{"arxiv_id":"2412.11803","arxiv_id_is_arxiv":true,"paper":"/paper/ualign-leveraging-uncertainty-estimations-for","title":"UAlign: Leveraging Uncertainty Estimations for Factuality Alignment on Large Language Models","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amourwaltz/ualign","path":"code/train_sft.py","file_url":"https://github.com/amourwaltz/ualign/blob/HEAD/code/train_sft.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, amourwaltz/ualign when it was checked","code_sha256":"91592110883e0f36","code_sha256_prefix":"91592110883e0f36","mcp_get_code":{"code_sha256":"91592110883e0f36"}},{"arxiv_id":"2406.12606","arxiv_id_is_arxiv":true,"paper":"/paper/low-redundant-optimization-for-large-language","title":"Not Everything is All You Need: Toward Low-Redundant Optimization for Large Language Model Alignment","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RUCAIBox/ALLO","path":"train/train_forgetting.py","file_url":"https://github.com/RUCAIBox/ALLO/blob/HEAD/train/train_forgetting.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, RUCAIBox/ALLO when it was checked","code_sha256":"91ce4c9d4d225664","code_sha256_prefix":"91ce4c9d4d225664","mcp_get_code":{"code_sha256":"91ce4c9d4d225664"}},{"arxiv_id":"2406.02395","arxiv_id_is_arxiv":true,"paper":"/paper/grootvl-tree-topology-is-all-you-need-in","title":"GrootVL: Tree Topology is All You Need in State Space Model","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"easonxiao-888/grootvl","path":"GrootL/supervised-fine-tune.py","file_url":"https://github.com/easonxiao-888/grootvl/blob/HEAD/GrootL/supervised-fine-tune.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, easonxiao-888/grootvl when it was checked","code_sha256":"160d2ba1cce9321e","code_sha256_prefix":"160d2ba1cce9321e","mcp_get_code":{"code_sha256":"160d2ba1cce9321e"}},{"arxiv_id":"2405.13516","arxiv_id_is_arxiv":true,"paper":"/paper/lire-listwise-reward-enhancement-for","title":"LIRE: listwise reward enhancement for preference alignment","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevie1023/LIRE","path":"train_alpaca_prompt.py","file_url":"https://github.com/stevie1023/LIRE/blob/HEAD/train_alpaca_prompt.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, stevie1023/LIRE when it was checked","code_sha256":"ce6dbeeae3d77963","code_sha256_prefix":"ce6dbeeae3d77963","mcp_get_code":{"code_sha256":"ce6dbeeae3d77963"}},{"arxiv_id":"2405.06680","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-compositional-deficiency-of","title":"Exploring the Compositional Deficiency of Large Language Models in Mathematical Reasoning","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tongjingqi/MathTrap","path":"train_math.py","file_url":"https://github.com/tongjingqi/MathTrap/blob/HEAD/train_math.py","status":"unverified","verification_level":0,"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":"abbd983f4f37a1d5","code_sha256_prefix":"abbd983f4f37a1d5","mcp_get_code":{"code_sha256":"abbd983f4f37a1d5"}},{"arxiv_id":"2402.09773","arxiv_id_is_arxiv":true,"paper":"/paper/nuteprune-efficient-progressive-pruning-with","title":"NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Models","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucius-lsr/nuteprune","path":"tasks/alpaca.py","file_url":"https://github.com/lucius-lsr/nuteprune/blob/HEAD/tasks/alpaca.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, lucius-lsr/nuteprune when it was checked","code_sha256":"fb1bfd591bf0af2f","code_sha256_prefix":"fb1bfd591bf0af2f","mcp_get_code":{"code_sha256":"fb1bfd591bf0af2f"}},{"arxiv_id":"2401.06081","arxiv_id_is_arxiv":true,"paper":"/paper/improving-large-language-models-via-fine","title":"Improving Large Language Models via Fine-grained Reinforcement Learning with Minimum Editing Constraint","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/rlmec","path":"train/train_rlmec.py","file_url":"https://github.com/rucaibox/rlmec/blob/HEAD/train/train_rlmec.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, rucaibox/rlmec when it was checked","code_sha256":"b8f34728ae55b7f1","code_sha256_prefix":"b8f34728ae55b7f1","mcp_get_code":{"code_sha256":"b8f34728ae55b7f1"}},{"arxiv_id":"2401.06081","arxiv_id_is_arxiv":true,"paper":"/paper/improving-large-language-models-via-fine","title":"Improving Large Language Models via Fine-grained Reinforcement Learning with Minimum Editing Constraint","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/rlmec","path":"train/train_grm.py","file_url":"https://github.com/rucaibox/rlmec/blob/HEAD/train/train_grm.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, rucaibox/rlmec when it was checked","code_sha256":"de9a14e89b96dd62","code_sha256_prefix":"de9a14e89b96dd62","mcp_get_code":{"code_sha256":"de9a14e89b96dd62"}},{"arxiv_id":"2310.11511","arxiv_id_is_arxiv":true,"paper":"/paper/self-rag-learning-to-retrieve-generate-and","title":"Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AkariAsai/self-rag","path":"data_creation/train_special_tokens.py","file_url":"https://github.com/AkariAsai/self-rag/blob/HEAD/data_creation/train_special_tokens.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":"c22fc64f9f9730e4","code_sha256_prefix":"c22fc64f9f9730e4","mcp_get_code":{"code_sha256":"c22fc64f9f9730e4"}},{"arxiv_id":"2309.12307","arxiv_id_is_arxiv":true,"paper":"/paper/longlora-efficient-fine-tuning-of-long","title":"LongLoRA: Efficient Fine-tuning of Long-Context Large Language Models","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/longlora","path":"supervised-fine-tune-qlora.py","file_url":"https://github.com/dvlab-research/longlora/blob/HEAD/supervised-fine-tune-qlora.py","status":"unverified","verification_level":0,"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":"fa5531158d53f0a8","code_sha256_prefix":"fa5531158d53f0a8","mcp_get_code":{"code_sha256":"fa5531158d53f0a8"}},{"arxiv_id":"2308.07286","arxiv_id_is_arxiv":true,"paper":"/paper/the-devil-is-in-the-errors-leveraging-large","title":"The Devil is in the Errors: Leveraging Large Language Models for Fine-grained Machine Translation Evaluation","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuuhuang/lost_in_the_src","path":"automqm/finetune_llama.py","file_url":"https://github.com/xuuhuang/lost_in_the_src/blob/HEAD/automqm/finetune_llama.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":"78553e11ab537e05","code_sha256_prefix":"78553e11ab537e05","mcp_get_code":{"code_sha256":"78553e11ab537e05"}},{"arxiv_id":"2308.06744","arxiv_id_is_arxiv":true,"paper":"/paper/token-scaled-logit-distillation-for-ternary-1","title":"Token-Scaled Logit Distillation for Ternary Weight Generative Language Models","date":"2023-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiha-lab/TSLD","path":"utils/alpaca_dataset.py","file_url":"https://github.com/aiha-lab/TSLD/blob/HEAD/utils/alpaca_dataset.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, aiha-lab/TSLD when it was checked","code_sha256":"2252427ecd077946","code_sha256_prefix":"2252427ecd077946","mcp_get_code":{"code_sha256":"2252427ecd077946"}},{"arxiv_id":"2308.06259","arxiv_id_is_arxiv":true,"paper":"/paper/self-alignment-with-instruction","title":"Self-Alignment with Instruction Backtranslation","date":"2023-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidkim205/komt","path":"finetune_with_ds.py","file_url":"https://github.com/davidkim205/komt/blob/HEAD/finetune_with_ds.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":"a1d411d9b429c882","code_sha256_prefix":"a1d411d9b429c882","mcp_get_code":{"code_sha256":"a1d411d9b429c882"}},{"arxiv_id":"2305.13829","arxiv_id_is_arxiv":true,"paper":"/paper/learn-from-mistakes-through-cooperative","title":"Learning from Mistakes via Cooperative Study Assistant for Large Language Models","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dqwang122/salam","path":"src/finetune.py","file_url":"https://github.com/dqwang122/salam/blob/HEAD/src/finetune.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":"a14da09015edfc5a","code_sha256_prefix":"a14da09015edfc5a","mcp_get_code":{"code_sha256":"a14da09015edfc5a"}},{"arxiv_id":"aaai_34662","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_34662","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"maxindian/3D-RPE-Long-Contex-Modeling","path":"fine-tune-cpe-chat2.py","file_url":"https://github.com/maxindian/3D-RPE-Long-Contex-Modeling/blob/HEAD/fine-tune-cpe-chat2.py","status":"unverified","verification_level":0,"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":"82630496d35e1055","code_sha256_prefix":"82630496d35e1055","mcp_get_code":{"code_sha256":"82630496d35e1055"}}],"record_sha256":"6284b16acecd0bdbeb82a60e4ca3203ab3bf2a632747bbeb8066f15dd16b2025","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}