{"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/kernel-2","entry":"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":16,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":0,"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":16,"n_samples_ran":10,"n_samples_constructed":8,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":5,"n_places":16,"n_places_pointer_only":7,"n_places_pointer_only_link_open":0,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":9,"unverified":6},"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":"2606.18993","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-18993","title":"Sequential Kernel-based Conditional Independence Testing via Adaptive Betting","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"he-zh/SKCI","path":"trainer/trainer.py","file_url":"https://github.com/he-zh/SKCI/blob/HEAD/trainer/trainer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, he-zh/SKCI when it was checked","code_sha256":"49b08ce34c57a4ab","code_sha256_prefix":"49b08ce34c57a4ab","mcp_get_code":{"code_sha256":"49b08ce34c57a4ab"}},{"arxiv_id":"2605.05996","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05996","title":"Gaussian Mixture Models in Hilbert Spaces via Kernel Methods","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"dani2442/rkhs-mixture-models","path":"src/mixture.py","file_url":"https://github.com/dani2442/rkhs-mixture-models/blob/HEAD/src/mixture.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dani2442/rkhs-mixture-models when it was checked","code_sha256":"25021d6a244ee6f8","code_sha256_prefix":"25021d6a244ee6f8","mcp_get_code":{"code_sha256":"25021d6a244ee6f8"}},{"arxiv_id":"2502.03686","arxiv_id_is_arxiv":true,"paper":"/paper/variational-control-for-guidance-in-diffusion","title":"Variational Control for Guidance in Diffusion Models","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czi-ai/oc-guidance","path":"algos/ndtm.py","file_url":"https://github.com/czi-ai/oc-guidance/blob/HEAD/algos/ndtm.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":"c2af90d254ccfd46","code_sha256_prefix":"c2af90d254ccfd46","mcp_get_code":{"code_sha256":"c2af90d254ccfd46"}},{"arxiv_id":"2410.23595","arxiv_id_is_arxiv":true,"paper":"/paper/disentangling-interpretable-factors-with","title":"Disentangling Interpretable Factors with Supervised Independent Subspace Principal Component Analysis","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiayuSuPKU/sispca","path":"sispca/model.py","file_url":"https://github.com/JiayuSuPKU/sispca/blob/HEAD/sispca/model.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":"0f609a43f773f0b5","code_sha256_prefix":"0f609a43f773f0b5","mcp_get_code":{"code_sha256":"0f609a43f773f0b5"}},{"arxiv_id":"2407.08751","arxiv_id_is_arxiv":true,"paper":"/paper/latent-diffusion-for-neural-spiking-data","title":"Latent Diffusion for Neural Spiking Data","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mackelab/LDNS","path":"ldns/networks/blocks.py","file_url":"https://github.com/mackelab/LDNS/blob/HEAD/ldns/networks/blocks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"637ce76ea996d0da","code_sha256_prefix":"637ce76ea996d0da","mcp_get_code":{"code_sha256":"637ce76ea996d0da"}},{"arxiv_id":"2402.08530","arxiv_id_is_arxiv":true,"paper":"/paper/a-distributional-analogue-to-the-successor","title":"A Distributional Analogue to the Successor Representation","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jessefarebro/distributional-sr","path":"dsm/kernels.py","file_url":"https://github.com/jessefarebro/distributional-sr/blob/HEAD/dsm/kernels.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":"b8f8e64c881235c8","code_sha256_prefix":"b8f8e64c881235c8","mcp_get_code":{"code_sha256":"b8f8e64c881235c8"}},{"arxiv_id":"2401.07711","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-nonparametric-tensor-decomposition","title":"Efficient Nonparametric Tensor Decomposition for Binary and Count Data","date":"2024-01-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taozerui/gptd","path":"src/model/solve_gptf_pg.py","file_url":"https://github.com/taozerui/gptd/blob/HEAD/src/model/solve_gptf_pg.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, taozerui/gptd when it was checked","code_sha256":"6d5be2faa4f8b3cd","code_sha256_prefix":"6d5be2faa4f8b3cd","mcp_get_code":{"code_sha256":"6d5be2faa4f8b3cd"}},{"arxiv_id":"2312.00752","arxiv_id_is_arxiv":true,"paper":"/paper/mamba-linear-time-sequence-modeling-with","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lab-emi/cleanumamba","path":"src/network/S4/MambaS4.py","file_url":"https://github.com/lab-emi/cleanumamba/blob/HEAD/src/network/S4/MambaS4.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lab-emi/cleanumamba when it was checked","code_sha256":"6e0d3f18a6d838b9","code_sha256_prefix":"6e0d3f18a6d838b9","mcp_get_code":{"code_sha256":"6e0d3f18a6d838b9"}},{"arxiv_id":"2306.01589","arxiv_id_is_arxiv":true,"paper":"/paper/transfer-learning-for-atomistic-simulations","title":"Transfer learning for atomistic simulations using GNNs and kernel mean embeddings","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isakfalk/atomistic_transfer_mekrr","path":"ocpmodels/transfer_learning/models/distribution_regression.py","file_url":"https://github.com/isakfalk/atomistic_transfer_mekrr/blob/HEAD/ocpmodels/transfer_learning/models/distribution_regression.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":"3344cafe530a018d","code_sha256_prefix":"3344cafe530a018d","mcp_get_code":{"code_sha256":"3344cafe530a018d"}},{"arxiv_id":"2302.10160","arxiv_id_is_arxiv":true,"paper":"/paper/pseudo-labeling-for-kernel-ridge-regression","title":"Pseudo-Labeling for Kernel Ridge Regression under Covariate Shift","date":"2023-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kw2934/krr","path":"KRR.py","file_url":"https://github.com/kw2934/krr/blob/HEAD/KRR.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":"5dcf3d92a5bddd5b","code_sha256_prefix":"5dcf3d92a5bddd5b","mcp_get_code":{"code_sha256":"5dcf3d92a5bddd5b"}},{"arxiv_id":"2210.17323","arxiv_id_is_arxiv":true,"paper":"/paper/gptq-accurate-post-training-quantization-for","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vectorch-ai/scalellm","path":"src/kernels/quantization/marlin/generate_instantiations.py","file_url":"https://github.com/vectorch-ai/scalellm/blob/HEAD/src/kernels/quantization/marlin/generate_instantiations.py","status":"unverified","verification_level":0,"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":"2e160e59dad498ff","code_sha256_prefix":"2e160e59dad498ff","mcp_get_code":{"code_sha256":"2e160e59dad498ff"}},{"arxiv_id":"2210.13014","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-knowledge-distillation-topology","title":"Geometric Knowledge Distillation: Topology Compression for Graph Neural Networks","date":"2022-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chr26195/gkd","path":"kernels.py","file_url":"https://github.com/chr26195/gkd/blob/HEAD/kernels.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, chr26195/gkd when it was checked","code_sha256":"2c61d3e4a79a64b1","code_sha256_prefix":"2c61d3e4a79a64b1","mcp_get_code":{"code_sha256":"2c61d3e4a79a64b1"}},{"arxiv_id":"2207.09944","arxiv_id_is_arxiv":true,"paper":"/paper/probable-domain-generalization-via-quantile","title":"Probable Domain Generalization via Quantile Risk Minimization","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cianeastwood/qrm","path":"DomainBed/domainbed/algorithms.py","file_url":"https://github.com/cianeastwood/qrm/blob/HEAD/DomainBed/domainbed/algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cianeastwood/qrm when it was checked","code_sha256":"fc08ccc9405219ec","code_sha256_prefix":"fc08ccc9405219ec","mcp_get_code":{"code_sha256":"fc08ccc9405219ec"}},{"arxiv_id":"2111.00396","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-modeling-long-sequences-with-1","title":"Efficiently Modeling Long Sequences with Structured State Spaces","date":"2021-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"state-spaces/s4","path":"models/s4/s4.py","file_url":"https://github.com/state-spaces/s4/blob/HEAD/models/s4/s4.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":"855fe49867900076","code_sha256_prefix":"855fe49867900076","mcp_get_code":{"code_sha256":"855fe49867900076"}},{"arxiv_id":"2109.09991","arxiv_id_is_arxiv":true,"paper":"/paper/learning-kernel-smoothed-machine-translation","title":"Learning Kernel-Smoothed Machine Translation with Retrieved Examples","date":"2021-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangqn/KSTER","path":"joeynmt/combiners.py","file_url":"https://github.com/jiangqn/KSTER/blob/HEAD/joeynmt/combiners.py","status":"unverified","verification_level":0,"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":"85f94e4c607f3908","code_sha256_prefix":"85f94e4c607f3908","mcp_get_code":{"code_sha256":"85f94e4c607f3908"}},{"arxiv_id":"1909.08540","arxiv_id_is_arxiv":true,"paper":"/paper/no-regret-learning-in-unknown-games-with","title":"No-Regret Learning in Unknown Games with Correlated Payoffs","date":"2019-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sessap/noregretgames","path":"Repeated_MatrixGames/Repeated_matrix_games.py","file_url":"https://github.com/sessap/noregretgames/blob/HEAD/Repeated_MatrixGames/Repeated_matrix_games.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sessap/noregretgames when it was checked","code_sha256":"51929d8acbc3c9cf","code_sha256_prefix":"51929d8acbc3c9cf","mcp_get_code":{"code_sha256":"51929d8acbc3c9cf"}}],"record_sha256":"70ca21e55bbfdef84b32e4f83f90b2726911d70e67ed50d000bebdad3c3e1a53","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}