1 of 4 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 0 have no contract verdict; 1 failure of our instrument; 3 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/2102.02079.json · badge: /api/ran/2102.02079.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 |
|---|---|---|
| Xtra-Computing/NIID-Bench | canonical (classifier label) classifier basis: classifier_2025 |
1 ran · 0 no recorded run |
| eleanor-w/kci_for_fl | extension (classifier label) classifier basis: classifier_2025 |
0 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| partition_data | Ran ran; our contract draft was wrong, not the code |
Xtra-Computing/NIID-Bench/partition.py code served (permissive licence) · get_code("82a6908178b4dfc0") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned dict. 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.
|
| init_nets | Not yet run unverified (harvested, no recorded run) |
eleanor-w/kci_for_fl/experiments.py code served (permissive licence) · get_code("bf68b2cfab5826f0") How it ranno invocation recorded. |
| train_net | Not yet run unverified (harvested, no recorded run) |
eleanor-w/kci_for_fl/experiments.py code served (permissive licence) · get_code("54a7795b20263264") How it ranno invocation recorded. |
| train_net_fedprox | Not yet run unverified (harvested, no recorded run) |
eleanor-w/kci_for_fl/experiments.py code served (permissive licence) · get_code("c145a7562ae9d57c") How it ranno invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 1 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 1 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.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| partition_data | 1 other paper 1 later |
ijcai2024_0457 (2024 (year only)) Feature Norm Regularized Federated Learning: Utilizing Data Disparities for Model Performance Gains |
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.
Due to the increasing privacy concerns and data regulations, training data have been increasingly fragmented, forming distributed databases of multiple "data silos" (e.g., within different organizations and countries). To develop effective machine learning services, there is a must to exploit data from such distributed databases without exchanging the raw data. Recently, federated learning (FL) has been a solution with growing interests, which enables multiple parties to collaboratively train a machine learning model without exchanging their local data. A key and common challenge on distributed databases is the heterogeneity of the data distribution among the parties. The data of different parties are usually non-independently and identically distributed (i.e., non-IID). There have been many FL algorithms to address the learning effectiveness under non-IID data settings. However, there lacks an experimental study on systematically understanding their advantages and disadvantages, as previous studies have very rigid data partitioning strategies among parties, which are hardly representative and thorough. In this paper, to help researchers better understand and study the non-IID data setting in federated learning, we propose comprehensive data partitioning strategies to cover the typical non-IID data cases. Moreover, we conduct extensive experiments to evaluate state-of-the-art FL algorithms. We find that non-IID does bring significant challenges in learning accuracy of FL algorithms, and none of the existing state-of-the-art FL algorithms outperforms others in all cases. Our experiments provide insights for future studies of addressing the challenges in "data silos".
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.02079")
get_code_for_paper("2102.02079")
have("2102.02079")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.02079.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.02079)
Connect an agent — have() is free.