{"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/make-functional","entry":"make_functional","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":8,"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":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":5,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"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":"2410.14389","arxiv_id_is_arxiv":true,"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/merging_model.py","file_url":"https://github.com/EnnengYang/SurgeryV2/blob/HEAD/src/merging_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, EnnengYang/SurgeryV2 when it was checked","code_sha256":"8adbe30621fbeb18","code_sha256_prefix":"8adbe30621fbeb18","mcp_get_code":{"code_sha256":"8adbe30621fbeb18"}},{"arxiv_id":"2409.05208","arxiv_id_is_arxiv":true,"paper":"/paper/influence-based-attributions-can-be","title":"Influence-based Attributions can be Manipulated","date":"2024-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"infinite-pursuits/influence-based-attributions-can-be-manipulated","path":"downstream_multiclass/pytorch_influence_functions/influence_functions/utils.py","file_url":"https://github.com/infinite-pursuits/influence-based-attributions-can-be-manipulated/blob/HEAD/downstream_multiclass/pytorch_influence_functions/influence_functions/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, infinite-pursuits/influence-based-attributions-can-be-manipulated when it was checked","code_sha256":"194db402fdfd8a1d","code_sha256_prefix":"194db402fdfd8a1d","mcp_get_code":{"code_sha256":"194db402fdfd8a1d"}},{"arxiv_id":"2408.07362","arxiv_id_is_arxiv":true,"paper":"/paper/badmerging-backdoor-attacks-against-model","title":"BadMerging: Backdoor Attacks Against Model Merging","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzhang538/badmerging","path":"src/main_adamerging_badmergingoff.py","file_url":"https://github.com/jzhang538/badmerging/blob/HEAD/src/main_adamerging_badmergingoff.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jzhang538/badmerging when it was checked","code_sha256":"8adbe30621fbeb18","code_sha256_prefix":"8adbe30621fbeb18","mcp_get_code":{"code_sha256":"8adbe30621fbeb18"}},{"arxiv_id":"2407.07089","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-linear-layers-only-is-a-simple","title":"Fine-Tuning Attention Modules Only: Enhancing Weight Disentanglement in Task Arithmetic","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyrie-23/task_arithmetic_tangent","path":"src/main_task_wise_adamerging.py","file_url":"https://github.com/kyrie-23/task_arithmetic_tangent/blob/HEAD/src/main_task_wise_adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8adbe30621fbeb18","code_sha256_prefix":"8adbe30621fbeb18","mcp_get_code":{"code_sha256":"8adbe30621fbeb18"}},{"arxiv_id":"2402.04081","arxiv_id_is_arxiv":true,"paper":"/paper/improved-generalization-of-weight-space","title":"Improved Generalization of Weight Space Networks via Augmentations","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"avivsham/deep-weight-space-augmentations","path":"models/relation_transformer/probe_features.py","file_url":"https://github.com/avivsham/deep-weight-space-augmentations/blob/HEAD/models/relation_transformer/probe_features.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d1d584930ebaf49f","code_sha256_prefix":"d1d584930ebaf49f","mcp_get_code":{"code_sha256":"d1d584930ebaf49f"}},{"arxiv_id":"2402.02705","arxiv_id_is_arxiv":true,"paper":"/paper/representation-surgery-for-multi-task-model","title":"Representation Surgery for Multi-Task Model Merging","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ennengyang/representationsurgery","path":"src/merging_model.py","file_url":"https://github.com/ennengyang/representationsurgery/blob/HEAD/src/merging_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8adbe30621fbeb18","code_sha256_prefix":"8adbe30621fbeb18","mcp_get_code":{"code_sha256":"8adbe30621fbeb18"}},{"arxiv_id":"2312.06173","arxiv_id_is_arxiv":true,"paper":"/paper/concrete-subspace-learning-based-interference","title":"Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanganke/subspace_fusion","path":"src/adamerging.py","file_url":"https://github.com/tanganke/subspace_fusion/blob/HEAD/src/adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, tanganke/subspace_fusion when it was checked","code_sha256":"64e4ae217b73cdfa","code_sha256_prefix":"64e4ae217b73cdfa","mcp_get_code":{"code_sha256":"64e4ae217b73cdfa"}},{"arxiv_id":"2311.06231","arxiv_id_is_arxiv":true,"paper":"/paper/learning-human-action-recognition","title":"Learning Human Action Recognition Representations Without Real Humans","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"howardzh01/PPMA","path":"code/omnivision/model/model_wrappers.py","file_url":"https://github.com/howardzh01/PPMA/blob/HEAD/code/omnivision/model/model_wrappers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, howardzh01/PPMA (NOASSERTION)","code_sha256":"b43c65d053fdd761","code_sha256_prefix":"b43c65d053fdd761","mcp_get_code":{"code_sha256":"b43c65d053fdd761"}},{"arxiv_id":"2310.02575","arxiv_id_is_arxiv":true,"paper":"/paper/adamerging-adaptive-model-merging-for-multi","title":"AdaMerging: Adaptive Model Merging for Multi-Task Learning","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EnnengYang/AdaMerging","path":"src/main_task_wise_adamerging.py","file_url":"https://github.com/EnnengYang/AdaMerging/blob/HEAD/src/main_task_wise_adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8adbe30621fbeb18","code_sha256_prefix":"8adbe30621fbeb18","mcp_get_code":{"code_sha256":"8adbe30621fbeb18"}},{"arxiv_id":"2106.04753","arxiv_id_is_arxiv":true,"paper":"/paper/on-sample-based-explanation-methods-for-nlp","title":"On Sample Based Explanation Methods for NLP:Efficiency, Faithfulness, and Semantic Evaluation","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/TracInF","path":"code/pif/influence_functions/hvp_grad.py","file_url":"https://github.com/IBM/TracInF/blob/HEAD/code/pif/influence_functions/hvp_grad.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"194db402fdfd8a1d","code_sha256_prefix":"194db402fdfd8a1d","mcp_get_code":{"code_sha256":"194db402fdfd8a1d"}}],"record_sha256":"6e7c6a837c81fe2415d4812aa258f1b4509464a979d6bbcf8b884deaab11aaf1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}