{"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/kernel-matrix","entry":"kernel_matrix","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":6,"n_papers_ran":5,"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":4,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":3,"ran":0,"unverified":2},"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":"2603.03897","paper":"/paper/arxiv-2603-03897","title":"IROSA: Interactive Robot Skill Adaptation Using Natural Language","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"DLR-RM/IROSA","path":"irosa/models/kmp.py","file_url":"https://github.com/DLR-RM/IROSA/blob/HEAD/irosa/models/kmp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a6fe74e591f37547","mcp_get_code":{"code_sha256":"a6fe74e591f37547"}},{"arxiv_id":"2306.08777","paper":"/paper/mmd-fuse-learning-and-combining-kernels-for","title":"MMD-FUSE: Learning and Combining Kernels for Two-Sample Testing Without Data Splitting","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdfuse-paper","path":"kernel.py","file_url":"https://github.com/antoninschrab/mmdfuse-paper/blob/HEAD/kernel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dbcb6b687249d1a2","mcp_get_code":{"code_sha256":"dbcb6b687249d1a2"}},{"arxiv_id":"2206.09194","paper":"/paper/efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdagg","path":"mmdagg/jax.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/jax.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c48c4eb0714eef3","mcp_get_code":{"code_sha256":"2c48c4eb0714eef3"}},{"arxiv_id":"2206.09194","paper":"/paper/efficient-aggregated-kernel-tests-using","title":"Efficient Aggregated Kernel Tests using Incomplete $U$-statistics","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdagg","path":"mmdagg/np.py","file_url":"https://github.com/antoninschrab/mmdagg/blob/HEAD/mmdagg/np.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e7beb2199214856","mcp_get_code":{"code_sha256":"4e7beb2199214856"}},{"arxiv_id":"2206.08843","paper":"/paper/automl-two-sample-test","title":"AutoML Two-Sample Test","date":"2022-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"4e7beb2199214856","mcp_get_code":{"code_sha256":"4e7beb2199214856"}},{"arxiv_id":"2110.15073","paper":"/paper/mmd-aggregated-two-sample-test","title":"MMD Aggregated Two-Sample Test","date":"2021-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdagg-paper","path":"mmdagg/jax.py","file_url":"https://github.com/antoninschrab/mmdagg-paper/blob/HEAD/mmdagg/jax.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c48c4eb0714eef3","mcp_get_code":{"code_sha256":"2c48c4eb0714eef3"}},{"arxiv_id":"2110.15073","paper":"/paper/mmd-aggregated-two-sample-test","title":"MMD Aggregated Two-Sample Test","date":"2021-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"antoninschrab/mmdagg-paper","path":"mmdagg/np.py","file_url":"https://github.com/antoninschrab/mmdagg-paper/blob/HEAD/mmdagg/np.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4e7beb2199214856","mcp_get_code":{"code_sha256":"4e7beb2199214856"}},{"arxiv_id":"1908.01580","paper":"/paper/the-hsic-bottleneck-deep-learning-without","title":"The HSIC Bottleneck: Deep Learning without Back-Propagation","date":"2019-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gusye1234/Pytorch-HSIC-bottleneck","path":"torch_hsic.py","file_url":"https://github.com/gusye1234/Pytorch-HSIC-bottleneck/blob/HEAD/torch_hsic.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4043a12aa5102af0","mcp_get_code":{"code_sha256":"4043a12aa5102af0"}},{"arxiv_id":"1908.01580","paper":"/paper/the-hsic-bottleneck-deep-learning-without","title":"The HSIC Bottleneck: Deep Learning without Back-Propagation","date":"2019-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forin-xyz/Keras-HSIC-Bottleneck","path":"hsic_bottleneck.py","file_url":"https://github.com/forin-xyz/Keras-HSIC-Bottleneck/blob/HEAD/hsic_bottleneck.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b8bd182708aa51a7","mcp_get_code":{"code_sha256":"b8bd182708aa51a7"}}]}