{"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/compute-kernel","entry":"compute_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":13,"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":12,"n_samples_ran":5,"n_samples_fingerprinted":4,"n_places":13,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":1,"unverified":7},"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":"2506.01153","paper":null,"title":"arXiv:2506.01153","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"ddrous/warp","path":"models.py","file_url":"https://github.com/ddrous/warp/blob/HEAD/models.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":"212f5bc81f3be31d","mcp_get_code":{"code_sha256":"212f5bc81f3be31d"}},{"arxiv_id":"2501.11673","paper":"/paper/randomized-kaczmarz-methods-with-beyond","title":"Randomized Kaczmarz Methods with Beyond-Krylov Convergence","date":"2025-01-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edwinyang7/kaczmarz-plusplus","path":"psd_flops.py","file_url":"https://github.com/edwinyang7/kaczmarz-plusplus/blob/HEAD/psd_flops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"057f4371ccbf5847","mcp_get_code":{"code_sha256":"057f4371ccbf5847"}},{"arxiv_id":"2311.05420","paper":"/paper/counterfactually-fair-representation","title":"Counterfactually Fair Representation","date":"2023-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osu-srml/cf_representation_learning","path":"CVAE/utils.py","file_url":"https://github.com/osu-srml/cf_representation_learning/blob/HEAD/CVAE/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e0a46babceb34647","mcp_get_code":{"code_sha256":"e0a46babceb34647"}},{"arxiv_id":"2210.03164","paper":"/paper/infoot-information-maximizing-optimal","title":"InfoOT: Information Maximizing Optimal Transport","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chingyaoc/infoot","path":"infoot.py","file_url":"https://github.com/chingyaoc/infoot/blob/HEAD/infoot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1cc13908cb7f6294","mcp_get_code":{"code_sha256":"1cc13908cb7f6294"}},{"arxiv_id":"2112.11450","paper":"/paper/max-margin-contrastive-learning","title":"Max-Margin Contrastive Learning","date":"2021-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anshulbshah/MMCL","path":"models/losses.py","file_url":"https://github.com/anshulbshah/MMCL/blob/HEAD/models/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9498c0875cc30496","mcp_get_code":{"code_sha256":"9498c0875cc30496"}},{"arxiv_id":"2107.07502","paper":"/paper/multibench-multiscale-benchmarks-for","title":"MultiBench: Multiscale Benchmarks for Multimodal Representation Learning","date":"2021-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pliang279/factorized","path":"mfm_model.py","file_url":"https://github.com/pliang279/factorized/blob/HEAD/mfm_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0a46babceb34647","mcp_get_code":{"code_sha256":"e0a46babceb34647"}},{"arxiv_id":"2107.02784","paper":"/paper/data-driven-reduced-order-modeling-of","title":"Data-driven reduced order modeling of environmental hydrodynamics using deep autoencoders and neural ODEs","date":"2021-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erdc/pynirom","path":"pynirom/rbf/rbf.py","file_url":"https://github.com/erdc/pynirom/blob/HEAD/pynirom/rbf/rbf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7bca82596cbfac78","mcp_get_code":{"code_sha256":"7bca82596cbfac78"}},{"arxiv_id":"2103.02193","paper":"/paper/adaptive-consistency-regularization-for-semi","title":"Adaptive Consistency Regularization for Semi-Supervised Transfer Learning","date":"2021-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/Semi-Supervised-Transfer-Learning","path":"code/ssl_lib/consistency/regularizer.py","file_url":"https://github.com/SHI-Labs/Semi-Supervised-Transfer-Learning/blob/HEAD/code/ssl_lib/consistency/regularizer.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":"58296ac0e951d61d","mcp_get_code":{"code_sha256":"58296ac0e951d61d"}},{"arxiv_id":"2001.06216","paper":"/paper/graphlime-local-interpretable-model","title":"GraphLIME: Local Interpretable Model Explanations for Graph Neural Networks","date":"2020-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"riken-aip/pyHSICLasso","path":"pyHSICLasso/hsic_lasso.py","file_url":"https://github.com/riken-aip/pyHSICLasso/blob/HEAD/pyHSICLasso/hsic_lasso.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5690b8a912e41025","mcp_get_code":{"code_sha256":"5690b8a912e41025"}},{"arxiv_id":"1910.01791","paper":"/paper/conditional-out-of-sample-generation-for","title":"Conditional out-of-sample generation for unpaired data using trVAE","date":"2019-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theislab/trVAE","path":"trvae/models/_utils.py","file_url":"https://github.com/theislab/trVAE/blob/HEAD/trvae/models/_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"43974318d47ccfdb","mcp_get_code":{"code_sha256":"43974318d47ccfdb"}},{"arxiv_id":"1906.01930","paper":"/paper/approximate-inference-turns-deep-networks","title":"Approximate Inference Turns Deep Networks into Gaussian Processes","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"team-approx-bayes/dnn2gp","path":"dnn2gp/dnn2gp.py","file_url":"https://github.com/team-approx-bayes/dnn2gp/blob/HEAD/dnn2gp/dnn2gp.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e74bcb11475906d5","mcp_get_code":{"code_sha256":"e74bcb11475906d5"}},{"arxiv_id":"1904.08194","paper":"/paper/effective-estimation-of-deep-generative","title":"Effective Estimation of Deep Generative Language Models","date":"2019-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tom-pelsmaeker/deep-generative-lm","path":"util/evaluation.py","file_url":"https://github.com/tom-pelsmaeker/deep-generative-lm/blob/HEAD/util/evaluation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"94b404d392bcb7ae","mcp_get_code":{"code_sha256":"94b404d392bcb7ae"}},{"arxiv_id":"1706.02262","paper":"/paper/infovae-information-maximizing-variational","title":"InfoVAE: Information Maximizing Variational Autoencoders","date":"2017-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ema-marconato/glancenet","path":"models/infovae.py","file_url":"https://github.com/ema-marconato/glancenet/blob/HEAD/models/infovae.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"76cd8e24e234e5cb","mcp_get_code":{"code_sha256":"76cd8e24e234e5cb"}}]}