SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2201.06367 · 2022

Towards Unsupervised Deep Graph Structure Learning

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; 1 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 3 failures of our instrument; 0 no recorded run), measured 2026-11-21; 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.06367.json · badge: /api/ran/2201.06367.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
grand-lab/sublime canonical (classifier label)
classifier basis not recorded on the link
5 ran · 0 no recorded run
FunctionStatusWhere it lives
apply_non_linearity Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
grand-lab/sublime/utils.py
pointer only (licence: MIT); the stored copy get_code serves, from kgccc/GCTAM, is pointer only (licence: NONE) · get_code("e9f8ae6d8d1aa7ef")
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 kgccc/GCTAM, 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.

edge_deletion Ran
ran; our contract draft was wrong, not the code
grand-lab/sublime/utils.py
pointer only (licence: MIT); the stored copy get_code serves, from zxlearningdeep/infomgf, is pointer only (licence: NONE) · get_code("010e5445d57a8af7")
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 zxlearningdeep/infomgf, 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.

parse_index_file Ran
ran, honoured the contract we drafted
grand-lab/sublime/data_loader.py
pointer only (licence: MIT); 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: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. 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.

sample_mask Ran
ran, violated the contract we drafted
grand-lab/sublime/data_loader.py
code served (permissive licence) · get_code("b32fd748b4bbe3bf")
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) and returned ndarray, ndim 1, dtype family float, shape (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.

import numpy as np

# Analyze the function:
# - idx: used as an index into mask array, should be an integer or array of integers
# - l: used as the length parameter for np.zeros, should be an integer

# Create valid arguments
idx = 2  # Single index into the mask array
l = 5    # Length of the mask array

ARGS = {
    "idx": idx,
    "l": l
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 1, dtype family float, shape (5,) — shape (5,) 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
split_batch Ran
ran; our contract draft was wrong, not the code
grand-lab/sublime/utils.py
pointer only (licence: MIT); the stored copy get_code serves, from mala-lab/RHO, is pointer only (licence: NONE) · get_code("52877319159d65f9")
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 mala-lab/RHO, 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.

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, 5 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 0 the same month, 5 later) and 0 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
31 dated earlier, 19 later, 3 same year, order not determinable · 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
sample_mask 28 other papers
19 dated earlier, 8 later, 1 same year, order not determinable
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
split_batch 6 other papers
6 later
2023.emnlp-main.771 (2023 (year only))
Multi-Source Multi-Type Knowledge Exploration and Exploitation for Dialogue Generation
aaai_25573 (2023 (year only))
Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating
2406.10471 (2024-06)
PERSONALIZED PIECES: Efficient Personalized Large Language Models through Collaborative Efforts
and 3 more not named here
apply_non_linearity 3 other papers
3 later
ijcai2023_0234 (2023 (year only))
Beyond Homophily: Robust Graph Anomaly Detection via Neural Sparsification
2409.17386 (2024-09)
Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning
2603.01806 (2026-03)
GCTAM: Global and Contextual Truncated Affinity Combined Maximization Model For Unsupervised Graph Anomaly Detection
edge_deletion 1 other paper
1 later
2409.17386 (2024-09)
Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning

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-21.

Repositories linked to this paper

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

Abstract

In recent years, graph neural networks (GNNs) have emerged as a successful tool in a variety of graph-related applications. However, the performance of GNNs can be deteriorated when noisy connections occur in the original graph structures; besides, the dependence on explicit structures prevents GNNs from being applied to general unstructured scenarios. To address these issues, recently emerged deep graph structure learning (GSL) methods propose to jointly optimize the graph structure along with GNN under the supervision of a node classification task. Nonetheless, these methods focus on a supervised learning scenario, which leads to several problems, i.e., the reliance on labels, the bias of edge distribution, and the limitation on application tasks. In this paper, we propose a more practical GSL paradigm, unsupervised graph structure learning, where the learned graph topology is optimized by data itself without any external guidance (i.e., labels). To solve the unsupervised GSL problem, we propose a novel StrUcture Bootstrapping contrastive LearnIng fraMEwork (SUBLIME for abbreviation) with the aid of self-supervised contrastive learning. Specifically, we generate a learning target from the original data as an "anchor graph", and use a contrastive loss to maximize the agreement between the anchor graph and the learned graph. To provide persistent guidance, we design a novel bootstrapping mechanism that upgrades the anchor graph with learned structures during model learning. We also design a series of graph learners and post-processing schemes to model the structures to learn. Extensive experiments on eight benchmark datasets demonstrate the significant effectiveness of our proposed SUBLIME and high quality of the optimized graphs.

For agents

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

get_harvested_code_for_paper("2201.06367")
get_code_for_paper("2201.06367")
have("2201.06367")

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

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

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

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

Connect an agent — have() is free.