SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2212.04085 · 2022

Graph Matching with Bi-level Noisy Correspondence

arXiv · PDF · Open in the Atlas

Code that ran

7 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; 0 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 6 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/2212.04085.json · badge: /api/ran/2212.04085.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
Lin-Yijie/Graph-Matching-Networks canonical (classifier label)
classifier basis: classifier_2025
4 ran · 0 no recorded run
copy not recorded community
not in the paper's declared repositories
3 ran · 0 no recorded run
FunctionStatusWhere it lives
bilinear_interpolate Ran
ran; our contract draft was wrong, not the code
Lin-Yijie/Graph-Matching-Networks/COMMON/src/feature_align.py
pointer only (licence: NOASSERTION) · get_code("1cfec25a3287ee2a")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Lin-Yijie/Graph-Matching-Networks (NOASSERTION). 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.

concat_features Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
this paper's copy was not recorded; identical code first harvested from Thinklab-SJTU/ThinkMatch
pointer only; the stored copy get_code serves, from Thinklab-SJTU/ThinkMatch, is pointer only (licence: NOASSERTION) · get_code("bc40b9897e027ece")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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.

feature_align Ran
ran; our contract draft was wrong, not the code
Lin-Yijie/Graph-Matching-Networks/COMMON/src/feature_align.py
pointer only (licence: NOASSERTION) · get_code("14ce6d363f8affbb")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Lin-Yijie/Graph-Matching-Networks (NOASSERTION). 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.

interp_2d Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
Lin-Yijie/Graph-Matching-Networks/COMMON/src/feature_align.py
pointer only (licence: NOASSERTION) · get_code("7863f6e6d53c2ec2")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Lin-Yijie/Graph-Matching-Networks (NOASSERTION). 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.

lexico_iter Ran
ran; our contract draft was wrong, not the code
this paper's copy was not recorded; identical code first harvested from Thinklab-SJTU/ThinkMatch
pointer only; the stored copy get_code serves, from Thinklab-SJTU/ThinkMatch, is pointer only (licence: NOASSERTION) · get_code("a81be531136a1b00")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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_over_channels Ran
ran, violated the contract we drafted
this paper's copy was not recorded; identical code first harvested from Thinklab-SJTU/ThinkMatch
pointer only; the stored copy get_code serves, from Thinklab-SJTU/ThinkMatch, is pointer only (licence: NOASSERTION) · get_code("f12ddebef47d400e")
How it ran

The body of this sample is withheld: this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it. 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 Ran
ran; our contract draft was wrong, not the code
Lin-Yijie/Graph-Matching-Networks/COMMON/src/lap_solvers/ILP.py
pointer only (licence: NOASSERTION) · get_code("98bba89c2a19a3bb")
How it ran

The body of this sample is withheld: GitHub could not classify the licence of this paper's repository, Lin-Yijie/Graph-Matching-Networks (NOASSERTION). 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 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, 4 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 1 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
concat_features 1 other paper
1 dated earlier
2003.11657 (2020-03)
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
lexico_iter 1 other paper
1 dated earlier
2003.11657 (2020-03)
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
normalize_over_channels 1 other paper
1 dated earlier
2003.11657 (2020-03)
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
softmax 1 other paper
1 later
2312.02224 (2023-12)
Tracing Hyperparameter Dependencies for Model Parsing via Learnable Graph Pooling Network

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 this paper, we study a novel and widely existing problem in graph matching (GM), namely, Bi-level Noisy Correspondence (BNC), which refers to node-level noisy correspondence (NNC) and edge-level noisy correspondence (ENC). In brief, on the one hand, due to the poor recognizability and viewpoint differences between images, it is inevitable to inaccurately annotate some keypoints with offset and confusion, leading to the mismatch between two associated nodes, i.e., NNC. On the other hand, the noisy node-to-node correspondence will further contaminate the edge-to-edge correspondence, thus leading to ENC. For the BNC challenge, we propose a novel method termed Contrastive Matching with Momentum Distillation. Specifically, the proposed method is with a robust quadratic contrastive loss which enjoys the following merits: i) better exploring the node-to-node and edge-to-edge correlations through a GM customized quadratic contrastive learning paradigm; ii) adaptively penalizing the noisy assignments based on the confidence estimated by the momentum teacher. Extensive experiments on three real-world datasets show the robustness of our model compared with 12 competitive baselines. The code is available at https://github.com/XLearning-SCU/2023-ICCV-COMMON.

For agents

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

get_harvested_code_for_paper("2212.04085")
get_code_for_paper("2212.04085")
have("2212.04085")

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

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

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

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

Connect an agent — have() is free.