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, 0 violated it and 0 have no contract verdict; 2 failures 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/1906.07159.json · badge: /api/ran/1906.07159.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 |
|---|---|---|
| sunfanyunn/vgraph | canonical (classifier label) classifier basis: classifier_2025 |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| get_assignment | Ran ran; our contract draft was wrong, not the code |
sunfanyunn/vgraph/nonoverlapping-community-detection.py pointer only (licence: NONE) · get_code("17cf0f7673e6cbfa") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sunfanyunn/vgraph 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_assignment | Ran ran; our contract draft was wrong, not the code |
sunfanyunn/vgraph/overlapping-community-detection.py pointer only (licence: NONE) · get_code("c0020b8ca613a803") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sunfanyunn/vgraph 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. |
| loss_function | Ran ran, honoured the contract we drafted |
sunfanyunn/vgraph/nonoverlapping-community-detection.py pointer only (licence: NONE) · get_code("354159202439c55a") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, sunfanyunn/vgraph 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 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, 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 3 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.
This paper focuses on two fundamental tasks of graph analysis: community detection and node representation learning, which capture the global and local structures of graphs, respectively. In the current literature, these two tasks are usually independently studied while they are actually highly correlated. We propose a probabilistic generative model called vGraph to learn community membership and node representation collaboratively. Specifically, we assume that each node can be represented as a mixture of communities, and each community is defined as a multinomial distribution over nodes. Both the mixing coefficients and the community distribution are parameterized by the low-dimensional representations of the nodes and communities. We designed an effective variational inference algorithm which regularizes the community membership of neighboring nodes to be similar in the latent space. Experimental results on multiple real-world graphs show that vGraph is very effective in both community detection and node representation learning, outperforming many competitive baselines in both tasks. We show that the framework of vGraph is quite flexible and can be easily extended to detect hierarchical communities.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1906.07159")
get_code_for_paper("1906.07159")
have("1906.07159")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1906.07159.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1906.07159)
Connect an agent — have() is free.