2 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 0 have no contract verdict; 2 failures of our instrument; 1 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/2004.12088.json · badge: /api/ran/2004.12088.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 |
|---|---|---|
| chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning | canonical (classifier label) classifier basis: classifier_2025 |
2 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| FedAvg | Ran ran; our contract draft was wrong, not the code |
chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning/SFLV1_ResNet_HAM10000.py pointer only (licence: NONE) · get_code("cddf6b6e878cc6ae") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning 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. |
| calculate_accuracy | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning/SFLV1_ResNet_HAM10000.py pointer only (licence: NONE) · get_code("36a01988eb899505") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning 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. |
| train_server | Not yet run unverified (harvested, no recorded run) |
chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning/SFLV1_ResNet_HAM10000.py pointer only (licence: NONE) · get_code("5749364c6b3444e0") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, chandra2thapa/SplitFed-When-Federated-Learning-Meets-Split-Learning 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. No invocation 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, 2 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 1 the same month, 2 later) and 1 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 |
|---|---|---|---|
| FedAvg | 9 other papers 4 dated earlier, 1 the same month, 4 later |
1602.05629 (2016-02) Communication-Efficient Learning of Deep Networks from Decentralized Data |
1710.10196 (2017-10) Progressive Growing of GANs for Improved Quality, Stability, and Variation 1812.07108 (2018-12) Learning Private Neural Language Modeling with Attentive Aggregation and 6 more not named here |
| calculate_accuracy | 1 other paper 1 later |
2607.08219 (2026-07) Benchmark Evaluation of Federated Learning on Multi-organ Images |
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.
Federated learning (FL) and split learning (SL) are two popular distributed machine learning approaches. Both follow a model-to-data scenario; clients train and test machine learning models without sharing raw data. SL provides better model privacy than FL due to the machine learning model architecture split between clients and the server. Moreover, the split model makes SL a better option for resource-constrained environments. However, SL performs slower than FL due to the relay-based training across multiple clients. In this regard, this paper presents a novel approach, named splitfed learning (SFL), that amalgamates the two approaches eliminating their inherent drawbacks, along with a refined architectural configuration incorporating differential privacy and PixelDP to enhance data privacy and model robustness. Our analysis and empirical results demonstrate that (pure) SFL provides similar test accuracy and communication efficiency as SL while significantly decreasing its computation time per global epoch than in SL for multiple clients. Furthermore, as in SL, its communication efficiency over FL improves with the number of clients. Besides, the performance of SFL with privacy and robustness measures is further evaluated under extended experimental settings.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2004.12088")
get_code_for_paper("2004.12088")
have("2004.12088")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2004.12088.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2004.12088)
Connect an agent — have() is free.