{"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-ppl","entry":"compute_ppl","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":10,"n_papers_ran":2,"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":10,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":8},"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":"2509.03058","paper":"/paper/arxiv-2509-03058","title":"EverTracer: Hunting Stolen Large Language Models via Stealthy and Robust Probabilistic Fingerprint","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Xuzhenhua55/EverTracer","path":"Experiments/input-stealthness/ppl_calculate.py","file_url":"https://github.com/Xuzhenhua55/EverTracer/blob/HEAD/Experiments/input-stealthness/ppl_calculate.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c48add63c51510a4","mcp_get_code":{"code_sha256":"c48add63c51510a4"}},{"arxiv_id":"2410.16454","paper":"/paper/does-your-llm-truly-unlearn-an-embarrassingly","title":"Catastrophic Failure of LLM Unlearning via Quantization","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzwjames/FailureLLMUnlearning","path":"metrics/privleak.py","file_url":"https://github.com/zzwjames/FailureLLMUnlearning/blob/HEAD/metrics/privleak.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"475c0ba89c5db551","mcp_get_code":{"code_sha256":"475c0ba89c5db551"}},{"arxiv_id":"2406.11263","paper":"/paper/the-fall-of-rome-understanding-the-collapse","title":"Understanding the Collapse of LLMs in Model Editing","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanliyoung/collapse-in-model-editing","path":"easyeditor/editors/editor.py","file_url":"https://github.com/wanliyoung/collapse-in-model-editing/blob/HEAD/easyeditor/editors/editor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e1dbabed65583cc0","mcp_get_code":{"code_sha256":"e1dbabed65583cc0"}},{"arxiv_id":"2406.05918","paper":"/paper/why-don-t-prompt-based-fairness-metrics","title":"Why Don't Prompt-Based Fairness Metrics Correlate?","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/CAIRO","path":"model/generation.py","file_url":"https://github.com/chandar-lab/CAIRO/blob/HEAD/model/generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a9a7102d102cc799","mcp_get_code":{"code_sha256":"a9a7102d102cc799"}},{"arxiv_id":"2403.19928","paper":"/paper/dijiang-efficient-large-language-models","title":"DiJiang: Efficient Large Language Models through Compact Kernelization","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuchuantian/dijiang","path":"train_pythia.py","file_url":"https://github.com/yuchuantian/dijiang/blob/HEAD/train_pythia.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"44b82bf0bb0e8bc1","mcp_get_code":{"code_sha256":"44b82bf0bb0e8bc1"}},{"arxiv_id":"2402.10946","paper":"/paper/culturellm-incorporating-cultural-differences","title":"CultureLLM: Incorporating Cultural Differences into Large Language Models","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"scarelette/culturellm","path":"ppl.py","file_url":"https://github.com/scarelette/culturellm/blob/HEAD/ppl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e346ea64f2af66b5","mcp_get_code":{"code_sha256":"e346ea64f2af66b5"}},{"arxiv_id":"2312.15398","paper":"/paper/fairness-aware-structured-pruning-in","title":"Fairness-Aware Structured Pruning in Transformers","date":"2023-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/fasp","path":"model/generation.py","file_url":"https://github.com/chandar-lab/fasp/blob/HEAD/model/generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a549c5e9e609e234","mcp_get_code":{"code_sha256":"a549c5e9e609e234"}},{"arxiv_id":"2312.07401","paper":"/paper/on-diverse-preferences-for-large-language","title":"On Diversified Preferences of Large Language Model Alignment","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dunzeng/more","path":"evaluation_utils.py","file_url":"https://github.com/dunzeng/more/blob/HEAD/evaluation_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"bd566700507d4d13","mcp_get_code":{"code_sha256":"bd566700507d4d13"}},{"arxiv_id":"2205.02593","paper":"/paper/metgen-a-module-based-entailment-tree","title":"METGEN: A Module-Based Entailment Tree Generation Framework for Answer Explanation","date":"2022-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tencent-ailab/metalogic","path":"code/inference.py","file_url":"https://github.com/tencent-ailab/metalogic/blob/HEAD/code/inference.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2e5c0702c50628ea","mcp_get_code":{"code_sha256":"2e5c0702c50628ea"}},{"arxiv_id":"2112.07566","paper":"/paper/valse-a-task-independent-benchmark-for-vision-1","title":"VALSE: A Task-Independent Benchmark for Vision and Language Models Centered on Linguistic Phenomena","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heidelberg-nlp/valse","path":"unimodal_valse_eval.py","file_url":"https://github.com/heidelberg-nlp/valse/blob/HEAD/unimodal_valse_eval.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3b772f0bbcecca2c","mcp_get_code":{"code_sha256":"3b772f0bbcecca2c"}}]}