Jun Xia, Lirong Wu, Ge Wang, Jintao Chen, Stan Li
3 of 4 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 1 has no contract verdict; 2 failures of our instrument; 1 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, measured 2026-11-21; 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/2110.02027.json · badge: /api/ran/2110.02027.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 |
|---|---|---|
| junxia97/ProGCL | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 0 no recorded run |
| junxia97/progcl | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| weighted_mean | Ran ran; our contract draft was wrong, not the code |
junxia97/ProGCL/pGRACE/model.py pointer only (licence: NONE) · get_code("2dff6e858d437842") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, junxia97/ProGCL 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. |
| Encoder | Ran ran on a synthesized input |
junxia97/progcl/pGRACE/model.py pointer only (licence: NONE) · get_code("cbf7739871233f4b") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, junxia97/progcl 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. |
| fit_beta_weighted | Ran ran; our contract draft was wrong, not the code |
junxia97/ProGCL/pGRACE/model.py pointer only (licence: NONE) · get_code("300e84c6b99cb7f4") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, junxia97/ProGCL 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. |
| GRACE | Not yet run unverified (harvested, no recorded run) |
junxia97/progcl/pGRACE/model.py pointer only (licence: NONE) · get_code("d9905b57e3927f8f") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, junxia97/progcl 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. No invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 2 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 2 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| fit_beta_weighted | 3 other papers 3 later · 1 only as an assembly brick |
2206.07551 (2022-06) Unknown-Aware Domain Adversarial Learning for Open-Set Domain Adaptation |
2309.13944 (2023-09) Provable Training for Graph Contrastive Learning 2310.05424 (2023-10) Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decoding |
| weighted_mean | 1 other paper 1 later |
2309.13944 (2023-09) Provable Training for Graph Contrastive Learning |
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.
Contrastive Learning (CL) has emerged as a dominant technique for unsupervised representation learning which embeds augmented versions of the anchor close to each other (positive samples) and pushes the embeddings of other samples (negatives) apart. As revealed in recent studies, CL can benefit from hard negatives (negatives that are most similar to the anchor). However, we observe limited benefits when we adopt existing hard negative mining techniques of other domains in Graph Contrastive Learning (GCL). We perform both experimental and theoretical analysis on this phenomenon and find it can be attributed to the message passing of Graph Neural Networks (GNNs). Unlike CL in other domains, most hard negatives are potentially false negatives (negatives that share the same class with the anchor) if they are selected merely according to the similarities between anchor and themselves, which will undesirably push away the samples of the same class. To remedy this deficiency, we propose an effective method, dubbed ProGCL, to estimate the probability of a negative being true one, which constitutes a more suitable measure for negatives' hardness together with similarity. Additionally, we devise two schemes (i.e., ProGCLweight and ProGCL-mix) to boost the performance of GCL. Extensive experiments demonstrate that ProGCL brings notable and consistent improvements over base GCL methods and yields multiple state-of-the-art results on several unsupervised benchmarks or even exceeds the performance of supervised ones. Also, ProGCL is readily pluggable into various negatives-based GCL methods for performance improvement. We release the code at https://github.com/ junxia97/ProGCL.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2110.02027")
get_code_for_paper("2110.02027")
have("2110.02027")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2110.02027.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2110.02027)
Connect an agent — have() is free.