Florence D'alché-Buc, Rémi Flamary, Paul Krzakala, Charlotte Laclau, Gabriel Melo, Florence d'Alché-Buc, Federico Méndez
2 of 2 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 0 have no contract verdict; 2 failures of our instrument; 0 no recorded run), measured 2026-11-21; 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/2609.15437.json · badge: /api/ran/2609.15437.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.
| Repository | Role | Ran |
|---|---|---|
| FedericoMendez/amortized-graph-prediction | canonical (classifier label) classifier basis: census |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| parse_evaluation_parameters | Ran ran; our contract draft was wrong, not the code |
FedericoMendez/amortized-graph-prediction/src/evaluate_cli.py pointer only (licence: NONE) · get_code("b7926d14a7e07c81") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, FedericoMendez/amortized-graph-prediction 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_parameters | Ran ran; our contract draft was wrong, not the code |
FedericoMendez/amortized-graph-prediction/src/coloring_examples_cli.py pointer only (licence: NONE) · get_code("e10099f561eb7a85") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, FedericoMendez/amortized-graph-prediction 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. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 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.
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.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
End-to-end Supervised Graph Prediction (SGP) requires a permutation-invariant loss to compare predicted and target graphs with arbitrary node orderings. Such losses typically involve a costly graph-matching problem. We first study three Optimal Transport relaxations of this problem and show, theoretically and empirically, that the Gromov-Wasserstein (GW) objective is the most suitable for SGP. Then, to avoid solving the resulting inner optimization for every training example, we propose to amortize the graph matching (node alignment) problem. For each training sample, the loss function leverages a transport plan provided by a parametric matcher based on the differentiable Sinkhorn algorithm applied on empirical node distributions. The graph prediction module and the matcher are jointly learned. We showcase the efficiency of this approach on toy and real world SGP problems of increasing complexity including a novel Mass-spectra to Scaffold task that we introduce.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2609.15437")
get_code_for_paper("2609.15437")
have("2609.15437")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2609.15437.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2609.15437)
Connect an agent — have() is free.