{"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/pruner","entry":"Pruner","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":8,"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":11,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":10,"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":7},"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":"2505.12212","arxiv_id_is_arxiv":true,"paper":"/paper/data-whisperer-efficient-data-selection-for","title":"Data Whisperer: Efficient Data Selection for Task-Specific LLM Fine-Tuning via Few-Shot In-Context Learning","date":"2025-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gszfwsb/Data-Whisperer","path":"pruning/datawhisperer_gsm_pruner.py","file_url":"https://github.com/gszfwsb/Data-Whisperer/blob/HEAD/pruning/datawhisperer_gsm_pruner.py","status":"unverified","verification_level":0,"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, gszfwsb/Data-Whisperer when it was checked","code_sha256":"1e53a03eb50382c7","code_sha256_prefix":"1e53a03eb50382c7","mcp_get_code":{"code_sha256":"1e53a03eb50382c7"}},{"arxiv_id":"2404.05621","arxiv_id_is_arxiv":true,"paper":"/paper/multiflow-shifting-towards-task-agnostic","title":"MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning","date":"2024-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FarinaMatteo/multiflow","path":"pruners/multiflow.py","file_url":"https://github.com/FarinaMatteo/multiflow/blob/HEAD/pruners/multiflow.py","status":"unverified","verification_level":0,"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, FarinaMatteo/multiflow when it was checked","code_sha256":"f790d340a0df644e","code_sha256_prefix":"f790d340a0df644e","mcp_get_code":{"code_sha256":"f790d340a0df644e"}},{"arxiv_id":"2206.12562","arxiv_id_is_arxiv":true,"paper":"/paper/platon-pruning-large-transformer-models-with","title":"PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance","date":"2022-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qingruzhang/platon","path":"Pruner.py","file_url":"https://github.com/qingruzhang/platon/blob/HEAD/Pruner.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, qingruzhang/platon when it was checked","code_sha256":"c86186f05d9ac2cd","code_sha256_prefix":"c86186f05d9ac2cd","mcp_get_code":{"code_sha256":"c86186f05d9ac2cd"}},{"arxiv_id":"2206.06563","arxiv_id_is_arxiv":true,"paper":"/paper/zeroth-order-topological-insights-into","title":"Zeroth-Order Topological Insights into Iterative Magnitude Pruning","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ganguli-lab/Synaptic-Flow","path":"Pruners/pruners.py","file_url":"https://github.com/ganguli-lab/Synaptic-Flow/blob/HEAD/Pruners/pruners.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, ganguli-lab/Synaptic-Flow when it was checked","code_sha256":"25100e43d36881c9","code_sha256_prefix":"25100e43d36881c9","mcp_get_code":{"code_sha256":"25100e43d36881c9"}},{"arxiv_id":"2103.16886","arxiv_id_is_arxiv":true,"paper":"/paper/neural-response-interpretation-through-the","title":"Neural Response Interpretation through the Lens of Critical Pathways","date":"2021-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CAMP-eXplain-AI/PathwayGrad","path":"src/Pruner.py","file_url":"https://github.com/CAMP-eXplain-AI/PathwayGrad/blob/HEAD/src/Pruner.py","status":"unverified","verification_level":0,"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, CAMP-eXplain-AI/PathwayGrad when it was checked","code_sha256":"f347c8b42ab4d75b","code_sha256_prefix":"f347c8b42ab4d75b","mcp_get_code":{"code_sha256":"f347c8b42ab4d75b"}},{"arxiv_id":"2012.09243","arxiv_id_is_arxiv":true,"paper":"/paper/neural-pruning-via-growing-regularization-1","title":"Neural Pruning via Growing Regularization","date":"2020-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingsun-tse/regularization-pruning","path":"pruner/reg_pruner.py","file_url":"https://github.com/mingsun-tse/regularization-pruning/blob/HEAD/pruner/reg_pruner.py","status":"unverified","verification_level":0,"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, mingsun-tse/regularization-pruning when it was checked","code_sha256":"3d649921f02ecc11","code_sha256_prefix":"3d649921f02ecc11","mcp_get_code":{"code_sha256":"3d649921f02ecc11"}},{"arxiv_id":"2006.05467","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-neural-networks-without-any-data-by","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pvh1602/npb","path":"Pruners/pruners.py","file_url":"https://github.com/pvh1602/npb/blob/HEAD/Pruners/pruners.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, pvh1602/npb when it was checked","code_sha256":"e28e1790d31fe600","code_sha256_prefix":"e28e1790d31fe600","mcp_get_code":{"code_sha256":"e28e1790d31fe600"}},{"arxiv_id":"2006.05467","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-neural-networks-without-any-data-by","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hoonyyhoon/Comparison-of-Synflow_SNIP_GraSP","path":"pruning_method/Synflow.py","file_url":"https://github.com/Hoonyyhoon/Comparison-of-Synflow_SNIP_GraSP/blob/HEAD/pruning_method/Synflow.py","status":"unverified","verification_level":0,"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, Hoonyyhoon/Comparison-of-Synflow_SNIP_GraSP when it was checked","code_sha256":"80f512af69686019","code_sha256_prefix":"80f512af69686019","mcp_get_code":{"code_sha256":"80f512af69686019"}},{"arxiv_id":"2006.05467","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-neural-networks-without-any-data-by","title":"Pruning neural networks without any data by iteratively conserving synaptic flow","date":"2020-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iurada/px-ntk-pruning","path":"lib/pruners.py","file_url":"https://github.com/iurada/px-ntk-pruning/blob/HEAD/lib/pruners.py","status":"unverified","verification_level":0,"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, iurada/px-ntk-pruning when it was checked","code_sha256":"895223082b0c7453","code_sha256_prefix":"895223082b0c7453","mcp_get_code":{"code_sha256":"895223082b0c7453"}},{"arxiv_id":"1608.08710","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-filters-for-efficient-convnets","title":"Pruning Filters for Efficient ConvNets","date":"2016-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcoancona/TorchPruner","path":"torchpruner/pruner/pruner.py","file_url":"https://github.com/marcoancona/TorchPruner/blob/HEAD/torchpruner/pruner/pruner.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":"5d815bc1bdb41c80","code_sha256_prefix":"5d815bc1bdb41c80","mcp_get_code":{"code_sha256":"5d815bc1bdb41c80"}},{"arxiv_id":"1608.08710","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-filters-for-efficient-convnets","title":"Pruning Filters for Efficient ConvNets","date":"2016-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingsun-tse/regularization-pruning","path":"pruner/l1_pruner.py","file_url":"https://github.com/mingsun-tse/regularization-pruning/blob/HEAD/pruner/l1_pruner.py","status":"unverified","verification_level":0,"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, mingsun-tse/regularization-pruning when it was checked","code_sha256":"eb229809230a2c98","code_sha256_prefix":"eb229809230a2c98","mcp_get_code":{"code_sha256":"eb229809230a2c98"}}],"record_sha256":"f7ce38ed9b0110907ea76b00a71029c0bd873bd9873dc95ae44e58735227d936","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}