{"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/torch-load-old","entry":"torch_load_old","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":8,"n_papers_ran":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":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2606.22589","paper":"/paper/arxiv-2606-22589","title":"Training-free Task Classification for Multi-Task Model Merging","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BAIKLAB/SiM","path":"src/utils.py","file_url":"https://github.com/BAIKLAB/SiM/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}},{"arxiv_id":"2605.26693","paper":"/paper/arxiv-2605-26693","title":"Model Merging on Loss Landscape: A Geometry Perspective","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mlfoundations/task_vectors","path":"src/utils.py","file_url":"https://github.com/mlfoundations/task_vectors/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}},{"arxiv_id":"2506.13406","paper":"/paper/calm-consensus-aware-localized-merging-for","title":"CALM: Consensus-Aware Localized Merging for Multi-Task Learning","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yankd22/calm","path":"src/utils.py","file_url":"https://github.com/yankd22/calm/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}},{"arxiv_id":"2502.01015","paper":"/paper/efficient-model-editing-with-task-vector","title":"Efficient Model Editing with Task Vector Bases: A Theoretical Framework and Scalable Approach","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uiuctml/TaskVectorBasis","path":"src/utils.py","file_url":"https://github.com/uiuctml/TaskVectorBasis/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}},{"arxiv_id":"2412.12153","paper":"/paper/revisiting-weight-averaging-for-model-merging","title":"Revisiting Weight Averaging for Model Merging","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JH-GEECS/CART_public","path":"src/utils.py","file_url":"https://github.com/JH-GEECS/CART_public/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}},{"arxiv_id":"2410.14389","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/utils.py","file_url":"https://github.com/EnnengYang/SurgeryV2/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}},{"arxiv_id":"2410.05583","paper":"/paper/negmerge-consensual-weight-negation-for","title":"NegMerge: Consensual Weight Negation for Strong Machine Unlearning","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/negmerge","path":"CLIP_MU/src/utils.py","file_url":"https://github.com/naver-ai/negmerge/blob/HEAD/CLIP_MU/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}},{"arxiv_id":"2305.12827","paper":"/paper/task-arithmetic-in-the-tangent-space-improved","title":"Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Models","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gortizji/tangent_task_arithmetic","path":"src/utils.py","file_url":"https://github.com/gortizji/tangent_task_arithmetic/blob/HEAD/src/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7d051a7adefedb6c","mcp_get_code":{"code_sha256":"7d051a7adefedb6c"}}]}