SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2201.12032 · NeurIPS · 2022

Neural Approximation of Graph Topological Features

Yusu Wang, Chao Chen, Ibm Watson, Zuoyu Yan, Tengfei Ma, Liangcai Gao, Zhi Tang, Research Center

arXiv · PDF · Open in the Atlas

Code that ran

3 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, 0 violated it and 0 have no contract verdict; 3 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/2201.12032.json · badge: /api/ran/2201.12032.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.

RepositoryRoleRan
pkuyzy/TLC-GNN canonical (classifier label)
classifier basis: classifier_2025
1 ran · 1 no recorded run
Lihaogx/DNDN reimplementation (classifier label)
classifier basis: classifier_2025
2 ran · 0 no recorded run
FunctionStatusWhere it lives
add_line_graph_Edges Ran
ran; our contract draft was wrong, not the code
Lihaogx/DNDN/utils/process_data.py
pointer only (licence: NONE) · get_code("ff432180a38c0d30")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Lihaogx/DNDN 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.

load_dataset Ran
ran; our contract draft was wrong, not the code
pkuyzy/TLC-GNN/Knowledge_Distillation/train_Teacher_Model.py
pointer only (licence: NONE) · get_code("292b060872aec4bc")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, pkuyzy/TLC-GNN 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.

split_graph Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
Lihaogx/DNDN/utils/process_data.py
pointer only (licence: NONE) · get_code("cd9202af39df21cf")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, Lihaogx/DNDN 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.

test Not yet run
unverified (harvested, no recorded run)
pkuyzy/TLC-GNN/pipelines_GIN.py
pointer only (licence: NONE) · get_code("d4e3c72a304bb783")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, pkuyzy/TLC-GNN 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. No invocation recorded.

Also present in other papers' code

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, 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 3 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.

FunctionAlso present inEarliest-datedOthers named
load_dataset 2 other papers
1 dated earlier, 1 later
2102.10255 (2021-02)
Link Prediction with Persistent Homology: An Interactive View
2501.09178 (2025-01)
Enhancing Graph Representation Learning with Localized Topological Features

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.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Topological features based on persistent homology can capture high-order structural information which can then be used to augment graph neural network methods. However, computing extended persistent homology summaries remains slow for large and dense graphs and can be a serious bottleneck for the learning pipeline. Inspired by recent success in neural algorithmic reasoning, we propose a novel graph neural network to estimate extended persistence diagrams (EPDs) on graphs efficiently. Our model is built on algorithmic insights, and benefits from better supervision and closer alignment with the EPD computation algorithm. We validate our method with convincing empirical results on approximating EPDs and downstream graph representation learning tasks. Our method is also efficient; on large and dense graphs, we accelerate the computation by nearly 100 times.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2201.12032")
get_code_for_paper("2201.12032")
have("2201.12032")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2201.12032.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2201.12032.svg)](https://syntology.ai/paper/2201.12032)

Connect an agent — have() is free.