{"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/masking","entry":"Masking","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":5,"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":9,"n_samples_ran":6,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":6,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":3},"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.00888","paper":"/paper/arxiv-2606-00888","title":"Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scaling","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"QiaoXiao7282/SMET","path":"sparselearning/core_dst.py","file_url":"https://github.com/QiaoXiao7282/SMET/blob/HEAD/sparselearning/core_dst.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65ba3f1f2f9fb257","mcp_get_code":{"code_sha256":"65ba3f1f2f9fb257"}},{"arxiv_id":"2402.03885","paper":"/paper/moment-a-family-of-open-time-series","title":"MOMENT: A Family of Open Time-series Foundation Models","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moment-timeseries-foundation-model/moment-research","path":"moment/models/moment.py","file_url":"https://github.com/moment-timeseries-foundation-model/moment-research/blob/HEAD/moment/models/moment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e8834f0cfa23f251","mcp_get_code":{"code_sha256":"e8834f0cfa23f251"}},{"arxiv_id":"2402.03885","paper":"/paper/moment-a-family-of-open-time-series","title":"MOMENT: A Family of Open Time-series Foundation Models","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"moment-timeseries-foundation-model/moment","path":"momentfm/models/moment.py","file_url":"https://github.com/moment-timeseries-foundation-model/moment/blob/HEAD/momentfm/models/moment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d202f0efa0f3d3b","mcp_get_code":{"code_sha256":"6d202f0efa0f3d3b"}},{"arxiv_id":"2310.02277","paper":"/paper/junk-dna-hypothesis-a-task-centric-angle-of","title":"Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs \"Difficult\" Downstream Tasks in LLMs","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/junk_dna_hypothesis","path":"True_GEM/sparse/sparse_core.py","file_url":"https://github.com/vita-group/junk_dna_hypothesis/blob/HEAD/True_GEM/sparse/sparse_core.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0619348bb5a27dda","mcp_get_code":{"code_sha256":"0619348bb5a27dda"}},{"arxiv_id":"2212.09840","paper":"/paper/dynamic-sparse-network-for-time-series","title":"Dynamic Sparse Network for Time Series Classification: Learning What to \"see''","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiaoxiao7282/dsn","path":"sparselearning/core_kernel.py","file_url":"https://github.com/qiaoxiao7282/dsn/blob/HEAD/sparselearning/core_kernel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"153dac5f9fb3ef94","mcp_get_code":{"code_sha256":"153dac5f9fb3ef94"}},{"arxiv_id":"2106.14568","paper":"/paper/freetickets-accurate-robust-and-efficient","title":"Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/freetickets","path":"sparselearning/core.py","file_url":"https://github.com/vita-group/freetickets/blob/HEAD/sparselearning/core.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4bb21a77b180d6b4","mcp_get_code":{"code_sha256":"4bb21a77b180d6b4"}},{"arxiv_id":"2106.10404","paper":"/paper/sparse-training-via-boosting-pruning","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","date":"2021-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/granet","path":"CIFAR/sparselearning/core.py","file_url":"https://github.com/vita-group/granet/blob/HEAD/CIFAR/sparselearning/core.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"21c612263568ab05","mcp_get_code":{"code_sha256":"21c612263568ab05"}},{"arxiv_id":"2106.04533","paper":"/paper/chasing-sparsity-in-vision-transformers-an","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/SViTE","path":"SViTE/dst_utils/core.py","file_url":"https://github.com/VITA-Group/SViTE/blob/HEAD/SViTE/dst_utils/core.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2aa4315db6649c6d","mcp_get_code":{"code_sha256":"2aa4315db6649c6d"}},{"arxiv_id":"1706.03762","paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mitran27/Attention-is-all-you-Need","path":"Components/Attention.py","file_url":"https://github.com/mitran27/Attention-is-all-you-Need/blob/HEAD/Components/Attention.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8fa3f8f1de77719a","mcp_get_code":{"code_sha256":"8fa3f8f1de77719a"}}]}