{"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/compute-mmd","entry":"compute_mmd","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":9,"n_papers_ran":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":9,"n_samples_ran":4,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":5},"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":"2608.23473","paper":"/paper/arxiv-2608-23473","title":"METACASTER: Meta-Harness-Optimized Agent for End-to-End Few-Shot Learning of Lightweight Time Series Forecasters","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"D2I-Group/metacaster","path":"eval/generation_quality.py","file_url":"https://github.com/D2I-Group/metacaster/blob/HEAD/eval/generation_quality.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4556ff4fec2cce35","mcp_get_code":{"code_sha256":"4556ff4fec2cce35"}},{"arxiv_id":"2603.12296","paper":"/paper/arxiv-2603-12296","title":"Synthetic Data Generation for Brain-Computer Interfaces: Overview, Benchmarking, and Future Directions","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"wzwvv/DG4BCI","path":"Synthetic_Data_Evaluation/MMD.py","file_url":"https://github.com/wzwvv/DG4BCI/blob/HEAD/Synthetic_Data_Evaluation/MMD.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"767ba4732682b723","mcp_get_code":{"code_sha256":"767ba4732682b723"}},{"arxiv_id":"2509.21655","paper":"/paper/arxiv-2509-21655","title":"DriftLite: Lightweight Drift Control for Inference-Time Scaling of Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"yinuoren/DriftLite","path":"evaluation.py","file_url":"https://github.com/yinuoren/DriftLite/blob/HEAD/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"120031b737364a94","mcp_get_code":{"code_sha256":"120031b737364a94"}},{"arxiv_id":"2505.14128","paper":"/paper/a-methodological-framework-for-measuring","title":"A Methodological Framework for Measuring Spatial Labeling Similarity","date":"2025-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihdu/slam","path":"src/mmd_calculation.py","file_url":"https://github.com/yihdu/slam/blob/HEAD/src/mmd_calculation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8c43e7b3486c823a","mcp_get_code":{"code_sha256":"8c43e7b3486c823a"}},{"arxiv_id":"2410.24012","paper":"/paper/diffusion-twigs-with-loop-guidance-for","title":"Diffusion Twigs with Loop Guidance for Conditional Graph Generation","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aalto-quml/diffusion_twigs","path":"evaluation/mmd.py","file_url":"https://github.com/aalto-quml/diffusion_twigs/blob/HEAD/evaluation/mmd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"50a84a037f597f43","mcp_get_code":{"code_sha256":"50a84a037f597f43"}},{"arxiv_id":"2311.05420","paper":"/paper/counterfactually-fair-representation","title":"Counterfactually Fair Representation","date":"2023-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osu-srml/cf_representation_learning","path":"CVAE/utils.py","file_url":"https://github.com/osu-srml/cf_representation_learning/blob/HEAD/CVAE/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"449871daccdb32f8","mcp_get_code":{"code_sha256":"449871daccdb32f8"}},{"arxiv_id":"2106.08161","paper":"/paper/contrastive-mixture-of-posteriors-for","title":"Contrastive Mixture of Posteriors for Counterfactual Inference, Data Integration and Fairness","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BenevolentAI/CoMP","path":"comp/metrics.py","file_url":"https://github.com/BenevolentAI/CoMP/blob/HEAD/comp/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bac34fce94abe980","mcp_get_code":{"code_sha256":"bac34fce94abe980"}},{"arxiv_id":"1910.01791","paper":"/paper/conditional-out-of-sample-generation-for","title":"Conditional out-of-sample generation for unpaired data using trVAE","date":"2019-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theislab/trVAE","path":"trvae/models/_utils.py","file_url":"https://github.com/theislab/trVAE/blob/HEAD/trvae/models/_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5aa8de1c8fdfb28","mcp_get_code":{"code_sha256":"b5aa8de1c8fdfb28"}},{"arxiv_id":"1706.02262","paper":"/paper/infovae-information-maximizing-variational","title":"InfoVAE: Information Maximizing Variational Autoencoders","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ema-marconato/glancenet","path":"models/infovae.py","file_url":"https://github.com/ema-marconato/glancenet/blob/HEAD/models/infovae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"b1ebeb3cc68c188e","mcp_get_code":{"code_sha256":"b1ebeb3cc68c188e"}}]}