{"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/cosine-lr","entry":"cosine_lr","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":31,"n_papers_ran":31,"n_papers_ran_no_instrument_failure":28,"n_papers_ran_instrument_only":3,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":31,"n_places_pointer_only":27,"n_places_pointer_only_link_open":15,"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":4,"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":"2606.22589","arxiv_id_is_arxiv":true,"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":"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, BAIKLAB/SiM when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2605.26693","arxiv_id_is_arxiv":true,"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":"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, mlfoundations/task_vectors when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2605.20803","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20803","title":"Tunable MAGMAX: Preference-Aware Model Merging for Continual Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"KeiHiroshima/tunable-magmax","path":"src/utils.py","file_url":"https://github.com/KeiHiroshima/tunable-magmax/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 BAIKLAB/SiM, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2512.12997","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-12997","title":"Calibrating Uncertainty for Zero-Shot Adversarial CLIP","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"VivienLu/UCAT","path":"utils.py","file_url":"https://github.com/VivienLu/UCAT/blob/HEAD/utils.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, VivienLu/UCAT when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2507.12998","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.12998","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"MediaBrain-SJTU/DISSect","path":"src/scheduler.py","file_url":"https://github.com/MediaBrain-SJTU/DISSect/blob/HEAD/src/scheduler.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, MediaBrain-SJTU/DISSect when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2506.13406","arxiv_id_is_arxiv":true,"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":"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, yankd22/calm when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2503.10657","arxiv_id_is_arxiv":true,"paper":"/paper/routereval-a-comprehensive-benchmark-for","title":"RouterEval: A Comprehensive Benchmark for Routing LLMs to Explore Model-level Scaling Up in LLMs","date":"2025-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milkthink-lab/routereval","path":"router/MLPR_LinearR/tools.py","file_url":"https://github.com/milkthink-lab/routereval/blob/HEAD/router/MLPR_LinearR/tools.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":"7529a26792fd6da5","code_sha256_prefix":"7529a26792fd6da5","mcp_get_code":{"code_sha256":"7529a26792fd6da5"}},{"arxiv_id":"2502.01015","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 BAIKLAB/SiM, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2412.12153","arxiv_id_is_arxiv":true,"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":"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, JH-GEECS/CART_public when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2412.08580","arxiv_id_is_arxiv":true,"paper":"/paper/laion-sg-an-enhanced-large-scale-dataset-for","title":"LAION-SG: An Enhanced Large-Scale Dataset for Training Complex Image-Text Models with Structural Annotations","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mengcye/LAION-SG","path":"sgEncoderTraining/training/scheduler.py","file_url":"https://github.com/mengcye/LAION-SG/blob/HEAD/sgEncoderTraining/training/scheduler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2411.19666","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-whole-slide-foundation-model-for","title":"Multimodal Whole Slide Foundation Model for Pathology","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahmoodlab/titan","path":"titan/finetune.py","file_url":"https://github.com/mahmoodlab/titan/blob/HEAD/titan/finetune.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, mahmoodlab/titan when it was checked","code_sha256":"e5ad400fe0abbe9a","code_sha256_prefix":"e5ad400fe0abbe9a","mcp_get_code":{"code_sha256":"e5ad400fe0abbe9a"}},{"arxiv_id":"2411.19331","arxiv_id_is_arxiv":true,"paper":"/paper/talking-to-dino-bridging-self-supervised","title":"Talking to DINO: Bridging Self-Supervised Vision Backbones with Language for Open-Vocabulary Segmentation","date":"2024-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorebianchi98/Talk2DINO","path":"src/train_util.py","file_url":"https://github.com/lorebianchi98/Talk2DINO/blob/HEAD/src/train_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"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/utils.py","file_url":"https://github.com/EnnengYang/SurgeryV2/blob/HEAD/src/utils.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, EnnengYang/SurgeryV2 when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2410.05583","arxiv_id_is_arxiv":true,"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":"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, naver-ai/negmerge when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2409.01936","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-clip-models-for-image-retrieval","title":"Optimizing CLIP Models for Image Retrieval with Maintained Joint-Embedding Alignment","date":"2024-09-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Visual-Computing/MCIP","path":"MCIP/src/realignment/scheduler.py","file_url":"https://github.com/Visual-Computing/MCIP/blob/HEAD/MCIP/src/realignment/scheduler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2405.08815","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-vision-language-pre-training-by","title":"Efficient Vision-Language Pre-training by Cluster Masking","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zi-hao-wei/efficient-vision-language-pre-training-by-cluster-masking","path":"training/scheduler.py","file_url":"https://github.com/zi-hao-wei/efficient-vision-language-pre-training-by-cluster-masking/blob/HEAD/training/scheduler.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, zi-hao-wei/efficient-vision-language-pre-training-by-cluster-masking when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2405.03988","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-adaptation-from-large-language","title":"LEARN: Knowledge Adaptation from Large Language Model to Recommendation for Practical Industrial Application","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adxcreative/LEARN","path":"src/training/scheduler.py","file_url":"https://github.com/adxcreative/LEARN/blob/HEAD/src/training/scheduler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2404.19287","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-adversarial-robustness-of","title":"Revisiting the Adversarial Robustness of Vision Language Models: a Multimodal Perspective","date":"2024-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ellezwq/mmcoa","path":"utils.py","file_url":"https://github.com/ellezwq/mmcoa/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2401.04350","arxiv_id_is_arxiv":true,"paper":"/paper/pre-trained-model-guided-fine-tuning-for-zero","title":"Pre-trained Model Guided Fine-Tuning for Zero-Shot Adversarial Robustness","date":"2024-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"serendipity1122/Pre-trained-Model-Guided-Fine-Tuning-for-Zero-Shot-Adversarial-Robustness","path":"utils.py","file_url":"https://github.com/serendipity1122/Pre-trained-Model-Guided-Fine-Tuning-for-Zero-Shot-Adversarial-Robustness/blob/HEAD/utils.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, serendipity1122/Pre-trained-Model-Guided-Fine-Tuning-for-Zero-Shot-Adversarial-Robustness when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2308.12213","arxiv_id_is_arxiv":true,"paper":"/paper/clipn-for-zero-shot-ood-detection-teaching","title":"CLIPN for Zero-Shot OOD Detection: Teaching CLIP to Say No","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xmed-lab/clipn","path":"src/tuning_util.py","file_url":"https://github.com/xmed-lab/clipn/blob/HEAD/src/tuning_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 BAIKLAB/SiM, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2308.05734","arxiv_id_is_arxiv":true,"paper":"/paper/audioldm-2-learning-holistic-audio-generation","title":"AudioLDM 2: Learning Holistic Audio Generation with Self-supervised Pretraining","date":"2023-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoheliu/audioldm-training-finetuning","path":"audioldm_train/modules/clap/training/scheduler.py","file_url":"https://github.com/haoheliu/audioldm-training-finetuning/blob/HEAD/audioldm_train/modules/clap/training/scheduler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2305.12827","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 BAIKLAB/SiM, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2304.04858","arxiv_id_is_arxiv":true,"paper":"/paper/simulated-annealing-in-early-layers-leads-to","title":"Simulated Annealing in Early Layers Leads to Better Generalization","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amiiir-sarfi/seal","path":"core.py","file_url":"https://github.com/amiiir-sarfi/seal/blob/HEAD/core.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, amiiir-sarfi/seal when it was checked","code_sha256":"2e32661e8d23fbbb","code_sha256_prefix":"2e32661e8d23fbbb","mcp_get_code":{"code_sha256":"2e32661e8d23fbbb"}},{"arxiv_id":"2302.14042","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-enhanced-pre-training-for-auto","title":"Knowledge-enhanced Visual-Language Pre-training on Chest Radiology Images","date":"2023-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaoman-zhang/kad","path":"A2_KEBERT/training/scheduler.py","file_url":"https://github.com/xiaoman-zhang/kad/blob/HEAD/A2_KEBERT/training/scheduler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2209.00179","arxiv_id_is_arxiv":true,"paper":"/paper/universal-multi-modality-retrieval-with-one","title":"Universal Vision-Language Dense Retrieval: Learning A Unified Representation Space for Multi-Modal Retrieval","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openmatch/univl-dr","path":"UniVL-DR/gen_embeddings.py","file_url":"https://github.com/openmatch/univl-dr/blob/HEAD/UniVL-DR/gen_embeddings.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2208.05592","arxiv_id_is_arxiv":true,"paper":"/paper/patching-open-vocabulary-models-by","title":"Patching open-vocabulary models by interpolating weights","date":"2022-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlfoundations/patching","path":"src/utils.py","file_url":"https://github.com/mlfoundations/patching/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 BAIKLAB/SiM, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}},{"arxiv_id":"2203.17274","arxiv_id_is_arxiv":true,"paper":"/paper/visual-prompting-modifying-pixel-space-to","title":"Exploring Visual Prompts for Adapting Large-Scale Models","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hjbahng/visual_prompting","path":"utils.py","file_url":"https://github.com/hjbahng/visual_prompting/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 VivienLu/UCAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"932d44bbf8bd0e3f","code_sha256_prefix":"932d44bbf8bd0e3f","mcp_get_code":{"code_sha256":"932d44bbf8bd0e3f"}},{"arxiv_id":"2203.14145","arxiv_id_is_arxiv":true,"paper":"/paper/reverse-engineering-of-imperceptible-1","title":"Reverse Engineering of Imperceptible Adversarial Image Perturbations","date":"2022-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanfanfanfan/reverse-engineering-of-imperceptible-adversarial-image-perturbations","path":"RED_train_with_trans.py","file_url":"https://github.com/yifanfanfanfan/reverse-engineering-of-imperceptible-adversarial-image-perturbations/blob/HEAD/RED_train_with_trans.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":"c5196b556b5ecc5a","code_sha256_prefix":"c5196b556b5ecc5a","mcp_get_code":{"code_sha256":"c5196b556b5ecc5a"}},{"arxiv_id":"2103.05152","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-evolution-in-neural-networks","title":"Knowledge Evolution in Neural Networks","date":"2021-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmdtaha/knowledge_evolution","path":"KE_model.py","file_url":"https://github.com/ahmdtaha/knowledge_evolution/blob/HEAD/KE_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e00ffa6d0e1a9ddb","code_sha256_prefix":"e00ffa6d0e1a9ddb","mcp_get_code":{"code_sha256":"e00ffa6d0e1a9ddb"}},{"arxiv_id":"1811.12254","arxiv_id_is_arxiv":true,"paper":"/paper/the-effect-of-heterogeneous-data-for","title":"The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech","date":"2018-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ychnlgy/Chebyshev-Lagrange","path":"shake-shake_pytorch/utils.py","file_url":"https://github.com/ychnlgy/Chebyshev-Lagrange/blob/HEAD/shake-shake_pytorch/utils.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":"7529a26792fd6da5","code_sha256_prefix":"7529a26792fd6da5","mcp_get_code":{"code_sha256":"7529a26792fd6da5"}},{"arxiv_id":"aaai_27950","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_27950","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"gaojingsheng/LAMM","path":"utils.py","file_url":"https://github.com/gaojingsheng/LAMM/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 BAIKLAB/SiM, and GitHub detected no licence in that repository when it was checked","code_sha256":"2d5d7a12d8de02b7","code_sha256_prefix":"2d5d7a12d8de02b7","mcp_get_code":{"code_sha256":"2d5d7a12d8de02b7"}}],"record_sha256":"f4a2f3a53f533b05434820036f3f723a2c90a31eb35bd6b2d46dc643a56213e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}