{"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":"/task/task-arithmetic/papers/ran/1","list_of":"/task/task-arithmetic","task":"Task Arithmetic","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,18],"of":18,"counts":{"archive_papers_tagged":61,"with_a_code_link":24,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":61,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/task-arithmetic/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/calm-consensus-aware-localized-merging-for","slug":"calm-consensus-aware-localized-merging-for","title":"CALM: Consensus-Aware Localized Merging for Multi-Task Learning","date":"2025-06-16","arxiv_id":"2506.13406","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/calm-consensus-aware-localized-merging-for#ran","syntology_url":"https://syntology.ai/paper/2506.13406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.13406"}},"official":{"repos":["yankd22/calm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/leveraging-submodule-linearity-enhances-task","slug":"leveraging-submodule-linearity-enhances-task","title":"Leveraging Submodule Linearity Enhances Task Arithmetic Performance in LLMs","date":"2025-04-15","arxiv_id":"2504.10902","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/leveraging-submodule-linearity-enhances-task#ran","syntology_url":"https://syntology.ai/paper/2504.10902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.10902"}},"official":{"repos":["deep-analysis-research/slta"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-model-editing-with-task-vector","slug":"efficient-model-editing-with-task-vector","title":"Efficient Model Editing with Task Vector Bases: A Theoretical Framework and Scalable Approach","date":"2025-02-03","arxiv_id":"2502.01015","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/efficient-model-editing-with-task-vector#ran","syntology_url":"https://syntology.ai/paper/2502.01015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.01015"}},"official":{"repos":["uiuctml/TaskVectorBasis"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/negmerge-consensual-weight-negation-for","slug":"negmerge-consensual-weight-negation-for","title":"NegMerge: Consensual Weight Negation for Strong Machine Unlearning","date":"2024-10-08","arxiv_id":"2410.05583","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/negmerge-consensual-weight-negation-for#ran","syntology_url":"https://syntology.ai/paper/2410.05583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05583"}},"official":{"repos":["naver-ai/negmerge"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/localize-and-stitch-efficient-model-merging","slug":"localize-and-stitch-efficient-model-merging","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","date":"2024-08-24","arxiv_id":"2408.13656","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/localize-and-stitch-efficient-model-merging#ran","syntology_url":"https://syntology.ai/paper/2408.13656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.13656"}},"official":{"repos":["uiuctml/localize-and-stitch","yifei-he/localize-and-stitch"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fine-tuning-linear-layers-only-is-a-simple","slug":"fine-tuning-linear-layers-only-is-a-simple","title":"Fine-Tuning Attention Modules Only: Enhancing Weight Disentanglement in Task Arithmetic","date":"2024-07-09","arxiv_id":"2407.07089","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fine-tuning-linear-layers-only-is-a-simple#ran","syntology_url":"https://syntology.ai/paper/2407.07089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07089"}},"official":{"repos":["kyrie-23/task_arithmetic_tangent","kyrie-23/linear_task_arithmetic"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-composition-using-task-vectors-with","slug":"knowledge-composition-using-task-vectors-with","title":"Knowledge Composition using Task Vectors with Learned Anisotropic Scaling","date":"2024-07-03","arxiv_id":"2407.02880","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/knowledge-composition-using-task-vectors-with#ran","syntology_url":"https://syntology.ai/paper/2407.02880","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02880"}},"official":{"repos":["fredzzhang/atlas"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/localizing-task-information-for-improved","slug":"localizing-task-information-for-improved","title":"Localizing Task Information for Improved Model Merging and Compression","date":"2024-05-13","arxiv_id":"2405.07813","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/localizing-task-information-for-improved#ran","syntology_url":"https://syntology.ai/paper/2405.07813","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.07813"}},"official":{"repos":["nik-dim/tall_masks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/have-you-merged-my-model-on-the-robustness-of","slug":"have-you-merged-my-model-on-the-robustness-of","title":"Have You Merged My Model? On The Robustness of Large Language Model IP Protection Methods Against Model Merging","date":"2024-04-08","arxiv_id":"2404.05188","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/have-you-merged-my-model-on-the-robustness-of#ran","syntology_url":"https://syntology.ai/paper/2404.05188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05188"}},"official":{"repos":["thuccslab/mergeguard"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-are-homer-simpson-safety-re","slug":"language-models-are-homer-simpson-safety-re","title":"Language Models are Homer Simpson! Safety Re-Alignment of Fine-tuned Language Models through Task Arithmetic","date":"2024-02-19","arxiv_id":"2402.11746","repositories_listed":3,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":9,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/language-models-are-homer-simpson-safety-re#ran","syntology_url":"https://syntology.ai/paper/2402.11746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11746"}},"official":{"repos":["declare-lab/resta","hiyouga/llama-factory"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/merging-multi-task-models-via-weight","slug":"merging-multi-task-models-via-weight","title":"Merging Multi-Task Models via Weight-Ensembling Mixture of Experts","date":"2024-02-01","arxiv_id":"2402.00433","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/merging-multi-task-models-via-weight#ran","syntology_url":"https://syntology.ai/paper/2402.00433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.00433"}},"official":{"repos":["tanganke/weight-ensembling_moe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/concrete-subspace-learning-based-interference","slug":"concrete-subspace-learning-based-interference","title":"Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion","date":"2023-12-11","arxiv_id":"2312.06173","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/concrete-subspace-learning-based-interference#ran","syntology_url":"https://syntology.ai/paper/2312.06173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.06173"}},"official":{"repos":["tanganke/subspace_fusion"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/model-merging-by-uncertainty-based-gradient","slug":"model-merging-by-uncertainty-based-gradient","title":"Model Merging by Uncertainty-Based Gradient Matching","date":"2023-10-19","arxiv_id":"2310.12808","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-merging-by-uncertainty-based-gradient#ran","syntology_url":"https://syntology.ai/paper/2310.12808","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12808"}},"official":{"repos":["ukplab/iclr2024-model-merging"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/parameter-efficient-multi-task-model-fusion","slug":"parameter-efficient-multi-task-model-fusion","title":"Parameter Efficient Multi-task Model Fusion with Partial Linearization","date":"2023-10-07","arxiv_id":"2310.04742","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/parameter-efficient-multi-task-model-fusion#ran","syntology_url":"https://syntology.ai/paper/2310.04742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04742"}},"official":{"repos":["tanganke/peta"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adamerging-adaptive-model-merging-for-multi","slug":"adamerging-adaptive-model-merging-for-multi","title":"AdaMerging: Adaptive Model Merging for Multi-Task Learning","date":"2023-10-04","arxiv_id":"2310.02575","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adamerging-adaptive-model-merging-for-multi#ran","syntology_url":"https://syntology.ai/paper/2310.02575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02575"}},"official":{"repos":["EnnengYang/AdaMerging"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/task-arithmetic-in-the-tangent-space-improved","slug":"task-arithmetic-in-the-tangent-space-improved","title":"Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Models","date":"2023-05-22","arxiv_id":"2305.12827","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/task-arithmetic-in-the-tangent-space-improved#ran","syntology_url":"https://syntology.ai/paper/2305.12827","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12827"}},"official":{"repos":["gortizji/tangent_task_arithmetic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-study-of-multimodal-model","slug":"an-empirical-study-of-multimodal-model","title":"An Empirical Study of Multimodal Model Merging","date":"2023-04-28","arxiv_id":"2304.14933","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-empirical-study-of-multimodal-model#ran","syntology_url":"https://syntology.ai/paper/2304.14933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14933"}},"official":{"repos":["ylsung/vl-merging"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/editing-models-with-task-arithmetic","slug":"editing-models-with-task-arithmetic","title":"Editing Models with Task Arithmetic","date":"2022-12-08","arxiv_id":"2212.04089","repositories_listed":9,"syntology":{"n":15,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/editing-models-with-task-arithmetic#ran","syntology_url":"https://syntology.ai/paper/2212.04089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04089"}},"official":{"repos":["mlfoundations/task_vectors"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}}],"record_sha256":"d582142d6bdae2b225cb789527bab58055e405b69d0cdb9ef8267142c753b03c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}