{"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/rbf","entry":"rbf","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":19,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":14,"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":17,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":12,"n_places":21,"n_places_pointer_only":10,"n_places_pointer_only_link_open":2,"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":1,"ran_violates":1,"ran_draft_wrong":5,"ran_fixture":0,"ran":9,"unverified":1},"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":"2602.01774","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01774","title":"Cost-Aware Bayesian Optimization for Interactive Devices","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"aalto-ui/CABOP","path":"utils/utils.py","file_url":"https://github.com/aalto-ui/CABOP/blob/HEAD/utils/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"47bec335c5a25043","code_sha256_prefix":"47bec335c5a25043","mcp_get_code":{"code_sha256":"47bec335c5a25043"}},{"arxiv_id":"2412.01108","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-representation-learning-for","title":"Multi-Scale Representation Learning for Protein Fitness Prediction","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepgraphlearning/s3f","path":"s3f/gvp.py","file_url":"https://github.com/deepgraphlearning/s3f/blob/HEAD/s3f/gvp.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":"8e7a01ca88c9959f","code_sha256_prefix":"8e7a01ca88c9959f","mcp_get_code":{"code_sha256":"8e7a01ca88c9959f"}},{"arxiv_id":"2412.00789","arxiv_id_is_arxiv":true,"paper":"/paper/a-cognac-shot-to-forget-bad-memories","title":"A Cognac Shot To Forget Bad Memories: Corrective Unlearning for Graph Neural Networks","date":"2024-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"varshitakolipaka/corrective-unlearning-for-gnns","path":"trainers/gnndelete.py","file_url":"https://github.com/varshitakolipaka/corrective-unlearning-for-gnns/blob/HEAD/trainers/gnndelete.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, varshitakolipaka/corrective-unlearning-for-gnns when it was checked","code_sha256":"48b102488b75c27f","code_sha256_prefix":"48b102488b75c27f","mcp_get_code":{"code_sha256":"48b102488b75c27f"}},{"arxiv_id":"2406.09135","arxiv_id_is_arxiv":true,"paper":"/paper/adarevd-adaptive-patch-exiting-reversible-1","title":"AdaRevD: Adaptive Patch Exiting Reversible Decoder Pushes the Limit of Image Deblurring","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"INVOKERer/AdaRevD","path":"CKA-Centered-Kernel-Alignment/CKA.py","file_url":"https://github.com/INVOKERer/AdaRevD/blob/HEAD/CKA-Centered-Kernel-Alignment/CKA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, INVOKERer/AdaRevD when it was checked","code_sha256":"0f137cab706f1953","code_sha256_prefix":"0f137cab706f1953","mcp_get_code":{"code_sha256":"0f137cab706f1953"}},{"arxiv_id":"2404.16277","arxiv_id_is_arxiv":true,"paper":"/paper/causally-inspired-regularization-enables","title":"Causally Inspired Regularization Enables Domain General Representations","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olawalesalaudeen/tcri","path":"DomainBed/domainbed/algorithms.py","file_url":"https://github.com/olawalesalaudeen/tcri/blob/HEAD/DomainBed/domainbed/algorithms.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":"a261e2e4b3f16df9","code_sha256_prefix":"a261e2e4b3f16df9","mcp_get_code":{"code_sha256":"a261e2e4b3f16df9"}},{"arxiv_id":"2404.07448","arxiv_id_is_arxiv":true,"paper":"/paper/transferable-and-principled-efficiency-for","title":"Transferable and Principled Efficiency for Open-Vocabulary Segmentation","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Xujxyang/OpenTrans","path":"CKA.py","file_url":"https://github.com/Xujxyang/OpenTrans/blob/HEAD/CKA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Xujxyang/OpenTrans when it was checked","code_sha256":"0f137cab706f1953","code_sha256_prefix":"0f137cab706f1953","mcp_get_code":{"code_sha256":"0f137cab706f1953"}},{"arxiv_id":"2401.05224","arxiv_id_is_arxiv":true,"paper":"/paper/do-vision-and-language-encoders-represent-the","title":"Do Vision and Language Encoders Represent the World Similarly?","date":"2024-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mayug/0-shot-llm-vision","path":"src/utils.py","file_url":"https://github.com/mayug/0-shot-llm-vision/blob/HEAD/src/utils.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, mayug/0-shot-llm-vision when it was checked","code_sha256":"2f7bc86a29367d01","code_sha256_prefix":"2f7bc86a29367d01","mcp_get_code":{"code_sha256":"2f7bc86a29367d01"}},{"arxiv_id":"2312.04064","arxiv_id_is_arxiv":true,"paper":"/paper/discobax-discovery-of-optimal-intervention","title":"DiscoBAX: Discovery of Optimal Intervention Sets in Genomic Experiment Design","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amehrjou/discobax","path":"discobax/models/toy_experiment_models.py","file_url":"https://github.com/amehrjou/discobax/blob/HEAD/discobax/models/toy_experiment_models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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, amehrjou/discobax, is not in the permissive set Syntology serves inline","code_sha256":"5104a259cad33b36","code_sha256_prefix":"5104a259cad33b36","mcp_get_code":{"code_sha256":"5104a259cad33b36"}},{"arxiv_id":"2310.11439","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-deep-neural-networks-through-1","title":"From Alexnet to Transformers: Measuring the Non-linearity of Deep Neural Networks with Affine Optimal Transport","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qbouniot/affscoredeep","path":"src/cka_core.py","file_url":"https://github.com/qbouniot/affscoredeep/blob/HEAD/src/cka_core.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, qbouniot/affscoredeep when it was checked","code_sha256":"28ef916522aabd6e","code_sha256_prefix":"28ef916522aabd6e","mcp_get_code":{"code_sha256":"28ef916522aabd6e"}},{"arxiv_id":"2306.00183","arxiv_id_is_arxiv":true,"paper":"/paper/diffused-redundancy-in-pre-trained","title":"Diffused Redundancy in Pre-trained Representations","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nvedant07/STIR","path":"stir/CKA_pytorch.py","file_url":"https://github.com/nvedant07/STIR/blob/HEAD/stir/CKA_pytorch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"603a14d591c9dfb5","code_sha256_prefix":"603a14d591c9dfb5","mcp_get_code":{"code_sha256":"603a14d591c9dfb5"}},{"arxiv_id":"2110.14805","arxiv_id_is_arxiv":true,"paper":"/paper/intermediate-layers-matter-in-momentum","title":"Intermediate Layers Matter in Momentum Contrastive Self Supervised Learning","date":"2021-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aakashrkaku/intermdiate_layer_matter_ssl","path":"breast_cancer_histopathology/CKA.py","file_url":"https://github.com/aakashrkaku/intermdiate_layer_matter_ssl/blob/HEAD/breast_cancer_histopathology/CKA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aakashrkaku/intermdiate_layer_matter_ssl when it was checked","code_sha256":"0f137cab706f1953","code_sha256_prefix":"0f137cab706f1953","mcp_get_code":{"code_sha256":"0f137cab706f1953"}},{"arxiv_id":"2109.05578","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-pca-with-the-nystrom-method","title":"Kernel PCA with the Nyström method","date":"2021-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fredhallgren/nystrompca","path":"nystrompca/base/kernel.py","file_url":"https://github.com/fredhallgren/nystrompca/blob/HEAD/nystrompca/base/kernel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1911cbb73a880f2","code_sha256_prefix":"a1911cbb73a880f2","mcp_get_code":{"code_sha256":"a1911cbb73a880f2"}},{"arxiv_id":"2107.12248","arxiv_id_is_arxiv":true,"paper":"/paper/are-bayesian-neural-networks-intrinsically","title":"Are Bayesian neural networks intrinsically good at out-of-distribution detection?","date":"2021-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrhenning/uncertainty_based_ood","path":"nngp/standard_kernels.py","file_url":"https://github.com/chrhenning/uncertainty_based_ood/blob/HEAD/nngp/standard_kernels.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61768d8e87c1b06d","code_sha256_prefix":"61768d8e87c1b06d","mcp_get_code":{"code_sha256":"61768d8e87c1b06d"}},{"arxiv_id":"2106.12506","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-with-mirrored-stein-operators","title":"Sampling with Mirrored Stein Operators","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"louissharrock/constrained-coin-sampling","path":"coin-msvgd/constrained/sampling/svmd.py","file_url":"https://github.com/louissharrock/constrained-coin-sampling/blob/HEAD/coin-msvgd/constrained/sampling/svmd.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":"2b49f1da52e4d5d7","code_sha256_prefix":"2b49f1da52e4d5d7","mcp_get_code":{"code_sha256":"2b49f1da52e4d5d7"}},{"arxiv_id":"2105.05757","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-similarity-of-representations","title":"Exploring the Similarity of Representations in Model-Agnostic Meta-Learning","date":"2021-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ThomasGoerttler/similarity-analysis-of-maml","path":"cka.py","file_url":"https://github.com/ThomasGoerttler/similarity-analysis-of-maml/blob/HEAD/cka.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 aakashrkaku/intermdiate_layer_matter_ssl, and GitHub detected no licence in that repository when it was checked","code_sha256":"0f137cab706f1953","code_sha256_prefix":"0f137cab706f1953","mcp_get_code":{"code_sha256":"0f137cab706f1953"}},{"arxiv_id":"2103.13841","arxiv_id_is_arxiv":true,"paper":"/paper/universal-representation-learning-from","title":"Universal Representation Learning from Multiple Domains for Few-shot Classification","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/CoPA","path":"models/pa.py","file_url":"https://github.com/tmlr-group/CoPA/blob/HEAD/models/pa.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":"ad1380889172ec1f","code_sha256_prefix":"ad1380889172ec1f","mcp_get_code":{"code_sha256":"ad1380889172ec1f"}},{"arxiv_id":"2103.13841","arxiv_id_is_arxiv":true,"paper":"/paper/universal-representation-learning-from","title":"Universal Representation Learning from Multiple Domains for Few-shot Classification","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/mokd","path":"models/cka.py","file_url":"https://github.com/tmlr-group/mokd/blob/HEAD/models/cka.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":"1dddaffd3ae4142f","code_sha256_prefix":"1dddaffd3ae4142f","mcp_get_code":{"code_sha256":"1dddaffd3ae4142f"}},{"arxiv_id":"2103.13841","arxiv_id_is_arxiv":true,"paper":"/paper/universal-representation-learning-from","title":"Universal Representation Learning from Multiple Domains for Few-shot Classification","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/mokd","path":"models/hsic_estimation.py","file_url":"https://github.com/tmlr-group/mokd/blob/HEAD/models/hsic_estimation.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":"29877c45faa57d6f","code_sha256_prefix":"29877c45faa57d6f","mcp_get_code":{"code_sha256":"29877c45faa57d6f"}},{"arxiv_id":"2006.10503","arxiv_id_is_arxiv":true,"paper":"/paper/se-3-transformers-3d-roto-translation","title":"SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networks","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosettacommons/rosettafold","path":"network/Attention_module_w_str.py","file_url":"https://github.com/rosettacommons/rosettafold/blob/HEAD/network/Attention_module_w_str.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":"7db5bc710b7682dc","code_sha256_prefix":"7db5bc710b7682dc","mcp_get_code":{"code_sha256":"7db5bc710b7682dc"}},{"arxiv_id":"2002.05616","arxiv_id_is_arxiv":true,"paper":"/paper/cutting-out-the-middle-man-training-and","title":"Learning the Stein Discrepancy for Training and Evaluating Energy-Based Models without Sampling","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wgrathwohl/LSD","path":"lsd_ica.py","file_url":"https://github.com/wgrathwohl/LSD/blob/HEAD/lsd_ica.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, wgrathwohl/LSD when it was checked","code_sha256":"78edf125fd3fb59d","code_sha256_prefix":"78edf125fd3fb59d","mcp_get_code":{"code_sha256":"78edf125fd3fb59d"}},{"arxiv_id":"1905.00414","arxiv_id_is_arxiv":true,"paper":"/paper/similarity-of-neural-network-representations","title":"Similarity of Neural Network Representations Revisited","date":"2019-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yl2488/CKA-Centered-Kernel-Alignment","path":"CKA.py","file_url":"https://github.com/yl2488/CKA-Centered-Kernel-Alignment/blob/HEAD/CKA.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","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 aakashrkaku/intermdiate_layer_matter_ssl, and GitHub detected no licence in that repository when it was checked","code_sha256":"0f137cab706f1953","code_sha256_prefix":"0f137cab706f1953","mcp_get_code":{"code_sha256":"0f137cab706f1953"}}],"record_sha256":"91d4236c04fb0334446ba6dc1ddde89418c395ba06ba1f81dc3e206e4e488256","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}