{"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/topk-values-mask","entry":"topk_values_mask","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":5,"ran":0,"unverified":0},"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":"2604.17753","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CaoAnda/ENMP-LoRAMerging when it was checked","code_sha256":"cc25fa48e243d80b","code_sha256_prefix":"cc25fa48e243d80b","mcp_get_code":{"code_sha256":"cc25fa48e243d80b"}},{"arxiv_id":"2509.17786","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6ead996d6b1adba","code_sha256_prefix":"f6ead996d6b1adba","mcp_get_code":{"code_sha256":"f6ead996d6b1adba"}},{"arxiv_id":"2503.23733","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thunlp-mt/adamms when it was checked","code_sha256":"9f4ac26be542f539","code_sha256_prefix":"9f4ac26be542f539","mcp_get_code":{"code_sha256":"9f4ac26be542f539"}},{"arxiv_id":"2410.19735","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6ead996d6b1adba","code_sha256_prefix":"f6ead996d6b1adba","mcp_get_code":{"code_sha256":"f6ead996d6b1adba"}},{"arxiv_id":"2410.19735","arxiv_id_is_arxiv":true,"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":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 CaoAnda/ENMP-LoRAMerging, and GitHub detected no licence in that repository when it was checked","code_sha256":"cc25fa48e243d80b","code_sha256_prefix":"cc25fa48e243d80b","mcp_get_code":{"code_sha256":"cc25fa48e243d80b"}},{"arxiv_id":"2409.18314","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, r-three/realistic_evaluation_of_model_merging_for_compositional_generalization when it was checked","code_sha256":"225c26ebc567caaa","code_sha256_prefix":"225c26ebc567caaa","mcp_get_code":{"code_sha256":"225c26ebc567caaa"}},{"arxiv_id":"2406.11801","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","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, declare-lab/safety-arithmetic when it was checked","code_sha256":"3258283dc4ff9ef0","code_sha256_prefix":"3258283dc4ff9ef0","mcp_get_code":{"code_sha256":"3258283dc4ff9ef0"}},{"arxiv_id":"2306.01708","arxiv_id_is_arxiv":true,"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,"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":"225c26ebc567caaa","code_sha256_prefix":"225c26ebc567caaa","mcp_get_code":{"code_sha256":"225c26ebc567caaa"}}],"record_sha256":"939e34cec1f2e9111f589400618b516a84e2731e16b4d136d8050bac7b3808b0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}