{"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/train-net","entry":"train_net","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":9,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":0,"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":9,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":8,"n_samples_fingerprinted":0,"n_places":11,"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":0,"unverified":8},"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":"2606.20832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20832","title":"ReLaTS: a Reinforcement Learning-based method for dynamically determining the coupling Time Step in multi-scale simulations of self-gravitating systems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"veronicasaz/RL_bridgedCluster","path":"TrainRL.py","file_url":"https://github.com/veronicasaz/RL_bridgedCluster/blob/HEAD/TrainRL.py","status":"unverified","verification_level":0,"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, veronicasaz/RL_bridgedCluster when it was checked","code_sha256":"1a8b954d9dc9dccf","code_sha256_prefix":"1a8b954d9dc9dccf","mcp_get_code":{"code_sha256":"1a8b954d9dc9dccf"}},{"arxiv_id":"2312.06290","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-label-skews-in-federated-learning","title":"Exploiting Label Skews in Federated Learning with Model Concatenation","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtudyq/fedconcat","path":"experiments-fedconcat-id.py","file_url":"https://github.com/sjtudyq/fedconcat/blob/HEAD/experiments-fedconcat-id.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2335d6ae7b4dde0f","code_sha256_prefix":"2335d6ae7b4dde0f","mcp_get_code":{"code_sha256":"2335d6ae7b4dde0f"}},{"arxiv_id":"2312.06290","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-label-skews-in-federated-learning","title":"Exploiting Label Skews in Federated Learning with Model Concatenation","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjtudyq/fedconcat","path":"experiments-FeSEM.py","file_url":"https://github.com/sjtudyq/fedconcat/blob/HEAD/experiments-FeSEM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7ab2dc72d80b745","code_sha256_prefix":"a7ab2dc72d80b745","mcp_get_code":{"code_sha256":"a7ab2dc72d80b745"}},{"arxiv_id":"2308.09318","arxiv_id_is_arxiv":true,"paper":"/paper/towards-attack-tolerant-federated-learning","title":"Towards Attack-tolerant Federated Learning via Critical Parameter Analysis","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sungwon-Han/FEDCPA","path":"main_targeted_attack.py","file_url":"https://github.com/Sungwon-Han/FEDCPA/blob/HEAD/main_targeted_attack.py","status":"unverified","verification_level":0,"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, Sungwon-Han/FEDCPA when it was checked","code_sha256":"9105203324a665f9","code_sha256_prefix":"9105203324a665f9","mcp_get_code":{"code_sha256":"9105203324a665f9"}},{"arxiv_id":"2305.19394","arxiv_id_is_arxiv":true,"paper":"/paper/synaptic-weight-distributions-depend-on-the","title":"Synaptic Weight Distributions Depend on the Geometry of Plasticity","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"romanpogodin/synaptic-weight-distr","path":"linear_regression.py","file_url":"https://github.com/romanpogodin/synaptic-weight-distr/blob/HEAD/linear_regression.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"617e0e99e16d5996","code_sha256_prefix":"617e0e99e16d5996","mcp_get_code":{"code_sha256":"617e0e99e16d5996"}},{"arxiv_id":"2211.01572","arxiv_id_is_arxiv":true,"paper":"/paper/fedtp-federated-learning-by-transformer","title":"FedTP: Federated Learning by Transformer Personalization","date":"2022-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyczy/fedtp","path":"methods/method.py","file_url":"https://github.com/zhyczy/fedtp/blob/HEAD/methods/method.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db0e6a41960059ed","code_sha256_prefix":"db0e6a41960059ed","mcp_get_code":{"code_sha256":"db0e6a41960059ed"}},{"arxiv_id":"2104.12225","arxiv_id_is_arxiv":true,"paper":"/paper/dc3-a-learning-method-for-optimization-with-1","title":"DC3: A learning method for optimization with hard constraints","date":"2021-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/DC3","path":"method.py","file_url":"https://github.com/locuslab/DC3/blob/HEAD/method.py","status":"unverified","verification_level":0,"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":"c8419695db89b99f","code_sha256_prefix":"c8419695db89b99f","mcp_get_code":{"code_sha256":"c8419695db89b99f"}},{"arxiv_id":"2102.02079","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-on-non-iid-data-silos-an","title":"Federated Learning on Non-IID Data Silos: An Experimental Study","date":"2021-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleanor-w/kci_for_fl","path":"experiments.py","file_url":"https://github.com/eleanor-w/kci_for_fl/blob/HEAD/experiments.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54a7795b20263264","code_sha256_prefix":"54a7795b20263264","mcp_get_code":{"code_sha256":"54a7795b20263264"}},{"arxiv_id":"ijcai2024_0457","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0457","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LonelyMoonDesert/FNR-FL","path":"draw_noisy_image.py","file_url":"https://github.com/LonelyMoonDesert/FNR-FL/blob/HEAD/draw_noisy_image.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed9c1f8baf279118","code_sha256_prefix":"ed9c1f8baf279118","mcp_get_code":{"code_sha256":"ed9c1f8baf279118"}},{"arxiv_id":"aaai_29063","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29063","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sjtudyq/FedConcat","path":"experiments-fedconcat-id.py","file_url":"https://github.com/sjtudyq/FedConcat/blob/HEAD/experiments-fedconcat-id.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2335d6ae7b4dde0f","code_sha256_prefix":"2335d6ae7b4dde0f","mcp_get_code":{"code_sha256":"2335d6ae7b4dde0f"}},{"arxiv_id":"aaai_29063","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29063","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"sjtudyq/FedConcat","path":"experiments-FeSEM.py","file_url":"https://github.com/sjtudyq/FedConcat/blob/HEAD/experiments-FeSEM.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a7ab2dc72d80b745","code_sha256_prefix":"a7ab2dc72d80b745","mcp_get_code":{"code_sha256":"a7ab2dc72d80b745"}}],"record_sha256":"9d0a0a0b32c9152f0017d30e0c197c213180ba21188b2f5102be6646300e0d0e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}