Yang Liu, Chris Liu, Jeffrey Flanigan, Yaxuan Wang
1 of 3 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 2 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2406.07933.json · badge: /api/ran/2406.07933.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| chrisliu298/llm-unlearn-eco | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 2 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| find_all_linear_names | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from csm9493/efficient-llm-unlearning pointer only · get_code("649fc48067a48529") How it ranThe body of this sample is withheld: 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. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| compute_metrics | Not yet run unverified (harvested, no recorded run) |
chrisliu298/llm-unlearn-eco/scripts/train_classifier.py pointer only (licence: NONE) · get_code("2903366de2ae20c9") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, chrisliu298/llm-unlearn-eco when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| rand_noise_first_n | Not yet run unverified (harvested, no recorded run) |
chrisliu298/llm-unlearn-eco/eco/attack/corrupt.py pointer only (licence: NONE) · get_code("9fafc30274b835a8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, chrisliu298/llm-unlearn-eco when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 1 the same month, 1 later) and 2 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| find_all_linear_names | 22 other papers 8 dated earlier, 1 the same month, 12 later, 1 same year, order not determinable |
2308.09936 (2023-08) BLIVA: A Simple Multimodal LLM for Better Handling of Text-Rich Visual Questions |
2310.13023 (2023-10) GraphGPT: Graph Instruction Tuning for Large Language Models 2311.13194 (2023-11) Towards Improving Document Understanding: An Exploration on Text-Grounding via MLLMs and 19 more not named here |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Large language models (LLMs) have advanced to encompass extensive knowledge across diverse domains. Yet controlling what a large language model should not know is important for ensuring alignment and thus safe use. However, accurately and efficiently unlearning knowledge from an LLM remains challenging due to the potential collateral damage caused by the fuzzy boundary between retention and forgetting, and the large computational requirements for optimization across stateof-the-art models with hundreds of billions of parameters. In this work, we present Embedding-COrrupted (ECO) Prompts, a lightweight unlearning framework for large language models to address both the challenges of knowledge entanglement and unlearning efficiency. Instead of relying on the LLM itself to unlearn, we enforce an unlearned state during inference by employing a prompt classifier to identify and safeguard prompts to forget. We learn corruptions added to prompt embeddings via zeroth order optimization toward the unlearning objective offline and corrupt prompts flagged by the classifier during inference. We find that these embedding-corrupted prompts not only lead to desirable outputs that satisfy the unlearning objective but also closely approximate the output from a model that has never been trained on the data intended for forgetting. Through extensive experiments on unlearning, we demonstrate the superiority of our method in achieving promising unlearning at nearly zero side effects in general domains and domains closely related to the unlearned ones. Additionally, we highlight the scalability of our method to 100 LLMs, ranging from 0.5B to 236B parameters, incurring no additional cost as the number of parameters increases. We have made our code publicly available at https://github.com/chrisliu298/llm-unlearn-eco.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.07933")
get_code_for_paper("2406.07933")
have("2406.07933")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.07933.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.07933)
Connect an agent — have() is free.