5 of 12 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 5 have no contract verdict; 0 failures of our instrument; 7 no recorded run), 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/2005.09810.json · badge: /api/ran/2005.09810.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 |
|---|---|---|
| kfoynt/LocalGraphClustering | canonical (classifier label) classifier basis: census |
5 ran · 7 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| acl_list | Ran ran on a synthesized input |
kfoynt/LocalGraphClustering/localgraphclustering/algorithms/acl_list.py code served (permissive licence) · get_code("25afa867451dfa44") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family float, shape (5,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| diff | Ran ran on a synthesized input |
kfoynt/LocalGraphClustering/localgraphclustering/algorithms/fista_dinput_dense.py code served (permissive licence) · get_code("0eca415c135a6946") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family int, shape (4,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| eig2nL_subgraph | Ran ran on a synthesized input |
kfoynt/LocalGraphClustering/localgraphclustering/algorithms/eig2_nL.py code served (permissive licence) · get_code("3bc99562f219b3ab") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| mat_vec_with_Q | Ran ran on a synthesized input |
kfoynt/LocalGraphClustering/localgraphclustering/algorithms/fista_dinput_dense.py code served (permissive licence) · get_code("fa5bf5f8919516b2") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned ndarray, ndim 1, dtype family float, shape (4,) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| sweepcut | Ran ran on a synthesized input |
kfoynt/LocalGraphClustering/localgraphclustering/algorithms/sweepcut.py code served (permissive licence) · get_code("4f49bc8e3863ab76") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| MQI | Not yet run unverified (harvested, no recorded run) |
kfoynt/LocalGraphClustering/localgraphclustering/MQI.py code served (permissive licence) · get_code("e1737d8b1e0223d9") How it ranno invocation recorded. |
| MQI_weighted | Not yet run unverified (harvested, no recorded run) |
kfoynt/LocalGraphClustering/localgraphclustering/MQI_weighted.py code served (permissive licence) · get_code("a3be98a2ac73b7e5") How it ranno invocation recorded. |
| SimpleLocal | Not yet run unverified (harvested, no recorded run) |
kfoynt/LocalGraphClustering/localgraphclustering/SimpleLocal.py code served (permissive licence) · get_code("f3ee78284e072922") How it ranno invocation recorded. |
| SimpleLocal_weighted | Not yet run unverified (harvested, no recorded run) |
kfoynt/LocalGraphClustering/localgraphclustering/SimpleLocal_weighted.py code served (permissive licence) · get_code("5b7985e7d25d8368") How it ranno invocation recorded. |
| approximate_PageRank_weighted | Not yet run unverified (harvested, no recorded run) |
kfoynt/LocalGraphClustering/localgraphclustering/approximate_PageRank_weighted.py code served (permissive licence) · get_code("4b839d8e9371df3b") How it ranno invocation recorded. |
| eig2_nL | Not yet run unverified (harvested, no recorded run) |
kfoynt/LocalGraphClustering/localgraphclustering/algorithms/eig2_nL.py code served (permissive licence) · get_code("63a290967ef4b75f") How it ranno invocation recorded. |
| fista_dinput_dense | Not yet run unverified (harvested, no recorded run) |
kfoynt/LocalGraphClustering/localgraphclustering/algorithms/fista_dinput_dense.py code served (permissive licence) · get_code("15a57b247e8c53ae") How it ranno invocation recorded. |
Of 12 samples lifted from this paper's linked repositories, 12 carry a function identity and 0 do not. Of the 12 distinct functions with an identity, 6 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 6 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| MQI | 1 other paper 1 later |
2106.05245 (2021-06) Local Algorithms for Finding Densely Connected Clusters |
|
| MQI_weighted | 1 other paper 1 later |
2106.05245 (2021-06) Local Algorithms for Finding Densely Connected Clusters |
|
| SimpleLocal | 1 other paper 1 later |
2106.05245 (2021-06) Local Algorithms for Finding Densely Connected Clusters |
|
| SimpleLocal_weighted | 1 other paper 1 later |
2106.05245 (2021-06) Local Algorithms for Finding Densely Connected Clusters |
|
| acl_list | 1 other paper 1 later |
2106.05245 (2021-06) Local Algorithms for Finding Densely Connected Clusters |
|
| eig2nL_subgraph | 1 other paper 1 later |
2106.05245 (2021-06) Local Algorithms for Finding Densely Connected Clusters |
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.
Local graph clustering and the closely related seed set expansion problem are primitives on graphs that are central to a wide range of analytic and learning tasks such as local clustering, community detection, nodes ranking and feature inference. Prior work on local graph clustering mostly falls into two categories with numerical and combinatorial roots respectively. In this work, we draw inspiration from both fields and propose a family of convex optimization formulations based on the idea of diffusion with p-norm network flow for $p\in (1,\infty)$. In the context of local clustering, we characterize the optimal solutions for these optimization problems and show their usefulness in finding low conductance cuts around input seed set. In particular, we achieve quadratic approximation of conductance in the case of $p=2$ similar to the Cheeger-type bounds of spectral methods, constant factor approximation when $p\rightarrow\infty$ similar to max-flow based methods, and a smooth transition for general $p$ values in between. Thus, our optimization formulation can be viewed as bridging the numerical and combinatorial approaches, and we can achieve the best of both worlds in terms of speed and noise robustness. We show that the proposed problem can be solved in strongly local running time for $p\ge 2$ and conduct empirical evaluations on both synthetic and real-world graphs to illustrate our approach compares favorably with existing methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.09810")
get_code_for_paper("2005.09810")
have("2005.09810")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.09810.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.09810)
Connect an agent — have() is free.