{"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/average-weights","entry":"average_weights","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":7,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":11,"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":3,"ran_fixture":0,"ran":5,"unverified":1},"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":"2608.24610","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24610","title":"Conditional GraphGANFed: Optimizing Graph-Structured Molecule Generation in Federated Generative Adversarial Networks","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"danielmanu93/Conditional-GraphGANFed","path":"utils.py","file_url":"https://github.com/danielmanu93/Conditional-GraphGANFed/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, danielmanu93/Conditional-GraphGANFed when it was checked","code_sha256":"ab2485d028020739","code_sha256_prefix":"ab2485d028020739","mcp_get_code":{"code_sha256":"ab2485d028020739"}},{"arxiv_id":"2602.02629","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02629","title":"Trustworthy Blockchain-based Federated Learning for Electronic Health Records: Securing Participant Identity with Decentralized Identifiers and Verifiable Credentials","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"rodrigoronner/TBFL-EHR-Framework","path":"TBFL-EHR-Framework/src/main_tbfl_simulation.py","file_url":"https://github.com/rodrigoronner/TBFL-EHR-Framework/blob/HEAD/TBFL-EHR-Framework/src/main_tbfl_simulation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, rodrigoronner/TBFL-EHR-Framework when it was checked","code_sha256":"d228391d37d7459a","code_sha256_prefix":"d228391d37d7459a","mcp_get_code":{"code_sha256":"d228391d37d7459a"}},{"arxiv_id":"2510.10100","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-10100","title":"Cooperative Pseudo Labeling for Unsupervised Federated Classification","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"krumpguo/FedCoPL","path":"methods/main_UL.py","file_url":"https://github.com/krumpguo/FedCoPL/blob/HEAD/methods/main_UL.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, krumpguo/FedCoPL when it was checked","code_sha256":"0a3bd5bcb922a499","code_sha256_prefix":"0a3bd5bcb922a499","mcp_get_code":{"code_sha256":"0a3bd5bcb922a499"}},{"arxiv_id":"2507.05394","arxiv_id_is_arxiv":true,"paper":"/paper/pfedmma-personalized-federated-fine-tuning","title":"pFedMMA: Personalized Federated Fine-Tuning with Multi-Modal Adapter for Vision-Language Models","date":"2025-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sajjad-ucsb/pfedmma","path":"utils.py","file_url":"https://github.com/sajjad-ucsb/pfedmma/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sajjad-ucsb/pfedmma when it was checked","code_sha256":"ab2485d028020739","code_sha256_prefix":"ab2485d028020739","mcp_get_code":{"code_sha256":"ab2485d028020739"}},{"arxiv_id":"2507.05394","arxiv_id_is_arxiv":true,"paper":"/paper/pfedmma-personalized-federated-fine-tuning","title":"pFedMMA: Personalized Federated Fine-Tuning with Multi-Modal Adapter for Vision-Language Models","date":"2025-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sajjad-ucsb/pfedmma","path":"fed_utils.py","file_url":"https://github.com/sajjad-ucsb/pfedmma/blob/HEAD/fed_utils.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, sajjad-ucsb/pfedmma when it was checked","code_sha256":"697e29e1bbc08d3d","code_sha256_prefix":"697e29e1bbc08d3d","mcp_get_code":{"code_sha256":"697e29e1bbc08d3d"}},{"arxiv_id":"2409.19610","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-from-vision-language","title":"Federated Learning from Vision-Language Foundation Models: Theoretical Analysis and Method","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PanBikang/PromptFolio","path":"utils.py","file_url":"https://github.com/PanBikang/PromptFolio/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, PanBikang/PromptFolio when it was checked","code_sha256":"ab2485d028020739","code_sha256_prefix":"ab2485d028020739","mcp_get_code":{"code_sha256":"ab2485d028020739"}},{"arxiv_id":"2409.19610","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-from-vision-language","title":"Federated Learning from Vision-Language Foundation Models: Theoretical Analysis and Method","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PanBikang/PromptFolio","path":"fed_utils.py","file_url":"https://github.com/PanBikang/PromptFolio/blob/HEAD/fed_utils.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, PanBikang/PromptFolio when it was checked","code_sha256":"697e29e1bbc08d3d","code_sha256_prefix":"697e29e1bbc08d3d","mcp_get_code":{"code_sha256":"697e29e1bbc08d3d"}},{"arxiv_id":"2405.09771","arxiv_id_is_arxiv":true,"paper":"/paper/harmonizing-generalization-and","title":"Harmonizing Generalization and Personalization in Federated Prompt Learning","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyucuiovo/fedpgp","path":"utils.py","file_url":"https://github.com/tianyucuiovo/fedpgp/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, tianyucuiovo/fedpgp when it was checked","code_sha256":"ab2485d028020739","code_sha256_prefix":"ab2485d028020739","mcp_get_code":{"code_sha256":"ab2485d028020739"}},{"arxiv_id":"2405.09771","arxiv_id_is_arxiv":true,"paper":"/paper/harmonizing-generalization-and","title":"Harmonizing Generalization and Personalization in Federated Prompt Learning","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyucuiovo/fedpgp","path":"fed_utils.py","file_url":"https://github.com/tianyucuiovo/fedpgp/blob/HEAD/fed_utils.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, tianyucuiovo/fedpgp when it was checked","code_sha256":"697e29e1bbc08d3d","code_sha256_prefix":"697e29e1bbc08d3d","mcp_get_code":{"code_sha256":"697e29e1bbc08d3d"}},{"arxiv_id":"2402.07002","arxiv_id_is_arxiv":true,"paper":"/paper/clients-collaborate-flexible-differentially","title":"Clients Collaborate: Flexible Differentially Private Federated Learning with Guaranteed Improvement of Utility-Privacy Trade-off","date":"2024-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"6lyc/fedceo_collaborate-with-each-other","path":"utils.py","file_url":"https://github.com/6lyc/fedceo_collaborate-with-each-other/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, 6lyc/fedceo_collaborate-with-each-other when it was checked","code_sha256":"ab2485d028020739","code_sha256_prefix":"ab2485d028020739","mcp_get_code":{"code_sha256":"ab2485d028020739"}},{"arxiv_id":"2308.12681","arxiv_id_is_arxiv":true,"paper":"/paper/lr-xfl-logical-reasoning-based-explainable","title":"LR-XFL: Logical Reasoning-based Explainable Federated Learning","date":"2023-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanci87/lr-xfl","path":"experiments/utils.py","file_url":"https://github.com/yanci87/lr-xfl/blob/HEAD/experiments/utils.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":"f78af8bb07ffd223","code_sha256_prefix":"f78af8bb07ffd223","mcp_get_code":{"code_sha256":"f78af8bb07ffd223"}},{"arxiv_id":"2105.01051","arxiv_id_is_arxiv":true,"paper":"/paper/superb-speech-processing-universal","title":"SUPERB: Speech processing Universal PERformance Benchmark","date":"2021-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"usc-sail/fed-ser-leakage","path":"mitigation/update.py","file_url":"https://github.com/usc-sail/fed-ser-leakage/blob/HEAD/mitigation/update.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":"7dd1e77967fbe002","code_sha256_prefix":"7dd1e77967fbe002","mcp_get_code":{"code_sha256":"7dd1e77967fbe002"}},{"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/utils.py","file_url":"https://github.com/AshwinRJ/Federated-Learning-PyTorch/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 danielmanu93/Conditional-GraphGANFed, and GitHub detected no licence in that repository when it was checked","code_sha256":"ab2485d028020739","code_sha256_prefix":"ab2485d028020739","mcp_get_code":{"code_sha256":"ab2485d028020739"}},{"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/fed-att","path":"src/agg/avg.py","file_url":"https://github.com/shaoxiongji/fed-att/blob/HEAD/src/agg/avg.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":"7a711a11ae243b32","code_sha256_prefix":"7a711a11ae243b32","mcp_get_code":{"code_sha256":"7a711a11ae243b32"}},{"arxiv_id":"1806.08804","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basiralab/reproduciblefedgnn","path":"federated_reproducibility/fed_localmodel.py","file_url":"https://github.com/basiralab/reproduciblefedgnn/blob/HEAD/federated_reproducibility/fed_localmodel.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":"63d220d8b4f8afd5","code_sha256_prefix":"63d220d8b4f8afd5","mcp_get_code":{"code_sha256":"63d220d8b4f8afd5"}},{"arxiv_id":"1602.05629","arxiv_id_is_arxiv":true,"paper":"/paper/communication-efficient-learning-of-deep","title":"Communication-Efficient Learning of Deep Networks from Decentralized Data","date":"2016-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futabato/FutabatedLearning","path":"src/federatedlearning/server/aggregations/aggregators.py","file_url":"https://github.com/futabato/FutabatedLearning/blob/HEAD/src/federatedlearning/server/aggregations/aggregators.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":"0964f793bbd43856","code_sha256_prefix":"0964f793bbd43856","mcp_get_code":{"code_sha256":"0964f793bbd43856"}}],"record_sha256":"6889921367c19eedfbf1be0b07c6dfaa3c6532f5de06a9944055d96ba2d8d626","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}