{"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/move-to-gpu","entry":"move_to_gpu","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":9,"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":4,"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":"2304.03376","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-statistical-representations-of","title":"Interpretable statistical representations of neural population dynamics and geometry","date":"2023-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dynamics-of-Neural-Systems-Lab/MARBLE","path":"MARBLE/utils.py","file_url":"https://github.com/Dynamics-of-Neural-Systems-Lab/MARBLE/blob/HEAD/MARBLE/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":"f3cbfb34cd6aeb7a","code_sha256_prefix":"f3cbfb34cd6aeb7a","mcp_get_code":{"code_sha256":"f3cbfb34cd6aeb7a"}},{"arxiv_id":"2303.10837","arxiv_id_is_arxiv":true,"paper":"/paper/fedml-he-an-efficient-homomorphic-encryption","title":"FedML-HE: An Efficient Homomorphic-Encryption-Based Privacy-Preserving Federated Learning System","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FedML-AI/FedML","path":"python/fedml/utils/model_utils.py","file_url":"https://github.com/FedML-AI/FedML/blob/HEAD/python/fedml/utils/model_utils.py","status":"ran","verification_level":1,"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":"a279848b3acf1a92","code_sha256_prefix":"a279848b3acf1a92","mcp_get_code":{"code_sha256":"a279848b3acf1a92"}},{"arxiv_id":"2212.10305","arxiv_id_is_arxiv":true,"paper":"/paper/which-pixel-to-annotate-a-label-efficient","title":"Which Pixel to Annotate: a Label-Efficient Nuclei Segmentation Framework","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhaof/nuseg","path":"CSinGAN/SinGAN/imresize.py","file_url":"https://github.com/lhaof/nuseg/blob/HEAD/CSinGAN/SinGAN/imresize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d8022d115a3f72e","code_sha256_prefix":"5d8022d115a3f72e","mcp_get_code":{"code_sha256":"5d8022d115a3f72e"}},{"arxiv_id":"2211.12445","arxiv_id_is_arxiv":true,"paper":"/paper/sindiffusion-learning-a-diffusion-model-from","title":"SinDiffusion: Learning a Diffusion Model from a Single Natural Image","date":"2022-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weilunwang/sindiffusion","path":"guided_diffusion/imresize.py","file_url":"https://github.com/weilunwang/sindiffusion/blob/HEAD/guided_diffusion/imresize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d8022d115a3f72e","code_sha256_prefix":"5d8022d115a3f72e","mcp_get_code":{"code_sha256":"5d8022d115a3f72e"}},{"arxiv_id":"2110.02900","arxiv_id_is_arxiv":true,"paper":"/paper/meta-internal-learning","title":"Meta Internal Learning","date":"2021-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RaphaelBensTAU/MetaInternalLearning","path":"modules/imresize.py","file_url":"https://github.com/RaphaelBensTAU/MetaInternalLearning/blob/HEAD/modules/imresize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d8022d115a3f72e","code_sha256_prefix":"5d8022d115a3f72e","mcp_get_code":{"code_sha256":"5d8022d115a3f72e"}},{"arxiv_id":"2109.05940","arxiv_id_is_arxiv":true,"paper":"/paper/cross-domain-robot-imitation-with-invariant","title":"Cross Domain Robot Imitation with Invariant Representation","date":"2021-09-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaohengyin/irgail_example","path":"torch_utils.py","file_url":"https://github.com/zhaohengyin/irgail_example/blob/HEAD/torch_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9adc9bf5872c56b6","code_sha256_prefix":"9adc9bf5872c56b6","mcp_get_code":{"code_sha256":"9adc9bf5872c56b6"}},{"arxiv_id":"2007.13518","arxiv_id_is_arxiv":true,"paper":"/paper/fedml-a-research-library-and-benchmark-for","title":"FedML: A Research Library and Benchmark for Federated Machine Learning","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fedmlai/fedml","path":"python/fedml/utils/model_utils.py","file_url":"https://github.com/fedmlai/fedml/blob/HEAD/python/fedml/utils/model_utils.py","status":"ran","verification_level":1,"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":"a279848b3acf1a92","code_sha256_prefix":"a279848b3acf1a92","mcp_get_code":{"code_sha256":"a279848b3acf1a92"}},{"arxiv_id":"2003.11512","arxiv_id_is_arxiv":true,"paper":"/paper/improved-techniques-for-training-single-image","title":"Improved Techniques for Training Single-Image GANs","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tohinz/ConSinGAN","path":"ConSinGAN/imresize.py","file_url":"https://github.com/tohinz/ConSinGAN/blob/HEAD/ConSinGAN/imresize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d8022d115a3f72e","code_sha256_prefix":"5d8022d115a3f72e","mcp_get_code":{"code_sha256":"5d8022d115a3f72e"}},{"arxiv_id":"1905.01164","arxiv_id_is_arxiv":true,"paper":"/paper/singan-learning-a-generative-model-from-a","title":"SinGAN: Learning a Generative Model from a Single Natural Image","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JackonLiu/SinGAN-Easy","path":"run_train/imresize.py","file_url":"https://github.com/JackonLiu/SinGAN-Easy/blob/HEAD/run_train/imresize.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5d8022d115a3f72e","code_sha256_prefix":"5d8022d115a3f72e","mcp_get_code":{"code_sha256":"5d8022d115a3f72e"}}],"record_sha256":"7c7c62b8c30037b1d34dd3e6a88cbac58fde6ee60d29af10ee5f63361a3c42f7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}