{"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/masking","entry":"Masking","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":5,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":6,"n_samples_constructed":5,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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.00888","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, QiaoXiao7282/SMET when it was checked","code_sha256":"65ba3f1f2f9fb257","code_sha256_prefix":"65ba3f1f2f9fb257","mcp_get_code":{"code_sha256":"65ba3f1f2f9fb257"}},{"arxiv_id":"2402.03885","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e8834f0cfa23f251","code_sha256_prefix":"e8834f0cfa23f251","mcp_get_code":{"code_sha256":"e8834f0cfa23f251"}},{"arxiv_id":"2402.03885","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d202f0efa0f3d3b","code_sha256_prefix":"6d202f0efa0f3d3b","mcp_get_code":{"code_sha256":"6d202f0efa0f3d3b"}},{"arxiv_id":"2310.02277","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vita-group/junk_dna_hypothesis when it was checked","code_sha256":"0619348bb5a27dda","code_sha256_prefix":"0619348bb5a27dda","mcp_get_code":{"code_sha256":"0619348bb5a27dda"}},{"arxiv_id":"2212.09840","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qiaoxiao7282/dsn when it was checked","code_sha256":"153dac5f9fb3ef94","code_sha256_prefix":"153dac5f9fb3ef94","mcp_get_code":{"code_sha256":"153dac5f9fb3ef94"}},{"arxiv_id":"2106.14568","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vita-group/freetickets when it was checked","code_sha256":"4bb21a77b180d6b4","code_sha256_prefix":"4bb21a77b180d6b4","mcp_get_code":{"code_sha256":"4bb21a77b180d6b4"}},{"arxiv_id":"2106.10404","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vita-group/granet when it was checked","code_sha256":"21c612263568ab05","code_sha256_prefix":"21c612263568ab05","mcp_get_code":{"code_sha256":"21c612263568ab05"}},{"arxiv_id":"2106.04533","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2aa4315db6649c6d","code_sha256_prefix":"2aa4315db6649c6d","mcp_get_code":{"code_sha256":"2aa4315db6649c6d"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mitran27/Attention-is-all-you-Need when it was checked","code_sha256":"8fa3f8f1de77719a","code_sha256_prefix":"8fa3f8f1de77719a","mcp_get_code":{"code_sha256":"8fa3f8f1de77719a"}}],"record_sha256":"4fe9bdec2859c77f8fb52c19477cb10dde1ca8ef5ad7f701e029ed5f2fc4342b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}