{"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/preprocess-logits-for-metrics","entry":"preprocess_logits_for_metrics","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":13,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":2,"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":10,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":7,"n_places":17,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":5,"unverified":2},"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":"2601.02531","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02531","title":"Losses that Cook: Topological Optimal Transport for Structured Recipe Generation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"DarthReca/losses-cook","path":"improved_loss.py","file_url":"https://github.com/DarthReca/losses-cook/blob/HEAD/improved_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db0916f0450c26db","code_sha256_prefix":"db0916f0450c26db","mcp_get_code":{"code_sha256":"db0916f0450c26db"}},{"arxiv_id":"2503.20047","arxiv_id_is_arxiv":true,"paper":"/paper/med3dvlm-an-efficient-vision-language-model","title":"Med3DVLM: An Efficient Vision-Language Model for 3D Medical Image Analysis","date":"2025-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mirthai/med3dvlm","path":"src/train/train_vlm.py","file_url":"https://github.com/mirthai/med3dvlm/blob/HEAD/src/train/train_vlm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0b66a8919774c46f","code_sha256_prefix":"0b66a8919774c46f","mcp_get_code":{"code_sha256":"0b66a8919774c46f"}},{"arxiv_id":"2503.20047","arxiv_id_is_arxiv":true,"paper":"/paper/med3dvlm-an-efficient-vision-language-model","title":"Med3DVLM: An Efficient Vision-Language Model for 3D Medical Image Analysis","date":"2025-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mirthai/med3dvlm","path":"src/train/train_clip.py","file_url":"https://github.com/mirthai/med3dvlm/blob/HEAD/src/train/train_clip.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"796e2d1861bc5152","code_sha256_prefix":"796e2d1861bc5152","mcp_get_code":{"code_sha256":"796e2d1861bc5152"}},{"arxiv_id":"2410.09671","arxiv_id_is_arxiv":true,"paper":"/paper/openr-an-open-source-framework-for-advanced","title":"OpenR: An Open Source Framework for Advanced Reasoning with Large Language Models","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openreasoner/openr","path":"prm/code/finetune_math_shep.py","file_url":"https://github.com/openreasoner/openr/blob/HEAD/prm/code/finetune_math_shep.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":"52f2677707a05132","code_sha256_prefix":"52f2677707a05132","mcp_get_code":{"code_sha256":"52f2677707a05132"}},{"arxiv_id":"2409.07088","arxiv_id_is_arxiv":true,"paper":"/paper/ontology-free-general-domain-knowledge-graph","title":"Ontology-Free General-Domain Knowledge Graph-to-Text Generation Dataset Synthesis using Large Language Model","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daehuikim/WikiOFGraph","path":"experiments/t5_trainer.py","file_url":"https://github.com/daehuikim/WikiOFGraph/blob/HEAD/experiments/t5_trainer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, daehuikim/WikiOFGraph when it was checked","code_sha256":"d2895bdf14e8f94f","code_sha256_prefix":"d2895bdf14e8f94f","mcp_get_code":{"code_sha256":"d2895bdf14e8f94f"}},{"arxiv_id":"2406.12038","arxiv_id_is_arxiv":true,"paper":"/paper/soft-prompting-for-unlearning-in-large","title":"Soft Prompting for Unlearning in Large Language Models","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karuna-bhaila/llm_unlearning","path":"utils.py","file_url":"https://github.com/karuna-bhaila/llm_unlearning/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, karuna-bhaila/llm_unlearning when it was checked","code_sha256":"d2895bdf14e8f94f","code_sha256_prefix":"d2895bdf14e8f94f","mcp_get_code":{"code_sha256":"d2895bdf14e8f94f"}},{"arxiv_id":"2405.16325","arxiv_id_is_arxiv":true,"paper":"/paper/slope-double-pruned-sparse-plus-lazy-low-rank","title":"SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMs","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Mohammad-Mozaffari/slope","path":"inference.py","file_url":"https://github.com/Mohammad-Mozaffari/slope/blob/HEAD/inference.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Mohammad-Mozaffari/slope when it was checked","code_sha256":"d2895bdf14e8f94f","code_sha256_prefix":"d2895bdf14e8f94f","mcp_get_code":{"code_sha256":"d2895bdf14e8f94f"}},{"arxiv_id":"2403.07691","arxiv_id_is_arxiv":true,"paper":"/paper/reference-free-monolithic-preference","title":"ORPO: Monolithic Preference Optimization without Reference Model","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xfactlab/orpo","path":"src/utils.py","file_url":"https://github.com/xfactlab/orpo/blob/HEAD/src/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2895bdf14e8f94f","code_sha256_prefix":"d2895bdf14e8f94f","mcp_get_code":{"code_sha256":"d2895bdf14e8f94f"}},{"arxiv_id":"2310.17230","arxiv_id_is_arxiv":true,"paper":"/paper/codebook-features-sparse-and-discrete","title":"Codebook Features: Sparse and Discrete Interpretability for Neural Networks","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taufeeque9/codebook-features","path":"codebook_features/run_clm.py","file_url":"https://github.com/taufeeque9/codebook-features/blob/HEAD/codebook_features/run_clm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2895bdf14e8f94f","code_sha256_prefix":"d2895bdf14e8f94f","mcp_get_code":{"code_sha256":"d2895bdf14e8f94f"}},{"arxiv_id":"2310.09089","arxiv_id_is_arxiv":true,"paper":"/paper/qilin-med-multi-stage-knowledge-injection","title":"Qilin-Med: Multi-stage Knowledge Injection Advanced Medical Large Language Model","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d2895bdf14e8f94f","code_sha256_prefix":"d2895bdf14e8f94f","mcp_get_code":{"code_sha256":"d2895bdf14e8f94f"}},{"arxiv_id":"2310.02743","arxiv_id_is_arxiv":true,"paper":"/paper/reward-model-ensembles-help-mitigate","title":"Reward Model Ensembles Help Mitigate Overoptimization","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tlc4418/llm_optimization","path":"src/sft/trainer_sft.py","file_url":"https://github.com/tlc4418/llm_optimization/blob/HEAD/src/sft/trainer_sft.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0b66a8919774c46f","code_sha256_prefix":"0b66a8919774c46f","mcp_get_code":{"code_sha256":"0b66a8919774c46f"}},{"arxiv_id":"2309.16119","arxiv_id_is_arxiv":true,"paper":"/paper/modulora-finetuning-3-bit-llms-on-consumer","title":"ModuLoRA: Finetuning 2-Bit LLMs on Consumer GPUs by Integrating with Modular Quantizers","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/modulora-experiment","path":"finetune/samsum-llama/train_samsum_4bit.py","file_url":"https://github.com/kuleshov-group/modulora-experiment/blob/HEAD/finetune/samsum-llama/train_samsum_4bit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bd72bc50b587388e","code_sha256_prefix":"bd72bc50b587388e","mcp_get_code":{"code_sha256":"bd72bc50b587388e"}},{"arxiv_id":"2308.11131","arxiv_id_is_arxiv":true,"paper":"/paper/rella-retrieval-enhanced-large-language","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavieenrose365/rella","path":"finetune.py","file_url":"https://github.com/lavieenrose365/rella/blob/HEAD/finetune.py","status":"ran","verification_level":1,"contract_check":null,"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, lavieenrose365/rella when it was checked","code_sha256":"82d07bd787abe764","code_sha256_prefix":"82d07bd787abe764","mcp_get_code":{"code_sha256":"82d07bd787abe764"}},{"arxiv_id":"2308.11131","arxiv_id_is_arxiv":true,"paper":"/paper/rella-retrieval-enhanced-large-language","title":"ReLLa: Retrieval-enhanced Large Language Models for Lifelong Sequential Behavior Comprehension in Recommendation","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lavieenrose365/rella","path":"inference.py","file_url":"https://github.com/lavieenrose365/rella/blob/HEAD/inference.py","status":"ran","verification_level":1,"contract_check":null,"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, lavieenrose365/rella when it was checked","code_sha256":"28989ed2d784c752","code_sha256_prefix":"28989ed2d784c752","mcp_get_code":{"code_sha256":"28989ed2d784c752"}},{"arxiv_id":"2304.08177","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-effective-text-encoding-for","title":"Efficient and Effective Text Encoding for Chinese LLaMA and Alpaca","date":"2023-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ymcui/chinese-llama-alpaca","path":"scripts/training/run_clm_pt_with_peft.py","file_url":"https://github.com/ymcui/chinese-llama-alpaca/blob/HEAD/scripts/training/run_clm_pt_with_peft.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2895bdf14e8f94f","code_sha256_prefix":"d2895bdf14e8f94f","mcp_get_code":{"code_sha256":"d2895bdf14e8f94f"}},{"arxiv_id":"2010.11934","arxiv_id_is_arxiv":true,"paper":"/paper/mt5-a-massively-multilingual-pre-trained-text","title":"mT5: A massively multilingual pre-trained text-to-text transformer","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MorenoLaQuatra/bart-it","path":"summarization/finetune_summarization.py","file_url":"https://github.com/MorenoLaQuatra/bart-it/blob/HEAD/summarization/finetune_summarization.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2641f706223d1e5c","code_sha256_prefix":"2641f706223d1e5c","mcp_get_code":{"code_sha256":"2641f706223d1e5c"}},{"arxiv_id":"2024.findings-naacl.117","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-naacl.117","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"qqplot/dcpmi","path":"utils/utils.py","file_url":"https://github.com/qqplot/dcpmi/blob/HEAD/utils/utils.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":"22f5005ada1d6126","code_sha256_prefix":"22f5005ada1d6126","mcp_get_code":{"code_sha256":"22f5005ada1d6126"}}],"record_sha256":"e53d937854a4a3e402206f42a0924a88c1e67dcc8b59b9e6c0f5c2b824185203","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}