{"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/check-sparsity","entry":"check_sparsity","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":16,"n_papers_ran":15,"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":14,"n_samples_ran":12,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":3,"by_status":{"ran_honours":5,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"unverified":2},"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":"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/utils.py","file_url":"https://github.com/mohammad-mozaffari/slim/blob/HEAD/slim/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"42183294cfd88747","mcp_get_code":{"code_sha256":"42183294cfd88747"}},{"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":"91a952a7c3e11f8b","mcp_get_code":{"code_sha256":"91a952a7c3e11f8b"}},{"arxiv_id":"2407.02068","paper":"/paper/lpvit-low-power-semi-structured-pruning-for","title":"LPViT: Low-Power Semi-structured Pruning for Vision Transformers","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Akimoto-Cris/LPViT","path":"pruning_utils.py","file_url":"https://github.com/Akimoto-Cris/LPViT/blob/HEAD/pruning_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"de2af715a05df3be","mcp_get_code":{"code_sha256":"de2af715a05df3be"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac28c555c0ec0815","mcp_get_code":{"code_sha256":"ac28c555c0ec0815"}},{"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":"4cf1dd5e7d4e2ca9","mcp_get_code":{"code_sha256":"4cf1dd5e7d4e2ca9"}},{"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"75c1b08e37a25564","mcp_get_code":{"code_sha256":"75c1b08e37a25564"}},{"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":"4cf1dd5e7d4e2ca9","mcp_get_code":{"code_sha256":"4cf1dd5e7d4e2ca9"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d7befe8027d275aa","mcp_get_code":{"code_sha256":"d7befe8027d275aa"}},{"arxiv_id":"2311.04902","paper":"/paper/beyond-size-how-gradients-shape-pruning","title":"Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rocktimjyotidas/gblm-pruner","path":"lib/prune.py","file_url":"https://github.com/rocktimjyotidas/gblm-pruner/blob/HEAD/lib/prune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d3d2eb274571aa8","mcp_get_code":{"code_sha256":"6d3d2eb274571aa8"}},{"arxiv_id":"2310.18574","paper":"/paper/breaking-the-trilemma-of-privacy-utility","title":"Breaking the Trilemma of Privacy, Utility, Efficiency via Controllable Machine Unlearning","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guangyaodou/conmu","path":"utils.py","file_url":"https://github.com/guangyaodou/conmu/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a8d2e1e32689ed","mcp_get_code":{"code_sha256":"93a8d2e1e32689ed"}},{"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"75c1b08e37a25564","mcp_get_code":{"code_sha256":"75c1b08e37a25564"}},{"arxiv_id":"2308.14969","paper":"/paper/reprogramming-under-constraints-revisiting","title":"Uncovering the Hidden Cost of Model Compression","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"landskape-ai/reprogram_lt","path":"experiments/cnn/ilm_vp.py","file_url":"https://github.com/landskape-ai/reprogram_lt/blob/HEAD/experiments/cnn/ilm_vp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8ed61d2bcf647b5d","mcp_get_code":{"code_sha256":"8ed61d2bcf647b5d"}},{"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":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b7b64b9aea9a039","mcp_get_code":{"code_sha256":"3b7b64b9aea9a039"}},{"arxiv_id":"2206.04762","paper":"/paper/data-efficient-double-win-lottery-tickets","title":"Data-Efficient Double-Win Lottery Tickets from Robust Pre-training","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/double-win-lth","path":"utils_pruning.py","file_url":"https://github.com/vita-group/double-win-lth/blob/HEAD/utils_pruning.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"092c59fab4392ba6","mcp_get_code":{"code_sha256":"092c59fab4392ba6"}},{"arxiv_id":"2106.03225","paper":"/paper/efficient-lottery-ticket-finding-less-data-is","title":"Efficient Lottery Ticket Finding: Less Data is More","date":"2021-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/PrAC-LTH","path":"utils/pruner.py","file_url":"https://github.com/VITA-Group/PrAC-LTH/blob/HEAD/utils/pruner.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"092c59fab4392ba6","mcp_get_code":{"code_sha256":"092c59fab4392ba6"}},{"arxiv_id":"1705.09296","paper":"/paper/neural-models-for-documents-with-metadata","title":"Neural Models for Documents with Metadata","date":"2017-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dallascard/neural_topic_models","path":"theano_code/run_ngtm.py","file_url":"https://github.com/dallascard/neural_topic_models/blob/HEAD/theano_code/run_ngtm.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3dc75aaf31d3c1f1","mcp_get_code":{"code_sha256":"3dc75aaf31d3c1f1"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d7befe8027d275aa","mcp_get_code":{"code_sha256":"d7befe8027d275aa"}},{"arxiv_id":"2025.findings-acl.394","paper":null,"title":"arXiv:2025.findings-acl.394","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TheShineyue/HSR","path":"alignment-attribution-hsr/lib/prune.py","file_url":"https://github.com/TheShineyue/HSR/blob/HEAD/alignment-attribution-hsr/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":"e5c2acc858940a2b","mcp_get_code":{"code_sha256":"e5c2acc858940a2b"}}]}