{"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/distance-wb","entry":"distance_wb","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":16,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":2,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":16,"n_places_pointer_only":14,"n_places_pointer_only_link_open":6,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"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":"2605.00185","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-00185","title":"Fair Dataset Distillation via Cross-Group Barycenter Alignment","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"mhmoslemi/COBRA","path":"cafe/utils.py","file_url":"https://github.com/mhmoslemi/COBRA/blob/HEAD/cafe/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 saehyung-lee/dcc, and GitHub detected no licence in that repository when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2505.16860","arxiv_id_is_arxiv":true,"paper":"/paper/gcal-adapting-graph-models-to-evolving-domain","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joe817/gcal","path":"GCAL.py","file_url":"https://github.com/joe817/gcal/blob/HEAD/GCAL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, joe817/gcal when it was checked","code_sha256":"33fb56403fa7b11d","code_sha256_prefix":"33fb56403fa7b11d","mcp_get_code":{"code_sha256":"33fb56403fa7b11d"}},{"arxiv_id":"2412.09945","arxiv_id_is_arxiv":true,"paper":"/paper/going-beyond-feature-similarity-effective","title":"Going Beyond Feature Similarity: Effective Dataset Distillation based on Class-Aware Conditional Mutual Information","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ndhg1213/CMIDD","path":"DC-DSA-DM/utils.py","file_url":"https://github.com/ndhg1213/CMIDD/blob/HEAD/DC-DSA-DM/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ndhg1213/CMIDD when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2404.00563","arxiv_id_is_arxiv":true,"paper":"/paper/exploiting-inter-sample-and-inter-feature","title":"Exploiting Inter-sample and Inter-feature Relations in Dataset Distillation","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VincenDen/IID","path":"DM+ours/utils.py","file_url":"https://github.com/VincenDen/IID/blob/HEAD/DM%2Bours/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, VincenDen/IID when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2312.00362","arxiv_id_is_arxiv":true,"paper":"/paper/dancing-with-images-video-distillation-via","title":"Dancing with Still Images: Video Distillation via Static-Dynamic Disentanglement","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuz1wan/video_distillation","path":"utils.py","file_url":"https://github.com/yuz1wan/video_distillation/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yuz1wan/video_distillation when it was checked","code_sha256":"50da380b9332efe9","code_sha256_prefix":"50da380b9332efe9","mcp_get_code":{"code_sha256":"50da380b9332efe9"}},{"arxiv_id":"2310.03295","arxiv_id_is_arxiv":true,"paper":"/paper/can-pre-trained-models-assist-in-dataset","title":"Can pre-trained models assist in dataset distillation?","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaolu-zjut/ddinterpreter","path":"methods/DC_DSA_DM/utils.py","file_url":"https://github.com/yaolu-zjut/ddinterpreter/blob/HEAD/methods/DC_DSA_DM/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yaolu-zjut/ddinterpreter when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2307.09742","arxiv_id_is_arxiv":true,"paper":"/paper/improved-distribution-matching-for-dataset-1","title":"Improved Distribution Matching for Dataset Condensation","date":"2023-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uitrbn/idm","path":"dc_utils.py","file_url":"https://github.com/uitrbn/idm/blob/HEAD/dc_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, uitrbn/idm when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2305.18381","arxiv_id_is_arxiv":true,"paper":"/paper/distill-gold-from-massive-ores-efficient","title":"Distill Gold from Massive Ores: Bi-level Data Pruning towards Efficient Dataset Distillation","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"silicx/goldfromores","path":"DatasetCondensation/utils.py","file_url":"https://github.com/silicx/goldfromores/blob/HEAD/DatasetCondensation/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 saehyung-lee/dcc, and GitHub detected no licence in that repository when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2302.01068","arxiv_id_is_arxiv":true,"paper":"/paper/fed-gloss-dp-federated-global-learning-using","title":"FedLAP-DP: Federated Learning by Sharing Differentially Private Loss Approximations","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a514514772/fedlap-dp","path":"utils/ops.py","file_url":"https://github.com/a514514772/fedlap-dp/blob/HEAD/utils/ops.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":"05e4679ed899a619","code_sha256_prefix":"05e4679ed899a619","mcp_get_code":{"code_sha256":"05e4679ed899a619"}},{"arxiv_id":"2301.01197","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-attacks-against-dataset-distillation","title":"Backdoor Attacks Against Dataset Distillation","date":"2023-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuyugeng/baadd","path":"DC/utils.py","file_url":"https://github.com/liuyugeng/baadd/blob/HEAD/DC/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from saehyung-lee/dcc, and GitHub detected no licence in that repository when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2211.04446","arxiv_id_is_arxiv":true,"paper":"/paper/private-set-generation-with-discriminative","title":"Private Set Generation with Discriminative Information","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DingfanChen/Private-Set","path":"utils/ops.py","file_url":"https://github.com/DingfanChen/Private-Set/blob/HEAD/utils/ops.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 saehyung-lee/dcc, and GitHub detected no licence in that repository when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2211.03003","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-annotate-part-segmentation-with-1","title":"Learning to Annotate Part Segmentation with Gradient Matching","date":"2022-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangyu12/lagm","path":"training/loss.py","file_url":"https://github.com/yangyu12/lagm/blob/HEAD/training/loss.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"40305d496ad82775","code_sha256_prefix":"40305d496ad82775","mcp_get_code":{"code_sha256":"40305d496ad82775"}},{"arxiv_id":"2204.13399","arxiv_id_is_arxiv":true,"paper":"/paper/federated-learning-on-heterogeneous-and-long","title":"Federated Learning on Heterogeneous and Long-Tailed Data via Classifier Re-Training with Federated Features","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shangxinyi/CReFF-FL","path":"Dataset/Gradient_matching_loss.py","file_url":"https://github.com/shangxinyi/CReFF-FL/blob/HEAD/Dataset/Gradient_matching_loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shangxinyi/CReFF-FL when it was checked","code_sha256":"10e34c46038f259b","code_sha256_prefix":"10e34c46038f259b","mcp_get_code":{"code_sha256":"10e34c46038f259b"}},{"arxiv_id":"2204.07513","arxiv_id_is_arxiv":true,"paper":"/paper/synthesizing-informative-training-samples","title":"Synthesizing Informative Training Samples with GAN","date":"2022-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VICO-UoE/DatasetCondensation","path":"utils.py","file_url":"https://github.com/VICO-UoE/DatasetCondensation/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 saehyung-lee/dcc, and GitHub detected no licence in that repository when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"2202.02916","arxiv_id_is_arxiv":true,"paper":"/paper/dataset-condensation-with-contrastive-signals","title":"Dataset Condensation with Contrastive Signals","date":"2022-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saehyung-lee/dcc","path":"utils.py","file_url":"https://github.com/saehyung-lee/dcc/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, saehyung-lee/dcc when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}},{"arxiv_id":"03030","arxiv_id_is_arxiv":false,"paper":null,"title":"id 03030 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"silicx/GoldFromOres-BiLP","path":"DatasetCondensation/utils.py","file_url":"https://github.com/silicx/GoldFromOres-BiLP/blob/HEAD/DatasetCondensation/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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 saehyung-lee/dcc, and GitHub detected no licence in that repository when it was checked","code_sha256":"6e9c65aaa7c1b5da","code_sha256_prefix":"6e9c65aaa7c1b5da","mcp_get_code":{"code_sha256":"6e9c65aaa7c1b5da"}}],"record_sha256":"2e37482c1efad09b92c1d8307a5ec2feafdd93c9d68902b28e85b0347582475d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}