{"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/fetch-dataset","entry":"fetch_dataset","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":7,"n_papers_ran":0,"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":7,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":7},"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":"2406.02465","paper":"/paper/an-empirical-study-into-clustering-of-unseen","title":"An Empirical Study into Clustering of Unseen Datasets with Self-Supervised Encoders","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scottclowe/zs-ssl-clustering","path":"zs_ssl_clustering/datasets/api.py","file_url":"https://github.com/scottclowe/zs-ssl-clustering/blob/HEAD/zs_ssl_clustering/datasets/api.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d0fc1c7854a8ad46","mcp_get_code":{"code_sha256":"d0fc1c7854a8ad46"}},{"arxiv_id":"2402.08922","paper":"/paper/the-mirrored-influence-hypothesis-efficient","title":"The Mirrored Influence Hypothesis: Efficient Data Influence Estimation by Harnessing Forward Passes","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruoxi-jia-group/forward-inf","path":"LOO-DualLOO-Convex-11.03.py","file_url":"https://github.com/ruoxi-jia-group/forward-inf/blob/HEAD/LOO-DualLOO-Convex-11.03.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2058104d569b458c","mcp_get_code":{"code_sha256":"2058104d569b458c"}},{"arxiv_id":"2212.01548","paper":"/paper/fedrolex-model-heterogeneous-federated","title":"FedRolex: Model-Heterogeneous Federated Learning with Rolling Sub-Model Extraction","date":"2022-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiot-mlsys-lab/fedrolex","path":"data.py","file_url":"https://github.com/aiot-mlsys-lab/fedrolex/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1231ff80106c5e8e","mcp_get_code":{"code_sha256":"1231ff80106c5e8e"}},{"arxiv_id":"2106.01425","paper":"/paper/gradient-assisted-learning","title":"GAL: Gradient Assisted Learning for Decentralized Multi-Organization Collaborations","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diaoenmao/GAL-Gradient-Assisted-Learning-for-Decentralized-Multi-Organization-Collaborations","path":"src/data.py","file_url":"https://github.com/diaoenmao/GAL-Gradient-Assisted-Learning-for-Decentralized-Multi-Organization-Collaborations/blob/HEAD/src/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1842bcd1a9dc7088","mcp_get_code":{"code_sha256":"1842bcd1a9dc7088"}},{"arxiv_id":"2010.01264","paper":"/paper/heterofl-computation-and-communication-1","title":"HeteroFL: Computation and Communication Efficient Federated Learning for Heterogeneous Clients","date":"2020-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diaoenmao/HeteroFL-Computation-and-Communication-Efficient-Federated-Learning-for-Heterogeneous-Clients","path":"src/data.py","file_url":"https://github.com/diaoenmao/HeteroFL-Computation-and-Communication-Efficient-Federated-Learning-for-Heterogeneous-Clients/blob/HEAD/src/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"750cad056c7e60fd","mcp_get_code":{"code_sha256":"750cad056c7e60fd"}},{"arxiv_id":"2004.11362","paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PaperCodeReview/SupCL-TF","path":"dataloader.py","file_url":"https://github.com/PaperCodeReview/SupCL-TF/blob/HEAD/dataloader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"104ecf80bfd973ca","mcp_get_code":{"code_sha256":"104ecf80bfd973ca"}},{"arxiv_id":"1908.07724","paper":"/paper/190807724","title":"Restricted Recurrent Neural Networks","date":"2019-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diaoenmao/Restricted-Recurrent-Neural-Networks","path":"src/data.py","file_url":"https://github.com/diaoenmao/Restricted-Recurrent-Neural-Networks/blob/HEAD/src/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c82599e5b607127a","mcp_get_code":{"code_sha256":"c82599e5b607127a"}}]}