Haowen Ma, Zhiguo Long, Hua Meng
1 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 0 have no contract verdict; 1 failure of our instrument; 3 no recorded run), measured 2026-11-22; 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/2408.10084.json · badge: /api/ran/2408.10084.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 |
|---|---|---|
| SWJTU-ML/TANGO_code | community Papers with Code archive |
1 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| compute_similarity_for_points | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
SWJTU-ML/TANGO_code/TANGO.py pointer only (licence: NONE) · get_code("aec9eefe0b5e55fc") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, SWJTU-ML/TANGO_code 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. |
| compute_similarity | Not yet run unverified (harvested, no recorded run) |
SWJTU-ML/TANGO_code/TANGO.py pointer only (licence: NONE) · get_code("39e4b096fab8b190") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, SWJTU-ML/TANGO_code 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. |
| compute_threshold_matrix | Not yet run unverified (harvested, no recorded run) |
SWJTU-ML/TANGO_code/TANGO.py pointer only (licence: NONE) · get_code("abdf650f474f0e94") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, SWJTU-ML/TANGO_code 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. |
| tango | Not yet run unverified (harvested, no recorded run) |
SWJTU-ML/TANGO_code/TANGO.py pointer only (licence: NONE) · get_code("c45d0b5c2e5129c7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, SWJTU-ML/TANGO_code 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, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 4 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.
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.
Density-based mode-seeking methods generate a density-ascending dependency from low-density points towards higher-density neighbors. Current mode-seeking methods identify modes by breaking some dependency connections, but relying heavily on local data characteristics, requiring case-by-case threshold settings or human intervention to be effective for different datasets. To address this issue, we introduce a novel concept called typicality, by exploring the locally defined dependency from a global perspective, to quantify how confident a point would be a mode. We devise an algorithm that effectively and efficiently identifies modes with the help of the global-view typicality. To implement and validate our idea, we design a clustering method called TANGO, which not only leverages typicality to detect modes, but also utilizes graph-cut with an improved path-based similarity to aggregate data into the final clusters. Moreover, this paper also provides some theoretical analysis on the proposed algorithm. Experimental results on several synthetic and extensive real-world datasets demonstrate the effectiveness and superiority of TANGO. The code is available at https:// github.com/SWJTU-ML/TANGO_code.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2408.10084")
get_code_for_paper("2408.10084")
have("2408.10084")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2408.10084.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2408.10084)
Connect an agent — have() is free.