Joongbo Shin, Kyomin Jung, Seunghyun Yoon, Yoonhyung Lee
None of the 1 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (1 no recorded run), measured 2026-11-21; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2004.08097.json · badge: /api/ran/2004.08097.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| joongbo/tta | marked official in Papers with Code Papers with Code archive |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| transformer_model_smsan | Not yet run unverified (harvested, no recorded run) |
joongbo/tta/modeling.py code served (permissive licence) · get_code("d1c890af0e36f943") How it ranno invocation recorded. |
Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| transformer_model_smsan brick of this paper's assembly: entry |
1 other paper 1 dated earlier · 1 only as an assembly brick |
1810.04805 (2018-10) BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Even though BERT has achieved successful performance improvements in various supervised learning tasks, BERT is still limited by repetitive inferences on unsupervised tasks for the computation of contextual language representations. To resolve this limitation, we propose a novel deep bidirectional language model called a Transformer-based Text Autoencoder (T-TA). The T-TA computes contextual language representations without repetition and displays the benefits of a deep bidirectional architecture, such as that of BERT. In computation time experiments in a CPU environment, the proposed T-TA performs over six times faster than the BERT-like model on a reranking task and twelve times faster on a semantic similarity task. Furthermore, the T-TA shows competitive or even better accuracies than those of BERT on the above tasks. Code is available at https://github.com/joongbo/tta.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2004.08097")
get_code_for_paper("2004.08097")
have("2004.08097")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2004.08097.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2004.08097)
Connect an agent — have() is free.