{"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/prune","entry":"prune","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":17,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":11,"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":15,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":9,"n_samples_unverified":3,"n_samples_fingerprinted":4,"n_places":17,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":2,"ran_fixture":7,"ran":3,"unverified":3},"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":"2606.03465","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03465","title":"Rethinking the Role of Tensor Decompositions in Post-Training LLM Compression","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"brain-lab-research/TT-LLM","path":"src/tucker_llm/laser/matrix_utils.py","file_url":"https://github.com/brain-lab-research/TT-LLM/blob/HEAD/src/tucker_llm/laser/matrix_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, brain-lab-research/TT-LLM when it was checked","code_sha256":"dfd3f0f25b0b9ad2","code_sha256_prefix":"dfd3f0f25b0b9ad2","mcp_get_code":{"code_sha256":"dfd3f0f25b0b9ad2"}},{"arxiv_id":"2604.23067","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-23067","title":"Training a General Purpose Automated Red Teaming Model","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"NVIDIA/garak","path":"garak/resources/red_team/conversation.py","file_url":"https://github.com/NVIDIA/garak/blob/HEAD/garak/resources/red_team/conversation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bc4fa40e4777638d","code_sha256_prefix":"bc4fa40e4777638d","mcp_get_code":{"code_sha256":"bc4fa40e4777638d"}},{"arxiv_id":"2505.05464","arxiv_id_is_arxiv":true,"paper":"/paper/bring-reason-to-vision-understanding","title":"Bring Reason to Vision: Understanding Perception and Reasoning through Model Merging","date":"2025-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shiqichen17/vlm_merging","path":"merge.py","file_url":"https://github.com/shiqichen17/vlm_merging/blob/HEAD/merge.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shiqichen17/vlm_merging when it was checked","code_sha256":"6caa545d200ee863","code_sha256_prefix":"6caa545d200ee863","mcp_get_code":{"code_sha256":"6caa545d200ee863"}},{"arxiv_id":"2409.14866","arxiv_id_is_arxiv":true,"paper":"/paper/effective-and-evasive-fuzz-testing-driven","title":"PAPILLON: Efficient and Stealthy Fuzz Testing-Powered Jailbreaks for LLMs","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaFrostnova/Papillon","path":"gptfuzzer/fuzzer/branch_prune.py","file_url":"https://github.com/aaFrostnova/Papillon/blob/HEAD/gptfuzzer/fuzzer/branch_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":"486c6d66a5df42d2","code_sha256_prefix":"486c6d66a5df42d2","mcp_get_code":{"code_sha256":"486c6d66a5df42d2"}},{"arxiv_id":"2406.11257","arxiv_id_is_arxiv":true,"paper":"/paper/excp-extreme-llm-checkpoint-compression-via","title":"ExCP: Extreme LLM Checkpoint Compression via Weight-Momentum Joint Shrinking","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gaffey/ExCP","path":"compress_pythia.py","file_url":"https://github.com/Gaffey/ExCP/blob/HEAD/compress_pythia.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9d020e96607ddadd","code_sha256_prefix":"9d020e96607ddadd","mcp_get_code":{"code_sha256":"9d020e96607ddadd"}},{"arxiv_id":"2405.14791","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-early-exits-for-federated-learning","title":"Recurrent Early Exits for Federated Learning with Heterogeneous Clients","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royson/reefl","path":"src/models/reefl_vit.py","file_url":"https://github.com/royson/reefl/blob/HEAD/src/models/reefl_vit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9b6ef57a04624e80","code_sha256_prefix":"9b6ef57a04624e80","mcp_get_code":{"code_sha256":"9b6ef57a04624e80"}},{"arxiv_id":"2403.00867","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-cuff-detecting-jailbreak-attacks-on","title":"Gradient Cuff: Detecting Jailbreak Attacks on Large Language Models by Exploring Refusal Loss Landscapes","date":"2024-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RICommunity/TAP","path":"main_TAP.py","file_url":"https://github.com/RICommunity/TAP/blob/HEAD/main_TAP.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27665c6bc88f1a85","code_sha256_prefix":"27665c6bc88f1a85","mcp_get_code":{"code_sha256":"27665c6bc88f1a85"}},{"arxiv_id":"2312.13558","arxiv_id_is_arxiv":true,"paper":"/paper/the-truth-is-in-there-improving-reasoning-in","title":"The Truth is in There: Improving Reasoning in Language Models with Layer-Selective Rank Reduction","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pratyushasharma/laser","path":"src/laser/matrix_utils.py","file_url":"https://github.com/pratyushasharma/laser/blob/HEAD/src/laser/matrix_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from brain-lab-research/TT-LLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"dfd3f0f25b0b9ad2","code_sha256_prefix":"dfd3f0f25b0b9ad2","mcp_get_code":{"code_sha256":"dfd3f0f25b0b9ad2"}},{"arxiv_id":"2312.02119","arxiv_id_is_arxiv":true,"paper":"/paper/tree-of-attacks-jailbreaking-black-box-llms","title":"Tree of Attacks: Jailbreaking Black-Box LLMs Automatically","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ricommunity/tap","path":"main_TAP.py","file_url":"https://github.com/ricommunity/tap/blob/HEAD/main_TAP.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"27665c6bc88f1a85","code_sha256_prefix":"27665c6bc88f1a85","mcp_get_code":{"code_sha256":"27665c6bc88f1a85"}},{"arxiv_id":"2205.01753","arxiv_id_is_arxiv":true,"paper":"/paper/self-focusing-virtual-screening-with-active","title":"Self-focusing virtual screening with active design space pruning","date":"2022-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coleygroup/dsp","path":"scripts/figures.py","file_url":"https://github.com/coleygroup/dsp/blob/HEAD/scripts/figures.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7cd86bfe4f28fe6","code_sha256_prefix":"b7cd86bfe4f28fe6","mcp_get_code":{"code_sha256":"b7cd86bfe4f28fe6"}},{"arxiv_id":"2110.09192","arxiv_id_is_arxiv":true,"paper":"/paper/learning-optimal-conformal-classifiers-1","title":"Learning Optimal Conformal Classifiers","date":"2021-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepmind/conformal_training","path":"sorting_nets.py","file_url":"https://github.com/deepmind/conformal_training/blob/HEAD/sorting_nets.py","status":"ran","verification_level":1,"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":"f0772d96f45ed98e","code_sha256_prefix":"f0772d96f45ed98e","mcp_get_code":{"code_sha256":"f0772d96f45ed98e"}},{"arxiv_id":"2103.06460","arxiv_id_is_arxiv":true,"paper":"/paper/emerging-paradigms-of-neural-network-pruning","title":"Recent Advances on Neural Network Pruning at Initialization","date":"2021-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingsun-tse/smile-pruning","path":"src/method_modules/prune.py","file_url":"https://github.com/mingsun-tse/smile-pruning/blob/HEAD/src/method_modules/prune.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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/smile-pruning when it was checked","code_sha256":"2fda1688059866b1","code_sha256_prefix":"2fda1688059866b1","mcp_get_code":{"code_sha256":"2fda1688059866b1"}},{"arxiv_id":"2006.07556","arxiv_id_is_arxiv":true,"paper":"/paper/neural-architecture-search-using-bayesian","title":"Interpretable Neural Architecture Search via Bayesian Optimisation with Weisfeiler-Lehman Kernels","date":"2020-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingchenwan/nasbowl","path":"bayesopt/generate_test_graphs.py","file_url":"https://github.com/xingchenwan/nasbowl/blob/HEAD/bayesopt/generate_test_graphs.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":"43444e233e672713","code_sha256_prefix":"43444e233e672713","mcp_get_code":{"code_sha256":"43444e233e672713"}},{"arxiv_id":"1810.02340","arxiv_id_is_arxiv":true,"paper":"/paper/snip-single-shot-network-pruning-based-on","title":"SNIP: Single-shot Network Pruning based on Connection Sensitivity","date":"2018-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"namhoonlee/snip-public","path":"snip/prune.py","file_url":"https://github.com/namhoonlee/snip-public/blob/HEAD/snip/prune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1bdb1c27633e3a80","code_sha256_prefix":"1bdb1c27633e3a80","mcp_get_code":{"code_sha256":"1bdb1c27633e3a80"}},{"arxiv_id":"1809.10341","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwwyyun/HDGI","path":"execute.py","file_url":"https://github.com/wwwyyun/HDGI/blob/HEAD/execute.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e853d6332902fb5f","code_sha256_prefix":"e853d6332902fb5f","mcp_get_code":{"code_sha256":"e853d6332902fb5f"}},{"arxiv_id":"1803.03635","arxiv_id_is_arxiv":true,"paper":"/paper/the-lottery-ticket-hypothesis-finding-sparse","title":"The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks","date":"2018-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Taoudi/LotteryTicketHypothesis","path":"src/conv_cifar/pruning.py","file_url":"https://github.com/Taoudi/LotteryTicketHypothesis/blob/HEAD/src/conv_cifar/pruning.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, Taoudi/LotteryTicketHypothesis when it was checked","code_sha256":"affcc14cf097faad","code_sha256_prefix":"affcc14cf097faad","mcp_get_code":{"code_sha256":"affcc14cf097faad"}},{"arxiv_id":"1608.03665","arxiv_id_is_arxiv":true,"paper":"/paper/learning-structured-sparsity-in-deep-neural","title":"Learning Structured Sparsity in Deep Neural Networks","date":"2016-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZJCV/SSL","path":"sslearning/prune/prune_resnet_by_depth.py","file_url":"https://github.com/ZJCV/SSL/blob/HEAD/sslearning/prune/prune_resnet_by_depth.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":"d8ae353c6503316a","code_sha256_prefix":"d8ae353c6503316a","mcp_get_code":{"code_sha256":"d8ae353c6503316a"}}],"record_sha256":"f1653b361761a24d90aa0e0878b0cf0d1e6f71b47503672f82c04925d2b4ecac","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}