{"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/taskvector","entry":"TaskVector","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":6,"n_papers_ran_no_instrument_failure":6,"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":9,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":7,"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":0,"ran_fixture":0,"ran":6,"unverified":3},"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":"2511.05408","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-05408","title":"Steering Language Models with Weight Arithmetic","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"safety-research/weight-steering","path":"task_vectors.py","file_url":"https://github.com/safety-research/weight-steering/blob/HEAD/task_vectors.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, safety-research/weight-steering when it was checked","code_sha256":"8ba0dad070def60b","code_sha256_prefix":"8ba0dad070def60b","mcp_get_code":{"code_sha256":"8ba0dad070def60b"}},{"arxiv_id":"2510.09658","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-09658","title":"Gradient-Sign Masking for Task Vector Transport Across Pre-Trained Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"fillo-rinaldi/GradFix","path":"grad_sign/gradient_sign_common.py","file_url":"https://github.com/fillo-rinaldi/GradFix/blob/HEAD/grad_sign/gradient_sign_common.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":"91f3d383c8881096","code_sha256_prefix":"91f3d383c8881096","mcp_get_code":{"code_sha256":"91f3d383c8881096"}},{"arxiv_id":"2505.22697","arxiv_id_is_arxiv":true,"paper":"/paper/update-your-transformer-to-the-latest-release","title":"Update Your Transformer to the Latest Release: Re-Basin of Task Vectors","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aimagelab/transfusion","path":"task_vectors/src/task_vectors.py","file_url":"https://github.com/aimagelab/transfusion/blob/HEAD/task_vectors/src/task_vectors.py","status":"ran","verification_level":1,"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, aimagelab/transfusion when it was checked","code_sha256":"b0db24cb0bcb77f3","code_sha256_prefix":"b0db24cb0bcb77f3","mcp_get_code":{"code_sha256":"b0db24cb0bcb77f3"}},{"arxiv_id":"2503.22178","arxiv_id_is_arxiv":true,"paper":"/paper/adarank-adaptive-rank-pruning-for-enhanced","title":"AdaRank: Adaptive Rank Pruning for Enhanced Model Merging","date":"2025-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"david3684/adarank","path":"lm/model_merging_methods/adarank_gpt2.py","file_url":"https://github.com/david3684/adarank/blob/HEAD/lm/model_merging_methods/adarank_gpt2.py","status":"ran","verification_level":1,"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, david3684/adarank when it was checked","code_sha256":"d24346902b4fa7e1","code_sha256_prefix":"d24346902b4fa7e1","mcp_get_code":{"code_sha256":"d24346902b4fa7e1"}},{"arxiv_id":"2503.06921","arxiv_id_is_arxiv":true,"paper":"/paper/task-vector-quantization-for-memory-efficient","title":"Task Vector Quantization for Memory-Efficient Model Merging","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIM-SKKU/TVQ","path":"src/task_vectors.py","file_url":"https://github.com/AIM-SKKU/TVQ/blob/HEAD/src/task_vectors.py","status":"ran","verification_level":1,"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, AIM-SKKU/TVQ when it was checked","code_sha256":"09e0c3065d60b16a","code_sha256_prefix":"09e0c3065d60b16a","mcp_get_code":{"code_sha256":"09e0c3065d60b16a"}},{"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":"fskong/FT-Classifier-for-Model-Merging","path":"task_vectors.py","file_url":"https://github.com/fskong/FT-Classifier-for-Model-Merging/blob/HEAD/task_vectors.py","status":"ran","verification_level":1,"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, fskong/FT-Classifier-for-Model-Merging when it was checked","code_sha256":"aeed07d009914ad2","code_sha256_prefix":"aeed07d009914ad2","mcp_get_code":{"code_sha256":"aeed07d009914ad2"}},{"arxiv_id":"2212.04089","arxiv_id_is_arxiv":true,"paper":"/paper/editing-models-with-task-arithmetic","title":"Editing Models with Task Arithmetic","date":"2022-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanyang19/ImPart","path":"merge/task_vector.py","file_url":"https://github.com/yanyang19/ImPart/blob/HEAD/merge/task_vector.py","status":"ran","verification_level":1,"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, yanyang19/ImPart when it was checked","code_sha256":"1856c2a053748d8a","code_sha256_prefix":"1856c2a053748d8a","mcp_get_code":{"code_sha256":"1856c2a053748d8a"}},{"arxiv_id":"2212.04089","arxiv_id_is_arxiv":true,"paper":"/paper/editing-models-with-task-arithmetic","title":"Editing Models with Task Arithmetic","date":"2022-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EnnengYang/AdaMerging","path":"src/task_vectors.py","file_url":"https://github.com/EnnengYang/AdaMerging/blob/HEAD/src/task_vectors.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":"f893acd6847a295a","code_sha256_prefix":"f893acd6847a295a","mcp_get_code":{"code_sha256":"f893acd6847a295a"}},{"arxiv_id":"2212.04089","arxiv_id_is_arxiv":true,"paper":"/paper/editing-models-with-task-arithmetic","title":"Editing Models with Task Arithmetic","date":"2022-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idankinderman/fs_merge","path":"src/merges/task_vectors.py","file_url":"https://github.com/idankinderman/fs_merge/blob/HEAD/src/merges/task_vectors.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, idankinderman/fs_merge when it was checked","code_sha256":"da649407a76a7991","code_sha256_prefix":"da649407a76a7991","mcp_get_code":{"code_sha256":"da649407a76a7991"}}],"record_sha256":"ad241ba1f95f90fac4de685af70c866706dc42c5afa7597a30832221ba74c364","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}