{"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/eval-ppl","entry":"eval_ppl","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":11,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":4,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":4},"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.04756","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04756","title":"Darkness Visible: Reading the Exception Handler of a Language Model","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"pbalogh/transparent-gpt2","path":"src/injection_followup.py","file_url":"https://github.com/pbalogh/transparent-gpt2/blob/HEAD/src/injection_followup.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, pbalogh/transparent-gpt2 when it was checked","code_sha256":"3af04bf25d96d0f6","code_sha256_prefix":"3af04bf25d96d0f6","mcp_get_code":{"code_sha256":"3af04bf25d96d0f6"}},{"arxiv_id":"2510.03267","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-03267","title":"PT$^2$-LLM: Post-Training Ternarization for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"XIANGLONGYAN/PT2-LLM","path":"run_ppl_eval.py","file_url":"https://github.com/XIANGLONGYAN/PT2-LLM/blob/HEAD/run_ppl_eval.py","status":"unverified","verification_level":0,"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":"f044b684b951e585","code_sha256_prefix":"f044b684b951e585","mcp_get_code":{"code_sha256":"f044b684b951e585"}},{"arxiv_id":"2506.03510","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.03510","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"snudm-starlab/SPRINT","path":"src/sprint.py","file_url":"https://github.com/snudm-starlab/SPRINT/blob/HEAD/src/sprint.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, snudm-starlab/SPRINT when it was checked","code_sha256":"3d8df262ae6ac0a2","code_sha256_prefix":"3d8df262ae6ac0a2","mcp_get_code":{"code_sha256":"3d8df262ae6ac0a2"}},{"arxiv_id":"2410.21352","arxiv_id_is_arxiv":true,"paper":"/paper/llmcbench-benchmarking-large-language-model","title":"LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AboveParadise/LLMCBench","path":"evaluate_ppl.py","file_url":"https://github.com/AboveParadise/LLMCBench/blob/HEAD/evaluate_ppl.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":"d8fea7ed2cb92813","code_sha256_prefix":"d8fea7ed2cb92813","mcp_get_code":{"code_sha256":"d8fea7ed2cb92813"}},{"arxiv_id":"2407.20584","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-large-language-models-with-semi","title":"Pruning Large Language Models with Semi-Structural Adaptive Sparse Training","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/adaptive-sparse-trainer","path":"LLaMA-2-7B/llmshearing/sparse/sparse_utils.py","file_url":"https://github.com/thu-ml/adaptive-sparse-trainer/blob/HEAD/LLaMA-2-7B/llmshearing/sparse/sparse_utils.py","status":"unverified","verification_level":0,"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":"96c9abdf6be0e778","code_sha256_prefix":"96c9abdf6be0e778","mcp_get_code":{"code_sha256":"96c9abdf6be0e778"}},{"arxiv_id":"2407.20584","arxiv_id_is_arxiv":true,"paper":"/paper/pruning-large-language-models-with-semi","title":"Pruning Large Language Models with Semi-Structural Adaptive Sparse Training","date":"2024-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/adaptive-sparse-trainer","path":"utils.py","file_url":"https://github.com/thu-ml/adaptive-sparse-trainer/blob/HEAD/utils.py","status":"unverified","verification_level":0,"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":"95170b214d3dd627","code_sha256_prefix":"95170b214d3dd627","mcp_get_code":{"code_sha256":"95170b214d3dd627"}},{"arxiv_id":"2402.09025","arxiv_id_is_arxiv":true,"paper":"/paper/sleb-streamlining-llms-through-redundancy","title":"SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blocks","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiwonsong-dev/sleb","path":"sleb.py","file_url":"https://github.com/jiwonsong-dev/sleb/blob/HEAD/sleb.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":"a7e0158215732c17","code_sha256_prefix":"a7e0158215732c17","mcp_get_code":{"code_sha256":"a7e0158215732c17"}},{"arxiv_id":"2310.20138","arxiv_id_is_arxiv":true,"paper":"/paper/depn-detecting-and-editing-privacy-neurons-in","title":"DEPN: Detecting and Editing Privacy Neurons in Pretrained Language Models","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flamewei123/DEPN","path":"src/3_edit_privacy_neurons.py","file_url":"https://github.com/flamewei123/DEPN/blob/HEAD/src/3_edit_privacy_neurons.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, flamewei123/DEPN when it was checked","code_sha256":"359b3d77e480e6f8","code_sha256_prefix":"359b3d77e480e6f8","mcp_get_code":{"code_sha256":"359b3d77e480e6f8"}},{"arxiv_id":"2210.15859","arxiv_id_is_arxiv":true,"paper":"/paper/you-can-t-pick-your-neighbors-or-can-you-when","title":"You can't pick your neighbors, or can you? When and how to rely on retrieval in the $k$NN-LM","date":"2022-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iesl/knnlm-retrieval-quality","path":"rq/knnlm_func.py","file_url":"https://github.com/iesl/knnlm-retrieval-quality/blob/HEAD/rq/knnlm_func.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, iesl/knnlm-retrieval-quality, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"cf04f6570c3c52e0","code_sha256_prefix":"cf04f6570c3c52e0","mcp_get_code":{"code_sha256":"cf04f6570c3c52e0"}},{"arxiv_id":"1911.04700","arxiv_id_is_arxiv":true,"paper":"/paper/a-pre-training-based-personalized-dialogue","title":"A Pre-training Based Personalized Dialogue Generation Model with Persona-sparse Data","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lireanstar/BPDG","path":"eval_ppl.py","file_url":"https://github.com/Lireanstar/BPDG/blob/HEAD/eval_ppl.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":"1ec2c2d36a3cda9a","code_sha256_prefix":"1ec2c2d36a3cda9a","mcp_get_code":{"code_sha256":"1ec2c2d36a3cda9a"}},{"arxiv_id":"2025.acl-long.590","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.590","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ChnQ/SPIN","path":"src/eval_ppl.py","file_url":"https://github.com/ChnQ/SPIN/blob/HEAD/src/eval_ppl.py","status":"unverified","verification_level":0,"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":"3fa75f4398f53d92","code_sha256_prefix":"3fa75f4398f53d92","mcp_get_code":{"code_sha256":"3fa75f4398f53d92"}}],"record_sha256":"a6c9c11dc8b3b0eb73cad14f0b3d3ae9ca311d59f2cb58e16366f827a3f6ebcc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}