{"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/get-features-helper","entry":"get_features_helper","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":12,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":3,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":10,"n_places_pointer_only_link_open":3,"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":0,"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":"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/datasets/common.py","file_url":"https://github.com/mlfoundations/task_vectors/blob/HEAD/src/datasets/common.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, mlfoundations/task_vectors when it was checked","code_sha256":"238ff32fcbf410d6","code_sha256_prefix":"238ff32fcbf410d6","mcp_get_code":{"code_sha256":"238ff32fcbf410d6"}},{"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/datasets/common.py","file_url":"https://github.com/yankd22/calm/blob/HEAD/src/datasets/common.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, yankd22/calm when it was checked","code_sha256":"238ff32fcbf410d6","code_sha256_prefix":"238ff32fcbf410d6","mcp_get_code":{"code_sha256":"238ff32fcbf410d6"}},{"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/dataset/common.py","file_url":"https://github.com/JH-GEECS/CART_public/blob/HEAD/src/dataset/common.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, JH-GEECS/CART_public when it was checked","code_sha256":"238ff32fcbf410d6","code_sha256_prefix":"238ff32fcbf410d6","mcp_get_code":{"code_sha256":"238ff32fcbf410d6"}},{"arxiv_id":"2411.19757","arxiv_id_is_arxiv":true,"paper":"/paper/dual-risk-minimization-towards-next-level","title":"Dual Risk Minimization: Towards Next-Level Robustness in Fine-tuning Zero-Shot Models","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vaynexie/DRM","path":"src/datasets/common.py","file_url":"https://github.com/vaynexie/DRM/blob/HEAD/src/datasets/common.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, vaynexie/DRM when it was checked","code_sha256":"aeb196e862a2c0ca","code_sha256_prefix":"aeb196e862a2c0ca","mcp_get_code":{"code_sha256":"aeb196e862a2c0ca"}},{"arxiv_id":"2411.06966","arxiv_id_is_arxiv":true,"paper":"/paper/robust-fine-tuning-of-zero-shot-models-via","title":"Robust Fine-tuning of Zero-shot Models via Variance Reduction","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BeierZhu/VRF","path":"src/datasets/common.py","file_url":"https://github.com/BeierZhu/VRF/blob/HEAD/src/datasets/common.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, BeierZhu/VRF when it was checked","code_sha256":"238ff32fcbf410d6","code_sha256_prefix":"238ff32fcbf410d6","mcp_get_code":{"code_sha256":"238ff32fcbf410d6"}},{"arxiv_id":"2410.17146","arxiv_id_is_arxiv":true,"paper":"/paper/lines-post-training-layer-scaling-prevents","title":"LiNeS: Post-training Layer Scaling Prevents Forgetting and Enhances Model Merging","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang-kee/LiNeS","path":"src/datasets/common.py","file_url":"https://github.com/wang-kee/LiNeS/blob/HEAD/src/datasets/common.py","status":"unverified","verification_level":0,"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 mlfoundations/task_vectors, and GitHub detected no licence in that repository when it was checked","code_sha256":"238ff32fcbf410d6","code_sha256_prefix":"238ff32fcbf410d6","mcp_get_code":{"code_sha256":"238ff32fcbf410d6"}},{"arxiv_id":"2410.03955","arxiv_id_is_arxiv":true,"paper":"/paper/model-developmental-safety-a-safety-centric","title":"A Retention-Centric Framework for Continual Learning with Guaranteed Model Developmental Safety","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ganglii/devsafety","path":"src/datasets/common.py","file_url":"https://github.com/ganglii/devsafety/blob/HEAD/src/datasets/common.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, ganglii/devsafety when it was checked","code_sha256":"74edffa1dfc39e58","code_sha256_prefix":"74edffa1dfc39e58","mcp_get_code":{"code_sha256":"74edffa1dfc39e58"}},{"arxiv_id":"2406.05184","arxiv_id_is_arxiv":true,"paper":"/paper/the-unmet-promise-of-synthetic-training","title":"The Unmet Promise of Synthetic Training Images: Using Retrieved Real Images Performs Better","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scottgeng00/unmet-promise","path":"adapt/src/datasets/common.py","file_url":"https://github.com/scottgeng00/unmet-promise/blob/HEAD/adapt/src/datasets/common.py","status":"unverified","verification_level":0,"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 mlfoundations/task_vectors, and GitHub detected no licence in that repository when it was checked","code_sha256":"238ff32fcbf410d6","code_sha256_prefix":"238ff32fcbf410d6","mcp_get_code":{"code_sha256":"238ff32fcbf410d6"}},{"arxiv_id":"2405.07813","arxiv_id_is_arxiv":true,"paper":"/paper/localizing-task-information-for-improved","title":"Localizing Task Information for Improved Model Merging and Compression","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nik-dim/tall_masks","path":"src/datasets/common.py","file_url":"https://github.com/nik-dim/tall_masks/blob/HEAD/src/datasets/common.py","status":"unverified","verification_level":0,"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 mlfoundations/task_vectors, and GitHub detected no licence in that repository when it was checked","code_sha256":"238ff32fcbf410d6","code_sha256_prefix":"238ff32fcbf410d6","mcp_get_code":{"code_sha256":"238ff32fcbf410d6"}},{"arxiv_id":"2312.02546","arxiv_id_is_arxiv":true,"paper":"/paper/machine-vision-therapy-multimodal-large","title":"Machine Vision Therapy: Multimodal Large Language Models Can Enhance Visual Robustness via Denoising In-Context Learning","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmllab/2024_icml_dicl","path":"ImageNet_datasets/common.py","file_url":"https://github.com/tmllab/2024_icml_dicl/blob/HEAD/ImageNet_datasets/common.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":"74edffa1dfc39e58","code_sha256_prefix":"74edffa1dfc39e58","mcp_get_code":{"code_sha256":"74edffa1dfc39e58"}},{"arxiv_id":"2311.01723","arxiv_id_is_arxiv":true,"paper":"/paper/towards-calibrated-robust-fine-tuning-of","title":"Towards Calibrated Robust Fine-Tuning of Vision-Language Models","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MLAI-Yonsei/CaRot","path":"src/datasets_/common.py","file_url":"https://github.com/MLAI-Yonsei/CaRot/blob/HEAD/src/datasets_/common.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, MLAI-Yonsei/CaRot when it was checked","code_sha256":"74edffa1dfc39e58","code_sha256_prefix":"74edffa1dfc39e58","mcp_get_code":{"code_sha256":"74edffa1dfc39e58"}},{"arxiv_id":"2308.01313","arxiv_id_is_arxiv":true,"paper":"/paper/more-context-less-distraction-visual","title":"PerceptionCLIP: Visual Classification by Inferring and Conditioning on Contexts","date":"2023-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"umd-huang-lab/perceptionclip","path":"src/zero_shot_inference/perceptionclip_two_step.py","file_url":"https://github.com/umd-huang-lab/perceptionclip/blob/HEAD/src/zero_shot_inference/perceptionclip_two_step.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":"74edffa1dfc39e58","code_sha256_prefix":"74edffa1dfc39e58","mcp_get_code":{"code_sha256":"74edffa1dfc39e58"}}],"record_sha256":"a39c7670c32bfa2546a9d26923699810dadfe20590de2d6f5f565772ad3ad331","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}