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; 0 honoured the contract we drafted, 0 violated it and 3 have no contract verdict; 0 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/2403.16372.json · badge: /api/ran/2403.16372.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 |
|---|---|---|
| MindSpore-scientific/code-11 | community (classifier label) classifier basis not recorded on the link |
3 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| generate_sample | Ran ran on a synthesized input |
MindSpore-scientific/code-11/QuantExplainNLP_AlgoAnalysis/data_preprocessing.py code served (permissive licence) · get_code("16298c972234921e") 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 str. 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.
|
| get_feature_names | Ran ran on a synthesized input |
MindSpore-scientific/code-11/QuantExplainNLP_AlgoAnalysis/explainability.py code served (permissive licence) · get_code("5919a74fc358ee01") 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 (13,) 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.
|
| maybe_num_nodes | Ran ran on a synthesized input |
MindSpore-scientific/code-11/RGNN/model_simple.py code served (permissive licence) · get_code("ef93260b5137f73b") 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 int, ndim 0, dtype family int, shape () 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.
|
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, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 3 later) and 0 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 |
|---|---|---|---|
| maybe_num_nodes | 9 other papers 4 dated earlier, 5 later |
2104.01528 (2021-04) SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction |
2210.12624 (2022-10) Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent Stochastic Approach 2307.16372 (2023-07) LP-MusicCaps: LLM-Based Pseudo Music Captioning and 6 more not named here |
| generate_sample | 6 other papers 2 dated earlier, 4 later |
2307.16372 (2023-07) LP-MusicCaps: LLM-Based Pseudo Music Captioning |
2312.16476 (2023-12) SVGDreamer: Text Guided SVG Generation with Diffusion Model 2408.14512 (2024-08) LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings and 3 more not named here |
| get_feature_names | 6 other papers 2 dated earlier, 4 later |
2307.16372 (2023-07) LP-MusicCaps: LLM-Based Pseudo Music Captioning |
2312.16476 (2023-12) SVGDreamer: Text Guided SVG Generation with Diffusion Model 2408.14512 (2024-08) LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings and 3 more not named here |
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.
Distributed learning is commonly used for accelerating model training by harnessing the computational capabilities of multiple-edge devices. However, in practical applications, the communication delay emerges as a bottleneck due to the substantial information exchange required between workers and a central parameter server. SignSGD with majority voting (signSGD-MV) is an effective distributed learning algorithm that can significantly reduce communication costs by one-bit quantization. However, due to heterogeneous computational capabilities, it fails to converge when the mini-batch sizes differ among workers. To overcome this, we propose a novel signSGD optimizer with \textit{federated voting} (signSGD-FV). The idea of federated voting is to exploit learnable weights to perform weighted majority voting. The server learns the weights assigned to the edge devices in an online fashion based on their computational capabilities. Subsequently, these weights are employed to decode the signs of the aggregated local gradients in such a way to minimize the sign decoding error probability. We provide a unified convergence rate analysis framework applicable to scenarios where the estimated weights are known to the parameter server either perfectly or imperfectly. We demonstrate that the proposed signSGD-FV algorithm has a theoretical convergence guarantee even when edge devices use heterogeneous mini-batch sizes. Experimental results show that signSGD-FV outperforms signSGD-MV, exhibiting a faster convergence rate, especially in heterogeneous mini-batch sizes.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2403.16372")
get_code_for_paper("2403.16372")
have("2403.16372")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2403.16372.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2403.16372)
Connect an agent — have() is free.