{"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/wrappedgpt","entry":"WrappedGPT","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":6,"n_papers_ran":4,"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":6,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"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":"0c1d287228e4b5ef","mcp_get_code":{"code_sha256":"0c1d287228e4b5ef"}},{"arxiv_id":"2506.08436","paper":"/paper/olica-efficient-structured-pruning-of-large","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bettertmrr/llm-olica","path":"model_pruning.py","file_url":"https://github.com/bettertmrr/llm-olica/blob/HEAD/model_pruning.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a1c8ad2d14601495","mcp_get_code":{"code_sha256":"a1c8ad2d14601495"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c5a1e00bdf2e981f","mcp_get_code":{"code_sha256":"c5a1e00bdf2e981f"}},{"arxiv_id":"2505.23807","paper":"/paper/dlp-dynamic-layerwise-pruning-in-large","title":"DLP: Dynamic Layerwise Pruning in Large Language Models","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ironartisan/dlp","path":"lib/prune.py","file_url":"https://github.com/ironartisan/dlp/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":"c8eb582a1c308afe","mcp_get_code":{"code_sha256":"c8eb582a1c308afe"}},{"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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ba57808cc18062f0","mcp_get_code":{"code_sha256":"ba57808cc18062f0"}},{"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c496051510743116","mcp_get_code":{"code_sha256":"c496051510743116"}}]}