{"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-divergence","entry":"compute_kl_divergence","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":1,"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":1,"ran_fixture":3,"ran":2,"unverified":0},"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":"2608.23473","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4795296799b75c32","code_sha256_prefix":"4795296799b75c32","mcp_get_code":{"code_sha256":"4795296799b75c32"}},{"arxiv_id":"2606.12476","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a477c96b5a8791a7","code_sha256_prefix":"a477c96b5a8791a7","mcp_get_code":{"code_sha256":"a477c96b5a8791a7"}},{"arxiv_id":"2605.25638","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"30c21f6dff55ac00","code_sha256_prefix":"30c21f6dff55ac00","mcp_get_code":{"code_sha256":"30c21f6dff55ac00"}},{"arxiv_id":"2604.11742","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"926141ec74c7a541","code_sha256_prefix":"926141ec74c7a541","mcp_get_code":{"code_sha256":"926141ec74c7a541"}},{"arxiv_id":"2603.09980","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, junfeng1212/TRU-main (NOASSERTION)","code_sha256":"88e453a427b81e23","code_sha256_prefix":"88e453a427b81e23","mcp_get_code":{"code_sha256":"88e453a427b81e23"}},{"arxiv_id":"2602.23798","arxiv_id_is_arxiv":true,"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":"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":"0ad1a4c40d0feee4","code_sha256_prefix":"0ad1a4c40d0feee4","mcp_get_code":{"code_sha256":"0ad1a4c40d0feee4"}},{"arxiv_id":"2601.03190","arxiv_id_is_arxiv":true,"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":"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":"0ad1a4c40d0feee4","code_sha256_prefix":"0ad1a4c40d0feee4","mcp_get_code":{"code_sha256":"0ad1a4c40d0feee4"}},{"arxiv_id":"2506.12618","arxiv_id_is_arxiv":true,"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":"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":"0ad1a4c40d0feee4","code_sha256_prefix":"0ad1a4c40d0feee4","mcp_get_code":{"code_sha256":"0ad1a4c40d0feee4"}},{"arxiv_id":"2407.00948","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a24ff867e74673a8","code_sha256_prefix":"a24ff867e74673a8","mcp_get_code":{"code_sha256":"a24ff867e74673a8"}}],"record_sha256":"cda4be55e17a004d3d82e5dcf5d0784eca34b036310b9331029b44cd26726fc9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}