{"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/rand-contrast","entry":"rand_contrast","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":7,"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":8,"n_samples_ran":8,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":3,"ran":0,"unverified":0},"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","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,"code_sha256_prefix":"da0792c30cd6923d","mcp_get_code":{"code_sha256":"da0792c30cd6923d"}},{"arxiv_id":"2406.18561","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,"code_sha256_prefix":"08cac66a8707ba68","mcp_get_code":{"code_sha256":"08cac66a8707ba68"}},{"arxiv_id":"2310.00093","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,"code_sha256_prefix":"b551aeb91085de7c","mcp_get_code":{"code_sha256":"b551aeb91085de7c"}},{"arxiv_id":"2203.01531","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,"code_sha256_prefix":"22b1451f3070f9e5","mcp_get_code":{"code_sha256":"22b1451f3070f9e5"}},{"arxiv_id":"2111.01007","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,"code_sha256_prefix":"cf3f99cfbe8f451a","mcp_get_code":{"code_sha256":"cf3f99cfbe8f451a"}},{"arxiv_id":"2007.15646","paper":"/paper/rewriting-a-deep-generative-model","title":"Rewriting a Deep Generative Model","date":"2020-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PeterWang512/GANSketching","path":"training/networks/diffaug.py","file_url":"https://github.com/PeterWang512/GANSketching/blob/HEAD/training/networks/diffaug.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cf3f99cfbe8f451a","mcp_get_code":{"code_sha256":"cf3f99cfbe8f451a"}},{"arxiv_id":"2006.10738","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,"code_sha256_prefix":"cf3f99cfbe8f451a","mcp_get_code":{"code_sha256":"cf3f99cfbe8f451a"}},{"arxiv_id":"2006.10738","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,"code_sha256_prefix":"1ea606a1b578d9fd","mcp_get_code":{"code_sha256":"1ea606a1b578d9fd"}},{"arxiv_id":"2006.10738","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,"code_sha256_prefix":"7668b11c66661278","mcp_get_code":{"code_sha256":"7668b11c66661278"}},{"arxiv_id":"2006.10738","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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"93a3d74d32b20296","mcp_get_code":{"code_sha256":"93a3d74d32b20296"}}]}