SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2207.00012 · 2022

Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN

arXiv · PDF · Open in the Atlas

Code that ran

5 of 5 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 3 have no contract verdict; 2 failures of our instrument; 0 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/2207.00012.json · badge: /api/ran/2207.00012.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
likuanppd/stable canonical (classifier label)
classifier basis not recorded on the link
5 ran · 0 no recorded run
FunctionStatusWhere it lives
adj_norm Ran
ran on a synthesized input
likuanppd/stable/utils.py
code served (permissive licence) · get_code("92d98e95c80fe951")
How it ran

Ran 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 Tensor, ndim 2, dtype family float, shape (4, 4) as a later run recorded it. The image it ran in was not recorded. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is 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.

import torch

torch.manual_seed(0)

# Create a small adjacency matrix (sparse or dense)
# The function expects a square matrix for adj
# Let's create a 4x4 adjacency matrix as a dense tensor
adj_dense = torch.tensor([
    [0.0, 1.0, 0.0, 1.0],
    [1.0, 0.0, 1.0, 0.0],
    [0.0, 1.0, 0.0, 1.0],
    [1.0, 0.0, 1.0, 0.0]
], dtype=torch.float32)

# Also create a sparse version for testing
indices = torch.LongTensor([[0, 0, 1, 1, 2, 2, 3, 3],
                            [1, 3, 0, 2, 1, 3, 0, 2]])
values = torch.FloatTensor([1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0])
adj_sparse = torch.sparse.FloatTensor(indices, values, torch.Size([4, 4]))

ARGS = {
    "adj": adj_dense,
    "neighbor_only": False
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type Tensor, ndim 2, dtype family float, shape (4, 4) — shape (4, 4) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
aug_random_edge Ran
ran on a synthesized input
likuanppd/stable/robcon.py
code served (permissive licence) · get_code("701a859aedd36a9e")
How it ran

Ran 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 csr_matrix. 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.

import numpy as np
import scipy.sparse as sp
import random

# Set seed for reproducibility
random.seed(0)
np.random.seed(0)

# Create a small symmetric sparse adjacency matrix
# 5x5 matrix with some edges
dense_adj = np.array([
    [0, 1, 1, 0, 0],
    [1, 0, 1, 1, 0],
    [1, 1, 0, 0, 1],
    [0, 1, 0, 0, 1],
    [0, 0, 1, 1, 0]
], dtype=int)

input_adj = sp.csr_matrix(dense_adj)

# Create adj_delete with some edges to recover (lower triangular part)
# This represents edges that were deleted
adj_delete_dense = np.array([
    [0, 0, 0, 0, 0],
    [1, 0, 0, 0, 0],
    [0, 1, 0, 0, 0],
    [1, 0, 1, 0, 0],
    [0, 1, 0, 1, 0]
], dtype=int)

adj_delete = sp.csr_matrix(adj_delete_dense)

ARGS = {
    "input_adj": input_adj,
    "adj_delete": adj_delete,
    "recover_percent": 0.5
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, scipy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type csr_matrix — a csr_matrix output has no array shape of its own; none is stated — the instrument coerces any output to an array; for a csr_matrix output the recorded ndim 0 and dtype family float describe that coercion, not the output, and are not stated
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
get_logger Ran
ran; our contract draft was wrong, not the code
likuanppd/stable/utils.py
pointer only (licence: MIT); the stored copy get_code serves, from hzc1208/lmht_snn, is pointer only (licence: NONE) · get_code("210ba8a40d178d14")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from hzc1208/lmht_snn, and GitHub detected no licence in that repository 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.

normalize_adj Ran
ran; our contract draft was wrong, not the code
likuanppd/stable/robcon.py
pointer only (licence: MIT); the stored copy get_code serves, from songw-sw/x-fnc, is pointer only (licence: NONE) · get_code("21b0199200507ff0")
How it ran

The body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from songw-sw/x-fnc, and GitHub detected no licence in that repository 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_dense_mul Ran
ran on a synthesized input
likuanppd/stable/utils.py
code served (permissive licence) · get_code("29aed99347f25b36")
How it ran

Ran 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 Tensor. 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.

import torch

torch.manual_seed(0)

# Create a sparse tensor (2x3)
indices = torch.LongTensor([[0, 1, 1], [0, 1, 2]])
values = torch.FloatTensor([1.0, 2.0, 3.0])
sparse_tensor = torch.sparse.FloatTensor(indices, values, torch.Size([2, 3]))

# Create a dense tensor (2x3)
dense_tensor = torch.FloatTensor([[1.0, 2.0, 3.0], [4.0, 5.0, 6.0]])

ARGS = {
    "s": sparse_tensor,
    "d": dense_tensor,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type Tensor, shape (2, 3) — shape (2, 3) as a later run recorded it
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block

Also present in other papers' code

Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 2 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
normalize_adj 14 other papers
8 dated earlier, 6 later
1812.00971 (2018-12)
Learning to Learn How to Learn: Self-Adaptive Visual Navigation Using Meta-Learning
2003.06749 (2020-03)
Learning hierarchical relationships for object-goal navigation
2104.09807 (2021-04)
Visual Navigation with Spatial Attention
and 11 more not named here
get_logger 10 other papers
2 dated earlier, 8 later
2106.06716 (2021-06)
DS-TransUNet:Dual Swin Transformer U-Net for Medical Image Segmentation
2205.08987 (2022-05)
Trading Positional Complexity vs Deepness in Coordinate Networks
2304.13098 (2023-04)
Uncovering the Representation of Spiking Neural Networks Trained with Surrogate Gradient
and 7 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

Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously modifying the graph structure. A straightforward solution to remedy this issue is to model the edge weights by learning a metric function between pairwise representations of two end nodes, which attempts to assign low weights to adversarial edges. The existing methods use either raw features or representations learned by supervised GNNs to model the edge weights. However, both strategies are faced with some immediate problems: raw features cannot represent various properties of nodes (e.g., structure information), and representations learned by supervised GNN may suffer from the poor performance of the classifier on the poisoned graph. We need representations that carry both feature information and as mush correct structure information as possible and are insensitive to structural perturbations. To this end, we propose an unsupervised pipeline, named STABLE, to optimize the graph structure. Finally, we input the well-refined graph into a downstream classifier. For this part, we design an advanced GCN that significantly enhances the robustness of vanilla GCN without increasing the time complexity. Extensive experiments on four real-world graph benchmarks demonstrate that STABLE outperforms the state-of-the-art methods and successfully defends against various attacks.

For agents

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

get_harvested_code_for_paper("2207.00012")
get_code_for_paper("2207.00012")
have("2207.00012")

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

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

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

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

Connect an agent — have() is free.