{"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-inv-cov","entry":"get_inv_cov","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":5,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"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":0,"ran_fixture":0,"ran":3,"unverified":2},"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":"2412.13341","arxiv_id_is_arxiv":true,"paper":"/paper/concept-rot-poisoning-concepts-in-large","title":"Concept-ROT: Poisoning Concepts in Large Language Models with Model Editing","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keltin13/concept-rot","path":"rot/compute_u.py","file_url":"https://github.com/keltin13/concept-rot/blob/HEAD/rot/compute_u.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, keltin13/concept-rot (NOASSERTION)","code_sha256":"ce18d10a9e6dd154","code_sha256_prefix":"ce18d10a9e6dd154","mcp_get_code":{"code_sha256":"ce18d10a9e6dd154"}},{"arxiv_id":"2408.07413","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-in-superposition-unveiling-the","title":"Knowledge in Superposition: Unveiling the Failures of Lifelong Knowledge Editing for Large Language Models","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhuihu/knowledge_in_superposition","path":"compute.py","file_url":"https://github.com/chenhuihu/knowledge_in_superposition/blob/HEAD/compute.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, chenhuihu/knowledge_in_superposition when it was checked","code_sha256":"1db0192c8fbf80f5","code_sha256_prefix":"1db0192c8fbf80f5","mcp_get_code":{"code_sha256":"1db0192c8fbf80f5"}},{"arxiv_id":"2405.02421","arxiv_id_is_arxiv":true,"paper":"/paper/what-does-the-knowledge-neuron-thesis-have-to","title":"What does the Knowledge Neuron Thesis Have to do with Knowledge?","date":"2024-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frankniujc/kn_thesis","path":"kn_code/rome/compute_u.py","file_url":"https://github.com/frankniujc/kn_thesis/blob/HEAD/kn_code/rome/compute_u.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":"d265047cc27fa57f","code_sha256_prefix":"d265047cc27fa57f","mcp_get_code":{"code_sha256":"d265047cc27fa57f"}},{"arxiv_id":"2403.13355","arxiv_id_is_arxiv":true,"paper":"/paper/badedit-backdooring-large-language-models-by","title":"BadEdit: Backdooring large language models by model editing","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lyz1213/BadEdit","path":"rome/compute_u.py","file_url":"https://github.com/Lyz1213/BadEdit/blob/HEAD/rome/compute_u.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":"65f71b871888c246","code_sha256_prefix":"65f71b871888c246","mcp_get_code":{"code_sha256":"65f71b871888c246"}},{"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/compute_u.py","file_url":"https://github.com/scalable-model-editing/rebuilding-rome/blob/HEAD/rome/compute_u.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":"65f71b871888c246","code_sha256_prefix":"65f71b871888c246","mcp_get_code":{"code_sha256":"65f71b871888c246"}},{"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":"hiyouga/fastedit","path":"fastedit/rome/rome_main.py","file_url":"https://github.com/hiyouga/fastedit/blob/HEAD/fastedit/rome/rome_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"196e16a6fd176c0b","code_sha256_prefix":"196e16a6fd176c0b","mcp_get_code":{"code_sha256":"196e16a6fd176c0b"}},{"arxiv_id":"2025.findings-acl.598","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.598","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"wanglne/DELMAN","path":"rome/compute_u.py","file_url":"https://github.com/wanglne/DELMAN/blob/HEAD/rome/compute_u.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":"65f71b871888c246","code_sha256_prefix":"65f71b871888c246","mcp_get_code":{"code_sha256":"65f71b871888c246"}}],"record_sha256":"b014d027e9266f87701d35751130c2490f0621849a82c1727d1dbda636cb28da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}