{"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/fetch-dataset","entry":"fetch_dataset","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":7,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":0,"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":0,"ran_fixture":0,"ran":2,"unverified":5},"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":"2406.02465","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d0fc1c7854a8ad46","code_sha256_prefix":"d0fc1c7854a8ad46","mcp_get_code":{"code_sha256":"d0fc1c7854a8ad46"}},{"arxiv_id":"2402.08922","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2058104d569b458c","code_sha256_prefix":"2058104d569b458c","mcp_get_code":{"code_sha256":"2058104d569b458c"}},{"arxiv_id":"2212.01548","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1231ff80106c5e8e","code_sha256_prefix":"1231ff80106c5e8e","mcp_get_code":{"code_sha256":"1231ff80106c5e8e"}},{"arxiv_id":"2106.01425","arxiv_id_is_arxiv":true,"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":"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":"1842bcd1a9dc7088","code_sha256_prefix":"1842bcd1a9dc7088","mcp_get_code":{"code_sha256":"1842bcd1a9dc7088"}},{"arxiv_id":"2010.01264","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"750cad056c7e60fd","code_sha256_prefix":"750cad056c7e60fd","mcp_get_code":{"code_sha256":"750cad056c7e60fd"}},{"arxiv_id":"2004.11362","arxiv_id_is_arxiv":true,"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":"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":"104ecf80bfd973ca","code_sha256_prefix":"104ecf80bfd973ca","mcp_get_code":{"code_sha256":"104ecf80bfd973ca"}},{"arxiv_id":"1908.07724","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c82599e5b607127a","code_sha256_prefix":"c82599e5b607127a","mcp_get_code":{"code_sha256":"c82599e5b607127a"}}],"record_sha256":"ea77ea3106692dda5314424debe3a49e33dd3fe890e22bea376796d28105a883","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}