{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/prepare-calibration-input","entry":"prepare_calibration_input","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":17,"n_papers_ran":2,"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":16,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":14},"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.24970","paper":"/paper/arxiv-2606-24970","title":"Don't Go Breaking My LLM: The Impact of Pruning Attention Layers on Explanation Faithfulness and Confidence Calibration","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"pietrotrope/Dont_Go_Breaking_My_LLM","path":"track_block_activations.py","file_url":"https://github.com/pietrotrope/Dont_Go_Breaking_My_LLM/blob/HEAD/track_block_activations.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"269c15e4af75b825","mcp_get_code":{"code_sha256":"269c15e4af75b825"}},{"arxiv_id":"2601.06787","paper":"/paper/arxiv-2601-06787","title":"Garbage Attention in Large Language Models: <BOS> Sink Heads and Sink-aware Pruning","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"CASIA-LMC-Lab/FLAP","path":"lib/prune.py","file_url":"https://github.com/CASIA-LMC-Lab/FLAP/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2519b3efd481ad47","mcp_get_code":{"code_sha256":"2519b3efd481ad47"}},{"arxiv_id":"2511.04805","paper":"/paper/arxiv-2511-04805","title":"PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Fine-Grained Expert Merging and Bit-packed Inference","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"Supercomputing-System-AI-Lab/PuzzleMoE","path":"puzzlemoe/utils/merge_experts_function.py","file_url":"https://github.com/Supercomputing-System-AI-Lab/PuzzleMoE/blob/HEAD/puzzlemoe/utils/merge_experts_function.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d3516264313fc68c","mcp_get_code":{"code_sha256":"d3516264313fc68c"}},{"arxiv_id":"2506.09351","paper":null,"title":"arXiv:2506.09351","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"yuchenblah/DIVE","path":"prune/lib/prune_mlp_unif.py","file_url":"https://github.com/yuchenblah/DIVE/blob/HEAD/prune/lib/prune_mlp_unif.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4a1fb7eee616eef6","mcp_get_code":{"code_sha256":"4a1fb7eee616eef6"}},{"arxiv_id":"2506.06866","paper":"/paper/safe-finding-sparse-and-flat-minima-to","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","date":"2025-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LOG-postech/safe-torch","path":"language/lib/prune.py","file_url":"https://github.com/LOG-postech/safe-torch/blob/HEAD/language/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c9b68ea3948eb9de","mcp_get_code":{"code_sha256":"c9b68ea3948eb9de"}},{"arxiv_id":"2412.12497","paper":"/paper/nlsr-neuron-level-safety-realignment-of-large","title":"NLSR: Neuron-Level Safety Realignment of Large Language Models Against Harmful Fine-Tuning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinykou/nlsr","path":"src/prune_regions/prune.py","file_url":"https://github.com/xinykou/nlsr/blob/HEAD/src/prune_regions/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"489c7308a936561a","mcp_get_code":{"code_sha256":"489c7308a936561a"}},{"arxiv_id":"2411.10606","paper":"/paper/amoeballm-constructing-any-shape-large","title":"AmoebaLLM: Constructing Any-Shape Large Language Models for Efficient and Instant Deployment","date":"2024-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GATECH-EIC/AmoebaLLM","path":"width_shrink/prune.py","file_url":"https://github.com/GATECH-EIC/AmoebaLLM/blob/HEAD/width_shrink/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a5c450766875733e","mcp_get_code":{"code_sha256":"a5c450766875733e"}},{"arxiv_id":"2410.09615","paper":"/paper/slim-one-shot-quantized-sparse-plus-low-rank","title":"SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mohammad-mozaffari/slim","path":"slim/prune.py","file_url":"https://github.com/mohammad-mozaffari/slim/blob/HEAD/slim/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"11faa3c36aa963d7","mcp_get_code":{"code_sha256":"11faa3c36aa963d7"}},{"arxiv_id":"2410.07461","paper":"/paper/is-c4-dataset-optimal-for-pruning-an","title":"Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruning","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abx393/llm-pruning-calibration-data","path":"lib/prune.py","file_url":"https://github.com/abx393/llm-pruning-calibration-data/blob/HEAD/lib/prune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"4dae8adb46b1e46e","mcp_get_code":{"code_sha256":"4dae8adb46b1e46e"}},{"arxiv_id":"2406.02924","paper":"/paper/pruner-zero-evolving-symbolic-pruning-metric","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/pruner-zero","path":"lib/prune.py","file_url":"https://github.com/pprp/pruner-zero/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"298323fc64be86fa","mcp_get_code":{"code_sha256":"298323fc64be86fa"}},{"arxiv_id":"2406.02924","paper":"/paper/pruner-zero-evolving-symbolic-pruning-metric","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pprp/pruner-zero","path":"lib/prune_opt.py","file_url":"https://github.com/pprp/pruner-zero/blob/HEAD/lib/prune_opt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6530251d1f1a7f4e","mcp_get_code":{"code_sha256":"6530251d1f1a7f4e"}},{"arxiv_id":"2401.02938","paper":"/paper/fast-and-optimal-weight-update-for-pruned","title":"Fast and Effective Weight Update for Pruned Large Language Models","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmfi-compbio/admm-pruning","path":"lib/prune.py","file_url":"https://github.com/fmfi-compbio/admm-pruning/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"298323fc64be86fa","mcp_get_code":{"code_sha256":"298323fc64be86fa"}},{"arxiv_id":"2401.02938","paper":"/paper/fast-and-optimal-weight-update-for-pruned","title":"Fast and Effective Weight Update for Pruned Large Language Models","date":"2024-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmfi-compbio/admm-pruning","path":"lib/prune_opt.py","file_url":"https://github.com/fmfi-compbio/admm-pruning/blob/HEAD/lib/prune_opt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6530251d1f1a7f4e","mcp_get_code":{"code_sha256":"6530251d1f1a7f4e"}},{"arxiv_id":"2312.11983","paper":"/paper/fluctuation-based-adaptive-structured-pruning","title":"Fluctuation-based Adaptive Structured Pruning for Large Language Models","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"casia-iva-lab/flap","path":"lib/prune.py","file_url":"https://github.com/casia-iva-lab/flap/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2519b3efd481ad47","mcp_get_code":{"code_sha256":"2519b3efd481ad47"}},{"arxiv_id":"2310.08915","paper":"/paper/dynamic-sparse-no-training-training-free-fine","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyxxmu/dsnot","path":"lib/prune.py","file_url":"https://github.com/zyxxmu/dsnot/blob/HEAD/lib/prune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0d1f4e924ac02ca3","mcp_get_code":{"code_sha256":"0d1f4e924ac02ca3"}},{"arxiv_id":"2310.05175","paper":"/paper/outlier-weighed-layerwise-sparsity-owl-a","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luuyin/owl","path":"lib/prune_all.py","file_url":"https://github.com/luuyin/owl/blob/HEAD/lib/prune_all.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"298323fc64be86fa","mcp_get_code":{"code_sha256":"298323fc64be86fa"}},{"arxiv_id":"2310.01382","paper":"/paper/compressing-llms-the-truth-is-rarely-pure-and","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/llm-kick","path":"GPTQ_experiment/lib/prune.py","file_url":"https://github.com/VITA-Group/llm-kick/blob/HEAD/GPTQ_experiment/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7b4247187069337f","mcp_get_code":{"code_sha256":"7b4247187069337f"}},{"arxiv_id":"2306.11695","paper":"/paper/a-simple-and-effective-pruning-approach-for","title":"A Simple and Effective Pruning Approach for Large Language Models","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/wanda","path":"lib/prune.py","file_url":"https://github.com/locuslab/wanda/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"33272894b6721cfb","mcp_get_code":{"code_sha256":"33272894b6721cfb"}},{"arxiv_id":"2306.11695","paper":"/paper/a-simple-and-effective-pruning-approach-for","title":"A Simple and Effective Pruning Approach for Large Language Models","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crystaleye42/eval-safety","path":"lib/prune.py","file_url":"https://github.com/crystaleye42/eval-safety/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9aed9bf93575f59e","mcp_get_code":{"code_sha256":"9aed9bf93575f59e"}},{"arxiv_id":"2306.11695","paper":"/paper/a-simple-and-effective-pruning-approach-for","title":"A Simple and Effective Pruning Approach for Large Language Models","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiaoxiao7282/seft","path":"lib/prune_all.py","file_url":"https://github.com/qiaoxiao7282/seft/blob/HEAD/lib/prune_all.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"09d5f6f2798113c6","mcp_get_code":{"code_sha256":"09d5f6f2798113c6"}},{"arxiv_id":"aaai_28960","paper":null,"title":"arXiv:aaai_28960","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"CASIA-IVA-Lab/FLAP","path":"lib/prune.py","file_url":"https://github.com/CASIA-IVA-Lab/FLAP/blob/HEAD/lib/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2519b3efd481ad47","mcp_get_code":{"code_sha256":"2519b3efd481ad47"}}]}