None of the 2 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (2 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/2106.09645.json · badge: /api/ran/2106.09645.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 |
|---|---|---|
| ha-lins/pgcl | canonical (classifier label) classifier basis: classifier_2025 |
0 ran · 1 no recorded run |
| copy not recorded | community not in the paper's declared repositories |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| distributed_sinkhorn | Not yet run unverified (harvested, no recorded run) |
ha-lins/pgcl/unsupervised_TU/pgcl_main.py code served (permissive licence) · get_code("a5ce8d6b2c6af43f") How it ranno invocation recorded. |
| eval | Not yet run unverified (harvested, no recorded run) |
this paper's copy was not recorded; identical code first harvested from DeepGraphLearning/GraphLoG pointer only; the stored copy get_code serves, from DeepGraphLearning/GraphLoG, is pointer only (licence: NONE) · get_code("f6e29229f7916056") How it ranThe 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. No invocation 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, 1 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 |
|---|---|---|---|
| eval | 5 other papers 1 the same month, 4 later |
2106.04113 (2021-06) Self-supervised Graph-level Representation Learning with Local and Global Structure |
2109.10259 (2021-09) AutoGCL: Automated Graph Contrastive Learning via Learnable View Generators 2110.00987 (2021-10) Motif-based Graph Self-Supervised Learning for Molecular Property Prediction and 2 more not named here |
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-level representations are critical in various real-world applications, such as predicting the properties of molecules. But in practice, precise graph annotations are generally very expensive and time-consuming. To address this issue, graph contrastive learning constructs instance discrimination task which pulls together positive pairs (augmentation pairs of the same graph) and pushes away negative pairs (augmentation pairs of different graphs) for unsupervised representation learning. However, since for a query, its negatives are uniformly sampled from all graphs, existing methods suffer from the critical sampling bias issue, i.e., the negatives likely having the same semantic structure with the query, leading to performance degradation. To mitigate this sampling bias issue, in this paper, we propose a Prototypical Graph Contrastive Learning (PGCL) approach. Specifically, PGCL models the underlying semantic structure of the graph data via clustering semantically similar graphs into the same group, and simultaneously encourages the clustering consistency for different augmentations of the same graph. Then given a query, it performs negative sampling via drawing the graphs from those clusters that differ from the cluster of query, which ensures the semantic difference between query and its negative samples. Moreover, for a query, PGCL further reweights its negative samples based on the distance between their prototypes (cluster centroids) and the query prototype such that those negatives having moderate prototype distance enjoy relatively large weights. This reweighting strategy is proved to be more effective than uniform sampling. Experimental results on various graph benchmarks testify the advantages of our PGCL over state-of-the-art methods. Code is publicly available at https://github.com/ha-lins/PGCL.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.09645")
get_code_for_paper("2106.09645")
have("2106.09645")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.09645.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.09645)
Connect an agent — have() is free.