Home › Code › repackage_hidden

repackage_hidden

Syntologyentry name in harvested coderead from the graph 2026-09-24

repackage_hidden appears in the code Syntology harvested for 31 papers, as 20 distinct code bodies found in 34 places (a place is one code body under one paper). At least one of them ran in 17 of the papers; 5 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named repackage_hidden do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 6 of the 20 distinct code bodies named repackage_hidden; 14 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

4ran · honoured contract
0ran · violated contract
2ran · our draft was wrong
0ran · fixture could not drive it
0ran
14unverified
5fingerprinted

Licence is a property of each copy, so it is counted per place: 12 of the 34 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

31 papers shown of 31, newest first; 34 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 1 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Representing and Parsing Korean Constituency Structure at Different Levels of Granularity * added by Syntology 2026-08 (from id) stanfordnlp/stanza/stanza/models/charlm.py 4372bb4533fd1936 ran · honoured contract fingerprinted no licence file found · pointer only
StoRM: A Diffusion-based Stochastic Regeneration Model for Speech Enhancement and Dereverberation 22 Dec 2022 sp-uhh/storm/sgmse/backbones/convtasnet.py 3957da6e7bfb4ed6 unverified MIT (permissive)
StoRM: A Diffusion-based Stochastic Regeneration Model for Speech Enhancement and Dereverberation 22 Dec 2022 sp-uhh/storm/sgmse/backbones/convtasnet_utils/utils.py fa549fcbd479aad5 unverified MIT (permissive)
Learning-Augmented Private Algorithms for Multiple Quantile Release 20 Oct 2022 anandsaha/nips.cocob.pytorch/word_language_model/main.orig.py d98e69125467f2f0 unverified MIT (permissive)
Regularizing Deep Neural Networks with Stochastic Estimators of Hessian Trace 11 Aug 2022 identical code first harvested elsewhere a81c5fb0b9535995 ran · honoured contract fingerprinted licence of this copy not recorded
A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural Networks 10 May 2022 mingruiliu-ml-lab/communication-efficient-local-gradient-clipping/nlp/main_lstm.py 4372bb4533fd1936 ran · honoured contract fingerprinted GPL-3.0 (copyleft) · pointer only
Annotating the Tweebank Corpus on Named Entity Recognition and Building NLP Models for Social Media Analysis 18 Jan 2022 social-machines/tweebanknlp/twitter-stanza/stanza/models/charlm.py 4372bb4533fd1936 ran · honoured contract fingerprinted Apache-2.0 (permissive)
Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks 28 May 2021 fin-young/THEO_POULA/train_lstm.py d007cafd2da71575 ran · our draft was wrong no licence file found · pointer only
Compositional Demographic Word Embeddings 6 Oct 2020 salesforce/awd-lstm-lm/utils.py 4372bb4533fd1936 ran · honoured contract fingerprinted BSD-3-Clause (permissive)
Improved Analysis of Clipping Algorithms for Non-convex Optimization 5 Oct 2020 zbh2047/clipping-algorithms/main_lstm.py ec9329606c156d1d ran · our draft was wrong fingerprinted no licence file found · pointer only
Bongard-LOGO: A New Benchmark for Human-Level Concept Learning and Reasoning 2 Oct 2020 NVlabs/Bongard-LOGO/Bongard-LOGO_Baselines/models/recurrent_model.py 6aaf07ccda31ac5f ran · honoured contract fingerprinted MIT (permissive)
Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modules 30 Jun 2020 sarthmit/BRIMs/CIFAR10/train_cifar.py 9e50bd9c4161128d unverified no licence file found · pointer only
Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modules 30 Jun 2020 sarthmit/BRIMs/MNIST/train_mnist.py 0ed7de278461e386 unverified no licence file found · pointer only
Capacity of Continuous Channels with Memory via Directed Information Neural Estimator 9 Mar 2020 omerlux/DINE/dine/utils.py d4b3cad9501696da ran · honoured contract fingerprinted no licence file found · pointer only
Fractional Skipping: Towards Finer-Grained Dynamic CNN Inference 3 Jan 2020 Torment123/DFS/models.py b6f41456f1266f92 unverified no licence file found · pointer only
Ordered Memory 29 Oct 2019 yikangshen/Ordered-Memory/utils/utils.py eee10a1cbab04d32 unverified MIT (permissive)
Code Generation as a Dual Task of Code Summarization 14 Oct 2019 code-gen/cgcs/language_model/lm_train.py 6aaf07ccda31ac5f ran · honoured contract fingerprinted MIT (permissive)
Recurrent Independent Mechanisms 24 Sep 2019 anirudh9119/RIMs/event_based/train_copying.py a81c5fb0b9535995 ran · honoured contract fingerprinted no licence file found · pointer only
Recurrent Independent Mechanisms 24 Sep 2019 anirudh9119/RIMs/event_based/train_adding.py 70d200be038af543 unverified no licence file found · pointer only
Why gradient clipping accelerates training: A theoretical justification for adaptivity 28 May 2019 JingzhaoZhang/why-clipping-accelerates/utils.py 4372bb4533fd1936 ran · honoured contract fingerprinted BSD-3-Clause (permissive)
Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks 22 Oct 2018 IanTheColder/ONLSTM-analysis/utils.py 4372bb4533fd1936 ran · honoured contract fingerprinted BSD-3-Clause (permissive)
Trellis Networks for Sequence Modeling 15 Oct 2018 locuslab/trellisnet/TrellisNet/word_PTB/utils.py 4372bb4533fd1936 ran · honoured contract fingerprinted MIT (permissive)
Rational Recurrences 28 Aug 2018 Noahs-ARK/rational-recurrences/language_model/train_lm.py 25b388c0d2d1ecab unverified MIT (permissive)
Pyramidal Recurrent Unit for Language Modeling 27 Aug 2018 sacmehta/PRU/utils.py d98e69125467f2f0 unverified MIT (permissive)
Relational recurrent neural networks 5 Jun 2018 L0SG/relational-rnn-pytorch/train_rnn.py a81c5fb0b9535995 ran · honoured contract fingerprinted Apache-2.0 (permissive)
Sharp Nearby, Fuzzy Far Away: How Neural Language Models Use Context 12 May 2018 urvashik/lm-context-analysis/utils.py d98e69125467f2f0 unverified Apache-2.0 (permissive)
Spell Once, Summon Anywhere: A Two-Level Open-Vocabulary Language Model 23 Apr 2018 sjmielke/spell-once/utils.py 626ebcbda1b6e336 unverified BSD-3-Clause (permissive)
An Analysis of Neural Language Modeling at Multiple Scales 22 Mar 2018 SachinIchake/KALM/utils.py 4372bb4533fd1936 ran · honoured contract fingerprinted BSD-3-Clause (permissive)
Breaking the Softmax Bottleneck: A High-Rank RNN Language Model 10 Nov 2017 zihangdai/mos/dynamiceval.py 8bd3cf7e6979e441 unverified MIT (permissive)
Neural Language Modeling by Jointly Learning Syntax and Lexicon 2 Nov 2017 nyu-mll/PRPN-Analysis/main_LM.py 8bad1a018e52e629 unverified MIT (permissive)
Dilated Recurrent Neural Networks 5 Oct 2017 zalandoresearch/pytorch-dilated-rnn/lm.py 5b50d8b3f7aa6aa7 unverified MIT (permissive)
Dynamic Evaluation of Neural Sequence Models 21 Sep 2017 benkrause/dynamic-evaluation/dynamiceval.py d98e69125467f2f0 unverified BSD-2-Clause (permissive)
Exploring Sparsity in Recurrent Neural Networks 17 Apr 2017 puhsu/pruning/model.py 6aaf07ccda31ac5f ran · honoured contract fingerprinted no licence file found · pointer only
Efficient softmax approximation for GPUs 14 Sep 2016 rosinality/adaptive-softmax-pytorch/text8.py 16460bb9b7b5d0a1 unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections