{"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/kl","entry":"KL","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":20,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":7,"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":19,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":9,"n_places":21,"n_places_pointer_only":13,"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":3,"ran":12,"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":"2604.20301","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-20301","title":"Properties and limitations of geometric tempering for gradient flow dynamics","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"FrancescaCrucinio/SMC-WFR","path":"Gaussian/MultivariateGaussianAlgorithms.py","file_url":"https://github.com/FrancescaCrucinio/SMC-WFR/blob/HEAD/Gaussian/MultivariateGaussianAlgorithms.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, FrancescaCrucinio/SMC-WFR when it was checked","code_sha256":"d037fcdb8a45af49","code_sha256_prefix":"d037fcdb8a45af49","mcp_get_code":{"code_sha256":"d037fcdb8a45af49"}},{"arxiv_id":"2604.20301","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-20301","title":"Properties and limitations of geometric tempering for gradient flow dynamics","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"FrancescaCrucinio/SMC-WFR","path":"GaussianODEs.py","file_url":"https://github.com/FrancescaCrucinio/SMC-WFR/blob/HEAD/GaussianODEs.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, FrancescaCrucinio/SMC-WFR when it was checked","code_sha256":"6e3c718695a113b5","code_sha256_prefix":"6e3c718695a113b5","mcp_get_code":{"code_sha256":"6e3c718695a113b5"}},{"arxiv_id":"2410.11964","arxiv_id_is_arxiv":true,"paper":"/paper/a-complete-decomposition-of-kl-error-using","title":"A Complete Decomposition of KL Error using Refined Information and Mode Interaction Selection","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EnouenJ/mode-attributing-hierarchy","path":"utils/utils.py","file_url":"https://github.com/EnouenJ/mode-attributing-hierarchy/blob/HEAD/utils/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, EnouenJ/mode-attributing-hierarchy when it was checked","code_sha256":"571d357711340c7f","code_sha256_prefix":"571d357711340c7f","mcp_get_code":{"code_sha256":"571d357711340c7f"}},{"arxiv_id":"2407.12292","arxiv_id_is_arxiv":true,"paper":"/paper/any-target-can-be-offense-adversarial-example","title":"Any Target Can be Offense: Adversarial Example Generation via Generalized Latent Infection","date":"2024-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VL-Group/GAKer","path":"utils/metrics.py","file_url":"https://github.com/VL-Group/GAKer/blob/HEAD/utils/metrics.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, VL-Group/GAKer when it was checked","code_sha256":"fb0541d3902f7b0c","code_sha256_prefix":"fb0541d3902f7b0c","mcp_get_code":{"code_sha256":"fb0541d3902f7b0c"}},{"arxiv_id":"2405.18975","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-classification-auxiliary-network","title":"Hierarchical Classification Auxiliary Network for Time Series Forecasting","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"syrgithub/hcan","path":"exp/exp_main.py","file_url":"https://github.com/syrgithub/hcan/blob/HEAD/exp/exp_main.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, syrgithub/hcan when it was checked","code_sha256":"5224f6e3732285e2","code_sha256_prefix":"5224f6e3732285e2","mcp_get_code":{"code_sha256":"5224f6e3732285e2"}},{"arxiv_id":"2403.02604","arxiv_id_is_arxiv":true,"paper":"/paper/unidoormanip-learning-universal-door","title":"UniDoorManip: Learning Universal Door Manipulation Policy Over Large-scale and Diverse Door Manipulation Environments","date":null,"month_inferred_from_arxiv_id":"2024-03","title_source":"archive","repo":"sectionZ6/UniDoorManip","path":"multimodal/models/model_actor.py","file_url":"https://github.com/sectionZ6/UniDoorManip/blob/HEAD/multimodal/models/model_actor.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, sectionZ6/UniDoorManip when it was checked","code_sha256":"d1cf64d217ebd894","code_sha256_prefix":"d1cf64d217ebd894","mcp_get_code":{"code_sha256":"d1cf64d217ebd894"}},{"arxiv_id":"2402.03664","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-solvers-for-partial-gromov","title":"Partial Gromov-Wasserstein Metric","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mint-vu/PGW_Metric","path":"lib/HK/SinkhornNP.py","file_url":"https://github.com/mint-vu/PGW_Metric/blob/HEAD/lib/HK/SinkhornNP.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, mint-vu/PGW_Metric when it was checked","code_sha256":"5f4ad09f57a60dd3","code_sha256_prefix":"5f4ad09f57a60dd3","mcp_get_code":{"code_sha256":"5f4ad09f57a60dd3"}},{"arxiv_id":"2402.03268","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-the-reasoning-ability-of","title":"Understanding Reasoning Ability of Language Models From the Perspective of Reasoning Paths Aggregation","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangxinyilinda/lm_random_walk","path":"kg_reasoning/analysis.py","file_url":"https://github.com/wangxinyilinda/lm_random_walk/blob/HEAD/kg_reasoning/analysis.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":"bd677ad1a63e9ad4","code_sha256_prefix":"bd677ad1a63e9ad4","mcp_get_code":{"code_sha256":"bd677ad1a63e9ad4"}},{"arxiv_id":"2312.02820","arxiv_id_is_arxiv":true,"paper":"/paper/clustering-pseudo-language-family-in","title":"Clustering Pseudo Language Family in Multilingual Translation Models with Fisher Information Matrix","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ecoli-hit/PseudoFamily","path":"compute_similarity.py","file_url":"https://github.com/ecoli-hit/PseudoFamily/blob/HEAD/compute_similarity.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, ecoli-hit/PseudoFamily when it was checked","code_sha256":"97a19b856eb43ec9","code_sha256_prefix":"97a19b856eb43ec9","mcp_get_code":{"code_sha256":"97a19b856eb43ec9"}},{"arxiv_id":"2308.11071","arxiv_id_is_arxiv":true,"paper":"/paper/neural-amortized-inference-for-nested-multi","title":"Neural Amortized Inference for Nested Multi-agent Reasoning","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KJha02/AmortizedNestedReasoning","path":"CARLO/accuracyViewer.py","file_url":"https://github.com/KJha02/AmortizedNestedReasoning/blob/HEAD/CARLO/accuracyViewer.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":"b7f32e53dd138e62","code_sha256_prefix":"b7f32e53dd138e62","mcp_get_code":{"code_sha256":"b7f32e53dd138e62"}},{"arxiv_id":"2308.07026","arxiv_id_is_arxiv":true,"paper":"/paper/advclip-downstream-agnostic-adversarial","title":"AdvCLIP: Downstream-agnostic Adversarial Examples in Multimodal Contrastive Learning","date":"2023-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgcl-codes/advclip","path":"utils/metrics.py","file_url":"https://github.com/cgcl-codes/advclip/blob/HEAD/utils/metrics.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 VL-Group/GAKer, and GitHub detected no licence in that repository when it was checked","code_sha256":"fb0541d3902f7b0c","code_sha256_prefix":"fb0541d3902f7b0c","mcp_get_code":{"code_sha256":"fb0541d3902f7b0c"}},{"arxiv_id":"2305.04933","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-quantification-in-machine","title":"Uncertainty Quantification in Machine Learning for Engineering Design and Health Prognostics: A Tutorial","date":"2023-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vnemani14/uq_ml_review","path":"Toy_problem/MFVI/Models_and_losses.py","file_url":"https://github.com/vnemani14/uq_ml_review/blob/HEAD/Toy_problem/MFVI/Models_and_losses.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":"1ac540103505b8bf","code_sha256_prefix":"1ac540103505b8bf","mcp_get_code":{"code_sha256":"1ac540103505b8bf"}},{"arxiv_id":"2301.12798","arxiv_id_is_arxiv":true,"paper":"/paper/trfeddis-trusted-federated-disentangling","title":"Reliable Federated Disentangling Network for Non-IID Domain Feature","date":"2023-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"looking9218/rfeddis","path":"federated/RFedDis_Domainnet.py","file_url":"https://github.com/looking9218/rfeddis/blob/HEAD/federated/RFedDis_Domainnet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, looking9218/rfeddis when it was checked","code_sha256":"705123f4a28fb226","code_sha256_prefix":"705123f4a28fb226","mcp_get_code":{"code_sha256":"705123f4a28fb226"}},{"arxiv_id":"2207.07859","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-and-its-applications-to-wifi","title":"SenseFi: A Library and Benchmark on Deep-Learning-Empowered WiFi Human Sensing","date":"2022-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xyanchen/wifi-csi-sensing-benchmark","path":"self_supervised.py","file_url":"https://github.com/xyanchen/wifi-csi-sensing-benchmark/blob/HEAD/self_supervised.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"001ba588bf8c63ea","code_sha256_prefix":"001ba588bf8c63ea","mcp_get_code":{"code_sha256":"001ba588bf8c63ea"}},{"arxiv_id":"2206.13397","arxiv_id_is_arxiv":true,"paper":"/paper/generative-modelling-with-inverse-heat","title":"Generative Modelling With Inverse Heat Dissipation","date":"2022-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aaltoml/generative-inverse-heat-dissipation","path":"model_code/utils.py","file_url":"https://github.com/aaltoml/generative-inverse-heat-dissipation/blob/HEAD/model_code/utils.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":"340b29b54fa65057","code_sha256_prefix":"340b29b54fa65057","mcp_get_code":{"code_sha256":"340b29b54fa65057"}},{"arxiv_id":"2206.00706","arxiv_id_is_arxiv":true,"paper":"/paper/split-kl-and-pac-bayes-split-kl-inequalities","title":"Split-kl and PAC-Bayes-split-kl Inequalities for Ternary Random Variables","date":"2022-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephanlorenzen/majorityvotebounds","path":"mvb/bounds/ccpbskl.py","file_url":"https://github.com/stephanlorenzen/majorityvotebounds/blob/HEAD/mvb/bounds/ccpbskl.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"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, stephanlorenzen/majorityvotebounds, is not in the permissive set Syntology serves inline","code_sha256":"54327cfb4ff09e1f","code_sha256_prefix":"54327cfb4ff09e1f","mcp_get_code":{"code_sha256":"54327cfb4ff09e1f"}},{"arxiv_id":"2202.06985","arxiv_id_is_arxiv":true,"paper":"/paper/deep-ensembles-work-but-are-they-necessary","title":"Deep Ensembles Work, But Are They Necessary?","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cellistigs/interp_ensembles","path":"scripts/plot_conditional_variance.py","file_url":"https://github.com/cellistigs/interp_ensembles/blob/HEAD/scripts/plot_conditional_variance.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, cellistigs/interp_ensembles when it was checked","code_sha256":"c8a654b055362cde","code_sha256_prefix":"c8a654b055362cde","mcp_get_code":{"code_sha256":"c8a654b055362cde"}},{"arxiv_id":"2110.07402","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-by-estimating-twin-1","title":"Self-Supervised Learning by Estimating Twin Class Distributions","date":"2021-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/TWIST","path":"objective.py","file_url":"https://github.com/bytedance/TWIST/blob/HEAD/objective.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":"a74d130de19016d6","code_sha256_prefix":"a74d130de19016d6","mcp_get_code":{"code_sha256":"a74d130de19016d6"}},{"arxiv_id":"2102.02051","arxiv_id_is_arxiv":true,"paper":"/paper/trusted-multi-view-classification-1","title":"Trusted Multi-View Classification","date":"2021-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"5224f6e3732285e2","code_sha256_prefix":"5224f6e3732285e2","mcp_get_code":{"code_sha256":"5224f6e3732285e2"}},{"arxiv_id":"2008.07772","arxiv_id_is_arxiv":true,"paper":"/paper/very-deep-transformers-for-neural-machine","title":"Very Deep Transformers for Neural Machine Translation","date":"2020-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/deepnmt","path":"deepnmt/adv_label_smoothed_cross_entropy.py","file_url":"https://github.com/microsoft/deepnmt/blob/HEAD/deepnmt/adv_label_smoothed_cross_entropy.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":"c8d783d775fd71be","code_sha256_prefix":"c8d783d775fd71be","mcp_get_code":{"code_sha256":"c8d783d775fd71be"}},{"arxiv_id":"1909.01506","arxiv_id_is_arxiv":true,"paper":"/paper/prediction-consistency-curvature","title":"Prediction, Consistency, Curvature: Representation Learning for Locally-Linear Control","date":"2019-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/PCC-pytorch","path":"losses.py","file_url":"https://github.com/VinAIResearch/PCC-pytorch/blob/HEAD/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":"c36f4ae19379afd8","code_sha256_prefix":"c36f4ae19379afd8","mcp_get_code":{"code_sha256":"c36f4ae19379afd8"}}],"record_sha256":"dce3627fb400d1f8f351aaab17034f1960f02b953d97da39938fb226799ebacf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}