{"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/compute-kernel","entry":"compute_kernel","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":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":4,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":5,"n_places":13,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":3,"ran_fixture":1,"ran":6,"unverified":2},"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":"2506.01153","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ddrous/warp when it was checked","code_sha256":"212f5bc81f3be31d","code_sha256_prefix":"212f5bc81f3be31d","mcp_get_code":{"code_sha256":"212f5bc81f3be31d"}},{"arxiv_id":"2501.11673","arxiv_id_is_arxiv":true,"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":"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":"057f4371ccbf5847","code_sha256_prefix":"057f4371ccbf5847","mcp_get_code":{"code_sha256":"057f4371ccbf5847"}},{"arxiv_id":"2311.05420","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, osu-srml/cf_representation_learning when it was checked","code_sha256":"e0a46babceb34647","code_sha256_prefix":"e0a46babceb34647","mcp_get_code":{"code_sha256":"e0a46babceb34647"}},{"arxiv_id":"2210.03164","arxiv_id_is_arxiv":true,"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":"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":"1cc13908cb7f6294","code_sha256_prefix":"1cc13908cb7f6294","mcp_get_code":{"code_sha256":"1cc13908cb7f6294"}},{"arxiv_id":"2112.11450","arxiv_id_is_arxiv":true,"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":"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":"9498c0875cc30496","code_sha256_prefix":"9498c0875cc30496","mcp_get_code":{"code_sha256":"9498c0875cc30496"}},{"arxiv_id":"2107.07502","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from osu-srml/cf_representation_learning, and GitHub detected no licence in that repository when it was checked","code_sha256":"e0a46babceb34647","code_sha256_prefix":"e0a46babceb34647","mcp_get_code":{"code_sha256":"e0a46babceb34647"}},{"arxiv_id":"2107.02784","arxiv_id_is_arxiv":true,"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":"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":"7bca82596cbfac78","code_sha256_prefix":"7bca82596cbfac78","mcp_get_code":{"code_sha256":"7bca82596cbfac78"}},{"arxiv_id":"2103.02193","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"58296ac0e951d61d","code_sha256_prefix":"58296ac0e951d61d","mcp_get_code":{"code_sha256":"58296ac0e951d61d"}},{"arxiv_id":"2001.06216","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5690b8a912e41025","code_sha256_prefix":"5690b8a912e41025","mcp_get_code":{"code_sha256":"5690b8a912e41025"}},{"arxiv_id":"1910.01791","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"43974318d47ccfdb","code_sha256_prefix":"43974318d47ccfdb","mcp_get_code":{"code_sha256":"43974318d47ccfdb"}},{"arxiv_id":"1906.01930","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, team-approx-bayes/dnn2gp when it was checked","code_sha256":"e74bcb11475906d5","code_sha256_prefix":"e74bcb11475906d5","mcp_get_code":{"code_sha256":"e74bcb11475906d5"}},{"arxiv_id":"1904.08194","arxiv_id_is_arxiv":true,"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":"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":"94b404d392bcb7ae","code_sha256_prefix":"94b404d392bcb7ae","mcp_get_code":{"code_sha256":"94b404d392bcb7ae"}},{"arxiv_id":"1706.02262","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ema-marconato/glancenet, is not in the permissive set Syntology serves inline","code_sha256":"76cd8e24e234e5cb","code_sha256_prefix":"76cd8e24e234e5cb","mcp_get_code":{"code_sha256":"76cd8e24e234e5cb"}}],"record_sha256":"5dbcca581aa0f6ead9ce6bfa3ee50e369b0031059ec76d59bf12dac2251759e8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}