{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/vector-to-state-dict","entry":"vector_to_state_dict","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":4,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":0},"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":"2606.22589","paper":"/paper/arxiv-2606-22589","title":"Training-free Task Classification for Multi-Task Model Merging","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BAIKLAB/SiM","path":"src/sim_utils.py","file_url":"https://github.com/BAIKLAB/SiM/blob/HEAD/src/sim_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9678f554b4b6a0d4","mcp_get_code":{"code_sha256":"9678f554b4b6a0d4"}},{"arxiv_id":"2503.23733","paper":"/paper/adamms-model-merging-for-heterogeneous","title":"AdaMMS: Model Merging for Heterogeneous Multimodal Large Language Models with Unsupervised Coefficient Optimization","date":"2025-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp-mt/adamms","path":"merge/ties_merging.py","file_url":"https://github.com/thunlp-mt/adamms/blob/HEAD/merge/ties_merging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bf6efec91354af72","mcp_get_code":{"code_sha256":"bf6efec91354af72"}},{"arxiv_id":"2410.14389","paper":"/paper/surgeryv2-bridging-the-gap-between-model","title":"SurgeryV2: Bridging the Gap Between Model Merging and Multi-Task Learning with Deep Representation Surgery","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EnnengYang/SurgeryV2","path":"src/ties_merging_utils.py","file_url":"https://github.com/EnnengYang/SurgeryV2/blob/HEAD/src/ties_merging_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bf6efec91354af72","mcp_get_code":{"code_sha256":"bf6efec91354af72"}},{"arxiv_id":"2405.17461","paper":"/paper/emr-merging-tuning-free-high-performance","title":"EMR-Merging: Tuning-Free High-Performance Model Merging","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harveyhuang18/emr_merging","path":"merge_vit/src/ties_merging_utils.py","file_url":"https://github.com/harveyhuang18/emr_merging/blob/HEAD/merge_vit/src/ties_merging_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bf6efec91354af72","mcp_get_code":{"code_sha256":"bf6efec91354af72"}},{"arxiv_id":"2311.13171","paper":"/paper/compeft-compression-for-communicating","title":"ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantization","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prateeky2806/compeft","path":"src/utils.py","file_url":"https://github.com/prateeky2806/compeft/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"1b1a016089577bfe","mcp_get_code":{"code_sha256":"1b1a016089577bfe"}},{"arxiv_id":"2311.13171","paper":"/paper/compeft-compression-for-communicating","title":"ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantization","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prateeky2806/compeft","path":"src/qlora/ties_utils.py","file_url":"https://github.com/prateeky2806/compeft/blob/HEAD/src/qlora/ties_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"771baa0aee5d6f6b","mcp_get_code":{"code_sha256":"771baa0aee5d6f6b"}}]}