SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2406.02059 · ICML · 2024

Graph Adversarial Diffusion Convolution

Marinka Zitnik, Tianfan Fu, Songtao Liu, Dinghao Wu, Jinghui Chen, Lu Lin

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; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 2 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/2406.02059.json · badge: /api/ran/2406.02059.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
songtaoliu0823/gadc canonical (classifier label)
classifier basis: census
3 ran · 1 no recorded run
FunctionStatusWhere it lives
graph_diffusion Ran
ran; our contract draft was wrong, not the code
songtaoliu0823/gadc/Heterophilic_Graph/gadc.py
pointer only (licence: NONE) · get_code("156b173c00e390bc")
How it ran

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

parse_index_file Ran
ran, honoured the contract we drafted
songtaoliu0823/gadc/Adaptive_Adversarial_Attack/utils.py
pointer only (licence: NONE); the stored copy get_code serves, from DSL-Lab/Specformer, is pointer only (licence: GPL-3.0) · get_code("c1d6392f89c5e495")
How it ran

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

sparse_to_tuple Ran
ran; our contract draft was wrong, not the code
songtaoliu0823/gadc/Adaptive_Adversarial_Attack/utils.py
pointer only (licence: NONE) · get_code("eaa82e9c7a22e930")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, songtaoliu0823/gadc 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_data Not yet run
unverified (harvested, no recorded run)
songtaoliu0823/gadc/Adaptive_Adversarial_Attack/utils.py
pointer only (licence: NONE) · get_code("76a42c3db1bf3eef")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, songtaoliu0823/gadc 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, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 2 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.

FunctionAlso present inEarliest-datedOthers named
parse_index_file 53 other papers
50 dated earlier, 1 the same month, 2 later · 1 only as an assembly brick
1603.08861 (2016-03)
Revisiting Semi-Supervised Learning with Graph Embeddings
1611.07308 (2016-11)
Variational Graph Auto-Encoders
1710.10568 (2017-10)
Stochastic Training of Graph Convolutional Networks with Variance Reduction
and 50 more not named here
sparse_to_tuple 7 other papers
6 dated earlier, 1 the same month
1903.04154 (2019-03)
Fisher-Bures Adversary Graph Convolutional Networks
aaai_20388 (2022 (year only))
RepBin: Constraint-Based Graph Representation Learning for Metagenomic Binning
ijcai2022_0310 (2022 (year only))
Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network
and 4 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.

Repositories linked to this paper

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

Abstract

This paper introduces a min-max optimization formulation for the Graph Signal Denoising (GSD) problem. In this formulation, we first maximize the second term of GSD by introducing perturbations to the graph structure based on Laplacian distance and then minimize the overall loss of the GSD. By solving the min-max optimization problem, we derive a new variant of the Graph Diffusion Convolution (GDC) architecture, called Graph Adversarial Diffusion Convolution (GADC). GADC differs from GDC by incorporating an additional term that enhances robustness against adversarial attacks on the graph structure and noise in node features. Moreover, GADC improves the performance of GDC on heterophilic graphs. Extensive experiments demonstrate the effectiveness of GADC across various datasets.

For agents

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

get_harvested_code_for_paper("2406.02059")
get_code_for_paper("2406.02059")
have("2406.02059")

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

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

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

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

Connect an agent — have() is free.