{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/wrappedgpt","entry":"WrappedGPT","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"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_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":2},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c1d287228e4b5ef","code_sha256_prefix":"0c1d287228e4b5ef","mcp_get_code":{"code_sha256":"0c1d287228e4b5ef"}},{"arxiv_id":"2506.08436","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bettertmrr/llm-olica when it was checked","code_sha256":"a1c8ad2d14601495","code_sha256_prefix":"a1c8ad2d14601495","mcp_get_code":{"code_sha256":"a1c8ad2d14601495"}},{"arxiv_id":"2506.06866","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c5a1e00bdf2e981f","code_sha256_prefix":"c5a1e00bdf2e981f","mcp_get_code":{"code_sha256":"c5a1e00bdf2e981f"}},{"arxiv_id":"2505.23807","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c8eb582a1c308afe","code_sha256_prefix":"c8eb582a1c308afe","mcp_get_code":{"code_sha256":"c8eb582a1c308afe"}},{"arxiv_id":"2310.08915","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zyxxmu/dsnot when it was checked","code_sha256":"ba57808cc18062f0","code_sha256_prefix":"ba57808cc18062f0","mcp_get_code":{"code_sha256":"ba57808cc18062f0"}},{"arxiv_id":"2310.05175","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c496051510743116","code_sha256_prefix":"c496051510743116","mcp_get_code":{"code_sha256":"c496051510743116"}}],"record_sha256":"b3427e5b472d2138517d039c363285567e10edb592979c04795f5bf019fdb6da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}