{"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/calculate-perplexity","entry":"calculate_perplexity","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":6,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":1,"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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":5,"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":0,"ran":4,"unverified":3},"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":"2606.14122","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-14122","title":"Beyond Perplexity: UTF-8 Validity in Byte-aware Language Models","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"cynthia/bytecanary","path":"src/bytecanary/evaluate.py","file_url":"https://github.com/cynthia/bytecanary/blob/HEAD/src/bytecanary/evaluate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, cynthia/bytecanary when it was checked","code_sha256":"5c1f2418ee44b141","code_sha256_prefix":"5c1f2418ee44b141","mcp_get_code":{"code_sha256":"5c1f2418ee44b141"}},{"arxiv_id":"2604.24470","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-24470","title":"Zero-shot Large Language Models for Automatic Readability Assessment","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"kinimod23/GRANT","path":"unsupervised/BERT/apply.py","file_url":"https://github.com/kinimod23/GRANT/blob/HEAD/unsupervised/BERT/apply.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, kinimod23/GRANT when it was checked","code_sha256":"ac0d85fa1d5b36df","code_sha256_prefix":"ac0d85fa1d5b36df","mcp_get_code":{"code_sha256":"ac0d85fa1d5b36df"}},{"arxiv_id":"2511.00177","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-00177","title":"Can SAEs reveal and mitigate racial biases of LLMs in healthcare?","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"hibaahsan/sae_bias","path":"src/steer_bhcs.py","file_url":"https://github.com/hibaahsan/sae_bias/blob/HEAD/src/steer_bhcs.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, hibaahsan/sae_bias when it was checked","code_sha256":"d120118971ebf2cb","code_sha256_prefix":"d120118971ebf2cb","mcp_get_code":{"code_sha256":"d120118971ebf2cb"}},{"arxiv_id":"2412.12979","arxiv_id_is_arxiv":true,"paper":"/paper/guiding-generative-protein-language-models","title":"Guiding Generative Protein Language Models with Reinforcement Learning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai4pdlab/dpo_plm","path":"seq_gen.py","file_url":"https://github.com/ai4pdlab/dpo_plm/blob/HEAD/seq_gen.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":"7eb95b024fabf1cc","code_sha256_prefix":"7eb95b024fabf1cc","mcp_get_code":{"code_sha256":"7eb95b024fabf1cc"}},{"arxiv_id":"2406.17746","arxiv_id_is_arxiv":true,"paper":"/paper/recite-reconstruct-recollect-memorization-in","title":"Recite, Reconstruct, Recollect: Memorization in LMs as a Multifaceted Phenomenon","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleutherai/semantic-memorization","path":"inference.py","file_url":"https://github.com/eleutherai/semantic-memorization/blob/HEAD/inference.py","status":"ran","verification_level":1,"contract_check":null,"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, eleutherai/semantic-memorization when it was checked","code_sha256":"f6beaa0ccde5ca7b","code_sha256_prefix":"f6beaa0ccde5ca7b","mcp_get_code":{"code_sha256":"f6beaa0ccde5ca7b"}},{"arxiv_id":"2405.18400","arxiv_id_is_arxiv":true,"paper":"/paper/superposed-decoding-multiple-generations-from","title":"Superposed Decoding: Multiple Generations from a Single Autoregressive Inference Pass","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RAIVNLab/SuperposedDecoding","path":"superposed/llama/metrics.py","file_url":"https://github.com/RAIVNLab/SuperposedDecoding/blob/HEAD/superposed/llama/metrics.py","status":"ran","verification_level":1,"contract_check":null,"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, RAIVNLab/SuperposedDecoding (NOASSERTION)","code_sha256":"9844eb34712feeb4","code_sha256_prefix":"9844eb34712feeb4","mcp_get_code":{"code_sha256":"9844eb34712feeb4"}},{"arxiv_id":"2402.09394","arxiv_id_is_arxiv":true,"paper":"/paper/long-form-evaluation-of-model-editing","title":"Long-form evaluation of model editing","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"domenicrosati/longform-evaluation-model-editing","path":"src/automatic_metrics.py","file_url":"https://github.com/domenicrosati/longform-evaluation-model-editing/blob/HEAD/src/automatic_metrics.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":"6be6c7d3f948ef58","code_sha256_prefix":"6be6c7d3f948ef58","mcp_get_code":{"code_sha256":"6be6c7d3f948ef58"}},{"arxiv_id":"2012.07805","arxiv_id_is_arxiv":true,"paper":"/paper/extracting-training-data-from-large-language","title":"Extracting Training Data from Large Language Models","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shreyansh26/Extracting-Training-Data-from-Large-Langauge-Models","path":"extraction_top_n.py","file_url":"https://github.com/shreyansh26/Extracting-Training-Data-from-Large-Langauge-Models/blob/HEAD/extraction_top_n.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c59c1720bffdb7a5","code_sha256_prefix":"c59c1720bffdb7a5","mcp_get_code":{"code_sha256":"c59c1720bffdb7a5"}},{"arxiv_id":"2023.findings-emnlp.139","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-emnlp.139","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"TrustedLLM/LLMDet","path":"llmdet/truth_perplexity.py","file_url":"https://github.com/TrustedLLM/LLMDet/blob/HEAD/llmdet/truth_perplexity.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":"23f93efbe9cb73dd","code_sha256_prefix":"23f93efbe9cb73dd","mcp_get_code":{"code_sha256":"23f93efbe9cb73dd"}}],"record_sha256":"7b28adede2fc0effb1b3328a560cc7f73b962f8559b3f2552f6487338a5270a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}