{"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/invert","entry":"invert","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":12,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":4,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":5,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":13,"n_places_pointer_only":5,"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":1,"ran":5,"unverified":2},"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":"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":"ran","verification_level":1,"contract_check":null,"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, lin-zhao-resoLve/D3HR when it was checked","code_sha256":"fd6a20859bd2e457","code_sha256_prefix":"fd6a20859bd2e457","mcp_get_code":{"code_sha256":"fd6a20859bd2e457"}},{"arxiv_id":"2601.09497","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, Ritabrata04/cdod-icpr when it was checked","code_sha256":"15cff93e5a0a7039","code_sha256_prefix":"15cff93e5a0a7039","mcp_get_code":{"code_sha256":"15cff93e5a0a7039"}},{"arxiv_id":"2505.18399","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"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, lin-zhao-resolve/d3hr when it was checked","code_sha256":"fd6a20859bd2e457","code_sha256_prefix":"fd6a20859bd2e457","mcp_get_code":{"code_sha256":"fd6a20859bd2e457"}},{"arxiv_id":"2504.09772","arxiv_id_is_arxiv":true,"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":"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":"48b8ff87d2aa2e93","code_sha256_prefix":"48b8ff87d2aa2e93","mcp_get_code":{"code_sha256":"48b8ff87d2aa2e93"}},{"arxiv_id":"2406.09413","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, snap-research/weights2weights (NOASSERTION)","code_sha256":"a1b7c201b4b5e735","code_sha256_prefix":"a1b7c201b4b5e735","mcp_get_code":{"code_sha256":"a1b7c201b4b5e735"}},{"arxiv_id":"2402.01434","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0021f3443c71700c","code_sha256_prefix":"0021f3443c71700c","mcp_get_code":{"code_sha256":"0021f3443c71700c"}},{"arxiv_id":"2310.04780","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4cebd5ded62dc91a","code_sha256_prefix":"4cebd5ded62dc91a","mcp_get_code":{"code_sha256":"4cebd5ded62dc91a"}},{"arxiv_id":"2303.09736","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3f961a13bd98c4b","code_sha256_prefix":"f3f961a13bd98c4b","mcp_get_code":{"code_sha256":"f3f961a13bd98c4b"}},{"arxiv_id":"1909.13719","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b794fd0b35eea322","code_sha256_prefix":"b794fd0b35eea322","mcp_get_code":{"code_sha256":"b794fd0b35eea322"}},{"arxiv_id":"1909.13719","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lyxxn0414/test-data-generation when it was checked","code_sha256":"a14dd4fa2af8e72e","code_sha256_prefix":"a14dd4fa2af8e72e","mcp_get_code":{"code_sha256":"a14dd4fa2af8e72e"}},{"arxiv_id":"1901.06151","arxiv_id_is_arxiv":true,"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":"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":"9f23558fd49c39c9","code_sha256_prefix":"9f23558fd49c39c9","mcp_get_code":{"code_sha256":"9f23558fd49c39c9"}},{"arxiv_id":"2024.acl-demos.24","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"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":"e21cd2e33777a9e8","code_sha256_prefix":"e21cd2e33777a9e8","mcp_get_code":{"code_sha256":"e21cd2e33777a9e8"}},{"arxiv_id":"2023.findings-emnlp.761","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 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":"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":"81fe3c0217dde15d","code_sha256_prefix":"81fe3c0217dde15d","mcp_get_code":{"code_sha256":"81fe3c0217dde15d"}}],"record_sha256":"b00a5ac7ef36ddf86a0a3ce70b13c055b39d209fd51190b45883e87aab066312","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}