{"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/lr-policy","entry":"lr_policy","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":6,"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":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"n_places_pointer_only_link_open":3,"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":2,"ran_fixture":0,"ran":0,"unverified":1},"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":"Jiacheng8/FADRM","path":"recover/utils_recover.py","file_url":"https://github.com/Jiacheng8/FADRM/blob/HEAD/recover/utils_recover.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zhangxin-xd/UFC, and GitHub detected no licence in that repository when it was checked","code_sha256":"38fd828e9ae4636a","code_sha256_prefix":"38fd828e9ae4636a","mcp_get_code":{"code_sha256":"38fd828e9ae4636a"}},{"arxiv_id":"2506.24125","arxiv_id_is_arxiv":true,"paper":"/paper/fadrm-fast-and-accurate-data-residual","title":"FADRM: Fast and Accurate Data Residual Matching for Dataset Distillation","date":"2025-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/fadrm","path":"recover/utils_recover.py","file_url":"https://github.com/jiacheng8/fadrm/blob/HEAD/recover/utils_recover.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zhangxin-xd/UFC, and GitHub detected no licence in that repository when it was checked","code_sha256":"38fd828e9ae4636a","code_sha256_prefix":"38fd828e9ae4636a","mcp_get_code":{"code_sha256":"38fd828e9ae4636a"}},{"arxiv_id":"2501.07575","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-distillation-via-committee-voting","title":"Dataset Distillation via Committee Voting","date":"2025-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiacheng8/cv-dd","path":"recover/utils_recover.py","file_url":"https://github.com/jiacheng8/cv-dd/blob/HEAD/recover/utils_recover.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from zhangxin-xd/UFC, and GitHub detected no licence in that repository when it was checked","code_sha256":"38fd828e9ae4636a","code_sha256_prefix":"38fd828e9ae4636a","mcp_get_code":{"code_sha256":"38fd828e9ae4636a"}},{"arxiv_id":"2408.06927","arxiv_id_is_arxiv":true,"paper":"/paper/breaking-class-barriers-efficient-dataset","title":"Breaking Class Barriers: Efficient Dataset Distillation via Inter-Class Feature Compensator","date":"2024-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxin-xd/UFC","path":"ufc_generation/ufc_cifar.py","file_url":"https://github.com/zhangxin-xd/UFC/blob/HEAD/ufc_generation/ufc_cifar.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, zhangxin-xd/UFC when it was checked","code_sha256":"38fd828e9ae4636a","code_sha256_prefix":"38fd828e9ae4636a","mcp_get_code":{"code_sha256":"38fd828e9ae4636a"}},{"arxiv_id":"2110.04545","arxiv_id_is_arxiv":true,"paper":"/paper/towards-data-free-domain-generalization","title":"Towards Data-Free Domain Generalization","date":"2021-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaokunChen245/DFDG","path":"dfdg/training/train_student_syn_img.py","file_url":"https://github.com/HaokunChen245/DFDG/blob/HEAD/dfdg/training/train_student_syn_img.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8879e55d89cdc808","code_sha256_prefix":"8879e55d89cdc808","mcp_get_code":{"code_sha256":"8879e55d89cdc808"}},{"arxiv_id":"2010.14298","arxiv_id_is_arxiv":true,"paper":"/paper/a-statistical-framework-for-low-bitwidth","title":"A Statistical Framework for Low-bitwidth Training of Deep Neural Networks","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjf00000/StatQuant","path":"image_classification/training.py","file_url":"https://github.com/cjf00000/StatQuant/blob/HEAD/image_classification/training.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e099f52e7267bec","code_sha256_prefix":"2e099f52e7267bec","mcp_get_code":{"code_sha256":"2e099f52e7267bec"}}],"record_sha256":"5d6a11259ed0f8b7b97d0b28958b272f8427893f51dd63a139a0a5ab7648f09a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}