{"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/mmd-2","entry":"MMD","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":2,"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":6,"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":"2510.13887","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"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, XiaojianDing/2025-NeurIPS-HSACC when it was checked","code_sha256":"5dcb3ac053caef51","code_sha256_prefix":"5dcb3ac053caef51","mcp_get_code":{"code_sha256":"5dcb3ac053caef51"}},{"arxiv_id":"2407.11052","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Meihan-Liu/24AAAI-A2GNN when it was checked","code_sha256":"ca363e4b450c262a","code_sha256_prefix":"ca363e4b450c262a","mcp_get_code":{"code_sha256":"ca363e4b450c262a"}},{"arxiv_id":"2403.15760","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54f1b5ed38dafdfa","code_sha256_prefix":"54f1b5ed38dafdfa","mcp_get_code":{"code_sha256":"54f1b5ed38dafdfa"}},{"arxiv_id":"2307.01217","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54f1b5ed38dafdfa","code_sha256_prefix":"54f1b5ed38dafdfa","mcp_get_code":{"code_sha256":"54f1b5ed38dafdfa"}},{"arxiv_id":"2305.01281","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1f70402f7b8a5e2a","code_sha256_prefix":"1f70402f7b8a5e2a","mcp_get_code":{"code_sha256":"1f70402f7b8a5e2a"}},{"arxiv_id":"2109.13296","arxiv_id_is_arxiv":true,"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":"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":"72734211c010d40e","code_sha256_prefix":"72734211c010d40e","mcp_get_code":{"code_sha256":"72734211c010d40e"}},{"arxiv_id":"2010.12362","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be2d9936016ac934","code_sha256_prefix":"be2d9936016ac934","mcp_get_code":{"code_sha256":"be2d9936016ac934"}},{"arxiv_id":"2007.07695","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"94115d21abaca47d","code_sha256_prefix":"94115d21abaca47d","mcp_get_code":{"code_sha256":"94115d21abaca47d"}}],"record_sha256":"d310ee38949238b2b606916391e240b9c4cf2df7cc7ad311ab0737dc73c51275","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}