Aditya Devarakonda, Giulia Guidi, Flavio Vella, Julian Bellavita, Matthew Rubino, Nakul Iyer, Andrew Chang
6 of 6 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, 0 violated it and 0 have no contract verdict; 5 failures of our instrument; 0 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/2601.17136.json · badge: /api/ran/2601.17136.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 |
|---|---|---|
| CornellHPC/Vivaldi | canonical (classifier label) classifier basis: census |
6 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| average_breakdown_trials | Ran ran; our contract draft was wrong, not the code |
CornellHPC/Vivaldi/experiments/plot_scaling.py pointer only (licence: NONE) · get_code("35ddfb7fb64145f4") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CornellHPC/Vivaldi 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. |
| get_scaling_data | Ran ran; our contract draft was wrong, not the code |
CornellHPC/Vivaldi/experiments/exp.py pointer only (licence: NONE) · get_code("576935a3ae30cd46") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CornellHPC/Vivaldi 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. |
| parse_breakdown_data | Ran ran; our contract draft was wrong, not the code |
CornellHPC/Vivaldi/experiments/plot_scaling.py pointer only (licence: NONE) · get_code("f4473e8e0efdf836") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CornellHPC/Vivaldi 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. |
| parse_data | Ran ran; our contract draft was wrong, not the code |
CornellHPC/Vivaldi/experiments/plot_scaling.py pointer only (licence: NONE) · get_code("08ab190716ca5738") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CornellHPC/Vivaldi 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. |
| read_data | Ran ran, honoured the contract we drafted |
CornellHPC/Vivaldi/experiments/exp.py pointer only (licence: NONE) · get_code("1c268b8b7bf54d7d") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CornellHPC/Vivaldi 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. |
| request_p_prefix | Ran ran; our contract draft was wrong, not the code |
CornellHPC/Vivaldi/experiments/exp_combblas.py pointer only (licence: NONE) · get_code("0e04f194dd2cd44c") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, CornellHPC/Vivaldi 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. |
Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 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 6 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.
Clustering algorithms are among the most important and informative data analysis tools available. Of these, the Kmeans algorithm is one of the most popular and powerful choices due to its simplicity and generality. However, K-means cannot compute non-linearly separable cluster boundaries, which limits its utility in certain cases. Kernel K-means is a variant of the Kmeans algorithm that can compute non-linearly separable cluster boundaries. Kernel K-means has significant computational and memory requirements because of the presence of a large kernel matrix which scales quadratically with dataset size. Prior work has accelerated Kernel K-means by formulating it using sparse linear algebra primitives and implementing it on a single GPU. However, that approach cannot run on datasets with more than approximately 80,000 samples due to limited GPU memory. Clustering using Kernel K-means remains challenging because of its high computational and memory costs. In this work, we address this issue by presenting a suite of distributed-memory parallel algorithms for large-scale Kernel K-means clustering on multi-GPU systems. Our approach maps the most computationally expensive components of Kernel K-means onto communicationefficient distributed linear algebra primitives uniquely tailored for Kernel K-means, enabling highly scalable implementations that efficiently cluster million-scale datasets. Central to our work is the design of partitioning schemes that enable communicationefficient composition of the linear algebra primitives that appear in Kernel K-means. Our 1.5D algorithm consistently achieves the highest performance, enabling Kernel K-means to scale to data one to two orders of magnitude larger than previously practical. On 256 GPUs, it achieves a geometric mean weak scaling efficiency of 79.7% and a geometric mean strong scaling speedup of 4.2×. Compared to our 1D algorithm, the 1.5D approach achieves up to a 3.6× speedup on 256 GPUs and reduces clustering time from over an hour to under two seconds relative to a single-GPU sliding window implementation. Our results show that distributed algorithms designed with application-specific linear algebraic formulations can achieve substantial performance improvement.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2601.17136")
get_code_for_paper("2601.17136")
have("2601.17136")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2601.17136.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2601.17136)
Connect an agent — have() is free.