{"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/create-log-dir","entry":"create_log_dir","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":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":4,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":2,"unverified":1},"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":"2408.13656","arxiv_id_is_arxiv":true,"paper":"/paper/localize-and-stitch-efficient-model-merging","title":"Localize-and-Stitch: Efficient Model Merging via Sparse Task Arithmetic","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifei-he/localize-and-stitch","path":"vision/src/main_dataless_localize_stitch.py","file_url":"https://github.com/yifei-he/localize-and-stitch/blob/HEAD/vision/src/main_dataless_localize_stitch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3053d2bdc3ea5c89","code_sha256_prefix":"3053d2bdc3ea5c89","mcp_get_code":{"code_sha256":"3053d2bdc3ea5c89"}},{"arxiv_id":"2408.07362","arxiv_id_is_arxiv":true,"paper":"/paper/badmerging-backdoor-attacks-against-model","title":"BadMerging: Backdoor Attacks Against Model Merging","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jzhang538/badmerging","path":"src/main_adamerging_badmergingoff.py","file_url":"https://github.com/jzhang538/badmerging/blob/HEAD/src/main_adamerging_badmergingoff.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jzhang538/badmerging when it was checked","code_sha256":"3053d2bdc3ea5c89","code_sha256_prefix":"3053d2bdc3ea5c89","mcp_get_code":{"code_sha256":"3053d2bdc3ea5c89"}},{"arxiv_id":"2407.07089","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-linear-layers-only-is-a-simple","title":"Fine-Tuning Attention Modules Only: Enhancing Weight Disentanglement in Task Arithmetic","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kyrie-23/task_arithmetic_tangent","path":"src/main_task_wise_adamerging.py","file_url":"https://github.com/kyrie-23/task_arithmetic_tangent/blob/HEAD/src/main_task_wise_adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3053d2bdc3ea5c89","code_sha256_prefix":"3053d2bdc3ea5c89","mcp_get_code":{"code_sha256":"3053d2bdc3ea5c89"}},{"arxiv_id":"2405.17461","arxiv_id_is_arxiv":true,"paper":"/paper/emr-merging-tuning-free-high-performance","title":"EMR-Merging: Tuning-Free High-Performance Model Merging","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harveyhuang18/emr_merging","path":"merge_vit/src/main_emr_merging.py","file_url":"https://github.com/harveyhuang18/emr_merging/blob/HEAD/merge_vit/src/main_emr_merging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, harveyhuang18/emr_merging when it was checked","code_sha256":"3053d2bdc3ea5c89","code_sha256_prefix":"3053d2bdc3ea5c89","mcp_get_code":{"code_sha256":"3053d2bdc3ea5c89"}},{"arxiv_id":"2405.17461","arxiv_id_is_arxiv":true,"paper":"/paper/emr-merging-tuning-free-high-performance","title":"EMR-Merging: Tuning-Free High-Performance Model Merging","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harveyhuang18/emr_merging","path":"merge_vit/src/main_emr_30_vits.py","file_url":"https://github.com/harveyhuang18/emr_merging/blob/HEAD/merge_vit/src/main_emr_30_vits.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, harveyhuang18/emr_merging when it was checked","code_sha256":"5375fc5c7809c769","code_sha256_prefix":"5375fc5c7809c769","mcp_get_code":{"code_sha256":"5375fc5c7809c769"}},{"arxiv_id":"2310.02575","arxiv_id_is_arxiv":true,"paper":"/paper/adamerging-adaptive-model-merging-for-multi","title":"AdaMerging: Adaptive Model Merging for Multi-Task Learning","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EnnengYang/AdaMerging","path":"src/main_task_wise_adamerging.py","file_url":"https://github.com/EnnengYang/AdaMerging/blob/HEAD/src/main_task_wise_adamerging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3053d2bdc3ea5c89","code_sha256_prefix":"3053d2bdc3ea5c89","mcp_get_code":{"code_sha256":"3053d2bdc3ea5c89"}},{"arxiv_id":"2002.04839","arxiv_id_is_arxiv":true,"paper":"/paper/laprop-a-better-way-to-combine-momentum-with","title":"LaProp: Separating Momentum and Adaptivity in Adam","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Z-T-WANG/LaProp-Optimizer","path":"rainbow/common/utils.py","file_url":"https://github.com/Z-T-WANG/LaProp-Optimizer/blob/HEAD/rainbow/common/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":"878f223c996c5522","code_sha256_prefix":"878f223c996c5522","mcp_get_code":{"code_sha256":"878f223c996c5522"}},{"arxiv_id":"1503.03585","arxiv_id_is_arxiv":true,"paper":"/paper/deep-unsupervised-learning-using","title":"Deep Unsupervised Learning using Nonequilibrium Thermodynamics","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sohl-Dickstein/Diffusion-Probabilistic-Models","path":"util.py","file_url":"https://github.com/Sohl-Dickstein/Diffusion-Probabilistic-Models/blob/HEAD/util.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":"c08473571e4bbb41","code_sha256_prefix":"c08473571e4bbb41","mcp_get_code":{"code_sha256":"c08473571e4bbb41"}}],"record_sha256":"bbc58bb8db7973bc2fc34f819b053aa1c53f6a393658f2b13303c4c32d17f7a0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}