SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2404.08995 · 2024

Beyond Known Clusters: Probe New Prototypes for Efficient Generalized Class Discovery

arXiv · PDF · Open in the Atlas

Code that ran

3 of 3 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; 1 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 1 failure 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/2404.08995.json · badge: /api/ran/2404.08995.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
xjtuyw/pnp canonical (classifier label)
classifier basis: classifier_2025
2 ran · 0 no recorded run
copy not recorded community
not in the paper's declared repositories
1 ran · 0 no recorded run
FunctionStatusWhere it lives
intdict2ndarray Ran
ran, honoured the contract we drafted
xjtuyw/pnp/cluster.py
pointer only (licence: NONE) · get_code("aa57815e101e6fa5")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xjtuyw/pnp 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.

l2norm Ran
ran, violated the contract we drafted
this paper's copy was not recorded; identical code first harvested from xiaoxiong74/face-cluster-by-infomap
pointer only; the stored copy get_code serves, from xiaoxiong74/face-cluster-by-infomap, is pointer only (licence: NONE) · get_code("9e5b9ebb30a1dab5")
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.

read_meta Ran
ran; our contract draft was wrong, not the code
xjtuyw/pnp/cluster.py
pointer only (licence: NONE) · get_code("66584cc5f4d7766e")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, xjtuyw/pnp 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.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 0 later) and 0 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
intdict2ndarray 3 other papers
3 dated earlier
1904.02749 (2019-04)
Learning to Cluster Faces on an Affinity Graph
2004.00445 (2020-04)
Learning to Cluster Faces via Confidence and Connectivity Estimation
2103.11568 (2021-03)
Cluster Contrast for Unsupervised Person Re-Identification
l2norm 3 other papers
3 dated earlier
1904.02749 (2019-04)
Learning to Cluster Faces on an Affinity Graph
2004.00445 (2020-04)
Learning to Cluster Faces via Confidence and Connectivity Estimation
2103.11568 (2021-03)
Cluster Contrast for Unsupervised Person Re-Identification
read_meta 3 other papers
3 dated earlier
1904.02749 (2019-04)
Learning to Cluster Faces on an Affinity Graph
2004.00445 (2020-04)
Learning to Cluster Faces via Confidence and Connectivity Estimation
2103.11568 (2021-03)
Cluster Contrast for Unsupervised Person Re-Identification

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

Generalized Class Discovery (GCD) aims to dynamically assign labels to unlabelled data partially based on knowledge learned from labelled data, where the unlabelled data may come from known or novel classes. The prevailing approach generally involves clustering across all data and learning conceptions by prototypical contrastive learning. However, existing methods largely hinge on the performance of clustering algorithms and are thus subject to their inherent limitations. Firstly, the estimated cluster number is often smaller than the ground truth, making the existing methods suffer from the lack of prototypes for comprehensive conception learning. To address this issue, we propose an adaptive probing mechanism that introduces learnable potential prototypes to expand cluster prototypes (centers). As there is no ground truth for the potential prototype, we develop a self-supervised prototype learning framework to optimize the potential prototype in an end-to-end fashion. Secondly, clustering is computationally intensive, and the conventional strategy of clustering both labelled and unlabelled instances exacerbates this issue. To counteract this inefficiency, we opt to cluster only the unlabelled instances and subsequently expand the cluster prototypes with our introduced potential prototypes to fast explore novel classes. Despite the simplicity of our proposed method, extensive empirical analysis on a wide range of datasets confirms that our method consistently delivers state-of-the-art results. Specifically, our method surpasses the nearest competitor by a significant margin of 9.7% within the Stanford Cars dataset and 12x clustering efficiency within the Herbarium 19 dataset. We will make the code and checkpoints publicly available at https://github.com/xjtuYW/PNP.git.

For agents

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

get_harvested_code_for_paper("2404.08995")
get_code_for_paper("2404.08995")
have("2404.08995")

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

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

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

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

Connect an agent — have() is free.