{"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-kl","entry":"compute_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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":9,"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":14,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":14,"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":2,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":7,"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":"2506.11902","arxiv_id_is_arxiv":true,"paper":"/paper/treerl-llm-reinforcement-learning-with-on","title":"TreeRL: LLM Reinforcement Learning with On-Policy Tree Search","date":"2025-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/TreeRL","path":"openrlhf/models/utils.py","file_url":"https://github.com/THUDM/TreeRL/blob/HEAD/openrlhf/models/utils.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":"c62b030ba99acc0b","code_sha256_prefix":"c62b030ba99acc0b","mcp_get_code":{"code_sha256":"c62b030ba99acc0b"}},{"arxiv_id":"2504.10637","arxiv_id_is_arxiv":true,"paper":"/paper/better-estimation-of-the-kl-divergence","title":"Better Estimation of the KL Divergence Between Language Models","date":"2025-04-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rycolab/kl-rb","path":"trl/trainer/utils.py","file_url":"https://github.com/rycolab/kl-rb/blob/HEAD/trl/trainer/utils.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, rycolab/kl-rb when it was checked","code_sha256":"fd37f7ac629f7673","code_sha256_prefix":"fd37f7ac629f7673","mcp_get_code":{"code_sha256":"fd37f7ac629f7673"}},{"arxiv_id":"2407.01920","arxiv_id_is_arxiv":true,"paper":"/paper/to-forget-or-not-towards-practical-knowledge","title":"To Forget or Not? Towards Practical Knowledge Unlearning for Large Language Models","date":"2024-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/knowundo","path":"llm_unlearn/methods/ascent_plus_KLdivergence.py","file_url":"https://github.com/zjunlp/knowundo/blob/HEAD/llm_unlearn/methods/ascent_plus_KLdivergence.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":"798c7fa0566c9a0c","code_sha256_prefix":"798c7fa0566c9a0c","mcp_get_code":{"code_sha256":"798c7fa0566c9a0c"}},{"arxiv_id":"2403.03536","arxiv_id_is_arxiv":true,"paper":"/paper/towards-efficient-and-effective-unlearning-of","title":"Towards Efficient and Effective Unlearning of Large Language Models for Recommendation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justarter/e2urec","path":"utils.py","file_url":"https://github.com/justarter/e2urec/blob/HEAD/utils.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, justarter/e2urec when it was checked","code_sha256":"d2fb3510d2e40cc0","code_sha256_prefix":"d2fb3510d2e40cc0","mcp_get_code":{"code_sha256":"d2fb3510d2e40cc0"}},{"arxiv_id":"2402.15159","arxiv_id_is_arxiv":true,"paper":"/paper/machine-unlearning-of-pre-trained-large","title":"Machine Unlearning of Pre-trained Large Language Models","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaojin17/unlearning_llm","path":"llm_unlearn/methods/ascent_plus_KLdivergence.py","file_url":"https://github.com/yaojin17/unlearning_llm/blob/HEAD/llm_unlearn/methods/ascent_plus_KLdivergence.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":"62345832792f7ce7","code_sha256_prefix":"62345832792f7ce7","mcp_get_code":{"code_sha256":"62345832792f7ce7"}},{"arxiv_id":"2302.06223","arxiv_id_is_arxiv":true,"paper":"/paper/variational-mixture-of-hypergenerators-for","title":"Variational Mixture of HyperGenerators for Learning Distributions Over Functions","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bkoyuncu/vamoh","path":"imagegym/loss.py","file_url":"https://github.com/bkoyuncu/vamoh/blob/HEAD/imagegym/loss.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":"2c38f2c51417d9d8","code_sha256_prefix":"2c38f2c51417d9d8","mcp_get_code":{"code_sha256":"2c38f2c51417d9d8"}},{"arxiv_id":"2206.03230","arxiv_id_is_arxiv":true,"paper":"/paper/shedding-a-pac-bayesian-light-on-adaptive","title":"Shedding a PAC-Bayesian Light on Adaptive Sliced-Wasserstein Distances","date":"2022-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rubenohana/pac-bayesian_sliced-wasserstein","path":"swd_pac.py","file_url":"https://github.com/rubenohana/pac-bayesian_sliced-wasserstein/blob/HEAD/swd_pac.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, rubenohana/pac-bayesian_sliced-wasserstein when it was checked","code_sha256":"20d5a94a79d4fc36","code_sha256_prefix":"20d5a94a79d4fc36","mcp_get_code":{"code_sha256":"20d5a94a79d4fc36"}},{"arxiv_id":"2205.03665","arxiv_id_is_arxiv":true,"paper":"/paper/variational-sparse-coding-with-learned","title":"Variational Sparse Coding with Learned Thresholding","date":"2022-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kfallah/variational-sparse-coding","path":"model/reparameterization.py","file_url":"https://github.com/kfallah/variational-sparse-coding/blob/HEAD/model/reparameterization.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, kfallah/variational-sparse-coding when it was checked","code_sha256":"592a9f533df33a85","code_sha256_prefix":"592a9f533df33a85","mcp_get_code":{"code_sha256":"592a9f533df33a85"}},{"arxiv_id":"2201.10787","arxiv_id_is_arxiv":true,"paper":"/paper/variational-model-inversion-attacks-1","title":"Variational Model Inversion Attacks","date":"2022-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangkua1/vmi","path":"evaluate_samples.py","file_url":"https://github.com/wangkua1/vmi/blob/HEAD/evaluate_samples.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, wangkua1/vmi when it was checked","code_sha256":"5cc15dbbae703454","code_sha256_prefix":"5cc15dbbae703454","mcp_get_code":{"code_sha256":"5cc15dbbae703454"}},{"arxiv_id":"2106.12570","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multimodal-vaes-through-mutual","title":"Learning Multimodal VAEs through Mutual Supervision","date":"2021-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thwjoy/meme","path":"models/meme.py","file_url":"https://github.com/thwjoy/meme/blob/HEAD/models/meme.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, thwjoy/meme when it was checked","code_sha256":"fb151278cbed3095","code_sha256_prefix":"fb151278cbed3095","mcp_get_code":{"code_sha256":"fb151278cbed3095"}},{"arxiv_id":"2105.08756","arxiv_id_is_arxiv":true,"paper":"/paper/pathdreamer-a-world-model-for-indoor","title":"Pathdreamer: A World Model for Indoor Navigation","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/pathdreamer","path":"models/point_cloud_models.py","file_url":"https://github.com/google-research/pathdreamer/blob/HEAD/models/point_cloud_models.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":"5b5f0fe56d18c7b3","code_sha256_prefix":"5b5f0fe56d18c7b3","mcp_get_code":{"code_sha256":"5b5f0fe56d18c7b3"}},{"arxiv_id":"1802.05365","arxiv_id_is_arxiv":true,"paper":"/paper/deep-contextualized-word-representations","title":"Deep contextualized word representations","date":"2018-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"griff4692/LMC","path":"modules/lmc/lmc_model.py","file_url":"https://github.com/griff4692/LMC/blob/HEAD/modules/lmc/lmc_model.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, griff4692/LMC when it was checked","code_sha256":"e6951eb47d3fce83","code_sha256_prefix":"e6951eb47d3fce83","mcp_get_code":{"code_sha256":"e6951eb47d3fce83"}},{"arxiv_id":"1703.00848","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-image-to-image-translation","title":"Unsupervised Image-to-Image Translation Networks","date":"2017-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eriklindernoren/PyTorch-GAN","path":"implementations/unit/unit.py","file_url":"https://github.com/eriklindernoren/PyTorch-GAN/blob/HEAD/implementations/unit/unit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbbe1581861ec1fd","code_sha256_prefix":"bbbe1581861ec1fd","mcp_get_code":{"code_sha256":"bbbe1581861ec1fd"}},{"arxiv_id":"Gao_AsyFOD_An_Asymmetric_Adaptation_Paradigm_for_Few-Shot_Domain_Adaptive_Object_CVPR_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Gao_AsyFOD_An_Asymmetric_Adaptation_Paradigm_for_Few-Shot_Domain_Adaptive_Object_CVPR_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hlings/AsyFOD","path":"utils/loss.py","file_url":"https://github.com/Hlings/AsyFOD/blob/HEAD/utils/loss.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":"754b89ce11613e10","code_sha256_prefix":"754b89ce11613e10","mcp_get_code":{"code_sha256":"754b89ce11613e10"}}],"record_sha256":"daf3fa631d749b8ac6c6b7d2e4810cf18fcd44ec19776f555519dde4aa946e91","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}