{"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/record-net-data-stats","entry":"record_net_data_stats","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"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":3,"ran_fixture":0,"ran":1,"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":"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":"datasplit.py","file_url":"https://github.com/sajjad-ucsb/pfedmma/blob/HEAD/datasplit.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, sajjad-ucsb/pfedmma when it was checked","code_sha256":"49d5e536fa27cddc","code_sha256_prefix":"49d5e536fa27cddc","mcp_get_code":{"code_sha256":"49d5e536fa27cddc"}},{"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":"datasplit.py","file_url":"https://github.com/PanBikang/PromptFolio/blob/HEAD/datasplit.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, PanBikang/PromptFolio when it was checked","code_sha256":"49d5e536fa27cddc","code_sha256_prefix":"49d5e536fa27cddc","mcp_get_code":{"code_sha256":"49d5e536fa27cddc"}},{"arxiv_id":"2406.00431","arxiv_id_is_arxiv":true,"paper":"/paper/spafl-communication-efficient-federated","title":"SpaFL: Communication-Efficient Federated Learning with Sparse Models and Low computational Overhead","date":"2024-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"news-vt/SpaFL_NeruIPS_2024","path":"main/cifar100/Split_data.py","file_url":"https://github.com/news-vt/SpaFL_NeruIPS_2024/blob/HEAD/main/cifar100/Split_data.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, news-vt/SpaFL_NeruIPS_2024 when it was checked","code_sha256":"ddd0fe183f822f1a","code_sha256_prefix":"ddd0fe183f822f1a","mcp_get_code":{"code_sha256":"ddd0fe183f822f1a"}},{"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":"datasplit.py","file_url":"https://github.com/tianyucuiovo/fedpgp/blob/HEAD/datasplit.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, tianyucuiovo/fedpgp when it was checked","code_sha256":"49d5e536fa27cddc","code_sha256_prefix":"49d5e536fa27cddc","mcp_get_code":{"code_sha256":"49d5e536fa27cddc"}},{"arxiv_id":"2404.12130","arxiv_id_is_arxiv":true,"paper":"/paper/one-shot-sequential-federated-learning-for","title":"One-Shot Sequential Federated Learning for Non-IID Data by Enhancing Local Model Diversity","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NaiboWang/FedELMY","path":"helpers/datasets.py","file_url":"https://github.com/NaiboWang/FedELMY/blob/HEAD/helpers/datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, NaiboWang/FedELMY when it was checked","code_sha256":"619c02b025068cf5","code_sha256_prefix":"619c02b025068cf5","mcp_get_code":{"code_sha256":"619c02b025068cf5"}},{"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":"utils.py","file_url":"https://github.com/zhyczy/fedtp/blob/HEAD/utils.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":"db38be23fd6d39ff","code_sha256_prefix":"db38be23fd6d39ff","mcp_get_code":{"code_sha256":"db38be23fd6d39ff"}}],"record_sha256":"09b0a922f98461f10556d6f23bd9900b3dda09ce829d8c86683f21e23e77d868","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}