None of the 3 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (3 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/1811.04441.json · badge: /api/ran/1811.04441.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 |
|---|---|---|
| JD-AI-Research-Silicon-Valley/SACN | canonical (classifier label) classifier basis: census |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| check_for_reversible_relations | Not yet run unverified (harvested, no recorded run) |
JD-AI-Research-Silicon-Valley/SACN/inverse_model.py code served (permissive licence) · get_code("24ef53c5c5b147a5") How it ranno invocation recorded. |
| get_list_of_torch_modules | Not yet run unverified (harvested, no recorded run) |
JD-AI-Research-Silicon-Valley/SACN/src/spodernet/spodernet/backends/torchbackend.py code served (permissive licence) · get_code("35195ac220d2639d") How it ranno invocation recorded. |
| predictor | Not yet run unverified (harvested, no recorded run) |
JD-AI-Research-Silicon-Valley/SACN/src/spodernet/spodernet/backends/tfmodels.py code served (permissive licence) · get_code("bcbee6026f554da1") How it ranno invocation recorded. |
Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 2 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 |
|---|---|---|---|
| check_for_reversible_relations | 1 other paper 1 later |
2111.06345 (2021-11) Poisoning Knowledge Graph Embeddings via Relation Inference Patterns |
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.
Knowledge graph embedding has been an active research topic for knowledge base completion, with progressive improvement from the initial TransE, TransH, DistMult et al to the current state-of-the-art ConvE. ConvE uses 2D convolution over embeddings and multiple layers of nonlinear features to model knowledge graphs. The model can be efficiently trained and scalable to large knowledge graphs. However, there is no structure enforcement in the embedding space of ConvE. The recent graph convolutional network (GCN) provides another way of learning graph node embedding by successfully utilizing graph connectivity structure. In this work, we propose a novel end-to-end Structure-Aware Convolutional Network (SACN) that takes the benefit of GCN and ConvE together. SACN consists of an encoder of a weighted graph convolutional network (WGCN), and a decoder of a convolutional network called Conv-TransE. WGCN utilizes knowledge graph node structure, node attributes and edge relation types. It has learnable weights that adapt the amount of information from neighbors used in local aggregation, leading to more accurate embeddings of graph nodes. Node attributes in the graph are represented as additional nodes in the WGCN. The decoder Conv-TransE enables the state-of-the-art ConvE to be translational between entities and relations while keeps the same link prediction performance as ConvE. We demonstrate the effectiveness of the proposed SACN on standard FB15k-237 and WN18RR datasets, and it gives about 10% relative improvement over the state-of-the-art ConvE in terms of HITS@1, HITS@3 and HITS@10.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1811.04441")
get_code_for_paper("1811.04441")
have("1811.04441")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1811.04441.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1811.04441)
Connect an agent — have() is free.