Bhavya Kailkhura, Sijia Liu, Yimeng Zhang, Jinghan Jia, Yihua Zhang, Jiancheng Liu, James Diffenderfer, Bharat Runwal
3 of 6 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 1 failure of our instrument; 3 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; 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/2404.18239.json · badge: /api/ran/2404.18239.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 |
|---|---|---|
| optml-group/soul | canonical (classifier label) classifier basis not recorded on the link |
2 ran · 3 no recorded run |
| OPTML-Group/SOUL | community Papers with Code archive |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| SophiaG | Ran ran on a synthesized input · constructed an object; no result was computed |
OPTML-Group/SOUL/src/optim/sophia.py code served (permissive licence) · get_code("80caf6ff337fe734") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned an instance of its own class, SophiaG: the run constructed the object and did not call it, so no result was computed. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| find_all_linear_names | Ran ran; our contract draft was wrong, not the code |
optml-group/soul/src/exec/Fine_tune_hp.py code served (permissive licence) · get_code("649fc48067a48529") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| get_wikitext2 | Ran ran on a synthesized input |
optml-group/soul/src/dataset/dataset.py pointer only (licence: MIT); the stored copy get_code serves, from zyxxmu/dsnot, is pointer only (licence: NONE) · get_code("dee8be97b2cf4692") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zyxxmu/dsnot, and GitHub detected no licence in that repository 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. A run is recorded. |
| get_c4 | Not yet run unverified (harvested, no recorded run) |
optml-group/soul/src/dataset/dataset.py pointer only (licence: MIT); the stored copy get_code serves, from zyxxmu/dsnot, is pointer only (licence: NONE) · get_code("7630a157a3b32ab9") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zyxxmu/dsnot, and GitHub detected no licence in that repository 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. |
| get_loaders | Not yet run unverified (harvested, no recorded run) |
optml-group/soul/src/dataset/dataset.py code served (permissive licence) · get_code("16994008353af958") How it ranno invocation recorded. |
| unlearncollector | Not yet run unverified (harvested, no recorded run) |
optml-group/soul/src/dataset/Base.py code served (permissive licence) · get_code("21b851de3f5356c4") How it ranno invocation recorded. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 5 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 0 the same month, 5 later) and 1 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 6 dated earlier, 15 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 |
| get_wikitext2 | 15 other papers 6 dated earlier, 7 later, 2 same year, order not determinable · 1 only as an assembly brick |
2306.11695 (2023-06) A Simple and Effective Pruning Approach for Large Language Models |
2310.01382 (2023-10) Compressing LLMs: The Truth is Rarely Pure and Never Simple 2310.05175 (2023-10) Outlier Weighed Layerwise Sparsity (OWL ): A Missing Secret Sauce for Pruning LLMs to High Sparsity and 12 more not named here |
| get_c4 | 10 other papers 4 dated earlier, 4 later, 2 same year, order not determinable · 1 only as an assembly brick |
2306.11695 (2023-06) A Simple and Effective Pruning Approach for Large Language Models |
2310.05175 (2023-10) Outlier Weighed Layerwise Sparsity (OWL ): A Missing Secret Sauce for Pruning LLMs to High Sparsity 2310.08915 (2023-10) Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs and 7 more not named here |
| get_loaders | 9 other papers 5 dated earlier, 3 later, 1 same year, order not determinable |
2306.11695 (2023-06) A Simple and Effective Pruning Approach for Large Language Models |
2310.01382 (2023-10) Compressing LLMs: The Truth is Rarely Pure and Never Simple 2310.05175 (2023-10) Outlier Weighed Layerwise Sparsity (OWL ): A Missing Secret Sauce for Pruning LLMs to High Sparsity and 6 more not named here |
| unlearncollector | 2 other papers 2 later |
2410.17509 (2024-10) WAGLE: Strategic Weight Attribution for Effective and Modular Unlearning in Large Language Models |
2506.01339 (2025-06) Invariance Makes LLM Unlearning Resilient Even to Unanticipated Downstream Fine-Tuning |
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 highlighted the necessity of effective unlearning mechanisms to comply with data regulations and ethical AI practices. LLM unlearning aims at removing undesired data influences and associated model capabilities without compromising utility beyond the scope of unlearning. While interest in studying LLM unlearning is growing, the impact of the optimizer choice for LLM unlearning remains unexplored. In this work, we shed light on the significance of optimizer selection in LLM unlearning for the first time, establishing a clear connection between second-order optimization and influence unlearning (a classical approach using influence functions to update the model for data influence removal). This insight propels us to develop a second-order optimization-based LLM unlearning framework, termed Second-Order UnLearning (SOUL), which extends the static, one-shot model update using influence unlearning to a dynamic, iterative unlearning process. Our extensive experiments show that SOUL consistently outperforms conventional first-order methods across various unlearning tasks, models, and metrics, indicating that second-order optimization offers an effective and broadly applicable solution for LLM unlearning. Codes are available at https://github.com/OPTML-Group/SOUL.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2404.18239")
get_code_for_paper("2404.18239")
have("2404.18239")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2404.18239.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2404.18239)
Connect an agent — have() is free.