4 of 5 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; 3 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 1 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, measured 2026-11-21; 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/1910.09796.json · badge: /api/ran/1910.09796.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 |
|---|---|---|
| thunlp/KernelGAT | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| swish | Ran ran; our contract draft was wrong, not the code |
this paper's copy was not recorded; identical code first harvested from jeonsworld/ViT-pytorch pointer only · get_code("0f786c407fb1ee4c") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| gelu | Ran ran, honoured the contract we drafted |
this paper's copy was not recorded; identical code first harvested from tanmay1618/text_to_sql_bert pointer only; the stored copy get_code serves, from tanmay1618/text_to_sql_bert, is pointer only (licence: NONE) · get_code("fdc64f4c72036ae4") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. |
| kernal_mus | Ran ran, honoured the contract we drafted |
thunlp/KernelGAT/kgat/models.py code served (permissive licence) · get_code("347bcdf9cb798d84") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| kernel_sigmas | Ran ran, honoured the contract we drafted |
thunlp/KernelGAT/kgat/models.py code served (permissive licence) · get_code("0bafc889ce780931") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| load_tf_weights_in_bert | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from orionw/RedditHumorDetection pointer only · get_code("baa5766f4566aafc") How it ranThe body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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. No invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 5 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 2 the same month, 5 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 |
|---|---|---|---|
| swish | 206 other papers 22 dated earlier, 1 the same month, 183 later · 44 only as an assembly brick |
1408.5882 (2014-08) Convolutional Neural Networks for Sentence Classification |
1805.12114 (2018-05) Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models 1809.01357 (2018-09) Zero Shot Learning for Code Education: Rubric Sampling with Deep Learning Inference and 203 more not named here |
| gelu | 198 other papers 26 dated earlier, 1 the same month, 171 later · 32 only as an assembly brick |
1408.5882 (2014-08) Convolutional Neural Networks for Sentence Classification |
1810.04805 (2018-10) BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 1901.10125 (2019-01) Glyce: Glyph-vectors for Chinese Character Representations and 195 more not named here |
| load_tf_weights_in_bert | 12 other papers 5 dated earlier, 7 later · 1 only as an assembly brick |
1810.04805 (2018-10) BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding |
1906.01698 (2019-06) Open Sesame: Getting Inside BERT's Linguistic Knowledge 1908.02265 (2019-08) ViLBERT: Pretraining Task-Agnostic Visiolinguistic Representations for Vision-and-Language Tasks and 9 more not named here |
| kernal_mus | 2 other papers 2 later |
2110.15064 (2021-10) Towards Fine-Grained Reasoning for Fake News Detection |
2202.09381 (2022-02) Synthetic Disinformation Attacks on Automated Fact Verification Systems |
| kernel_sigmas | 2 other papers 2 later |
2110.15064 (2021-10) Towards Fine-Grained Reasoning for Fake News Detection |
2202.09381 (2022-02) Synthetic Disinformation Attacks on Automated Fact Verification Systems |
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.
Fact Verification requires fine-grained natural language inference capability that finds subtle clues to identify the syntactical and semantically correct but not well-supported claims. This paper presents Kernel Graph Attention Network (KGAT), which conducts more fine-grained fact verification with kernel-based attentions. Given a claim and a set of potential evidence sentences that form an evidence graph, KGAT introduces node kernels, which better measure the importance of the evidence node, and edge kernels, which conduct fine-grained evidence propagation in the graph, into Graph Attention Networks for more accurate fact verification. KGAT achieves a 70.38% FEVER score and significantly outperforms existing fact verification models on FEVER, a large-scale benchmark for fact verification. Our analyses illustrate that, compared to dot-product attentions, the kernel-based attention concentrates more on relevant evidence sentences and meaningful clues in the evidence graph, which is the main source of KGAT's effectiveness.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.09796")
get_code_for_paper("1910.09796")
have("1910.09796")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.09796.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.09796)
Connect an agent — have() is free.