Muhammed Fatih Balın, Dominique Lasalle, Ümit Çatalyürek
1 of 9 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (1 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 1 has no contract verdict; 0 failures of our instrument; 8 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/2310.12403.json · badge: /api/ran/2310.12403.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 |
|---|---|---|
| gt-tdalab/dgl-coop | application (classifier label) classifier basis: classifier_2025 |
1 ran · 8 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| LazyFeature | Ran ran on a synthesized input · constructed an object; no result was computed |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("6ff1ab6414e7e081") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, class construct-then-call prompt, model not recorded) and returned LazyFeature: the class was constructed and called, and the call returned an instance of its own class. 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.
|
| BlockSampler | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("de458b1316b1fe0a") How it ranno invocation recorded. |
| LaborSampler | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("9c87070ebf6e4293") How it ranno invocation recorded. |
| Sampler | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("228613fed63ef133") How it ranno invocation recorded. |
| _set_lazy_features | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("ff1a37b98c3aa234") How it ranno invocation recorded. |
| choice | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("7dc7bd1ca50e4bf6") How it ranno invocation recorded. |
| set_dst_lazy_features | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("b1bea8639ec3c94d") How it ranno invocation recorded. |
| set_edge_lazy_features | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("807604b26b54e099") How it ranno invocation recorded. |
| set_src_lazy_features | Not yet run unverified (harvested, no recorded run) |
gt-tdalab/dgl-coop/python/dgl/dataloading/labor_sampler.py code served (permissive licence) · get_code("a6432514a13e95ab") How it ranno invocation recorded. |
Of 9 samples lifted from this paper's linked repositories, 9 carry a function identity and 0 do not. Of the 9 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 9 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.
Training large scale Graph Neural Networks (GNNs) requires significant computational resources, and the process is highly data-intensive. One of the most effective ways to reduce resource requirements is minibatch training coupled with graph sampling. GNNs have the unique property that items in a minibatch have overlapping data. However, the commonly implemented Independent Minibatching approach assigns each Processing Element (PE, i.e., cores and/or GPUs) its own minibatch to process, leading to duplicated computations and input data access across PEs. This amplifies the Neighborhood Explosion Phenomenon (NEP), which is the main bottleneck limiting scaling. To reduce the effects of NEP in the multi-PE setting, we propose a new approach called Cooperative Minibatching. Our approach capitalizes on the fact that the size of the sampled subgraph is a concave function of the batch size, leading to significant reductions in the amount of work as batch sizes increase. Hence, it is favorable for processors equipped with a fast interconnect to work on a large minibatch together as a single larger processor, instead of working on separate smaller minibatches, even though global batch size is identical. We also show how to take advantage of the same phenomenon in serial execution by generating dependent consecutive minibatches. Our experimental evaluations show up to 4x bandwidth savings for fetching vertex embeddings, by simply increasing this dependency without harming model convergence. Combining our proposed approaches, we achieve up to 64% speedup over Independent Minibatching on single-node multi-GPU systems, using same resources.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.12403")
get_code_for_paper("2310.12403")
have("2310.12403")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2310.12403.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2310.12403)
Connect an agent — have() is free.