4 of 8 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, 0 violated it and 4 have no contract verdict; 0 failures of our instrument; 4 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/2209.01084.json · badge: /api/ran/2209.01084.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 |
|---|---|---|
| graph-com/neighborhood-aware-temporal-network | canonical (classifier label) classifier basis not recorded on the link |
4 ran · 2 no recorded run |
| graph-com/nlb | community (classifier label) classifier basis not recorded on the link |
0 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_one_hot | Ran ran on a synthesized input |
graph-com/neighborhood-aware-temporal-network/process.py code served (permissive licence) · get_code("8ca7afb49dfbccb7") 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 ndarray, ndim 2, dtype family float, shape (3, 5) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape 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.
|
| preprocess | Ran ran on a synthesized input |
graph-com/neighborhood-aware-temporal-network/process.py code served (permissive licence) · get_code("a79be74d482b75c9") 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 tuple. The image it ran in was not recorded. If your copy returns the same type 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.
|
| process_sampling_numbers | Ran ran on a synthesized input |
graph-com/neighborhood-aware-temporal-network/utils.py code served (permissive licence) · get_code("ece6ee2b33ca01af") 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 tuple. The image it ran in was not recorded. If your copy returns the same type 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.
|
| reindex | Ran ran on a synthesized input |
graph-com/neighborhood-aware-temporal-network/process.py code served (permissive licence) · get_code("e5a738d195716118") 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 DataFrame. The image it ran in was not recorded. If your copy returns the same type 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.
|
| get_layer_type | Not yet run unverified (harvested, no recorded run) |
graph-com/neighborhood-aware-temporal-network/GAT.py code served (permissive licence) · get_code("7878b72c4ebda48a") How it ranno invocation recorded. |
| get_layer_type | Not yet run unverified (harvested, no recorded run) |
graph-com/nlb/GAT.py code served (permissive licence) · get_code("ff96493f152a3c72") How it ranno invocation recorded. |
| set_up_logger | Not yet run unverified (harvested, no recorded run) |
graph-com/neighborhood-aware-temporal-network/log.py code served (permissive licence) · get_code("45261928956e5e41") How it ranno invocation recorded. |
| set_up_logger | Not yet run unverified (harvested, no recorded run) |
graph-com/nlb/log.py code served (permissive licence) · get_code("c126bd4eb97d7fb7") How it ranno invocation recorded. |
Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 7 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 6 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 |
|---|---|---|---|
| get_layer_type | 1 other paper 1 later |
2410.04013 (2024-10) Improving Temporal Link Prediction via Temporal Walk Matrix Projection |
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.
Temporal networks have been widely used to model real-world complex systems such as financial systems and e-commerce systems. In a temporal network, the joint neighborhood of a set of nodes often provides crucial structural information useful for predicting whether they may interact at a certain time. However, recent representation learning methods for temporal networks often fail to extract such information or depend on online construction of structural features, which is time-consuming. To address the issue, this work proposes Neighborhood-Aware Temporal network model (NAT). For each node in the network, NAT abandons the commonly-used one-single-vector-based representation while adopting a novel dictionary-type neighborhood representation. Such a dictionary representation records a downsampled set of the neighboring nodes as keys, and allows fast construction of structural features for a joint neighborhood of multiple nodes. We also design a dedicated data structure termed N-cache to support parallel access and update of those dictionary representations on GPUs. NAT gets evaluated over seven real-world large-scale temporal networks. NAT not only outperforms all cutting-edge baselines by averaged 1.2% and 4.2% in transductive and inductive link prediction accuracy, respectively, but also keeps scalable by achieving a speed-up of 4.1-76.7x against the baselines that adopt joint structural features and achieves a speed-up of 1.6-4.0x against the baselines that cannot adopt those features. The link to the code: https: //github.com/Graph-COM/Neighborhood-Aware-Temporal-Network.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2209.01084")
get_code_for_paper("2209.01084")
have("2209.01084")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2209.01084.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2209.01084)
Connect an agent — have() is free.