Home › Code › pad_input

pad_input

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

pad_input appears in the code Syntology harvested for 16 papers, as 8 distinct code bodies found in 16 places (a place is one code body under one paper). At least one of them ran in 7 of the papers; 0 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 pad_input 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 3 of the 8 distinct code bodies named pad_input; 5 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

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

Licence is a property of each copy, so it is counted per place: 4 of the 16 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

16 papers shown of 16, newest first; 16 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 3 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
DualKV: Shared-Prompt Flash Attention for Efficient RL Training with Large Rollouts and Long Contexts added by Syntology 2026-05 (from id) amazon-science/dualkv-flash-attn-for-rl/flash-attention/flash_attn/bert_padding.py a8cf6124094beaab ran licence not identified · pointer only
ELSA: Exact Linear-Scan Attention for Fast and Memory-Light Vision Transformers added by Syntology 2026-04 (from id) Dao-AILab/flash-attention/flash_attn/bert_padding.py a8cf6124094beaab ran BSD-3-Clause (permissive)
One Script Instead of Hundreds? On Pretraining Romanized Encoder Language Models added by Syntology 2026-01 (from id) AnswerDotAI/ModernBERT/src/bert_padding.py b166dc11d0f54137 unverified Apache-2.0 (permissive)
MagiCodec: Simple Masked Gaussian-Injected Codec for High-Fidelity Reconstruction and Generation 31 May 2025 Ereboas/MagiCodec/components/ops/padding.py 3c9fe8b8927b497e unverified MIT (permissive)
Fast and Low-Cost Genomic Foundation Models via Outlier Removal 1 May 2025 MAGICS-LAB/GERM/DNABERT2/bert_padding.py b166dc11d0f54137 unverified MIT (permissive)
Self-rewarding correction for mathematical reasoning 26 Feb 2025 agentica-project/verl-pipeline/verl/models/bert_padding.py a8cf6124094beaab ran Apache-2.0 (permissive)
The dark side of the forces: assessing non-conservative force models for atomistic machine learning 16 Dec 2024 FAIR-Chem/fairchem/src/fairchem/core/common/gp_utils.py 724cb0390dff1053 unverified licence not identified · pointer only
Arbitrary-steps Image Super-resolution via Diffusion Inversion 12 Dec 2024 zsyoaoa/invsr/utils/util_net.py 8ae6e822723ccaa0 unverified licence not identified · pointer only
Hydra: Bidirectional State Space Models Through Generalized Matrix Mixers 13 Jul 2024 goombalab/hydra/hydra/bert/src/bert_padding.py b166dc11d0f54137 unverified MIT (permissive)
FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision 11 Jul 2024 dao-ailab/flash-attention/flash_attn/bert_padding.py a8cf6124094beaab ran BSD-3-Clause (permissive)
DNABERT-S: Pioneering Species Differentiation with Species-Aware DNA Embeddings 13 Feb 2024 magics-lab/dnabert_s/evaluate/model_codes/bert_padding.py b166dc11d0f54137 unverified no licence file found · pointer only
BEND: Benchmarking DNA Language Models on biologically meaningful tasks 21 Nov 2023 frederikkemarin/BEND/bend/models/dnabert2_padding.py b166dc11d0f54137 unverified BSD-3-Clause (permissive)
Efficient Memory Management for Large Language Model Serving with PagedAttention 12 Sep 2023 ROCm/flash-attention/flash_attn/bert_padding.py a8cf6124094beaab ran BSD-3-Clause (permissive)
DNABERT-2: Efficient Foundation Model and Benchmark For Multi-Species Genome 26 Jun 2023 frederikkemarin/bend/bend/utils/embedders.py dbf4ecb6112f8eef ran · fixture could not drive it BSD-3-Clause (permissive)
PortaSpeech: Portable and High-Quality Generative Text-to-Speech 30 Sep 2021 keonlee9420/PortaSpeech/model/postnet.py ee17504855eec917 unverified MIT (permissive)
Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolation 27 Aug 2021 answerdotai/modernbert/src/bert_layers/attention.py 802fa8542c8445f9 ran · fixture could not drive it Apache-2.0 (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