{"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/rand-cutout","entry":"rand_cutout","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":7,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":6,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":9,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":12,"n_places_pointer_only":8,"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":1,"ran_draft_wrong":6,"ran_fixture":3,"ran":0,"unverified":1},"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":"2605.13475","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-13475","title":"FedHPro: Federated Hyper-Prototype Learning via Gradient Matching","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mala-lab/FedHPro","path":"main_run.py","file_url":"https://github.com/mala-lab/FedHPro/blob/HEAD/main_run.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, mala-lab/FedHPro when it was checked","code_sha256":"d3cd62c7852afac2","code_sha256_prefix":"d3cd62c7852afac2","mcp_get_code":{"code_sha256":"d3cd62c7852afac2"}},{"arxiv_id":"2605.06678","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-06678","title":"A Wasserstein GAN-based climate scenario generator for risk management and insurance: the case of soil subsidence","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"dnkameni/SwiGAN","path":"modules/diff_augment.py","file_url":"https://github.com/dnkameni/SwiGAN/blob/HEAD/modules/diff_augment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dnkameni/SwiGAN when it was checked","code_sha256":"e11fd62529a9a734","code_sha256_prefix":"e11fd62529a9a734","mcp_get_code":{"code_sha256":"e11fd62529a9a734"}},{"arxiv_id":"2406.18561","arxiv_id_is_arxiv":true,"paper":"/paper/selmatch-effectively-scaling-up-dataset","title":"SelMatch: Effectively Scaling Up Dataset Distillation via Selection-Based Initialization and Partial Updates by Trajectory Matching","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yongalls/SelMatch","path":"distill.py","file_url":"https://github.com/Yongalls/SelMatch/blob/HEAD/distill.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, Yongalls/SelMatch when it was checked","code_sha256":"d23b4f2a3643720b","code_sha256_prefix":"d23b4f2a3643720b","mcp_get_code":{"code_sha256":"d23b4f2a3643720b"}},{"arxiv_id":"2310.00093","arxiv_id_is_arxiv":true,"paper":"/paper/datadam-efficient-dataset-distillation-with-1","title":"DataDAM: Efficient Dataset Distillation with Attention Matching","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"datadistillation/datadam","path":"main_DataDAM.py","file_url":"https://github.com/datadistillation/datadam/blob/HEAD/main_DataDAM.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, datadistillation/datadam when it was checked","code_sha256":"e7e9168fac4fe2a7","code_sha256_prefix":"e7e9168fac4fe2a7","mcp_get_code":{"code_sha256":"e7e9168fac4fe2a7"}},{"arxiv_id":"2203.01531","arxiv_id_is_arxiv":true,"paper":"/paper/cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/cafe","path":"distill.py","file_url":"https://github.com/kaiwang960112/cafe/blob/HEAD/distill.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, kaiwang960112/cafe when it was checked","code_sha256":"b3fdd0e504dba6d1","code_sha256_prefix":"b3fdd0e504dba6d1","mcp_get_code":{"code_sha256":"b3fdd0e504dba6d1"}},{"arxiv_id":"2111.01007","arxiv_id_is_arxiv":true,"paper":"/paper/projected-gans-converge-faster","title":"Projected GANs Converge Faster","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8a8f1bb31f56eb41","code_sha256_prefix":"8a8f1bb31f56eb41","mcp_get_code":{"code_sha256":"8a8f1bb31f56eb41"}},{"arxiv_id":"2111.01007","arxiv_id_is_arxiv":true,"paper":"/paper/projected-gans-converge-faster","title":"Projected GANs Converge Faster","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/projected_gan","path":"pg_modules/discriminator.py","file_url":"https://github.com/autonomousvision/projected_gan/blob/HEAD/pg_modules/discriminator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad4806edfa54ef28","code_sha256_prefix":"ad4806edfa54ef28","mcp_get_code":{"code_sha256":"ad4806edfa54ef28"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/data-efficient-gans","path":"DiffAugment_pytorch.py","file_url":"https://github.com/mit-han-lab/data-efficient-gans/blob/HEAD/DiffAugment_pytorch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a8f1bb31f56eb41","code_sha256_prefix":"8a8f1bb31f56eb41","mcp_get_code":{"code_sha256":"8a8f1bb31f56eb41"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaborvecsei/SLE-GAN","path":"sle_gan/diff_augment.py","file_url":"https://github.com/gaborvecsei/SLE-GAN/blob/HEAD/sle_gan/diff_augment.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7eedee91371852fd","code_sha256_prefix":"7eedee91371852fd","mcp_get_code":{"code_sha256":"7eedee91371852fd"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eps696/stylegan2","path":"src/training/DiffAugment_tf.py","file_url":"https://github.com/eps696/stylegan2/blob/HEAD/src/training/DiffAugment_tf.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, eps696/stylegan2 (NOASSERTION)","code_sha256":"d3f6dbbf7ed4b605","code_sha256_prefix":"d3f6dbbf7ed4b605","mcp_get_code":{"code_sha256":"d3f6dbbf7ed4b605"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milmor/TransGAN","path":"diffaug.py","file_url":"https://github.com/milmor/TransGAN/blob/HEAD/diffaug.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2d7ad30f29efa00","code_sha256_prefix":"d2d7ad30f29efa00","mcp_get_code":{"code_sha256":"d2d7ad30f29efa00"}},{"arxiv_id":"2006.10738","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-augmentation-for-data","title":"Differentiable Augmentation for Data-Efficient GAN Training","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"claim-berlin/3d_stylegan_circle_of_willis","path":"diff_augment.py","file_url":"https://github.com/claim-berlin/3d_stylegan_circle_of_willis/blob/HEAD/diff_augment.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, claim-berlin/3d_stylegan_circle_of_willis (NOASSERTION)","code_sha256":"390fc5d117993c38","code_sha256_prefix":"390fc5d117993c38","mcp_get_code":{"code_sha256":"390fc5d117993c38"}}],"record_sha256":"c33af3200a80cfa8e2c27309dc5aed282a13a5803e1d47f61420daeaa9528bc2","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}