{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/compute-kl-divergence","entry":"compute_kl_divergence","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":5,"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":7,"n_samples_ran":5,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":3,"unverified":2},"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":"2608.23473","paper":"/paper/arxiv-2608-23473","title":"METACASTER: Meta-Harness-Optimized Agent for End-to-End Few-Shot Learning of Lightweight Time Series Forecasters","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"D2I-Group/metacaster","path":"eval/generation_quality.py","file_url":"https://github.com/D2I-Group/metacaster/blob/HEAD/eval/generation_quality.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4795296799b75c32","mcp_get_code":{"code_sha256":"4795296799b75c32"}},{"arxiv_id":"2606.12476","paper":"/paper/arxiv-2606-12476","title":"Quickest Detection of Hallucination Onset: Delay Bounds and Learned CUSUM Statistics","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YehudaItkin/quickest-hallucination-onset","path":"poc_analysis.py","file_url":"https://github.com/YehudaItkin/quickest-hallucination-onset/blob/HEAD/poc_analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a477c96b5a8791a7","mcp_get_code":{"code_sha256":"a477c96b5a8791a7"}},{"arxiv_id":"2605.25638","paper":"/paper/arxiv-2605-25638","title":"Reinforcement Learning from Denoising Feedback","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ant-research/Drift","path":"trainer/main_rl.py","file_url":"https://github.com/ant-research/Drift/blob/HEAD/trainer/main_rl.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"30c21f6dff55ac00","mcp_get_code":{"code_sha256":"30c21f6dff55ac00"}},{"arxiv_id":"2604.11742","paper":"/paper/arxiv-2604-11742","title":"Discourse Diversity in Multi-Turn Empathic Dialogue","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"honglizhan/mint-empathy","path":"training/reward_verl.py","file_url":"https://github.com/honglizhan/mint-empathy/blob/HEAD/training/reward_verl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"926141ec74c7a541","mcp_get_code":{"code_sha256":"926141ec74c7a541"}},{"arxiv_id":"2603.09980","paper":"/paper/arxiv-2603-09980","title":"Explainable LLM Unlearning Through Reasoning","date":"2026-02-08","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"junfeng1212/TRU-main","path":"src/trainer/utils.py","file_url":"https://github.com/junfeng1212/TRU-main/blob/HEAD/src/trainer/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"88e453a427b81e23","mcp_get_code":{"code_sha256":"88e453a427b81e23"}},{"arxiv_id":"2602.23798","paper":"/paper/arxiv-2602-23798","title":"MPU: Towards Secure and Privacy-Preserving Knowledge Unlearning for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Tristan0318/MPU","path":"src/trainer/utils.py","file_url":"https://github.com/Tristan0318/MPU/blob/HEAD/src/trainer/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ad1a4c40d0feee4","mcp_get_code":{"code_sha256":"0ad1a4c40d0feee4"}},{"arxiv_id":"2601.03190","paper":"/paper/arxiv-2601-03190","title":"Maximizing Local Entropy Where It Matters: Prefix-Aware Localized LLM Unlearning","date":"2026-01-06","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"nxZhai/PALU","path":"src/trainer/utils.py","file_url":"https://github.com/nxZhai/PALU/blob/HEAD/src/trainer/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ad1a4c40d0feee4","mcp_get_code":{"code_sha256":"0ad1a4c40d0feee4"}},{"arxiv_id":"2506.12618","paper":"/paper/openunlearning-accelerating-llm-unlearning","title":"OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metrics","date":"2025-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/open-unlearning","path":"src/trainer/utils.py","file_url":"https://github.com/locuslab/open-unlearning/blob/HEAD/src/trainer/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ad1a4c40d0feee4","mcp_get_code":{"code_sha256":"0ad1a4c40d0feee4"}},{"arxiv_id":"2407.00948","paper":"/paper/the-house-always-wins-a-framework-for","title":"View From Above: A Framework for Evaluating Distribution Shifts in Model Behavior","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bluefin-Tuna/ApartResearch","path":"deception/pyfiles/statistical_analysis.py","file_url":"https://github.com/Bluefin-Tuna/ApartResearch/blob/HEAD/deception/pyfiles/statistical_analysis.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a24ff867e74673a8","mcp_get_code":{"code_sha256":"a24ff867e74673a8"}}]}