{"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/get-sparsity","entry":"get_sparsity","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":5,"n_papers_ran":3,"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":4,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2407.02068","paper":"/paper/lpvit-low-power-semi-structured-pruning-for","title":"LPViT: Low-Power Semi-structured Pruning for Vision Transformers","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Akimoto-Cris/LPViT","path":"engine.py","file_url":"https://github.com/Akimoto-Cris/LPViT/blob/HEAD/engine.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9f7f6915bde67e3d","mcp_get_code":{"code_sha256":"9f7f6915bde67e3d"}},{"arxiv_id":"2402.15978","paper":"/paper/shaving-weights-with-occam-s-razor-bayesian","title":"Shaving Weights with Occam's Razor: Bayesian Sparsification for Neural Networks Using the Marginal Likelihood","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fortuinlab/spam-pruning","path":"experiment/src/marglikopt.py","file_url":"https://github.com/fortuinlab/spam-pruning/blob/HEAD/experiment/src/marglikopt.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9d92e467fe9c8557","mcp_get_code":{"code_sha256":"9d92e467fe9c8557"}},{"arxiv_id":"2311.09060","paper":"/paper/do-localization-methods-actually-localize","title":"Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarks","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terarachang/memdata","path":"hardconcrete.py","file_url":"https://github.com/terarachang/memdata/blob/HEAD/hardconcrete.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":"c5bca863e8e455ff","mcp_get_code":{"code_sha256":"c5bca863e8e455ff"}},{"arxiv_id":"2206.09677","paper":"/paper/graphframex-towards-systematic-evaluation-of","title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","date":"2022-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphframex/graphframex","path":"code/evaluate/mask_utils.py","file_url":"https://github.com/graphframex/graphframex/blob/HEAD/code/evaluate/mask_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"300eb8be7c13d669","mcp_get_code":{"code_sha256":"300eb8be7c13d669"}},{"arxiv_id":"2024.naacl-long.176","paper":null,"title":"arXiv:2024.naacl-long.176","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"terarachang/MemPi","path":"hardconcrete.py","file_url":"https://github.com/terarachang/MemPi/blob/HEAD/hardconcrete.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":"c5bca863e8e455ff","mcp_get_code":{"code_sha256":"c5bca863e8e455ff"}}]}