2 of 5 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 2 have no contract verdict; 0 failures 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/2305.18403.json · badge: /api/ran/2305.18403.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 |
|---|---|---|
| aim-uofa/loraprune | canonical (classifier label) classifier basis not recorded on the link |
2 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| compute_sensitivity | Ran ran on a synthesized input |
aim-uofa/loraprune/loraprune/utils.py code served (permissive licence) · get_code("1caba93d370f1566") 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 Tensor, ndim 1, dtype family float, shape (32,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| generate_prompt | Ran ran on a synthesized input |
aim-uofa/loraprune/prune.py code served (permissive licence) · get_code("2d8a5c5d1c76d421") 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 str. 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.
|
| get_peft_model | Not yet run unverified (harvested, no recorded run) |
aim-uofa/loraprune/loraprune/peft_model.py code served (permissive licence) · get_code("b40a44ce0414cf76") How it ranno invocation recorded. |
| init_sensitivity_dict | Not yet run unverified (harvested, no recorded run) |
aim-uofa/loraprune/loraprune/utils.py code served (permissive licence) · get_code("b68a84213c479165") How it ranno invocation recorded. |
| update_sensitivity_dict | Not yet run unverified (harvested, no recorded run) |
aim-uofa/loraprune/loraprune/utils.py code served (permissive licence) · get_code("6dddc1737d9db4cf") How it ranno invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 5 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 5 later) and 0 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 |
|---|---|---|---|
| compute_sensitivity | 1 other paper 1 later |
2024.findings-acl.178 (2024 (year only)) LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning |
|
| generate_prompt | 1 other paper 1 later |
2024.findings-acl.178 (2024 (year only)) LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning |
|
| get_peft_model | 1 other paper 1 later |
2024.findings-acl.178 (2024 (year only)) LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning |
|
| init_sensitivity_dict | 1 other paper 1 later |
2024.findings-acl.178 (2024 (year only)) LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuning |
|
| update_sensitivity_dict | 1 other paper 1 later |
2024.findings-acl.178 (2024 (year only)) LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient 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), such as LLaMA and T5, have shown exceptional performance across various tasks through fine-tuning. Although low-rank adaption (LoRA) has emerged to cheaply fine-tune these LLMs on downstream tasks, their deployment is still hindered by the vast model scale and computational costs. Post-training model pruning offers a way to compress LLMs. However, the current pruning methods designed for LLMs are not compatible with LoRA. This is due to their utilization of unstructured pruning on LLMs, impeding the merging of LoRA weights, or their dependence on the gradients of pre-trained weights to guide pruning, which can impose significant memory overhead. To this end, we propose LoRAPrune, a new framework that delivers an accurate structured pruned model in a highly memory-efficient manner. Specifically, we first design a LoRA-guided pruning criterion, which uses the weights and gradients of LoRA, rather than the gradients of pre-trained weights for importance estimation. We subsequently integrate this criterion into an iterative pruning process, effectively removing redundant channels and heads. Extensive experimental results demonstrate the superior performance of our LoRAPrune over existing approaches on the LLaMA series models. At a 50\% compression rate, LoRAPrune demonstrates superior performance over LLM-Pruner, achieving a reduction in perplexity by 4.81 on WikiText2 and 3.46 on PTB, while also decreasing memory usage by 52.6%. Besides, LoRAPrune also matches semi-structural pruning across multiple LLMs, proving its wide applicability. The code is available at https://github.com/aim-uofa/LoRAPrune.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2305.18403")
get_code_for_paper("2305.18403")
have("2305.18403")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2305.18403.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2305.18403)
Connect an agent — have() is free.