{"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/write-model","entry":"write_model","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":0,"n_papers_ran_no_instrument_failure":0,"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":11,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":11,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":11,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":11},"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":"2503.06881","arxiv_id_is_arxiv":true,"paper":"/paper/resmoe-space-efficient-compression-of-mixture","title":"ResMoE: Space-efficient Compression of Mixture of Experts LLMs via Residual Restoration","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-isail-lab-uiuc/resmoe","path":"mixtral/resmoe_mixtral/convert_mixtral_weights_to_hf.py","file_url":"https://github.com/idea-isail-lab-uiuc/resmoe/blob/HEAD/mixtral/resmoe_mixtral/convert_mixtral_weights_to_hf.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":"ee2001e1c7496dc4","code_sha256_prefix":"ee2001e1c7496dc4","mcp_get_code":{"code_sha256":"ee2001e1c7496dc4"}},{"arxiv_id":"2410.02184","arxiv_id_is_arxiv":true,"paper":"/paper/codejudge-evaluating-code-generation-with","title":"CodeJudge: Evaluating Code Generation with Large Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VichyTong/CodeJudge","path":"evaluation/model/convert_llama_weights_to_hf.py","file_url":"https://github.com/VichyTong/CodeJudge/blob/HEAD/evaluation/model/convert_llama_weights_to_hf.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":"5f56e1f4e5b6ba8c","code_sha256_prefix":"5f56e1f4e5b6ba8c","mcp_get_code":{"code_sha256":"5f56e1f4e5b6ba8c"}},{"arxiv_id":"2409.17504","arxiv_id_is_arxiv":true,"paper":"/paper/haloscope-harnessing-unlabeled-llm","title":"HaloScope: Harnessing Unlabeled LLM Generations for Hallucination Detection","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deeplearning-wisc/haloscope","path":"llama_iti/convert_llama_weights_to_hf.py","file_url":"https://github.com/deeplearning-wisc/haloscope/blob/HEAD/llama_iti/convert_llama_weights_to_hf.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, deeplearning-wisc/haloscope when it was checked","code_sha256":"4681d3d61616d9e0","code_sha256_prefix":"4681d3d61616d9e0","mcp_get_code":{"code_sha256":"4681d3d61616d9e0"}},{"arxiv_id":"2406.18200","arxiv_id_is_arxiv":true,"paper":"/paper/seed-accelerating-reasoning-tree-construction","title":"SEED: Accelerating Reasoning Tree Construction via Scheduled Speculative Decoding","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Linking-ai/SEED","path":"src/llama_tree_attn/convert_llama_weights_to_hf.py","file_url":"https://github.com/Linking-ai/SEED/blob/HEAD/src/llama_tree_attn/convert_llama_weights_to_hf.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, Linking-ai/SEED when it was checked","code_sha256":"731285361b7dea0e","code_sha256_prefix":"731285361b7dea0e","mcp_get_code":{"code_sha256":"731285361b7dea0e"}},{"arxiv_id":"2406.05317","arxiv_id_is_arxiv":true,"paper":"/paper/lococo-dropping-in-convolutions-for-long","title":"LoCoCo: Dropping In Convolutions for Long Context Compression","date":"2024-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/LoCoCo","path":"llama/convert_llama_weights_to_hf.py","file_url":"https://github.com/VITA-Group/LoCoCo/blob/HEAD/llama/convert_llama_weights_to_hf.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, VITA-Group/LoCoCo when it was checked","code_sha256":"b91ba72f3b013e76","code_sha256_prefix":"b91ba72f3b013e76","mcp_get_code":{"code_sha256":"b91ba72f3b013e76"}},{"arxiv_id":"2405.19298","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-image-quality-assessment-via","title":"Adaptive Image Quality Assessment via Teaching Large Multimodal Model to Compare","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Q-Future/Compare2Score","path":"q_align/model/convert_mplug_owl2_weight_to_hf.py","file_url":"https://github.com/Q-Future/Compare2Score/blob/HEAD/q_align/model/convert_mplug_owl2_weight_to_hf.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":"c40b2d63fc02cac4","code_sha256_prefix":"c40b2d63fc02cac4","mcp_get_code":{"code_sha256":"c40b2d63fc02cac4"}},{"arxiv_id":"2405.13053","arxiv_id_is_arxiv":true,"paper":"/paper/meteora-multiple-tasks-embedded-lora-for","title":"MeteoRA: Multiple-tasks Embedded LoRA for Large Language Models","date":"2024-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paragonlight/meteor-of-lora","path":"base_model/llama/convert_llama_meteor_weights_to_hf.py","file_url":"https://github.com/paragonlight/meteor-of-lora/blob/HEAD/base_model/llama/convert_llama_meteor_weights_to_hf.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, paragonlight/meteor-of-lora when it was checked","code_sha256":"b91ba72f3b013e76","code_sha256_prefix":"b91ba72f3b013e76","mcp_get_code":{"code_sha256":"b91ba72f3b013e76"}},{"arxiv_id":"2404.03196","arxiv_id_is_arxiv":true,"paper":"/paper/okay-let-s-do-this-modeling-event-coreference","title":"Okay, Let's Do This! Modeling Event Coreference with Generated Rationales and Knowledge Distillation","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csu-signal/llama_cdcr","path":"convert_llama_weights_to_hf.py","file_url":"https://github.com/csu-signal/llama_cdcr/blob/HEAD/convert_llama_weights_to_hf.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, csu-signal/llama_cdcr when it was checked","code_sha256":"4b597d1b6e00be58","code_sha256_prefix":"4b597d1b6e00be58","mcp_get_code":{"code_sha256":"4b597d1b6e00be58"}},{"arxiv_id":"2402.16061","arxiv_id_is_arxiv":true,"paper":"/paper/how-large-language-models-encode-context","title":"How Large Language Models Encode Context Knowledge? A Layer-Wise Probing Study","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jometeorie/probing_llama","path":"code/llama/convert_llama_weights_to_hf.py","file_url":"https://github.com/jometeorie/probing_llama/blob/HEAD/code/llama/convert_llama_weights_to_hf.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, jometeorie/probing_llama when it was checked","code_sha256":"731285361b7dea0e","code_sha256_prefix":"731285361b7dea0e","mcp_get_code":{"code_sha256":"731285361b7dea0e"}},{"arxiv_id":"2402.16061","arxiv_id_is_arxiv":true,"paper":"/paper/how-large-language-models-encode-context","title":"How Large Language Models Encode Context Knowledge? A Layer-Wise Probing Study","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jometeorie/probing_llama","path":"code/custom_llama/convert_llama_weights_to_hf.py","file_url":"https://github.com/jometeorie/probing_llama/blob/HEAD/code/custom_llama/convert_llama_weights_to_hf.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, jometeorie/probing_llama when it was checked","code_sha256":"cfeea96bf995824a","code_sha256_prefix":"cfeea96bf995824a","mcp_get_code":{"code_sha256":"cfeea96bf995824a"}},{"arxiv_id":"2402.01618","arxiv_id_is_arxiv":true,"paper":"/paper/style-vectors-for-steering-generative-large","title":"Style Vectors for Steering Generative Large Language Model","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dlr-sc/style-vectors-for-steering-llms","path":"utils/convert_llama_weights_to_hf.py","file_url":"https://github.com/dlr-sc/style-vectors-for-steering-llms/blob/HEAD/utils/convert_llama_weights_to_hf.py","status":"unverified","verification_level":0,"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 jometeorie/probing_llama, and GitHub detected no licence in that repository when it was checked","code_sha256":"cfeea96bf995824a","code_sha256_prefix":"cfeea96bf995824a","mcp_get_code":{"code_sha256":"cfeea96bf995824a"}},{"arxiv_id":"2401.06706","arxiv_id_is_arxiv":true,"paper":"/paper/multi-candidate-speculative-decoding","title":"Multi-Candidate Speculative Decoding","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"njunlp/mcsd","path":"MCSD/model/llama_tree_attn/convert_llama_weights_to_hf.py","file_url":"https://github.com/njunlp/mcsd/blob/HEAD/MCSD/model/llama_tree_attn/convert_llama_weights_to_hf.py","status":"unverified","verification_level":0,"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 Linking-ai/SEED, and GitHub detected no licence in that repository when it was checked","code_sha256":"731285361b7dea0e","code_sha256_prefix":"731285361b7dea0e","mcp_get_code":{"code_sha256":"731285361b7dea0e"}},{"arxiv_id":"2308.16137","arxiv_id_is_arxiv":true,"paper":"/paper/lm-infinite-simple-on-the-fly-length","title":"LM-Infinite: Zero-Shot Extreme Length Generalization for Large Language Models","date":"2023-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Glaciohound/LM-Infinite","path":"models/get_llama2/convert_llama_weights_to_hf.py","file_url":"https://github.com/Glaciohound/LM-Infinite/blob/HEAD/models/get_llama2/convert_llama_weights_to_hf.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":"25ab7cdc2eb3c237","code_sha256_prefix":"25ab7cdc2eb3c237","mcp_get_code":{"code_sha256":"25ab7cdc2eb3c237"}},{"arxiv_id":"2307.08072","arxiv_id_is_arxiv":true,"paper":"/paper/do-emergent-abilities-exist-in-quantized","title":"Do Emergent Abilities Exist in Quantized Large Language Models: An Empirical Study","date":"2023-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/quantizedempirical","path":"convert_llama_weights_to_hf.py","file_url":"https://github.com/rucaibox/quantizedempirical/blob/HEAD/convert_llama_weights_to_hf.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/quantizedempirical when it was checked","code_sha256":"25ab7cdc2eb3c237","code_sha256_prefix":"25ab7cdc2eb3c237","mcp_get_code":{"code_sha256":"25ab7cdc2eb3c237"}},{"arxiv_id":"2307.08072","arxiv_id_is_arxiv":true,"paper":"/paper/do-emergent-abilities-exist-in-quantized","title":"Do Emergent Abilities Exist in Quantized Large Language Models: An Empirical Study","date":"2023-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/quantizedempirical","path":"models/convert_llama_weights_to_hf.py","file_url":"https://github.com/rucaibox/quantizedempirical/blob/HEAD/models/convert_llama_weights_to_hf.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/quantizedempirical when it was checked","code_sha256":"57f5bf024e9e6eb0","code_sha256_prefix":"57f5bf024e9e6eb0","mcp_get_code":{"code_sha256":"57f5bf024e9e6eb0"}},{"arxiv_id":"2305.13718","arxiv_id_is_arxiv":true,"paper":"/paper/logicllm-exploring-self-supervised-logic","title":"Exploring Self-supervised Logic-enhanced Training for Large Language Models","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sparkjiao/logicllm","path":"convert_llama_weights_to_hf.py","file_url":"https://github.com/sparkjiao/logicllm/blob/HEAD/convert_llama_weights_to_hf.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":"de4478ea1dfdf42d","code_sha256_prefix":"de4478ea1dfdf42d","mcp_get_code":{"code_sha256":"de4478ea1dfdf42d"}},{"arxiv_id":"2025.findings-emnlp.435","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-emnlp.435","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"nguyenngocbaocmt02/OT-Intervention","path":"lofit_models/convert_llama_weights_to_hf.py","file_url":"https://github.com/nguyenngocbaocmt02/OT-Intervention/blob/HEAD/lofit_models/convert_llama_weights_to_hf.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":"25ab7cdc2eb3c237","code_sha256_prefix":"25ab7cdc2eb3c237","mcp_get_code":{"code_sha256":"25ab7cdc2eb3c237"}}],"record_sha256":"303daccb4ae8fdab944108df058b07b251a0ff5dc07d4c310eed46cc65668870","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}