{"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/cleanup-memory","entry":"cleanup_memory","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":8,"n_papers_ran":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":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2605.15491","paper":"/paper/arxiv-2605-15491","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chenxinrui-tsinghua/LinearPatch","path":"rotate_utils/utils.py","file_url":"https://github.com/chenxinrui-tsinghua/LinearPatch/blob/HEAD/rotate_utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"88c8d591b4688832","mcp_get_code":{"code_sha256":"88c8d591b4688832"}},{"arxiv_id":"2604.07955","paper":"/paper/arxiv-2604-07955","title":"Rethinking Residual Errors in Compensation-based LLM Quantization","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"list0830/ResComp","path":"fake_quant/utils.py","file_url":"https://github.com/list0830/ResComp/blob/HEAD/fake_quant/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"88c8d591b4688832","mcp_get_code":{"code_sha256":"88c8d591b4688832"}},{"arxiv_id":"2602.22538","paper":"/paper/arxiv-2602-22538","title":"RAIN-Merging: A Gradient-Free Method to Enhance Instruction Following in Large Reasoning Models with Preserved Thinking Format","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"K1nght/RAIN-Merging","path":"nullspace_merge_qkvo_ffn.py","file_url":"https://github.com/K1nght/RAIN-Merging/blob/HEAD/nullspace_merge_qkvo_ffn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e35eabd03de87a8","mcp_get_code":{"code_sha256":"0e35eabd03de87a8"}},{"arxiv_id":"2602.02546","paper":"/paper/arxiv-2602-02546","title":"D 2 Quant: Accurate Low-bit Post-Training Weight Quantization for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"XIANGLONGYAN/D2Quant","path":"d2quant/config.py","file_url":"https://github.com/XIANGLONGYAN/D2Quant/blob/HEAD/d2quant/config.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":"58973fc4e2b31774","mcp_get_code":{"code_sha256":"58973fc4e2b31774"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a8119d4e31042017","mcp_get_code":{"code_sha256":"a8119d4e31042017"}},{"arxiv_id":"2505.13866","paper":"/paper/reasoning-path-compression-compressing","title":"Reasoning Path Compression: Compressing Generation Trajectories for Efficient LLM Reasoning","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiwonsong-dev/reasoningpathcompression","path":"benchmark/throughput.py","file_url":"https://github.com/jiwonsong-dev/reasoningpathcompression/blob/HEAD/benchmark/throughput.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fae5b507fb9dfa12","mcp_get_code":{"code_sha256":"fae5b507fb9dfa12"}},{"arxiv_id":"2504.02692","paper":"/paper/gptqv2-efficient-finetuning-free-quantization","title":"GPTAQ: Efficient Finetuning-Free Quantization for Asymmetric Calibration","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-computing-lab-yale/gptaq","path":"fake_quant/gptaq_utils.py","file_url":"https://github.com/intelligent-computing-lab-yale/gptaq/blob/HEAD/fake_quant/gptaq_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"88c8d591b4688832","mcp_get_code":{"code_sha256":"88c8d591b4688832"}},{"arxiv_id":"2406.13474","paper":"/paper/attention-aware-post-training-quantization","title":"Attention-aware Post-training Quantization without Backpropagation","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SamsungLabs/BoA","path":"quantizers/boa.py","file_url":"https://github.com/SamsungLabs/BoA/blob/HEAD/quantizers/boa.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b9b9db4928482dd1","mcp_get_code":{"code_sha256":"b9b9db4928482dd1"}}]}