{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/mnist-noniid","entry":"mnist_noniid","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":5,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2408.12300","arxiv_id_is_arxiv":true,"paper":"/paper/tackling-data-heterogeneity-in-federated-1","title":"Tackling Data Heterogeneity in Federated Learning via Loss Decomposition","date":"2024-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zeng-shuang/fedld","path":"data_loader.py","file_url":"https://github.com/zeng-shuang/fedld/blob/HEAD/data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zeng-shuang/fedld when it was checked","code_sha256":"feed19e92309dd9a","code_sha256_prefix":"feed19e92309dd9a","mcp_get_code":{"code_sha256":"feed19e92309dd9a"}},{"arxiv_id":"2401.02094","arxiv_id_is_arxiv":true,"paper":"/paper/federated-class-incremental-learning-with-1","title":"PILoRA: Prototype Guided Incremental LoRA for Federated Class-Incremental Learning","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghy0501/pilora","path":"PILoRA-cifar/sampling.py","file_url":"https://github.com/ghy0501/pilora/blob/HEAD/PILoRA-cifar/sampling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ghy0501/pilora when it was checked","code_sha256":"fd6f79a5672c6b90","code_sha256_prefix":"fd6f79a5672c6b90","mcp_get_code":{"code_sha256":"fd6f79a5672c6b90"}},{"arxiv_id":"2010.02056","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-using-a-mixture-of-experts","title":"Specialized federated learning using a mixture of experts","date":"2020-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edvinli/federated-learning-mixture","path":"utils/sample_data.py","file_url":"https://github.com/edvinli/federated-learning-mixture/blob/HEAD/utils/sample_data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"80eaa4c2dace63d8","code_sha256_prefix":"80eaa4c2dace63d8","mcp_get_code":{"code_sha256":"80eaa4c2dace63d8"}},{"arxiv_id":"2009.01974","arxiv_id_is_arxiv":true,"paper":"/paper/feddistill-making-bayesian-model-ensemble","title":"FedBE: Making Bayesian Model Ensemble Applicable to Federated Learning","date":"2020-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongyouc/FedBE","path":"utils/sampling.py","file_url":"https://github.com/hongyouc/FedBE/blob/HEAD/utils/sampling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9d721ef1e522392","code_sha256_prefix":"d9d721ef1e522392","mcp_get_code":{"code_sha256":"d9d721ef1e522392"}},{"arxiv_id":"1908.07873","arxiv_id_is_arxiv":true,"paper":"/paper/190807873","title":"Federated Learning: Challenges, Methods, and Future Directions","date":"2019-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AshwinRJ/Federated-Learning-PyTorch","path":"src/sampling.py","file_url":"https://github.com/AshwinRJ/Federated-Learning-PyTorch/blob/HEAD/src/sampling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7cd628afb2ceee6f","code_sha256_prefix":"7cd628afb2ceee6f","mcp_get_code":{"code_sha256":"7cd628afb2ceee6f"}},{"arxiv_id":"1907.01132","arxiv_id_is_arxiv":true,"paper":"/paper/astraea-self-balancing-federated-learning-for","title":"Astraea: Self-balancing Federated Learning for Improving Classification Accuracy of Mobile Deep Learning Applications","date":"2019-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mtang724/Self-Balancing-Federated-Learning","path":"utils/sampling.py","file_url":"https://github.com/mtang724/Self-Balancing-Federated-Learning/blob/HEAD/utils/sampling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37a8837b66a64988","code_sha256_prefix":"37a8837b66a64988","mcp_get_code":{"code_sha256":"37a8837b66a64988"}},{"arxiv_id":"1812.07108","arxiv_id_is_arxiv":true,"paper":"/paper/learning-private-neural-language-modeling","title":"Learning Private Neural Language Modeling with Attentive Aggregation","date":"2018-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaoxiongji/federated-learning","path":"utils/sampling.py","file_url":"https://github.com/shaoxiongji/federated-learning/blob/HEAD/utils/sampling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"37a8837b66a64988","code_sha256_prefix":"37a8837b66a64988","mcp_get_code":{"code_sha256":"37a8837b66a64988"}}],"record_sha256":"c197b5b3db81a736d4a7c46dbdc51422c9b5564fea69372c59f75e3439ec56f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}