{"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-perplexity","entry":"compute_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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":10,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":5,"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":"2604.18293","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18293","title":"An Existence Proof for Neural Language Models That Can Explain Garden-Path Effects via Surprisal","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"osekilab/RE-GPE","path":"src/reverse_engineering/evaluate_perplexity.py","file_url":"https://github.com/osekilab/RE-GPE/blob/HEAD/src/reverse_engineering/evaluate_perplexity.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, osekilab/RE-GPE when it was checked","code_sha256":"4ad76a6cbd937093","code_sha256_prefix":"4ad76a6cbd937093","mcp_get_code":{"code_sha256":"4ad76a6cbd937093"}},{"arxiv_id":"2410.19109","arxiv_id_is_arxiv":true,"paper":"/paper/rsa-control-a-pragmatics-grounded-lightweight","title":"RSA-Control: A Pragmatics-Grounded Lightweight Controllable Text Generation Framework","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ewanwong/rsa-control","path":"toxicity_bias_mitigation/output_perplexity.py","file_url":"https://github.com/ewanwong/rsa-control/blob/HEAD/toxicity_bias_mitigation/output_perplexity.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":"b501be3d87f11fd2","code_sha256_prefix":"b501be3d87f11fd2","mcp_get_code":{"code_sha256":"b501be3d87f11fd2"}},{"arxiv_id":"2410.14649","arxiv_id_is_arxiv":true,"paper":"/paper/evopress-towards-optimal-dynamic-model","title":"EvoPress: Towards Optimal Dynamic Model Compression via Evolutionary Search","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/evopress","path":"evo_drop_search.py","file_url":"https://github.com/ist-daslab/evopress/blob/HEAD/evo_drop_search.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e1d3ed66ce398037","code_sha256_prefix":"e1d3ed66ce398037","mcp_get_code":{"code_sha256":"e1d3ed66ce398037"}},{"arxiv_id":"2405.18768","arxiv_id_is_arxiv":true,"paper":"/paper/rnaflow-rna-structure-sequence-design-via","title":"RNAFlow: RNA Structure & Sequence Design via Inverse Folding-Based Flow Matching","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divnori/rnaflow","path":"rnaflow/models/inverse_folding.py","file_url":"https://github.com/divnori/rnaflow/blob/HEAD/rnaflow/models/inverse_folding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f41f18f9668bca7","code_sha256_prefix":"8f41f18f9668bca7","mcp_get_code":{"code_sha256":"8f41f18f9668bca7"}},{"arxiv_id":"2405.16684","arxiv_id_is_arxiv":true,"paper":"/paper/gzip-predicts-data-dependent-scaling-laws","title":"gzip Predicts Data-dependent Scaling Laws","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KhoomeiK/complexity-scaling","path":"training.py","file_url":"https://github.com/KhoomeiK/complexity-scaling/blob/HEAD/training.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":"f02c461b66961302","code_sha256_prefix":"f02c461b66961302","mcp_get_code":{"code_sha256":"f02c461b66961302"}},{"arxiv_id":"2405.15523","arxiv_id_is_arxiv":true,"paper":"/paper/mosaic-memory-fuzzy-duplication-in-copyright","title":"The Mosaic Memory of Large Language Models","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computationalprivacy/mosaic_memory","path":"src/utils.py","file_url":"https://github.com/computationalprivacy/mosaic_memory/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"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":"8b00eb35104e3d2f","code_sha256_prefix":"8b00eb35104e3d2f","mcp_get_code":{"code_sha256":"8b00eb35104e3d2f"}},{"arxiv_id":"2402.11782","arxiv_id_is_arxiv":true,"paper":"/paper/what-evidence-do-language-models-find","title":"What Evidence Do Language Models Find Convincing?","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexWan0/rag-convincingness","path":"features/gpt2_perplexity.py","file_url":"https://github.com/AlexWan0/rag-convincingness/blob/HEAD/features/gpt2_perplexity.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":"4cb9ff0406030e9e","code_sha256_prefix":"4cb9ff0406030e9e","mcp_get_code":{"code_sha256":"4cb9ff0406030e9e"}},{"arxiv_id":"2312.15166","arxiv_id_is_arxiv":true,"paper":"/paper/solar-10-7b-scaling-large-language-models","title":"SOLAR 10.7B: Scaling Large Language Models with Simple yet Effective Depth Up-Scaling","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jquesnelle/yarn","path":"eval/perplexity.py","file_url":"https://github.com/jquesnelle/yarn/blob/HEAD/eval/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":"70ceb95d97957b6c","code_sha256_prefix":"70ceb95d97957b6c","mcp_get_code":{"code_sha256":"70ceb95d97957b6c"}},{"arxiv_id":"2310.15007","arxiv_id_is_arxiv":true,"paper":"/paper/did-the-neurons-read-your-book-document-level","title":"Did the Neurons Read your Book? Document-level Membership Inference for Large Language Models","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computationalprivacy/document-level-membership-inference","path":"src/compute_perplexity.py","file_url":"https://github.com/computationalprivacy/document-level-membership-inference/blob/HEAD/src/compute_perplexity.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":"a2c54d95202e2509","code_sha256_prefix":"a2c54d95202e2509","mcp_get_code":{"code_sha256":"a2c54d95202e2509"}},{"arxiv_id":"2109.06827","arxiv_id_is_arxiv":true,"paper":"/paper/types-of-out-of-distribution-texts-and-how-to","title":"Types of Out-of-Distribution Texts and How to Detect Them","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uditarora/ood-text-emnlp","path":"perplexity.py","file_url":"https://github.com/uditarora/ood-text-emnlp/blob/HEAD/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":"b29cddb5f632a9d9","code_sha256_prefix":"b29cddb5f632a9d9","mcp_get_code":{"code_sha256":"b29cddb5f632a9d9"}}],"record_sha256":"a0ada221a401afb1a8b0944d43ebb1ab780573d3798979a287a8f795c70aaa07","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}