{"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/vgg11-tiny","entry":"VGG11_Tiny","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":5,"n_papers_ran":0,"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":1,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"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":"2604.18811","paper":"/paper/arxiv-2604-18811","title":"Rethinking Dataset Distillation: Hard Truths About Soft Labels","date":"2026-04-20","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"NUS-HPC-AI-Lab/DATM","path":"networks.py","file_url":"https://github.com/NUS-HPC-AI-Lab/DATM/blob/HEAD/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2411.11924","paper":"/paper/dataset-distillers-are-good-label-denoisers","title":"Dataset Distillers Are Good Label Denoisers In the Wild","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kciiiman/dd_lnl","path":"DATM+ours/networks.py","file_url":"https://github.com/kciiiman/dd_lnl/blob/HEAD/DATM%2Bours/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2411.11329","paper":"/paper/color-oriented-redundancy-reduction-in","title":"Color-Oriented Redundancy Reduction in Dataset Distillation","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KeViNYuAn0314/AutoPalette","path":"networks.py","file_url":"https://github.com/KeViNYuAn0314/AutoPalette/blob/HEAD/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2410.17193","paper":"/paper/emphasizing-discriminative-features-for","title":"Emphasizing Discriminative Features for Dataset Distillation in Complex Scenarios","date":"2024-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nus-hpc-ai-lab/edf","path":"networks.py","file_url":"https://github.com/nus-hpc-ai-lab/edf/blob/HEAD/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2310.05773","paper":"/paper/towards-lossless-dataset-distillation-via","title":"Towards Lossless Dataset Distillation via Difficulty-Aligned Trajectory Matching","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nus-hpc-ai-lab/datm","path":"networks.py","file_url":"https://github.com/nus-hpc-ai-lab/datm/blob/HEAD/networks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}}]}