{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/read-dir","entry":"read_dir","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":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":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2407.18365","paper":"/paper/fadas-towards-federated-adaptive-asynchronous","title":"FADAS: Towards Federated Adaptive Asynchronous Optimization","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yujiaw98/FADAS","path":"femnist_datasets.py","file_url":"https://github.com/yujiaw98/FADAS/blob/HEAD/femnist_datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0c5238e6fe1a8c86","mcp_get_code":{"code_sha256":"0c5238e6fe1a8c86"}},{"arxiv_id":"2206.06501","paper":"/paper/optimal-clipping-and-magnitude-aware","title":"Optimal Clipping and Magnitude-aware Differentiation for Improved Quantization-aware Training","date":"2022-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zavareh1/ClippedQuantFL","path":"data.py","file_url":"https://github.com/zavareh1/ClippedQuantFL/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ce8a5a415feadd1f","mcp_get_code":{"code_sha256":"ce8a5a415feadd1f"}},{"arxiv_id":"2001.03799","paper":"/paper/dudornet-learning-a-dual-domain-recurrent","title":"DuDoRNet: Learning a Dual-Domain Recurrent Network for Fast MRI Reconstruction with Deep T1 Prior","date":"2020-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bbbbbbzhou/DuDoRNet","path":"utils/misc.py","file_url":"https://github.com/bbbbbbzhou/DuDoRNet/blob/HEAD/utils/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"554f96c4cb1f7ec4","mcp_get_code":{"code_sha256":"554f96c4cb1f7ec4"}},{"arxiv_id":"1805.08318","paper":"/paper/self-attention-generative-adversarial","title":"Self-Attention Generative Adversarial Networks","date":"2018-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alfagao/DeOldify","path":"fastai/dataset.py","file_url":"https://github.com/alfagao/DeOldify/blob/HEAD/fastai/dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2b102de695eaf51f","mcp_get_code":{"code_sha256":"2b102de695eaf51f"}},{"arxiv_id":"Caldarola_Beyond_Local_Sharpness_Communication-Efficient_Global_Sharpness-aware_Minimization_for_Federated_Learning_CVPR_2025_paper","paper":null,"title":"arXiv:Caldarola_Beyond_Local_Sharpness_Communication-Efficient_Global_Sharpness-aware_Minimization_for_Federated_Learning_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"pietrocagnasso/fedgloss","path":"codebase/utils/model_utils.py","file_url":"https://github.com/pietrocagnasso/fedgloss/blob/HEAD/codebase/utils/model_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"388f1756b3918959","mcp_get_code":{"code_sha256":"388f1756b3918959"}}]}