Philip Torr, Liang Lin, Guangrun Wang, Guangcong Wang, Keze Wang
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/2104.08760.json · badge: /api/ran/2104.08760.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 |
|---|---|---|
| wanggrun/triplet | marked official in Papers with Code Papers with Code archive |
0 ran · 2 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| Registry | Not yet run unverified (harvested, no recorded run) |
wanggrun/triplet/openselfsup/models/heads/triplet_loss_head.py code served (permissive licence) · get_code("5456c207a88ac560") How it ranno invocation recorded. |
| TripletLossHead | Not yet run unverified (harvested, no recorded run) |
wanggrun/triplet/openselfsup/models/heads/triplet_loss_head.py code served (permissive licence) · get_code("da3963a12daedd3a") How it ranno 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 (1 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 |
|---|---|---|---|
| Registry brick of this paper's assembly: helper |
5 other papers 4 dated earlier, 1 later · 1 only as an assembly brick |
1505.04597 (2015-05) U-Net: Convolutional Networks for Biomedical Image Segmentation |
1606.00915 (2016-06) DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs 2005.12872 (2020-05) End-to-End Object Detection with Transformers 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.
Self-supervised learning (especially contrastive learning) has attracted great interest due to its huge potential in learning discriminative representations in an unsupervised manner. Despite the acknowledged successes, existing contrastive learning methods suffer from very low learning efficiency, e.g., taking about ten times more training epochs than supervised learning for comparable recognition accuracy. In this paper, we reveal two contradictory phenomena in contrastive learning that we call under-clustering and over-clustering problems, which are major obstacles to learning efficiency. Under-clustering means that the model cannot efficiently learn to discover the dissimilarity between inter-class samples when the negative sample pairs for contrastive learning are insufficient to differentiate all the actual object classes. Over-clustering implies that the model cannot efficiently learn features from excessive negative sample pairs, forcing the model to over-cluster samples of the same actual classes into different clusters. To simultaneously overcome these two problems, we propose a novel self-supervised learning framework using a truncated triplet loss. Precisely, we employ a triplet loss tending to maximize the relative distance between the positive pair and negative pairs to address the under-clustering problem; and we construct the negative pair by selecting a negative sample deputy from all negative samples to avoid the over-clustering problem, guaranteed by the Bernoulli Distribution model. We extensively evaluate our framework in several large-scale benchmarks (e.g., ImageNet, SYSU-30k, and COCO). The results demonstrate our model's superiority (e.g., the learning efficiency) over the latest stateof-the-art methods by a clear margin. See Codes 1 .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.08760")
get_code_for_paper("2104.08760")
have("2104.08760")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.08760.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.08760)
Connect an agent — have() is free.