{"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/guassian-kernel","entry":"guassian_kernel","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":6,"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":3,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":3},"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":"2509.20177","paper":"/paper/arxiv-2509-20177","title":"Generative Model Inversion Through the Lens of the Manifold Hypothesis","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"tmlr-group/AlignMI","path":"high_resolution/criteria/mmd_loss.py","file_url":"https://github.com/tmlr-group/AlignMI/blob/HEAD/high_resolution/criteria/mmd_loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d1badab353798361","mcp_get_code":{"code_sha256":"d1badab353798361"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f4a8968b88a150d1","mcp_get_code":{"code_sha256":"f4a8968b88a150d1"}},{"arxiv_id":"2402.16041","paper":"/paper/detecting-machine-generated-texts-by-multi","title":"Detecting Machine-Generated Texts by Multi-Population Aware Optimization for Maximum Mean Discrepancy","date":"2024-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZSHsh98/MMD-MP","path":"MMD_calculate.py","file_url":"https://github.com/ZSHsh98/MMD-MP/blob/HEAD/MMD_calculate.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":"ab7fc708c9f89c7b","mcp_get_code":{"code_sha256":"ab7fc708c9f89c7b"}},{"arxiv_id":"2311.00423","paper":"/paper/llmrec-large-language-models-with-graph","title":"LLMRec: Large Language Models with Graph Augmentation for Recommendation","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuds/llmrec","path":"MMSSL/MMD.py","file_url":"https://github.com/hkuds/llmrec/blob/HEAD/MMSSL/MMD.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a88637e01d318677","mcp_get_code":{"code_sha256":"a88637e01d318677"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f4a8968b88a150d1","mcp_get_code":{"code_sha256":"f4a8968b88a150d1"}},{"arxiv_id":"2207.01784","paper":"/paper/a-unified-meta-learning-framework-for-dynamic","title":"A Unified Meta-Learning Framework for Dynamic Transfer Learning","date":"2022-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jwu4sml/l2e","path":"models/L2E.py","file_url":"https://github.com/jwu4sml/l2e/blob/HEAD/models/L2E.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f4a8968b88a150d1","mcp_get_code":{"code_sha256":"f4a8968b88a150d1"}},{"arxiv_id":"2201.01003","paper":"/paper/aligning-domain-specific-distribution-and","title":"Aligning Domain-specific Distribution and Classifier for Cross-domain Classification from Multiple Sources","date":"2022-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"easezyc/deep-transfer-learning","path":"MUDA/MFSAN/MFSAN_2src/mmd.py","file_url":"https://github.com/easezyc/deep-transfer-learning/blob/HEAD/MUDA/MFSAN/MFSAN_2src/mmd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f4a8968b88a150d1","mcp_get_code":{"code_sha256":"f4a8968b88a150d1"}},{"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":"491617531d40f138","mcp_get_code":{"code_sha256":"491617531d40f138"}},{"arxiv_id":"Gao_AsyFOD_An_Asymmetric_Adaptation_Paradigm_for_Few-Shot_Domain_Adaptive_Object_CVPR_2023_paper","paper":null,"title":"arXiv:Gao_AsyFOD_An_Asymmetric_Adaptation_Paradigm_for_Few-Shot_Domain_Adaptive_Object_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hlings/AsyFOD","path":"utils/loss.py","file_url":"https://github.com/Hlings/AsyFOD/blob/HEAD/utils/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a3dcb04aebf5ce8f","mcp_get_code":{"code_sha256":"a3dcb04aebf5ce8f"}}]}