{"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/escaped-split","entry":"escaped_split","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":10,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":9,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":0},"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":"2607.21595","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2602.01649","arxiv_id_is_arxiv":true,"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_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, LivingFutureLab/CaCoVID when it was checked","code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2602.01649","arxiv_id_is_arxiv":true,"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":"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, EvolvingLMMs-Lab/lmms-eval (NOASSERTION)","code_sha256":"29065ecbfb95eb0b","code_sha256_prefix":"29065ecbfb95eb0b","mcp_get_code":{"code_sha256":"29065ecbfb95eb0b"}},{"arxiv_id":"2512.06866","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2404.01365","arxiv_id_is_arxiv":true,"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_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, hdong920/griffin when it was checked","code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2402.09398","arxiv_id_is_arxiv":true,"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_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, hdong920/less when it was checked","code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2312.15838","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2310.05620","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2307.16039","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2305.14493","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}},{"arxiv_id":"2005.14165","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57e732507bad40db","code_sha256_prefix":"57e732507bad40db","mcp_get_code":{"code_sha256":"57e732507bad40db"}}],"record_sha256":"09cc51bd35fac0647ee3ad2562eebfbd740b982bee6baed74e24ad51fea784c1","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}