{"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/invert","entry":"invert","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":12,"n_papers_ran":3,"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":4,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":1,"unverified":8},"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","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":"lin-zhao-resoLve/D3HR","path":"generation/dit_inversion_save_statistic.py","file_url":"https://github.com/lin-zhao-resoLve/D3HR/blob/HEAD/generation/dit_inversion_save_statistic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd6a20859bd2e457","mcp_get_code":{"code_sha256":"fd6a20859bd2e457"}},{"arxiv_id":"2601.09497","paper":"/paper/arxiv-2601-09497","title":"Towards Robust Cross-Dataset Object Detection Generalization under Domain Specificity","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Ritabrata04/cdod-icpr","path":"class_aligner.py","file_url":"https://github.com/Ritabrata04/cdod-icpr/blob/HEAD/class_aligner.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"15cff93e5a0a7039","mcp_get_code":{"code_sha256":"15cff93e5a0a7039"}},{"arxiv_id":"2505.18399","paper":"/paper/taming-diffusion-for-dataset-distillation","title":"Taming Diffusion for Dataset Distillation with High Representativeness","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lin-zhao-resolve/d3hr","path":"generation/dit_inversion_save_statistic.py","file_url":"https://github.com/lin-zhao-resolve/d3hr/blob/HEAD/generation/dit_inversion_save_statistic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fd6a20859bd2e457","mcp_get_code":{"code_sha256":"fd6a20859bd2e457"}},{"arxiv_id":"2504.09772","paper":"/paper/two-heads-are-better-than-one-test-time-1","title":"Two Heads are Better Than One: Test-time Scaling of Multi-agent Collaborative Reasoning","date":"2025-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jincan333/MAS-TTS","path":"evaluate_dataset.py","file_url":"https://github.com/jincan333/MAS-TTS/blob/HEAD/evaluate_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"48b8ff87d2aa2e93","mcp_get_code":{"code_sha256":"48b8ff87d2aa2e93"}},{"arxiv_id":"2406.09413","paper":"/paper/interpreting-the-weight-space-of-customized","title":"Interpreting the Weight Space of Customized Diffusion Models","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/weights2weights","path":"inversion.py","file_url":"https://github.com/snap-research/weights2weights/blob/HEAD/inversion.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a1b7c201b4b5e735","mcp_get_code":{"code_sha256":"a1b7c201b4b5e735"}},{"arxiv_id":"2402.01434","paper":"/paper/conditioning-non-linear-and-infinite","title":"Conditioning non-linear and infinite-dimensional diffusion processes","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"libbylbaker/infsdebridge","path":"sdebridge/utils.py","file_url":"https://github.com/libbylbaker/infsdebridge/blob/HEAD/sdebridge/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0021f3443c71700c","mcp_get_code":{"code_sha256":"0021f3443c71700c"}},{"arxiv_id":"2310.04780","paper":"/paper/ipmix-label-preserving-data-augmentation-1","title":"IPMix: Label-Preserving Data Augmentation Method for Training Robust Classifiers","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hzlsaber/IPMix","path":"cifar.py","file_url":"https://github.com/hzlsaber/IPMix/blob/HEAD/cifar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4cebd5ded62dc91a","mcp_get_code":{"code_sha256":"4cebd5ded62dc91a"}},{"arxiv_id":"2303.09736","paper":"/paper/dynamic-structure-pruning-for-compressing","title":"Dynamic Structure Pruning for Compressing CNNs","date":"2023-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pytorch/examples","path":"fx/invert.py","file_url":"https://github.com/pytorch/examples/blob/HEAD/fx/invert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"f3f961a13bd98c4b","mcp_get_code":{"code_sha256":"f3f961a13bd98c4b"}},{"arxiv_id":"1909.13719","paper":"/paper/randaugment-practical-data-augmentation-with","title":"RandAugment: Practical automated data augmentation with a reduced search space","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nachiket273/pytorch_resnet_rs","path":"model/randaugment.py","file_url":"https://github.com/nachiket273/pytorch_resnet_rs/blob/HEAD/model/randaugment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b794fd0b35eea322","mcp_get_code":{"code_sha256":"b794fd0b35eea322"}},{"arxiv_id":"1909.13719","paper":"/paper/randaugment-practical-data-augmentation-with","title":"RandAugment: Practical automated data augmentation with a reduced search space","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyxxn0414/test-data-generation","path":"auto_augment.py","file_url":"https://github.com/lyxxn0414/test-data-generation/blob/HEAD/auto_augment.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":"a14dd4fa2af8e72e","mcp_get_code":{"code_sha256":"a14dd4fa2af8e72e"}},{"arxiv_id":"1901.06151","paper":"/paper/robust-watermarking-of-neural-network-with","title":"Robust Watermarking of Neural Network with Exponential Weighting","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"dunky11/exponential-weighting-watermarking","path":"example.py","file_url":"https://github.com/dunky11/exponential-weighting-watermarking/blob/HEAD/example.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9f23558fd49c39c9","mcp_get_code":{"code_sha256":"9f23558fd49c39c9"}},{"arxiv_id":"2024.acl-demos.24","paper":null,"title":"arXiv:2024.acl-demos.24","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mhulden/pyfoma","path":"src/pyfoma/fst.py","file_url":"https://github.com/mhulden/pyfoma/blob/HEAD/src/pyfoma/fst.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e21cd2e33777a9e8","mcp_get_code":{"code_sha256":"e21cd2e33777a9e8"}},{"arxiv_id":"2023.findings-emnlp.761","paper":null,"title":"arXiv:2023.findings-emnlp.761","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YaooXu/Q2T","path":"ssl-relation-prediction/src/datasets.py","file_url":"https://github.com/YaooXu/Q2T/blob/HEAD/ssl-relation-prediction/src/datasets.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"81fe3c0217dde15d","mcp_get_code":{"code_sha256":"81fe3c0217dde15d"}}]}