{"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/hsic-2","entry":"hsic","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":5,"n_papers_ran":1,"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":5,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":4},"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.02392","paper":"/paper/arxiv-2510-02392","title":"KnowledgeSmith: Uncovering Knowledge Updating in LLMs with Model Editing and Unlearning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"AIFrontierLab/KnowledgeSmith","path":"evaluation/similarity.py","file_url":"https://github.com/AIFrontierLab/KnowledgeSmith/blob/HEAD/evaluation/similarity.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9e9060c4dea3d192","mcp_get_code":{"code_sha256":"9e9060c4dea3d192"}},{"arxiv_id":"2203.01110","paper":"/paper/the-optimal-noise-in-noise-contrastive","title":"The Optimal Noise in Noise-Contrastive Learning Is Not What You Think","date":"2022-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"l-omar-chehab/nce-noise-var","path":"archive/loss.py","file_url":"https://github.com/l-omar-chehab/nce-noise-var/blob/HEAD/archive/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3de39a8e2a49e338","mcp_get_code":{"code_sha256":"3de39a8e2a49e338"}},{"arxiv_id":"2112.15265","paper":"/paper/entropy-regularized-optimal-transport-1","title":"Entropy Regularized Optimal Transport Independence Criterion","date":"2021-12-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"langliu95/etic-experiments","path":"ind_tests.py","file_url":"https://github.com/langliu95/etic-experiments/blob/HEAD/ind_tests.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"aa621441cd404633","mcp_get_code":{"code_sha256":"aa621441cd404633"}},{"arxiv_id":"1910.12252","paper":"/paper/kernel-stein-tests-for-multiple-model","title":"Kernel Stein Tests for Multiple Model Comparison","date":"2019-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jenninglim/multiscale-features","path":"mskernel/hsic.py","file_url":"https://github.com/jenninglim/multiscale-features/blob/HEAD/mskernel/hsic.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a901cbc0db6e924f","mcp_get_code":{"code_sha256":"a901cbc0db6e924f"}},{"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":"fa8a5e8c525f588e","mcp_get_code":{"code_sha256":"fa8a5e8c525f588e"}}]}