4 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; 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/2406.14969.json · badge: /api/ran/2406.14969.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 |
|---|---|---|
| dptech-corp/Uni-Mol | canonical (classifier label) classifier basis: plan_row |
4 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| calc_mask | Ran ran; our contract draft was wrong, not the code |
dptech-corp/Uni-Mol/unimol/unimol/losses/conf_gen.py pointer only (licence: MIT); the stored copy get_code serves, from FanmengWang/WGFormer, is pointer only (licence: GPL-3.0) · get_code("32f631a2eb5edfee") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from FanmengWang/WGFormer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| gaussian | Ran ran, violated the contract we drafted |
dptech-corp/Uni-Mol/unimol/unimol/models/unimol.py pointer only (licence: MIT); the stored copy get_code serves, from bowenwang77/DR-Label, is pointer only (licence: NONE) · get_code("294ba20b052bfbc7") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from bowenwang77/DR-Label, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| masked_mean | Ran ran; our contract draft was wrong, not the code |
dptech-corp/Uni-Mol/unimol_plus/inference.py pointer only (licence: MIT); the stored copy get_code serves, from dptech-corp/nag2g, is pointer only (licence: GPL-3.0) · get_code("698e12d1755a5461") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from dptech-corp/nag2g, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| realign_coord | Ran ran; our contract draft was wrong, not the code |
dptech-corp/Uni-Mol/unimol/unimol/losses/conf_gen.py pointer only (licence: MIT); the stored copy get_code serves, from FanmengWang/WGFormer, is pointer only (licence: GPL-3.0) · get_code("aa538ebbc52c74ed") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from FanmengWang/WGFormer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 4 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 3 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 |
|---|---|---|---|
| gaussian | 12 other papers 5 dated earlier, 1 the same month, 6 later |
2203.04810 (2022-03) Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets |
2210.01765 (2022-10) One Transformer Can Understand Both 2D & 3D Molecular Data 2301.09505 (2023-01) Rethinking the Expressive Power of GNNs via Graph Biconnectivity and 9 more not named here |
| calc_mask | 1 other paper 1 later |
2410.09795 (2024-10) WGFormer: An SE(3)-Transformer Driven by Wasserstein Gradient Flows for Molecular Ground-State Conformation Prediction |
|
| masked_mean | 1 other paper 1 dated earlier |
2309.15798 (2023-09) Node-Aligned Graph-to-Graph (NAG2G): Elevating Template-Free Deep Learning Approaches in Single-Step Retrosynthesis |
|
| realign_coord | 1 other paper 1 later |
2410.09795 (2024-10) WGFormer: An SE(3)-Transformer Driven by Wasserstein Gradient Flows for Molecular Ground-State Conformation Prediction |
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-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In recent years, pretraining models have made significant advancements in the fields of natural language processing (NLP), computer vision (CV), and life sciences. The significant advancements in NLP and CV are predominantly driven by the expansion of model parameters and data size, a phenomenon now recognized as the scaling laws. However, research exploring scaling law in molecular pretraining models remains unexplored. In this work, we present Uni-Mol2 , an innovative molecular pretraining model that leverages a two-track transformer to effectively integrate features at the atomic level, graph level, and geometry structure level. Along with this, we systematically investigate the scaling law within molecular pretraining models, characterizing the power-law correlations between validation loss and model size, dataset size, and computational resources. Consequently, we successfully scale Uni-Mol2 to 1.1 billion parameters through pretraining on 800 million conformations, making it the largest molecular pretraining model to date. Extensive experiments show consistent improvement in the downstream tasks as the model size grows. The Uni-Mol2 with 1.1B parameters also outperforms existing methods, achieving an average 27% improvement on the QM9 and 14% on COMPAS-1D dataset.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2406.14969")
get_code_for_paper("2406.14969")
have("2406.14969")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2406.14969.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2406.14969)
Connect an agent — have() is free.