SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2306.03221 · ICML · 2023

Structural Re-weighting Improves Graph Domain Adaptation

Han Zhao, Nhan Tran, Pan Li, Shikun Liu, Tianchun Li, Yongbin Feng, Qiu Qiang

arXiv · PDF · Open in the Atlas

Code that ran

2 of 7 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; 1 failure of our instrument; 5 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/2306.03221.json · badge: /api/ran/2306.03221.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
Graph-COM/StruRW canonical (classifier label)
classifier basis: classifier_2025
2 ran · 0 no recorded run
graph-com/strurw marked official in Papers with Code
Papers with Code archive
0 ran · 5 no recorded run
FunctionStatusWhere it lives
edges_to_adj Ran
ran; our contract draft was wrong, not the code
Graph-COM/StruRW/Utils/pre_data/datasets.py
pointer only (licence: NONE) · get_code("98148369810a06c2")
How it ran

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

read_edges Ran
ran, honoured the contract we drafted
Graph-COM/StruRW/Utils/pre_data/datasets.py
pointer only (licence: NONE) · get_code("6098bb77dfa6ae0d")
How it ran

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

cal_edge_prob Not yet run
unverified (harvested, no recorded run)
graph-com/strurw/Utils/edge_rw.py
pointer only (licence: NONE) · get_code("c78b2fa32eb7b257")
How it ran

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

cal_edge_prob_multi Not yet run
unverified (harvested, no recorded run)
graph-com/strurw/Utils/edge_rw.py
pointer only (licence: NONE) · get_code("0105b0551f4f01ff")
How it ran

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

cal_edge_prob_same Not yet run
unverified (harvested, no recorded run)
graph-com/strurw/Utils/edge_rw.py
pointer only (licence: NONE) · get_code("f29a61e11d603345")
How it ran

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

cal_edge_prob_sep Not yet run
unverified (harvested, no recorded run)
graph-com/strurw/Utils/edge_rw.py
pointer only (licence: NONE) · get_code("10b6c748fa2a96b5")
How it ran

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

calculate_reweight_multi Not yet run
unverified (harvested, no recorded run)
graph-com/strurw/Utils/edge_rw.py
pointer only (licence: NONE) · get_code("7376815eb686e260")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, graph-com/strurw 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 7 samples lifted from this paper's linked repositories, 7 carry a function identity and 0 do not. Of the 7 distinct functions with an identity, 2 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 2 later) and 5 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
edges_to_adj 3 other papers
3 later
2402.08907 (2024-02)
Subgraph Pooling: Tackling Negative Transfer on Graphs
2403.01092 (2024-03)
Pairwise Alignment Improves Graph Domain Adaptation
2407.11052 (2024-07)
Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation
read_edges 1 other paper
1 later
2402.08907 (2024-02)
Subgraph Pooling: Tackling Negative Transfer on Graphs

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

In many real-world applications, graph-structured data used for training and testing have differences in distribution, such as in high energy physics (HEP) where simulation data used for training may not match real experiments. Graph domain adaptation (GDA) is a method used to address these differences. However, current GDA primarily works by aligning the distributions of node representations output by a single graph neural network encoder shared across the training and testing domains, which may often yield sub-optimal solutions. This work examines different impacts of distribution shifts caused by either graph structure or node attributes and identifies a new type of shift, named conditional structure shift (CSS), which current GDA approaches are provably suboptimal to deal with. A novel approach, called structural reweighting (StruRW), is proposed to address this issue and is tested on synthetic graphs, four benchmark datasets, and a new application in HEP. StruRW has shown significant performance improvement over the baselines in the settings with large graph structure shifts, and reasonable performance improvement when node attribute shift dominates. 1

For agents

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

get_harvested_code_for_paper("2306.03221")
get_code_for_paper("2306.03221")
have("2306.03221")

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

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

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

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

Connect an agent — have() is free.