{"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/get-num-params","entry":"get_num_params","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":15,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":12,"n_places_pointer_only_link_open":5,"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":7,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2601.22156","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22156","title":"Hybrid Linear Attention Done Right: Efficient Distillation and Effective Architectures for Extremely Long Contexts","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"THUNLP/hybrid-linear-attention","path":"halo/utils.py","file_url":"https://github.com/THUNLP/hybrid-linear-attention/blob/HEAD/halo/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, THUNLP/hybrid-linear-attention when it was checked","code_sha256":"cb746560d2b54ee7","code_sha256_prefix":"cb746560d2b54ee7","mcp_get_code":{"code_sha256":"cb746560d2b54ee7"}},{"arxiv_id":"2510.06195","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-06195","title":"Latent Speech-Text Transformer","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"facebookresearch/lst","path":"lst/metrics.py","file_url":"https://github.com/facebookresearch/lst/blob/HEAD/lst/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/lst (NOASSERTION)","code_sha256":"81d8582d1fab7bda","code_sha256_prefix":"81d8582d1fab7bda","mcp_get_code":{"code_sha256":"81d8582d1fab7bda"}},{"arxiv_id":"2506.14761","arxiv_id_is_arxiv":true,"paper":"/paper/from-bytes-to-ideas-language-modeling-with","title":"From Bytes to Ideas: Language Modeling with Autoregressive U-Nets","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/lingua","path":"lingua/metrics.py","file_url":"https://github.com/facebookresearch/lingua/blob/HEAD/lingua/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from facebookresearch/lst, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"81d8582d1fab7bda","code_sha256_prefix":"81d8582d1fab7bda","mcp_get_code":{"code_sha256":"81d8582d1fab7bda"}},{"arxiv_id":"2503.18866","arxiv_id_is_arxiv":true,"paper":"/paper/reasoning-to-learn-from-latent-thoughts","title":"Reasoning to Learn from Latent Thoughts","date":"2025-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ryoungj/BoLT","path":"lingua/metrics.py","file_url":"https://github.com/ryoungj/BoLT/blob/HEAD/lingua/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from facebookresearch/lst, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"81d8582d1fab7bda","code_sha256_prefix":"81d8582d1fab7bda","mcp_get_code":{"code_sha256":"81d8582d1fab7bda"}},{"arxiv_id":"2412.09764","arxiv_id_is_arxiv":true,"paper":"/paper/memory-layers-at-scale","title":"Memory Layers at Scale","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/memory","path":"lingua/metrics.py","file_url":"https://github.com/facebookresearch/memory/blob/HEAD/lingua/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, facebookresearch/memory when it was checked","code_sha256":"81d8582d1fab7bda","code_sha256_prefix":"81d8582d1fab7bda","mcp_get_code":{"code_sha256":"81d8582d1fab7bda"}},{"arxiv_id":"2412.00420","arxiv_id_is_arxiv":true,"paper":"/paper/tarot-targeted-data-selection-via-optimal","title":"TAROT: Targeted Data Selection via Optimal Transport","date":"2024-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/tarot","path":"tarot/utils.py","file_url":"https://github.com/vita-epfl/tarot/blob/HEAD/tarot/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"580e08522d1c5ea9","code_sha256_prefix":"580e08522d1c5ea9","mcp_get_code":{"code_sha256":"580e08522d1c5ea9"}},{"arxiv_id":"2403.13268","arxiv_id_is_arxiv":true,"paper":"/paper/unifews-unified-entry-wise-sparsification-for","title":"Unifews: Unified Entry-Wise Sparsification for Efficient Graph Neural Network","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gdmnl/Unifews","path":"utils/metric.py","file_url":"https://github.com/gdmnl/Unifews/blob/HEAD/utils/metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, gdmnl/Unifews when it was checked","code_sha256":"537e2f1c3fdb882e","code_sha256_prefix":"537e2f1c3fdb882e","mcp_get_code":{"code_sha256":"537e2f1c3fdb882e"}},{"arxiv_id":"2402.15978","arxiv_id_is_arxiv":true,"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":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fortuinlab/spam-pruning when it was checked","code_sha256":"b81882decca625ee","code_sha256_prefix":"b81882decca625ee","mcp_get_code":{"code_sha256":"b81882decca625ee"}},{"arxiv_id":"2402.12789","arxiv_id_is_arxiv":true,"paper":"/paper/fair-classifiers-without-fair-training-an","title":"Fairness Without Harm: An Influence-Guided Active Sampling Approach","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/fairnesswithoutharm","path":"src/models.py","file_url":"https://github.com/ucsc-real/fairnesswithoutharm/blob/HEAD/src/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ucsc-real/fairnesswithoutharm when it was checked","code_sha256":"63410cdc89b2ca7a","code_sha256_prefix":"63410cdc89b2ca7a","mcp_get_code":{"code_sha256":"63410cdc89b2ca7a"}},{"arxiv_id":"2402.10211","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-state-space-models-for","title":"Hierarchical State Space Models for Continuous Sequence-to-Sequence Modeling","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raunaqbhirangi/hiss","path":"hiss/utils/train_utils.py","file_url":"https://github.com/raunaqbhirangi/hiss/blob/HEAD/hiss/utils/train_utils.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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 fortuinlab/spam-pruning, and GitHub detected no licence in that repository when it was checked","code_sha256":"b81882decca625ee","code_sha256_prefix":"b81882decca625ee","mcp_get_code":{"code_sha256":"b81882decca625ee"}},{"arxiv_id":"2312.06205","arxiv_id_is_arxiv":true,"paper":"/paper/the-journey-not-the-destination-how-data","title":"The Journey, Not the Destination: How Data Guides Diffusion Models","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"madrylab/journey-trak","path":"diffusion_trak/utils.py","file_url":"https://github.com/madrylab/journey-trak/blob/HEAD/diffusion_trak/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01f28d033fcc4188","code_sha256_prefix":"01f28d033fcc4188","mcp_get_code":{"code_sha256":"01f28d033fcc4188"}},{"arxiv_id":"2308.16475","arxiv_id_is_arxiv":true,"paper":"/paper/transformer-compression-via-subspace","title":"$\\rm SP^3$: Enhancing Structured Pruning via PCA Projection","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyx1999/sp3","path":"bert/pipeline/glue/entry.py","file_url":"https://github.com/hyx1999/sp3/blob/HEAD/bert/pipeline/glue/entry.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, hyx1999/sp3 when it was checked","code_sha256":"04c98539fd77722e","code_sha256_prefix":"04c98539fd77722e","mcp_get_code":{"code_sha256":"04c98539fd77722e"}},{"arxiv_id":"2306.05651","arxiv_id_is_arxiv":true,"paper":"/paper/differentially-private-sharpness-aware","title":"Differentially Private Sharpness-Aware Training","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TheSunWillRise/DPNAS","path":"dp_evaluate/models.py","file_url":"https://github.com/TheSunWillRise/DPNAS/blob/HEAD/dp_evaluate/models.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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 fortuinlab/spam-pruning, and GitHub detected no licence in that repository when it was checked","code_sha256":"b81882decca625ee","code_sha256_prefix":"b81882decca625ee","mcp_get_code":{"code_sha256":"b81882decca625ee"}},{"arxiv_id":"2107.07075","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-on-a-data-diet-finding","title":"Deep Learning on a Data Diet: Finding Important Examples Early in Training","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mansheej/data_diet","path":"data_diet/models.py","file_url":"https://github.com/mansheej/data_diet/blob/HEAD/data_diet/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from ucsc-real/fairnesswithoutharm, and GitHub detected no licence in that repository when it was checked","code_sha256":"63410cdc89b2ca7a","code_sha256_prefix":"63410cdc89b2ca7a","mcp_get_code":{"code_sha256":"63410cdc89b2ca7a"}},{"arxiv_id":"2024.acl-long.803","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.acl-long.803","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MadryLab/trak","path":"trak/utils.py","file_url":"https://github.com/MadryLab/trak/blob/HEAD/trak/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"580e08522d1c5ea9","code_sha256_prefix":"580e08522d1c5ea9","mcp_get_code":{"code_sha256":"580e08522d1c5ea9"}}],"record_sha256":"ec474c3d2212e7c440b328477126ff26783622a0967ebd511e1204acc0d558b9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}