{"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/mmd-2","entry":"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":8,"n_papers_ran":3,"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":7,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"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":"2510.13887","paper":"/paper/arxiv-2510-13887","title":"Incomplete Multi-view Clustering via Hierarchical Semantic Alignment and Cooperative Completion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"XiaojianDing/2025-NeurIPS-HSACC","path":"loss.py","file_url":"https://github.com/XiaojianDing/2025-NeurIPS-HSACC/blob/HEAD/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5dcb3ac053caef51","mcp_get_code":{"code_sha256":"5dcb3ac053caef51"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Meihan-Liu/24AAAI-A2GNN","path":"A2GNN-adv/utils.py","file_url":"https://github.com/Meihan-Liu/24AAAI-A2GNN/blob/HEAD/A2GNN-adv/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ca363e4b450c262a","mcp_get_code":{"code_sha256":"ca363e4b450c262a"}},{"arxiv_id":"2403.15760","paper":"/paper/an-upload-efficient-scheme-for-transferring","title":"An Upload-Efficient Scheme for Transferring Knowledge From a Server-Side Pre-trained Generator to Clients in Heterogeneous Federated Learning","date":"2024-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsingz0/fedktl","path":"system/flcore/servers/serverktl_stable_diffusion.py","file_url":"https://github.com/tsingz0/fedktl/blob/HEAD/system/flcore/servers/serverktl_stable_diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"54f1b5ed38dafdfa","mcp_get_code":{"code_sha256":"54f1b5ed38dafdfa"}},{"arxiv_id":"2307.01217","paper":"/paper/fedcp-separating-feature-information-for","title":"FedCP: Separating Feature Information for Personalized Federated Learning via Conditional Policy","date":"2023-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsingz0/fedcp","path":"system/flcore/clients/clientcp.py","file_url":"https://github.com/tsingz0/fedcp/blob/HEAD/system/flcore/clients/clientcp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"54f1b5ed38dafdfa","mcp_get_code":{"code_sha256":"54f1b5ed38dafdfa"}},{"arxiv_id":"2305.01281","paper":"/paper/addressing-parameter-choice-issues-in","title":"Addressing Parameter Choice Issues in Unsupervised Domain Adaptation by Aggregation","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpitfire/iwa","path":"misc/loss.py","file_url":"https://github.com/xpitfire/iwa/blob/HEAD/misc/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1f70402f7b8a5e2a","mcp_get_code":{"code_sha256":"1f70402f7b8a5e2a"}},{"arxiv_id":"2109.13296","paper":"/paper/turingbench-a-benchmark-environment-for","title":"TURINGBENCH: A Benchmark Environment for Turing Test in the Age of Neural Text Generation","date":"2021-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amritabh/conda-gen-text-detection","path":"mmd_code.py","file_url":"https://github.com/amritabh/conda-gen-text-detection/blob/HEAD/mmd_code.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"72734211c010d40e","mcp_get_code":{"code_sha256":"72734211c010d40e"}},{"arxiv_id":"2010.12362","paper":"/paper/rescuing-neural-spike-train-models-from-bad","title":"Rescuing neural spike train models from bad MLE","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diegoarri91/mmd-glm","path":"mmdglm/metrics.py","file_url":"https://github.com/diegoarri91/mmd-glm/blob/HEAD/mmdglm/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be2d9936016ac934","mcp_get_code":{"code_sha256":"be2d9936016ac934"}},{"arxiv_id":"2007.07695","paper":"/paper/label-propagation-with-augmented-anchors-a","title":"Label Propagation with Augmented Anchors: A Simple Semi-Supervised Learning baseline for Unsupervised Domain Adaptation","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YBZh/Label-Propagation-with-Augmented-Anchors","path":"models/DomainConfusionLoss.py","file_url":"https://github.com/YBZh/Label-Propagation-with-Augmented-Anchors/blob/HEAD/models/DomainConfusionLoss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94115d21abaca47d","mcp_get_code":{"code_sha256":"94115d21abaca47d"}}]}