SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1905.07645 · 2019

Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching

arXiv · PDF · Open in the Atlas

Code that ran

3 of 3 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; 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/1905.07645.json · badge: /api/ran/1905.07645.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
HongtengXu/s-gwl canonical (classifier label)
classifier basis: classifier_2025
3 ran · 0 no recorded run
FunctionStatusWhere it lives
node_distribution_similarity Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
HongtengXu/s-gwl/methods/GromovWassersteinFramework.py
pointer only (licence: NONE) · get_code("71960b1b8ef30641")
How it ran

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

softmax_grad Ran
ran, honoured the contract we drafted
HongtengXu/s-gwl/methods/GromovWassersteinFramework.py
pointer only (licence: NONE) · get_code("6cf1e50203f18dba")
How it ran

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

update_distribution Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
HongtengXu/s-gwl/methods/GromovWassersteinFramework.py
pointer only (licence: NONE) · get_code("1b8bb2ad0a64f704")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, HongtengXu/s-gwl 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 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 3 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
node_distribution_similarity 1 other paper
1 later
2207.02968 (2022-07)
Unsupervised Manifold Alignment with Joint Multidimensional Scaling
softmax_grad 1 other paper
1 later
2207.02968 (2022-07)
Unsupervised Manifold Alignment with Joint Multidimensional Scaling
update_distribution 1 other paper
1 later
2207.02968 (2022-07)
Unsupervised Manifold Alignment with Joint Multidimensional Scaling

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

We propose a scalable Gromov-Wasserstein learning (S-GWL) method and establish a novel and theoretically-supported paradigm for large-scale graph analysis. The proposed method is based on the fact that Gromov-Wasserstein discrepancy is a pseudometric on graphs. Given two graphs, the optimal transport associated with their Gromov-Wasserstein discrepancy provides the correspondence between their nodes and achieves graph matching. When one of the graphs has isolated but self-connected nodes ($i.e.$, a disconnected graph), the optimal transport indicates the clustering structure of the other graph and achieves graph partitioning. Using this concept, we extend our method to multi-graph partitioning and matching by learning a Gromov-Wasserstein barycenter graph for multiple observed graphs; the barycenter graph plays the role of the disconnected graph, and since it is learned, so is the clustering. Our method combines a recursive $K$-partition mechanism with a regularized proximal gradient algorithm, whose time complexity is $\mathcal{O}(K(E+V)\log_K V)$ for graphs with $V$ nodes and $E$ edges. To our knowledge, our method is the first attempt to make Gromov-Wasserstein discrepancy applicable to large-scale graph analysis and unify graph partitioning and matching into the same framework. It outperforms state-of-the-art graph partitioning and matching methods, achieving a trade-off between accuracy and efficiency.

For agents

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

get_harvested_code_for_paper("1905.07645")
get_code_for_paper("1905.07645")
have("1905.07645")

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

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

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

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

Connect an agent — have() is free.