{"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/add-fit-args","entry":"add_fit_args","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":2,"n_papers_ran_instrument_only":5,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":6,"n_places_pointer_only_link_open":1,"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":5,"ran_fixture":0,"ran":3,"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":"2207.03075","arxiv_id_is_arxiv":true,"paper":"/paper/towards-the-practical-utility-of-federated","title":"Towards the Practical Utility of Federated Learning in the Medical Domain","date":"2022-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wns823/medical_federated","path":"skin_cancer_federated/skin_cancer_main.py","file_url":"https://github.com/wns823/medical_federated/blob/HEAD/skin_cancer_federated/skin_cancer_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wns823/medical_federated when it was checked","code_sha256":"b8768f20600f3edc","code_sha256_prefix":"b8768f20600f3edc","mcp_get_code":{"code_sha256":"b8768f20600f3edc"}},{"arxiv_id":"2010.04902","arxiv_id_is_arxiv":true,"paper":"/paper/byzshield-an-efficient-and-robust-system-for","title":"ByzShield: An Efficient and Robust System for Distributed Training","date":"2020-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ad4da1db77b0c2a2","code_sha256_prefix":"ad4da1db77b0c2a2","mcp_get_code":{"code_sha256":"ad4da1db77b0c2a2"}},{"arxiv_id":"2010.04902","arxiv_id_is_arxiv":true,"paper":"/paper/byzshield-an-efficient-and-robust-system-for","title":"ByzShield: An Efficient and Robust System for Distributed Training","date":"2020-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkonstantinidis/ByzShield","path":"src/distributed_nn.py","file_url":"https://github.com/kkonstantinidis/ByzShield/blob/HEAD/src/distributed_nn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kkonstantinidis/ByzShield when it was checked","code_sha256":"82b80195da259145","code_sha256_prefix":"82b80195da259145","mcp_get_code":{"code_sha256":"82b80195da259145"}},{"arxiv_id":"2002.06440","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-with-matched-averaging-1","title":"Federated Learning with Matched Averaging","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/FedMA","path":"language_modeling/language_main.py","file_url":"https://github.com/IBM/FedMA/blob/HEAD/language_modeling/language_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7f7a1b9782566a2","code_sha256_prefix":"b7f7a1b9782566a2","mcp_get_code":{"code_sha256":"b7f7a1b9782566a2"}},{"arxiv_id":"1907.12205","arxiv_id_is_arxiv":true,"paper":"/paper/detox-a-redundancy-based-framework-for-faster","title":"DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation","date":"2019-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/DETOX","path":"src/distributed_evaluator.py","file_url":"https://github.com/hwang595/DETOX/blob/HEAD/src/distributed_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hwang595/DETOX when it was checked","code_sha256":"3b55ad00f11e2fbf","code_sha256_prefix":"3b55ad00f11e2fbf","mcp_get_code":{"code_sha256":"3b55ad00f11e2fbf"}},{"arxiv_id":"1902.06156","arxiv_id_is_arxiv":true,"paper":"/paper/a-little-is-enough-circumventing-defenses-for","title":"A Little Is Enough: Circumventing Defenses For Distributed Learning","date":"2019-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkonstantinidis/ByzShield","path":"src/distributed_evaluator.py","file_url":"https://github.com/kkonstantinidis/ByzShield/blob/HEAD/src/distributed_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kkonstantinidis/ByzShield when it was checked","code_sha256":"ad4da1db77b0c2a2","code_sha256_prefix":"ad4da1db77b0c2a2","mcp_get_code":{"code_sha256":"ad4da1db77b0c2a2"}},{"arxiv_id":"1803.09877","arxiv_id_is_arxiv":true,"paper":"/paper/draco-byzantine-resilient-distributed","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/Draco","path":"src/distributed_evaluator.py","file_url":"https://github.com/hwang595/Draco/blob/HEAD/src/distributed_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from hwang595/DETOX, and GitHub detected no licence in that repository when it was checked","code_sha256":"3b55ad00f11e2fbf","code_sha256_prefix":"3b55ad00f11e2fbf","mcp_get_code":{"code_sha256":"3b55ad00f11e2fbf"}},{"arxiv_id":"1803.09877","arxiv_id_is_arxiv":true,"paper":"/paper/draco-byzantine-resilient-distributed","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/Draco","path":"src/distributed_nn.py","file_url":"https://github.com/hwang595/Draco/blob/HEAD/src/distributed_nn.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":"b8d6643e20276b6a","code_sha256_prefix":"b8d6643e20276b6a","mcp_get_code":{"code_sha256":"b8d6643e20276b6a"}},{"arxiv_id":"1803.09877","arxiv_id_is_arxiv":true,"paper":"/paper/draco-byzantine-resilient-distributed","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/Draco","path":"src/single_machine.py","file_url":"https://github.com/hwang595/Draco/blob/HEAD/src/single_machine.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":"98bdc33dfac0b80d","code_sha256_prefix":"98bdc33dfac0b80d","mcp_get_code":{"code_sha256":"98bdc33dfac0b80d"}},{"arxiv_id":"1603.07027","arxiv_id_is_arxiv":true,"paper":"/paper/moon-a-mixed-objective-optimization-network","title":"MOON: A Mixed Objective Optimization Network for the Recognition of Facial Attributes","date":"2016-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"likelyzhao/peron_attribute","path":"training/common/fit.py","file_url":"https://github.com/likelyzhao/peron_attribute/blob/HEAD/training/common/fit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c93eb04d4abde37b","code_sha256_prefix":"c93eb04d4abde37b","mcp_get_code":{"code_sha256":"c93eb04d4abde37b"}}],"record_sha256":"da7aa29951b00f3fd9cef16185d4df919e644174d295b6142e1a8d7e8da1314f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}