{"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/cutmix","entry":"cutmix","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":5,"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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":14,"n_places_pointer_only":3,"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":4,"ran_fixture":2,"ran":5,"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":"2606.18209","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18209","title":"Rethinking Dataset Distillation for Classification: Do Distilled Sets Outperform Coresets?","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Jiacheng8/FADRM","path":"relabel/utils_fkd.py","file_url":"https://github.com/Jiacheng8/FADRM/blob/HEAD/relabel/utils_fkd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b07a34e357aed3db","code_sha256_prefix":"b07a34e357aed3db","mcp_get_code":{"code_sha256":"b07a34e357aed3db"}},{"arxiv_id":"2506.24125","arxiv_id_is_arxiv":true,"paper":"/paper/fadrm-fast-and-accurate-data-residual","title":"FADRM: Fast and Accurate Data Residual Matching for Dataset Distillation","date":"2025-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/fadrm","path":"relabel/utils_fkd.py","file_url":"https://github.com/jiacheng8/fadrm/blob/HEAD/relabel/utils_fkd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b07a34e357aed3db","code_sha256_prefix":"b07a34e357aed3db","mcp_get_code":{"code_sha256":"b07a34e357aed3db"}},{"arxiv_id":"2501.07575","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-via-committee-voting","title":"Dataset Distillation via Committee Voting","date":"2025-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/cv-dd","path":"relabel/utils_fkd.py","file_url":"https://github.com/jiacheng8/cv-dd/blob/HEAD/relabel/utils_fkd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b07a34e357aed3db","code_sha256_prefix":"b07a34e357aed3db","mcp_get_code":{"code_sha256":"b07a34e357aed3db"}},{"arxiv_id":"2411.01948","arxiv_id_is_arxiv":true,"paper":"/paper/learning-where-to-edit-vision-transformers","title":"Learning Where to Edit Vision Transformers","date":"2024-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hustyyq/where-to-edit","path":"meta_train.py","file_url":"https://github.com/hustyyq/where-to-edit/blob/HEAD/meta_train.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"56db9a284de50890","code_sha256_prefix":"56db9a284de50890","mcp_get_code":{"code_sha256":"56db9a284de50890"}},{"arxiv_id":"2407.15138","arxiv_id_is_arxiv":true,"paper":"/paper/d-4-m-dataset-distillation-via-disentangled","title":"D$^4$M: Dataset Distillation via Disentangled Diffusion Model","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"richards94/D4M","path":"matching/utils_fkd.py","file_url":"https://github.com/richards94/D4M/blob/HEAD/matching/utils_fkd.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3762ba29552f4adc","code_sha256_prefix":"3762ba29552f4adc","mcp_get_code":{"code_sha256":"3762ba29552f4adc"}},{"arxiv_id":"2404.11265","arxiv_id_is_arxiv":true,"paper":"/paper/the-victim-and-the-beneficiary-exploiting-a-1","title":"The Victim and The Beneficiary: Exploiting a Poisoned Model to Train a Clean Model on Poisoned Data","date":"2024-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zixuan-zhu/vab","path":"attention_mix_ImageNet.py","file_url":"https://github.com/zixuan-zhu/vab/blob/HEAD/attention_mix_ImageNet.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, zixuan-zhu/vab when it was checked","code_sha256":"fd0dd06aa9c0b3fe","code_sha256_prefix":"fd0dd06aa9c0b3fe","mcp_get_code":{"code_sha256":"fd0dd06aa9c0b3fe"}},{"arxiv_id":"2402.14015","arxiv_id_is_arxiv":true,"paper":"/paper/corrective-machine-unlearning","title":"Corrective Machine Unlearning","date":"2024-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drimpossible/corrective-unlearning-bench","path":"src/utils.py","file_url":"https://github.com/drimpossible/corrective-unlearning-bench/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, drimpossible/corrective-unlearning-bench, is not in the permissive set Syntology serves inline","code_sha256":"4a5a2ffb330ca182","code_sha256_prefix":"4a5a2ffb330ca182","mcp_get_code":{"code_sha256":"4a5a2ffb330ca182"}},{"arxiv_id":"2307.00631","arxiv_id_is_arxiv":true,"paper":"/paper/bidirectional-looking-with-a-novel-double","title":"Bidirectional Looking with A Novel Double Exponential Moving Average to Adaptive and Non-adaptive Momentum Optimizers","date":"2023-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chernyn/admeta-optimizer","path":"admeta-code/admeta-cifar/pytorch_image_classification/collators/cutmix.py","file_url":"https://github.com/chernyn/admeta-optimizer/blob/HEAD/admeta-code/admeta-cifar/pytorch_image_classification/collators/cutmix.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"72e2bbc696d16422","code_sha256_prefix":"72e2bbc696d16422","mcp_get_code":{"code_sha256":"72e2bbc696d16422"}},{"arxiv_id":"2306.11911","arxiv_id_is_arxiv":true,"paper":"/paper/lnl-k-learning-with-noisy-labels-and-noise","title":"LNL+K: Enhancing Learning with Noisy Labels Through Noise Source Knowledge Integration","date":"2023-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sunnysiqi/lnl_k","path":"cell_data/simple_multi_main.py","file_url":"https://github.com/sunnysiqi/lnl_k/blob/HEAD/cell_data/simple_multi_main.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":"c5d6f49696141e17","code_sha256_prefix":"c5d6f49696141e17","mcp_get_code":{"code_sha256":"c5d6f49696141e17"}},{"arxiv_id":"2106.01342","arxiv_id_is_arxiv":true,"paper":"/paper/saint-improved-neural-networks-for-tabular","title":"SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Training","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Actis92/lit-saint","path":"src/lit_saint/augmentations.py","file_url":"https://github.com/Actis92/lit-saint/blob/HEAD/src/lit_saint/augmentations.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":"ea091d52c3e000f5","code_sha256_prefix":"ea091d52c3e000f5","mcp_get_code":{"code_sha256":"ea091d52c3e000f5"}},{"arxiv_id":"1905.04899","arxiv_id_is_arxiv":true,"paper":"/paper/cutmix-regularization-strategy-to-train","title":"CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Features","date":"2019-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hysts/pytorch_cutmix","path":"cutmix.py","file_url":"https://github.com/hysts/pytorch_cutmix/blob/HEAD/cutmix.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"de3489ea88a14549","code_sha256_prefix":"de3489ea88a14549","mcp_get_code":{"code_sha256":"de3489ea88a14549"}},{"arxiv_id":"1905.04899","arxiv_id_is_arxiv":true,"paper":"/paper/cutmix-regularization-strategy-to-train","title":"CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Features","date":"2019-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Westlake-AI/openmixup","path":"openmixup/models/augments/cutmix.py","file_url":"https://github.com/Westlake-AI/openmixup/blob/HEAD/openmixup/models/augments/cutmix.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed79cd2e87b6c30d","code_sha256_prefix":"ed79cd2e87b6c30d","mcp_get_code":{"code_sha256":"ed79cd2e87b6c30d"}},{"arxiv_id":"1905.04899","arxiv_id_is_arxiv":true,"paper":"/paper/cutmix-regularization-strategy-to-train","title":"CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Features","date":"2019-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PsorTheDoctor/microarray-data","path":"utils/augmentation.py","file_url":"https://github.com/PsorTheDoctor/microarray-data/blob/HEAD/utils/augmentation.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, PsorTheDoctor/microarray-data when it was checked","code_sha256":"bdf0f6543801b45c","code_sha256_prefix":"bdf0f6543801b45c","mcp_get_code":{"code_sha256":"bdf0f6543801b45c"}},{"arxiv_id":"1905.04899","arxiv_id_is_arxiv":true,"paper":"/paper/cutmix-regularization-strategy-to-train","title":"CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Features","date":"2019-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuch37/image-processing","path":"augmentation/cutmix_pytorch.py","file_url":"https://github.com/liuch37/image-processing/blob/HEAD/augmentation/cutmix_pytorch.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":"8c13b211bd42a04c","code_sha256_prefix":"8c13b211bd42a04c","mcp_get_code":{"code_sha256":"8c13b211bd42a04c"}}],"record_sha256":"1dbc38d1effe6c8ed1887471f1fca3fefdafb68c034f4de2d1330d75d057d141","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}