{"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/topk-values-mask","entry":"topk_values_mask","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":7,"n_papers_ran":7,"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":5,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":4,"ran":1,"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":"2604.17753","paper":"/paper/arxiv-2604-17753","title":"Evolutionary Negative Module Pruning for Better LoRA Merging","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"CaoAnda/ENMP-LoRAMerging","path":"masking_ops.py","file_url":"https://github.com/CaoAnda/ENMP-LoRAMerging/blob/HEAD/masking_ops.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cc25fa48e243d80b","mcp_get_code":{"code_sha256":"cc25fa48e243d80b"}},{"arxiv_id":"2509.17786","paper":"/paper/arxiv-2509-17786","title":"Accurate and Efficient Low-Rank Model Merging in Core Space","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"apanariello4/core-space-merging","path":"merging_functions.py","file_url":"https://github.com/apanariello4/core-space-merging/blob/HEAD/merging_functions.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f6ead996d6b1adba","mcp_get_code":{"code_sha256":"f6ead996d6b1adba"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9f4ac26be542f539","mcp_get_code":{"code_sha256":"9f4ac26be542f539"}},{"arxiv_id":"2410.19735","paper":"/paper/model-merging-with-svd-to-tie-the-knots","title":"Model merging with SVD to tie the Knots","date":"2024-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gstoica27/knots","path":"merging_functions.py","file_url":"https://github.com/gstoica27/knots/blob/HEAD/merging_functions.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6ead996d6b1adba","mcp_get_code":{"code_sha256":"f6ead996d6b1adba"}},{"arxiv_id":"2410.19735","paper":"/paper/model-merging-with-svd-to-tie-the-knots","title":"Model merging with SVD to tie the Knots","date":"2024-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gstoica27/knots","path":"masking_ops.py","file_url":"https://github.com/gstoica27/knots/blob/HEAD/masking_ops.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cc25fa48e243d80b","mcp_get_code":{"code_sha256":"cc25fa48e243d80b"}},{"arxiv_id":"2409.18314","paper":"/paper/realistic-evaluation-of-model-merging-for","title":"Realistic Evaluation of Model Merging for Compositional Generalization","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"r-three/realistic_evaluation_of_model_merging_for_compositional_generalization","path":"src/merging/save_statistic.py","file_url":"https://github.com/r-three/realistic_evaluation_of_model_merging_for_compositional_generalization/blob/HEAD/src/merging/save_statistic.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"225c26ebc567caaa","mcp_get_code":{"code_sha256":"225c26ebc567caaa"}},{"arxiv_id":"2406.11801","paper":"/paper/safety-arithmetic-a-framework-for-test-time","title":"Safety Arithmetic: A Framework for Test-time Safety Alignment of Language Models by Steering Parameters and Activations","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/safety-arithmetic","path":"HDR/Ties_Merge.py","file_url":"https://github.com/declare-lab/safety-arithmetic/blob/HEAD/HDR/Ties_Merge.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3258283dc4ff9ef0","mcp_get_code":{"code_sha256":"3258283dc4ff9ef0"}},{"arxiv_id":"2306.01708","paper":"/paper/ties-merging-resolving-interference-when","title":"TIES-Merging: Resolving Interference When Merging Models","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"225c26ebc567caaa","mcp_get_code":{"code_sha256":"225c26ebc567caaa"}}]}