{"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/upd-matrix-match-shape","entry":"upd_matrix_match_shape","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":13,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":12,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":13,"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":2,"ran":1,"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.00477","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00477","title":"Do Text Edits Generalize to Visual Generation? Benchmarking Cross-Modal Knowledge Editing in UMMs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"gxx27/UniKE","path":"AlphaEdit/AlphaEdit_main.py","file_url":"https://github.com/gxx27/UniKE/blob/HEAD/AlphaEdit/AlphaEdit_main.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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 KentoNishi/KE-ICML-2025, and GitHub detected no licence in that repository when it was checked","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}},{"arxiv_id":"2605.26670","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26670","title":"The Labyrinth and the Thread: Rethinking Regularizations in Sequential Knowledge Editing for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Wangzzzzzzzz/OTE-SE-Alignment","path":"AlphaEdit/AlphaEdit_main.py","file_url":"https://github.com/Wangzzzzzzzz/OTE-SE-Alignment/blob/HEAD/AlphaEdit/AlphaEdit_main.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Wangzzzzzzzz/OTE-SE-Alignment when it was checked","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}},{"arxiv_id":"2602.02543","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02543","title":"Norm Anchors Make Model Edits Last","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"SasyaTitech/NAS","path":"NAS/NAS_main.py","file_url":"https://github.com/SasyaTitech/NAS/blob/HEAD/NAS/NAS_main.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":"9488d83ea9ad00a6","code_sha256_prefix":"9488d83ea9ad00a6","mcp_get_code":{"code_sha256":"9488d83ea9ad00a6"}},{"arxiv_id":"2502.10438","arxiv_id_is_arxiv":true,"paper":"/paper/injecting-universal-jailbreak-backdoors-into","title":"Injecting Universal Jailbreak Backdoors into LLMs in Minutes","date":"2025-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3a7359734df0b9a0","code_sha256_prefix":"3a7359734df0b9a0","mcp_get_code":{"code_sha256":"3a7359734df0b9a0"}},{"arxiv_id":"2502.03748","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2502.03748","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":null,"repo":"xpq-tech/BLUE","path":"AlphaEdit/AlphaEdit_main.py","file_url":"https://github.com/xpq-tech/BLUE/blob/HEAD/AlphaEdit/AlphaEdit_main.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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 KentoNishi/KE-ICML-2025, and GitHub detected no licence in that repository when it was checked","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}},{"arxiv_id":"2410.23843","arxiv_id_is_arxiv":true,"paper":"/paper/reasons-and-solutions-for-the-decline-in","title":"Reasons and Solutions for the Decline in Model Performance after Editing","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlpkeg/D4S","path":"easyeditor/models/memit/compute_z.py","file_url":"https://github.com/nlpkeg/D4S/blob/HEAD/easyeditor/models/memit/compute_z.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, nlpkeg/D4S when it was checked","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}},{"arxiv_id":"2410.17194","arxiv_id_is_arxiv":true,"paper":"/paper/representation-shattering-in-transformers-a","title":"Representation Shattering in Transformers: A Synthetic Study with Knowledge Editing","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KentoNishi/KE-ICML-2025","path":"memit-llama/AlphaEdit/AlphaEdit_main.py","file_url":"https://github.com/KentoNishi/KE-ICML-2025/blob/HEAD/memit-llama/AlphaEdit/AlphaEdit_main.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, KentoNishi/KE-ICML-2025 when it was checked","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}},{"arxiv_id":"2410.04045","arxiv_id_is_arxiv":true,"paper":"/paper/neuron-level-sequential-editing-for-large","title":"Neuron-Level Sequential Editing for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianghoucheng/nse","path":"nse/nse_main.py","file_url":"https://github.com/jianghoucheng/nse/blob/HEAD/nse/nse_main.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jianghoucheng/nse when it was checked","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}},{"arxiv_id":"2410.02355","arxiv_id_is_arxiv":true,"paper":"/paper/alphaedit-null-space-constrained-knowledge","title":"AlphaEdit: Null-Space Constrained Knowledge Editing for Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}},{"arxiv_id":"2406.11263","arxiv_id_is_arxiv":true,"paper":"/paper/the-fall-of-rome-understanding-the-collapse","title":"Understanding the Collapse of LLMs in Model Editing","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3a7359734df0b9a0","code_sha256_prefix":"3a7359734df0b9a0","mcp_get_code":{"code_sha256":"3a7359734df0b9a0"}},{"arxiv_id":"2403.07175","arxiv_id_is_arxiv":true,"paper":"/paper/rebuilding-rome-resolving-model-collapse","title":"Rebuilding ROME : Resolving Model Collapse during Sequential Model Editing","date":"2024-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scalable-model-editing/rebuilding-rome","path":"rome/rome_main.py","file_url":"https://github.com/scalable-model-editing/rebuilding-rome/blob/HEAD/rome/rome_main.py","status":"ran_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a7359734df0b9a0","code_sha256_prefix":"3a7359734df0b9a0","mcp_get_code":{"code_sha256":"3a7359734df0b9a0"}},{"arxiv_id":"2202.05262","arxiv_id_is_arxiv":true,"paper":"/paper/locating-and-editing-factual-knowledge-in-gpt","title":"Locating and Editing Factual Associations in GPT","date":"2022-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kmeng01/rome","path":"rome/rome_main.py","file_url":"https://github.com/kmeng01/rome/blob/HEAD/rome/rome_main.py","status":"ran_fixture","verification_level":2,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a7359734df0b9a0","code_sha256_prefix":"3a7359734df0b9a0","mcp_get_code":{"code_sha256":"3a7359734df0b9a0"}},{"arxiv_id":"2024.findings-acl.347","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-acl.347","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"dtamayo-nlp/MEMAT","path":"attention_translation/bilingual_multihead_optimization.py","file_url":"https://github.com/dtamayo-nlp/MEMAT/blob/HEAD/attention_translation/bilingual_multihead_optimization.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","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 KentoNishi/KE-ICML-2025, and GitHub detected no licence in that repository when it was checked","code_sha256":"bad421a5838188a7","code_sha256_prefix":"bad421a5838188a7","mcp_get_code":{"code_sha256":"bad421a5838188a7"}}],"record_sha256":"5315e0c2a9a409798a3b91e66bfc4b0c47748ea23db2ec7866ea5e3330991656","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}