{"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/vgg11-tiny","entry":"VGG11_Tiny","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":5,"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":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"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":1,"ran_fixture":0,"ran":0,"unverified":0},"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":"2604.18811","arxiv_id_is_arxiv":true,"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":"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, NUS-HPC-AI-Lab/DATM when it was checked","code_sha256":"57fb277537295695","code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2411.11924","arxiv_id_is_arxiv":true,"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":"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, kciiiman/dd_lnl when it was checked","code_sha256":"57fb277537295695","code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2411.11329","arxiv_id_is_arxiv":true,"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":"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, KeViNYuAn0314/AutoPalette when it was checked","code_sha256":"57fb277537295695","code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2410.17193","arxiv_id_is_arxiv":true,"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":"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, nus-hpc-ai-lab/edf when it was checked","code_sha256":"57fb277537295695","code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}},{"arxiv_id":"2310.05773","arxiv_id_is_arxiv":true,"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":"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, nus-hpc-ai-lab/datm when it was checked","code_sha256":"57fb277537295695","code_sha256_prefix":"57fb277537295695","mcp_get_code":{"code_sha256":"57fb277537295695"}}],"record_sha256":"5ea015118927820f203231307dd6c4071f7bb940b8299c64cc98572ea5c7d4c8","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}