1 of 2 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; 0 failures of our instrument; 1 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/1903.07293.json · badge: /api/ran/1903.07293.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 |
|---|---|---|
| Jhy1993/HAN | canonical (classifier label) classifier basis: census |
1 ran · 0 no recorded run |
| JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch | community (classifier label) classifier basis not recorded on the link |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| sample_mask | Ran ran, violated the contract we drafted |
Jhy1993/HAN/ex_acm3025.py pointer only (licence: NONE) · get_code("b32fd748b4bbe3bf") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, Jhy1993/HAN 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. |
| merge_dgl_graphs | Not yet run unverified (harvested, no recorded run) |
JasonZhangzy1757/Heterogeneous-Graph-Attention-Network-HAN-PyTorch/utils.py code served (permissive licence) · get_code("b3a1e906834f9af2") How it ranno invocation recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 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, 1 later) and 1 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 |
|---|---|---|---|
| sample_mask | 28 other papers 8 dated earlier, 20 later |
1603.08861 (2016-03) Revisiting Semi-Supervised Learning with Graph Embeddings |
1710.10568 (2017-10) Stochastic Training of Graph Convolutional Networks with Variance Reduction 1710.10903 (2017-10) Graph Attention Networks and 25 more not named here |
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.
Graph neural network, as a powerful graph representation technique based on deep learning, has shown superior performance and attracted considerable research interest. However, it has not been fully considered in graph neural network for heterogeneous graph which contains different types of nodes and links. The heterogeneity and rich semantic information bring great challenges for designing a graph neural network for heterogeneous graph. Recently, one of the most exciting advancements in deep learning is the attention mechanism, whose great potential has been well demonstrated in various areas. In this paper, we first propose a novel heterogeneous graph neural network based on the hierarchical attention, including node-level and semantic-level attentions. Specifically, the node-level attention aims to learn the importance between a node and its metapath based neighbors, while the semantic-level attention is able to learn the importance of different meta-paths. With the learned importance from both node-level and semantic-level attention, the importance of node and meta-path can be fully considered. Then the proposed model can generate node embedding by aggregating features from meta-path based neighbors in a hierarchical manner. Extensive experimental results on three real-world heterogeneous graphs not only show the superior performance of our proposed model over the state-of-the-arts, but also demonstrate its potentially good interpretability for graph analysis.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1903.07293")
get_code_for_paper("1903.07293")
have("1903.07293")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1903.07293.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1903.07293)
Connect an agent — have() is free.