{"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/find-layers","entry":"find_layers","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":68,"n_papers_ran":65,"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":17,"n_samples_ran":14,"n_samples_fingerprinted":0,"n_places":71,"n_places_pointer_only":25,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":8,"ran_fixture":0,"ran":6,"unverified":3},"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"088898428fc14c3e","mcp_get_code":{"code_sha256":"088898428fc14c3e"}},{"arxiv_id":"2606.04980","paper":"/paper/arxiv-2606-04980","title":"AlphaQ: Calibration-Free Bit Allocation for Mixture-of-Experts Quantization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Superone77/AlphaQ","path":"modelutils.py","file_url":"https://github.com/Superone77/AlphaQ/blob/HEAD/modelutils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"42a68e1344b46dfb","mcp_get_code":{"code_sha256":"42a68e1344b46dfb"}},{"arxiv_id":"2603.01376","paper":"/paper/arxiv-2603-01376","title":"3BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"mazumder-lab/3BASiL","path":"pipeline.py","file_url":"https://github.com/mazumder-lab/3BASiL/blob/HEAD/pipeline.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":"a27cec0b3dcb1fec","mcp_get_code":{"code_sha256":"a27cec0b3dcb1fec"}},{"arxiv_id":"2602.01027","paper":"/paper/arxiv-2602-01027","title":"SFMP: Fine-Grained, Hardware-Friendly and Search-Free Mixed-Precision Quantization for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Nkniexin/SFMP","path":"GPTQ/modelutils.py","file_url":"https://github.com/Nkniexin/SFMP/blob/HEAD/GPTQ/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"14fab8e91e876c60","mcp_get_code":{"code_sha256":"14fab8e91e876c60"}},{"arxiv_id":"2510.03267","paper":"/paper/arxiv-2510-03267","title":"PT$^2$-LLM: Post-Training Ternarization for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"XIANGLONGYAN/PT2-LLM","path":"pt2_llm/model_utils.py","file_url":"https://github.com/XIANGLONGYAN/PT2-LLM/blob/HEAD/pt2_llm/model_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2510.01650","paper":"/paper/arxiv-2510-01650","title":"The Unseen Frontier: Pushing the Limits of LLM Sparsity with Surrogate-Free ADMM","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"log-postech/elsa","path":"lib/utils.py","file_url":"https://github.com/log-postech/elsa/blob/HEAD/lib/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6644b68819429769","mcp_get_code":{"code_sha256":"6644b68819429769"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6644b68819429769","mcp_get_code":{"code_sha256":"6644b68819429769"}},{"arxiv_id":"2506.03781","paper":null,"title":"arXiv:2506.03781","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"OpenGVLab/OmniQuant","path":"models/models_utils.py","file_url":"https://github.com/OpenGVLab/OmniQuant/blob/HEAD/models/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2505.02214","paper":"/paper/an-empirical-study-of-qwen3-quantization","title":"An Empirical Study of Qwen3 Quantization","date":"2025-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"efficient-ml/qwen3-quantization","path":"BiLLM/modelutils.py","file_url":"https://github.com/efficient-ml/qwen3-quantization/blob/HEAD/BiLLM/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2411.09688","paper":"/paper/squeezed-attention-accelerating-long-context","title":"Squeezed Attention: Accelerating Long Context Length LLM Inference","date":"2024-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SqueezeAILab/SqueezedAttention","path":"utils/modelutils.py","file_url":"https://github.com/SqueezeAILab/SqueezedAttention/blob/HEAD/utils/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2411.05282","paper":"/paper/microscopiq-accelerating-foundational-models","title":"MicroScopiQ: Accelerating Foundational Models through Outlier-Aware Microscaling Quantization","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgia-tech-synergy-lab/microscopiq-llm-quantization","path":"utils/modelutils.py","file_url":"https://github.com/georgia-tech-synergy-lab/microscopiq-llm-quantization/blob/HEAD/utils/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2410.09344","paper":"/paper/dare-the-extreme-revisiting-delta-parameter","title":"DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models","date":"2024-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vengdeng/darex","path":"utils/getwx.py","file_url":"https://github.com/vengdeng/darex/blob/HEAD/utils/getwx.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2410.06270","paper":"/paper/mc-moe-mixture-compressor-for-mixture-of","title":"MC-MoE: Mixture Compressor for Mixture-of-Experts LLMs Gains More","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aaronhuang-778/MC-MoE","path":"modelutils.py","file_url":"https://github.com/Aaronhuang-778/MC-MoE/blob/HEAD/modelutils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"42a68e1344b46dfb","mcp_get_code":{"code_sha256":"42a68e1344b46dfb"}},{"arxiv_id":"2409.18850","paper":"/paper/two-sparse-matrices-are-better-than-one","title":"Two Sparse Matrices are Better than One: Sparsifying Neural Networks with Double Sparse Factorization","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usamec/double_sparse","path":"modelutils.py","file_url":"https://github.com/usamec/double_sparse/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2409.17066","paper":"/paper/vptq-extreme-low-bit-vector-post-training","title":"VPTQ: Extreme Low-bit Vector Post-Training Quantization for Large Language Models","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/vptq","path":"vptq/layers/utils.py","file_url":"https://github.com/microsoft/vptq/blob/HEAD/vptq/layers/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6886c53e21133de1","mcp_get_code":{"code_sha256":"6886c53e21133de1"}},{"arxiv_id":"2409.13652","paper":"/paper/oats-outlier-aware-pruning-through-sparse-and","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephenqz/oats","path":"OATS/pruning_utils.py","file_url":"https://github.com/stephenqz/oats/blob/HEAD/OATS/pruning_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"14fab8e91e876c60","mcp_get_code":{"code_sha256":"14fab8e91e876c60"}},{"arxiv_id":"2408.05646","paper":"/paper/eigen-attention-attention-in-low-rank-space","title":"Eigen Attention: Attention in Low-Rank Space for KV Cache Compression","date":"2024-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utkarshsaxena1/eigenattn","path":"models/models_utils.py","file_url":"https://github.com/utkarshsaxena1/eigenattn/blob/HEAD/models/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2407.10032","paper":"/paper/leanquant-accurate-large-language-model","title":"LeanQuant: Accurate Large Language Model Quantization with Loss-Error-Aware Grid","date":"2024-07-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LeanModels/LeanQuant","path":"modelutils.py","file_url":"https://github.com/LeanModels/LeanQuant/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2406.16797","paper":"/paper/lottery-ticket-adaptation-mitigating","title":"Lottery Ticket Adaptation: Mitigating Destructive Interference in LLMs","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kiddyboots216/lottery-ticket-adaptation","path":"rlaif/save_mask.py","file_url":"https://github.com/kiddyboots216/lottery-ticket-adaptation/blob/HEAD/rlaif/save_mask.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2406.05981","paper":"/paper/shiftaddllm-accelerating-pretrained-llms-via","title":"ShiftAddLLM: Accelerating Pretrained LLMs via Post-Training Multiplication-Less Reparameterization","date":"2024-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gatech-eic/shiftaddllm","path":"modelutils.py","file_url":"https://github.com/gatech-eic/shiftaddllm/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"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":"lora_ft/evaluate_ppl.py","file_url":"https://github.com/pprp/pruner-zero/blob/HEAD/lora_ft/evaluate_ppl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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/gradient_computation.py","file_url":"https://github.com/pprp/pruner-zero/blob/HEAD/lib/gradient_computation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"14fab8e91e876c60","mcp_get_code":{"code_sha256":"14fab8e91e876c60"}},{"arxiv_id":"2406.01721","paper":"/paper/rotation-and-permutation-for-advanced-outlier","title":"DuQuant: Distributing Outliers via Dual Transformation Makes Stronger Quantized LLMs","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hsu1023/DuQuant","path":"models/models_utils.py","file_url":"https://github.com/Hsu1023/DuQuant/blob/HEAD/models/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2406.00800","paper":"/paper/magr-weight-magnitude-reduction-for-enhancing","title":"MagR: Weight Magnitude Reduction for Enhancing Post-Training Quantization","date":"2024-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AozhongZhang/MagR","path":"modelutils.py","file_url":"https://github.com/AozhongZhang/MagR/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2405.15756","paper":"/paper/sparse-expansion-and-neuronal-disentanglement","title":"Sparse Expansion and Neuronal Disentanglement","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shavit-lab/sparse-expansion","path":"utils/modelutils.py","file_url":"https://github.com/shavit-lab/sparse-expansion/blob/HEAD/utils/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2405.14917","paper":"/paper/slim-llm-salience-driven-mixed-precision","title":"SliM-LLM: Salience-Driven Mixed-Precision Quantization for Large Language Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aaronhuang-778/SliM-LLM","path":"slim-llm/modelutils.py","file_url":"https://github.com/Aaronhuang-778/SliM-LLM/blob/HEAD/slim-llm/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2405.14917","paper":"/paper/slim-llm-salience-driven-mixed-precision","title":"SliM-LLM: Salience-Driven Mixed-Precision Quantization for Large Language Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aaronhuang-778/SliM-LLM","path":"slim-llm-plus/models/models_utils.py","file_url":"https://github.com/Aaronhuang-778/SliM-LLM/blob/HEAD/slim-llm-plus/models/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2405.09055","paper":"/paper/a-safety-realignment-framework-via-subspace","title":"A safety realignment framework via subspace-oriented model fusion for large language models","date":"2024-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinykou/safety_realignment","path":"lm_eval/code_task/modeling.py","file_url":"https://github.com/xinykou/safety_realignment/blob/HEAD/lm_eval/code_task/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3ab3c57755867f9a","mcp_get_code":{"code_sha256":"3ab3c57755867f9a"}},{"arxiv_id":"2404.14047","paper":"/paper/how-good-are-low-bit-quantized-llama3-models","title":"An empirical study of LLaMA3 quantization: from LLMs to MLLMs","date":"2024-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"macaronlin/llama3-quantization","path":"models/models_utils.py","file_url":"https://github.com/macaronlin/llama3-quantization/blob/HEAD/models/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2403.12544","paper":"/paper/affinequant-affine-transformation","title":"AffineQuant: Affine Transformation Quantization for Large Language Models","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/affinequant","path":"models/models_utils.py","file_url":"https://github.com/bytedance/affinequant/blob/HEAD/models/models_utils.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":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2403.06082","paper":"/paper/framequant-flexible-low-bit-quantization-for","title":"FrameQuant: Flexible Low-Bit Quantization for Transformers","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vsingh-group/framequant","path":"modelutils.py","file_url":"https://github.com/vsingh-group/framequant/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2403.01241","paper":"/paper/intactkv-improving-large-language-model","title":"IntactKV: Improving Large Language Model Quantization by Keeping Pivot Tokens Intact","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squeezeailab/kvquant","path":"benchmarking/kvquant/modelutils.py","file_url":"https://github.com/squeezeailab/kvquant/blob/HEAD/benchmarking/kvquant/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2402.17946","paper":"/paper/gradient-free-adaptive-global-pruning-for-pre","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BaiTheBest/SparseLLM","path":"pruning_utils.py","file_url":"https://github.com/BaiTheBest/SparseLLM/blob/HEAD/pruning_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2402.16880","paper":"/paper/besa-pruning-large-language-models-with","title":"BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"linkanonymous/besa","path":"utils/tools.py","file_url":"https://github.com/linkanonymous/besa/blob/HEAD/utils/tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"14fab8e91e876c60","mcp_get_code":{"code_sha256":"14fab8e91e876c60"}},{"arxiv_id":"2402.11295","paper":"/paper/onebit-towards-extremely-low-bit-large","title":"OneBit: Towards Extremely Low-bit Large Language Models","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuyuzhuang11/OneBit","path":"evaluation/lm_eval/models_utils.py","file_url":"https://github.com/xuyuzhuang11/OneBit/blob/HEAD/evaluation/lm_eval/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2402.08958","paper":"/paper/towards-next-level-post-training-quantization","title":"Towards Next-Level Post-Training Quantization of Hyper-Scale Transformers","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SamsungLabs/aespa","path":"utils.py","file_url":"https://github.com/SamsungLabs/aespa/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"1174e949ac22ea59","mcp_get_code":{"code_sha256":"1174e949ac22ea59"}},{"arxiv_id":"2402.04291","paper":"/paper/billm-pushing-the-limit-of-post-training","title":"BiLLM: Pushing the Limit of Post-Training Quantization for LLMs","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaronhuang-778/billm","path":"modelutils.py","file_url":"https://github.com/aaronhuang-778/billm/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2401.18079","paper":"/paper/kvquant-towards-10-million-context-length-llm","title":"KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SqueezeAILab/KVQuant","path":"deployment/kvquant/modelutils.py","file_url":"https://github.com/SqueezeAILab/KVQuant/blob/HEAD/deployment/kvquant/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"71eb7727feb23c97","mcp_get_code":{"code_sha256":"71eb7727feb23c97"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2312.05821","paper":"/paper/asvd-activation-aware-singular-value","title":"ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Models","date":"2023-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahnyuan/asvd4llm","path":"quantization.py","file_url":"https://github.com/hahnyuan/asvd4llm/blob/HEAD/quantization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2311.06322","paper":"/paper/post-training-quantization-with-progressive","title":"Post-training Quantization for Text-to-Image Diffusion Models with Progressive Calibration and Activation Relaxing","date":"2023-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsa18/PCR","path":"quantization_tools/quantization/quantizer_utils.py","file_url":"https://github.com/tsa18/PCR/blob/HEAD/quantization_tools/quantization/quantizer_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"819214853c3d34c7","mcp_get_code":{"code_sha256":"819214853c3d34c7"}},{"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":"gradient_computation.py","file_url":"https://github.com/rocktimjyotidas/gblm-pruner/blob/HEAD/gradient_computation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2310.16795","paper":"/paper/qmoe-practical-sub-1-bit-compression-of","title":"QMoE: Practical Sub-1-Bit Compression of Trillion-Parameter Models","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/qmoe","path":"switch.py","file_url":"https://github.com/ist-daslab/qmoe/blob/HEAD/switch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"87506509921686ee","mcp_get_code":{"code_sha256":"87506509921686ee"}},{"arxiv_id":"2310.09499","paper":"/paper/one-shot-sensitivity-aware-mixed-sparsity","title":"One-Shot Sensitivity-Aware Mixed Sparsity Pruning for Large Language Models","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"talkking/MixGPT","path":"modelutils.py","file_url":"https://github.com/talkking/MixGPT/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2310.08041","paper":"/paper/qllm-accurate-and-efficient-low-bitwidth","title":"QLLM: Accurate and Efficient Low-Bitwidth Quantization for Large Language Models","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"modeltc/qllm","path":"models/models_utils.py","file_url":"https://github.com/modeltc/qllm/blob/HEAD/models/models_utils.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":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2310.07676","paper":"/paper/composite-backdoor-attacks-against-large","title":"Composite Backdoor Attacks Against Large Language Models","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"miraclehh/cba","path":"multimodal/llama2_accessory/eval/modeling.py","file_url":"https://github.com/miraclehh/cba/blob/HEAD/multimodal/llama2_accessory/eval/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3ab3c57755867f9a","mcp_get_code":{"code_sha256":"3ab3c57755867f9a"}},{"arxiv_id":"2310.00034","paper":"/paper/pb-llm-partially-binarized-large-language","title":"PB-LLM: Partially Binarized Large Language Models","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahnyuan/binaryllm","path":"gptq_pb/modelutils.py","file_url":"https://github.com/hahnyuan/binaryllm/blob/HEAD/gptq_pb/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2309.16119","paper":"/paper/modulora-finetuning-3-bit-llms-on-consumer","title":"ModuLoRA: Finetuning 2-Bit LLMs on Consumer GPUs by Integrating with Modular Quantizers","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kuleshov-group/llmtools","path":"llmtools/utils.py","file_url":"https://github.com/kuleshov-group/llmtools/blob/HEAD/llmtools/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2309.07120","paper":"/paper/sight-beyond-text-multi-modal-training","title":"Sight Beyond Text: Multi-Modal Training Enhances LLMs in Truthfulness and Ethics","date":"2023-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-vlaa/sight-beyond-text","path":"llava/eval/mmlu/mmlu_modeling.py","file_url":"https://github.com/ucsc-vlaa/sight-beyond-text/blob/HEAD/llava/eval/mmlu/mmlu_modeling.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":"3ab3c57755867f9a","mcp_get_code":{"code_sha256":"3ab3c57755867f9a"}},{"arxiv_id":"2308.13137","paper":"/paper/omniquant-omnidirectionally-calibrated","title":"OmniQuant: Omnidirectionally Calibrated Quantization for Large Language Models","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/omniquant","path":"models/models_utils.py","file_url":"https://github.com/opengvlab/omniquant/blob/HEAD/models/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2307.15290","paper":"/paper/chathome-development-and-evaluation-of-a","title":"ChatHome: Development and Evaluation of a Domain-Specific Language Model for Home Renovation","date":"2023-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lianjiatech/belle","path":"models/gptq/modelutils.py","file_url":"https://github.com/lianjiatech/belle/blob/HEAD/models/gptq/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2307.09288","paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squeezeailab/squeezellm","path":"squeezellm/modelutils.py","file_url":"https://github.com/squeezeailab/squeezellm/blob/HEAD/squeezellm/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"56ac52f94f2cc872","mcp_get_code":{"code_sha256":"56ac52f94f2cc872"}},{"arxiv_id":"2304.01089","paper":"/paper/rptq-reorder-based-post-training-quantization","title":"RPTQ: Reorder-based Post-training Quantization for Large Language Models","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahnyuan/rptq4llm","path":"models/models_utils.py","file_url":"https://github.com/hahnyuan/rptq4llm/blob/HEAD/models/models_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"904cd61df2fe8fb9","mcp_get_code":{"code_sha256":"904cd61df2fe8fb9"}},{"arxiv_id":"2203.13474","paper":"/paper/a-conversational-paradigm-for-program","title":"CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesis","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openlmlab/moss","path":"models/quantization.py","file_url":"https://github.com/openlmlab/moss/blob/HEAD/models/quantization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"openreview_d3RFDLBw01","paper":null,"title":"arXiv:openreview_d3RFDLBw01","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AI2C-Lab/STLA","path":"utils.py","file_url":"https://github.com/AI2C-Lab/STLA/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1174e949ac22ea59","mcp_get_code":{"code_sha256":"1174e949ac22ea59"}},{"arxiv_id":"openreview_Im05D8gFFn","paper":null,"title":"arXiv:openreview_Im05D8gFFn","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mazumder-lab/RobOP","path":"RobOP-ALPS/utils_models.py","file_url":"https://github.com/mazumder-lab/RobOP/blob/HEAD/RobOP-ALPS/utils_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2025.findings-emnlp.1054","paper":null,"title":"arXiv:2025.findings-emnlp.1054","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"IST-DASLab/sparsegpt","path":"modelutils.py","file_url":"https://github.com/IST-DASLab/sparsegpt/blob/HEAD/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2025.acl-long.590","paper":null,"title":"arXiv:2025.acl-long.590","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ChnQ/SPIN","path":"src/SPIN.py","file_url":"https://github.com/ChnQ/SPIN/blob/HEAD/src/SPIN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2ed16fcdc14ad951","mcp_get_code":{"code_sha256":"2ed16fcdc14ad951"}},{"arxiv_id":"2024.findings-naacl.145","paper":null,"title":"arXiv:2024.findings-naacl.145","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LianjiaTech/BELLE","path":"models/gptq/modelutils.py","file_url":"https://github.com/LianjiaTech/BELLE/blob/HEAD/models/gptq/modelutils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a9e7f2cdf016b88b","mcp_get_code":{"code_sha256":"a9e7f2cdf016b88b"}},{"arxiv_id":"2024.findings-acl.933","paper":null,"title":"arXiv:2024.findings-acl.933","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"AutoGPTQ/AutoGPTQ","path":"auto_gptq/modeling/_utils.py","file_url":"https://github.com/AutoGPTQ/AutoGPTQ/blob/HEAD/auto_gptq/modeling/_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ac48f2f323eda99e","mcp_get_code":{"code_sha256":"ac48f2f323eda99e"}},{"arxiv_id":"2023.emnlp-main.892","paper":null,"title":"arXiv:2023.emnlp-main.892","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamsungLabs/Z-Fold","path":"zfold.py","file_url":"https://github.com/SamsungLabs/Z-Fold/blob/HEAD/zfold.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"602607980dfc128c","mcp_get_code":{"code_sha256":"602607980dfc128c"}}]}