{"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/embedded-dropout","entry":"embedded_dropout","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":16,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":2,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":9,"n_places_pointer_only_link_open":7,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":7},"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":"2602.03024","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03024","title":"Consistency Deep Equilibrium Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"landrarwolf/CDEQ","path":"CDEQ-src/lib/optimizations.py","file_url":"https://github.com/landrarwolf/CDEQ/blob/HEAD/CDEQ-src/lib/optimizations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, landrarwolf/CDEQ when it was checked","code_sha256":"df1c4e8a21c5f2ef","code_sha256_prefix":"df1c4e8a21c5f2ef","mcp_get_code":{"code_sha256":"df1c4e8a21c5f2ef"}},{"arxiv_id":"2411.00899","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-for-deep-equilibrium-1","title":"Certified Robustness for Deep Equilibrium Models via Serialized Random Smoothing","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WeizhiGao/Serialized-Randomized-Smoothing","path":"DEQ/lib/optimizations.py","file_url":"https://github.com/WeizhiGao/Serialized-Randomized-Smoothing/blob/HEAD/DEQ/lib/optimizations.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"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 landrarwolf/CDEQ, and GitHub detected no licence in that repository when it was checked","code_sha256":"df1c4e8a21c5f2ef","code_sha256_prefix":"df1c4e8a21c5f2ef","mcp_get_code":{"code_sha256":"df1c4e8a21c5f2ef"}},{"arxiv_id":"2311.01766","arxiv_id_is_arxiv":true,"paper":"/paper/support-or-refute-analyzing-the-stance-of","title":"Support or Refute: Analyzing the Stance of Evidence to Detect Out-of-Context Mis- and Disinformation","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yx3266/SEN","path":"training_and_evaluation/sent_emb/model.py","file_url":"https://github.com/yx3266/SEN/blob/HEAD/training_and_evaluation/sent_emb/model.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, yx3266/SEN when it was checked","code_sha256":"62d148258bdd054f","code_sha256_prefix":"62d148258bdd054f","mcp_get_code":{"code_sha256":"62d148258bdd054f"}},{"arxiv_id":"2203.10256","arxiv_id_is_arxiv":true,"paper":"/paper/dependency-based-mixture-language-models","title":"Dependency-based Mixture Language Models","date":"2022-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fadedcosine/dependency-guided-neural-text-generation","path":"DPLM-LSTM/embed_regularize.py","file_url":"https://github.com/fadedcosine/dependency-guided-neural-text-generation/blob/HEAD/DPLM-LSTM/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"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 yx3266/SEN, and GitHub detected no licence in that repository when it was checked","code_sha256":"62d148258bdd054f","code_sha256_prefix":"62d148258bdd054f","mcp_get_code":{"code_sha256":"62d148258bdd054f"}},{"arxiv_id":"2010.02986","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-demographic-word-embeddings","title":"Compositional Demographic Word Embeddings","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/awd-lstm-lm","path":"embed_regularize.py","file_url":"https://github.com/salesforce/awd-lstm-lm/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"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 yx3266/SEN, and GitHub detected no licence in that repository when it was checked","code_sha256":"62d148258bdd054f","code_sha256_prefix":"62d148258bdd054f","mcp_get_code":{"code_sha256":"62d148258bdd054f"}},{"arxiv_id":"2006.07116","arxiv_id_is_arxiv":true,"paper":"/paper/nas-bench-nlp-neural-architecture-search","title":"NAS-Bench-NLP: Neural Architecture Search Benchmark for Natural Language Processing","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fmsnew/nas-bench-nlp-release","path":"embed_regularize.py","file_url":"https://github.com/fmsnew/nas-bench-nlp-release/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"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 yx3266/SEN, and GitHub detected no licence in that repository when it was checked","code_sha256":"62d148258bdd054f","code_sha256_prefix":"62d148258bdd054f","mcp_get_code":{"code_sha256":"62d148258bdd054f"}},{"arxiv_id":"1905.11881","arxiv_id_is_arxiv":true,"paper":"/paper/analysis-of-gradient-clipping-and-adaptive","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JingzhaoZhang/why-clipping-accelerates","path":"embed_regularize.py","file_url":"https://github.com/JingzhaoZhang/why-clipping-accelerates/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"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 yx3266/SEN, and GitHub detected no licence in that repository when it was checked","code_sha256":"62d148258bdd054f","code_sha256_prefix":"62d148258bdd054f","mcp_get_code":{"code_sha256":"62d148258bdd054f"}},{"arxiv_id":"1810.10999","arxiv_id_is_arxiv":true,"paper":"/paper/reversible-recurrent-neural-networks","title":"Reversible Recurrent Neural Networks","date":"2018-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matthewjmackay/reversible-rnn","path":"language_modelling/embed_regularize.py","file_url":"https://github.com/matthewjmackay/reversible-rnn/blob/HEAD/language_modelling/embed_regularize.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":"4ed5e00e94ee3740","code_sha256_prefix":"4ed5e00e94ee3740","mcp_get_code":{"code_sha256":"4ed5e00e94ee3740"}},{"arxiv_id":"1810.09536","arxiv_id_is_arxiv":true,"paper":"/paper/ordered-neurons-integrating-tree-structures","title":"Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks","date":"2018-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IanTheColder/ONLSTM-analysis","path":"embed_regularize.py","file_url":"https://github.com/IanTheColder/ONLSTM-analysis/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"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 yx3266/SEN, and GitHub detected no licence in that repository when it was checked","code_sha256":"62d148258bdd054f","code_sha256_prefix":"62d148258bdd054f","mcp_get_code":{"code_sha256":"62d148258bdd054f"}},{"arxiv_id":"1810.06682","arxiv_id_is_arxiv":true,"paper":"/paper/trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/trellisnet","path":"TrellisNet/optimizations.py","file_url":"https://github.com/locuslab/trellisnet/blob/HEAD/TrellisNet/optimizations.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":"ad3308380ac371b2","code_sha256_prefix":"ad3308380ac371b2","mcp_get_code":{"code_sha256":"ad3308380ac371b2"}},{"arxiv_id":"1805.04836","arxiv_id_is_arxiv":true,"paper":"/paper/building-language-models-for-text-with-named","title":"Building Language Models for Text with Named Entities","date":"2018-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclanlp/NamedEntityLanguageModel","path":"embed_regularize.py","file_url":"https://github.com/uclanlp/NamedEntityLanguageModel/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c2fe307e011be7d","code_sha256_prefix":"3c2fe307e011be7d","mcp_get_code":{"code_sha256":"3c2fe307e011be7d"}},{"arxiv_id":"1805.04623","arxiv_id_is_arxiv":true,"paper":"/paper/sharp-nearby-fuzzy-far-away-how-neural","title":"Sharp Nearby, Fuzzy Far Away: How Neural Language Models Use Context","date":"2018-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"urvashik/lm-context-analysis","path":"embed_regularize.py","file_url":"https://github.com/urvashik/lm-context-analysis/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c2fe307e011be7d","code_sha256_prefix":"3c2fe307e011be7d","mcp_get_code":{"code_sha256":"3c2fe307e011be7d"}},{"arxiv_id":"1804.08205","arxiv_id_is_arxiv":true,"paper":"/paper/spell-once-summon-anywhere-a-two-level-open","title":"Spell Once, Summon Anywhere: A Two-Level Open-Vocabulary Language Model","date":"2018-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjmielke/spell-once","path":"embed_regularize.py","file_url":"https://github.com/sjmielke/spell-once/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"85281b50c86cffc8","code_sha256_prefix":"85281b50c86cffc8","mcp_get_code":{"code_sha256":"85281b50c86cffc8"}},{"arxiv_id":"1803.08240","arxiv_id_is_arxiv":true,"paper":"/paper/an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AtheMathmo/lookahead-lstm","path":"embed_regularize.py","file_url":"https://github.com/AtheMathmo/lookahead-lstm/blob/HEAD/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"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 yx3266/SEN, and GitHub detected no licence in that repository when it was checked","code_sha256":"62d148258bdd054f","code_sha256_prefix":"62d148258bdd054f","mcp_get_code":{"code_sha256":"62d148258bdd054f"}},{"arxiv_id":"1711.03953","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yfreedomliTHU/mos-pytorch1.1","path":"embed_regularize.py","file_url":"https://github.com/yfreedomliTHU/mos-pytorch1.1/blob/HEAD/embed_regularize.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":"61247fd8db2741cf","code_sha256_prefix":"61247fd8db2741cf","mcp_get_code":{"code_sha256":"61247fd8db2741cf"}},{"arxiv_id":"1711.03953","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zihangdai/mos","path":"embed_regularize.py","file_url":"https://github.com/zihangdai/mos/blob/HEAD/embed_regularize.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":"612788fb8fc53b62","code_sha256_prefix":"612788fb8fc53b62","mcp_get_code":{"code_sha256":"612788fb8fc53b62"}},{"arxiv_id":"1711.03953","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nkcr/overlap-ml","path":"awd/embed_regularize.py","file_url":"https://github.com/nkcr/overlap-ml/blob/HEAD/awd/embed_regularize.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6a3d8df0b754bb01","code_sha256_prefix":"6a3d8df0b754bb01","mcp_get_code":{"code_sha256":"6a3d8df0b754bb01"}},{"arxiv_id":"2025.naacl-long.61","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.naacl-long.61","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"vonfeng/DPLink","path":"codes/models.py","file_url":"https://github.com/vonfeng/DPLink/blob/HEAD/codes/models.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":"61247fd8db2741cf","code_sha256_prefix":"61247fd8db2741cf","mcp_get_code":{"code_sha256":"61247fd8db2741cf"}}],"record_sha256":"49ef061751432b15dd4b6c5e175946613bf8f84da63d28e53600e4ba1f5183da","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}