{"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/escaped-split","entry":"escaped_split","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":10,"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":2,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":1},"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":"2607.21595","paper":"/paper/arxiv-2607-21595","title":"3D-Aware VLMs with Implicit and Explicit Geometries","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Vegetebird/VLM-IE3D","path":"src/lmms_eval/utils.py","file_url":"https://github.com/Vegetebird/VLM-IE3D/blob/HEAD/src/lmms_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2602.01649","paper":"/paper/arxiv-2602-01649","title":"Contribution-aware Token Compression for Efficient Video Understanding via Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"LivingFutureLab/CaCoVID","path":"lmms_eval/lmms_eval/utils.py","file_url":"https://github.com/LivingFutureLab/CaCoVID/blob/HEAD/lmms_eval/lmms_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2602.01649","paper":"/paper/arxiv-2602-01649","title":"Contribution-aware Token Compression for Efficient Video Understanding via Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"EvolvingLMMs-Lab/lmms-eval","path":"lmms_eval/utils.py","file_url":"https://github.com/EvolvingLMMs-Lab/lmms-eval/blob/HEAD/lmms_eval/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"29065ecbfb95eb0b","mcp_get_code":{"code_sha256":"29065ecbfb95eb0b"}},{"arxiv_id":"2512.06866","paper":"/paper/arxiv-2512-06866","title":"Less Is More, but Where? Dynamic Token Compression via LLM-Guided Keyframe Prior","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"yu-lin-li/DyToK","path":"eval/lmms_eval/utils.py","file_url":"https://github.com/yu-lin-li/DyToK/blob/HEAD/eval/lmms_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2404.01365","paper":"/paper/prompt-prompted-mixture-of-experts-for","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hdong920/griffin","path":"src/lm_eval/utils.py","file_url":"https://github.com/hdong920/griffin/blob/HEAD/src/lm_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2402.09398","paper":"/paper/get-more-with-less-synthesizing-recurrence","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hdong920/less","path":"src/lm_eval/utils.py","file_url":"https://github.com/hdong920/less/blob/HEAD/src/lm_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2312.15838","paper":"/paper/secqa-a-concise-question-answering-dataset","title":"SecQA: A Concise Question-Answering Dataset for Evaluating Large Language Models in Computer Security","date":"2023-12-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zefang-liu/lm-evaluation-harness","path":"lm_eval/utils.py","file_url":"https://github.com/zefang-liu/lm-evaluation-harness/blob/HEAD/lm_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2310.05620","paper":"/paper/laiw-a-chinese-legal-large-language-models","title":"LAiW: A Chinese Legal Large Language Models Benchmark","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dai-shen/laiw","path":"src/financial-evaluation/lm_eval/utils.py","file_url":"https://github.com/dai-shen/laiw/blob/HEAD/src/financial-evaluation/lm_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2307.16039","paper":"/paper/okapi-instruction-tuned-large-language-models","title":"Okapi: Instruction-tuned Large Language Models in Multiple Languages with Reinforcement Learning from Human Feedback","date":"2023-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlp-uoregon/mlmm-evaluation","path":"lm_eval/utils.py","file_url":"https://github.com/nlp-uoregon/mlmm-evaluation/blob/HEAD/lm_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2305.14493","paper":"/paper/prompt-position-really-matters-in-few-shot","title":"Do prompt positions really matter?","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milliemaoo/prompt-position","path":"lm_eval/utils.py","file_url":"https://github.com/milliemaoo/prompt-position/blob/HEAD/lm_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2005.14165","paper":"/paper/language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vilm-ai/viet-llm-eval","path":"lm_eval/utils.py","file_url":"https://github.com/vilm-ai/viet-llm-eval/blob/HEAD/lm_eval/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}}]}