Hao Zhu, Ke Sun, Piotr Koniusz
2 of 2 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (2 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 0 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/2201.05493.json · badge: /api/ran/2201.05493.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 |
|---|---|---|
| allenhaozhu/coles | marked official in Papers with Code Papers with Code archive |
2 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Encoder | Ran ran on a synthesized input · constructed an object; no result was computed |
allenhaozhu/coles/model.py pointer only (licence: NONE) · get_code("91ce21d0eb7b5280") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, allenhaozhu/coles 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. |
| Model | Ran ran on a synthesized input · constructed an object; no result was computed |
allenhaozhu/coles/model.py pointer only (licence: NONE) · get_code("6f36a73633ad188d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, allenhaozhu/coles 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, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 later) and 1 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| Encoder brick of this paper's assembly: model |
2 other papers 2 later · 1 only as an assembly brick |
2306.10683 (2023-06) Spatial-Temporal Graph Learning with Adversarial Contrastive Adaptation |
2606.10284 (2026-06) Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing |
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.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph contrastive learning attracts/disperses node representations for similar/dissimilar node pairs under some notion of similarity. It may be combined with a low-dimensional embedding of nodes to preserve intrinsic and structural properties of a graph. In this paper, we extend the celebrated Laplacian Eigenmaps with contrastive learning, and call them COntrastive Laplacian EigenmapS (COLES). Starting from a GAN-inspired contrastive formulation, we show that the Jensen-Shannon divergence underlying many contrastive graph embedding models fails under disjoint positive and negative distributions, which may naturally emerge during sampling in the contrastive setting. In contrast, we demonstrate analytically that COLES essentially minimizes a surrogate of Wasserstein distance, which is known to cope well under disjoint distributions. Moreover, we show that the loss of COLES belongs to the family of so-called block-contrastive losses, previously shown to be superior compared to pair-wise losses typically used by contrastive methods. We show on popular benchmarks/backbones that COLES offers favourable accuracy/scalability compared to DeepWalk, GCN, Graph2Gauss, DGI and GRACE baselines.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2201.05493")
get_code_for_paper("2201.05493")
have("2201.05493")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2201.05493.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2201.05493)
Connect an agent — have() is free.