{"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/get-sample-size","entry":"get_sample_size","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":16,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":14,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":20,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":3,"unverified":1},"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":"2608.26430","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-26430","title":"Fine-Tuning of Transformer models with Frames","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"vsingh-group/FrameFT","path":"lm-evaluation-harness/lm_eval/evaluator_utils.py","file_url":"https://github.com/vsingh-group/FrameFT/blob/HEAD/lm-evaluation-harness/lm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"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/evaluator_utils.py","file_url":"https://github.com/Vegetebird/VLM-IE3D/blob/HEAD/src/lmms_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"arxiv_id":"2606.05917","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05917","title":"MEMORYCARD: Topic-Aware Multi-Modal Clue Compression for Long-Video Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"NEUIR/MemoryCard","path":"lmms_eval/evaluator_utils.py","file_url":"https://github.com/NEUIR/MemoryCard/blob/HEAD/lmms_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"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/evaluator_utils.py","file_url":"https://github.com/LivingFutureLab/CaCoVID/blob/HEAD/lmms_eval/lmms_eval/evaluator_utils.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, LivingFutureLab/CaCoVID when it was checked","code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"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/evaluator_utils.py","file_url":"https://github.com/EvolvingLMMs-Lab/lmms-eval/blob/HEAD/lmms_eval/evaluator_utils.py","status":"unverified","verification_level":0,"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":"f827e5b576859cb9","code_sha256_prefix":"f827e5b576859cb9","mcp_get_code":{"code_sha256":"f827e5b576859cb9"}},{"arxiv_id":"2601.22527","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22527","title":"ρ-EOS: Training-free Bidirectional Variable-Length Control for Masked Diffusion LLMs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"yjyddq/rho-EOS","path":"dllm_eval/evaluator_utils.py","file_url":"https://github.com/yjyddq/rho-EOS/blob/HEAD/dllm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"arxiv_id":"2601.07645","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-07645","title":"PlaM: Training-Free Plateau-Guided Model Merging for Better Visual Grounding in MLLMs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"wzj1718/PlaM","path":"Vision-Token-Masking/lmms_eval/evaluator_utils.py","file_url":"https://github.com/wzj1718/PlaM/blob/HEAD/Vision-Token-Masking/lmms_eval/evaluator_utils.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, wzj1718/PlaM when it was checked","code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"arxiv_id":"2601.02236","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02236","title":"CD 4 LM: Consistency Distillation and aDaptive Decoding for Diffusion Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"yihao-liang/CDLM","path":"evaluation/dllm_eval/evaluator_utils.py","file_url":"https://github.com/yihao-liang/CDLM/blob/HEAD/evaluation/dllm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"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/evaluator_utils.py","file_url":"https://github.com/yu-lin-li/DyToK/blob/HEAD/eval/lmms_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"arxiv_id":"2501.19393","arxiv_id_is_arxiv":true,"paper":"/paper/s1-simple-test-time-scaling","title":"s1: Simple test-time scaling","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simplescaling/s1","path":"eval/lm-evaluation-harness/lm_eval/evaluator_utils.py","file_url":"https://github.com/simplescaling/s1/blob/HEAD/eval/lm-evaluation-harness/lm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"arxiv_id":"2412.14171","arxiv_id_is_arxiv":true,"paper":"/paper/thinking-in-space-how-multimodal-large","title":"Thinking in Space: How Multimodal Large Language Models See, Remember, and Recall Spaces","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vision-x-nyu/thinking-in-space","path":"lmms_eval/evaluator_utils.py","file_url":"https://github.com/vision-x-nyu/thinking-in-space/blob/HEAD/lmms_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"arxiv_id":"2405.07938","arxiv_id_is_arxiv":true,"paper":"/paper/econlogicqa-a-question-answering-benchmark","title":"EconLogicQA: A Question-Answering Benchmark for Evaluating Large Language Models in Economic Sequential Reasoning","date":"2024-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yinzhu-quan/lm-evaluation-harness","path":"lm_eval/evaluator_utils.py","file_url":"https://github.com/yinzhu-quan/lm-evaluation-harness/blob/HEAD/lm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b315604fb608f3b","code_sha256_prefix":"5b315604fb608f3b","mcp_get_code":{"code_sha256":"5b315604fb608f3b"}},{"arxiv_id":"2306.07285","arxiv_id_is_arxiv":true,"paper":"/paper/transcoder-towards-unified-transferable-code","title":"TransCoder: Towards Unified Transferable Code Representation Learning Inspired by Human Skills","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiushisun/transcoder","path":"learner.py","file_url":"https://github.com/qiushisun/transcoder/blob/HEAD/learner.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":"3824baa1aca5bb25","code_sha256_prefix":"3824baa1aca5bb25","mcp_get_code":{"code_sha256":"3824baa1aca5bb25"}},{"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":"Sypherd/lm-evaluation-harness","path":"lm_eval/evaluator_utils.py","file_url":"https://github.com/Sypherd/lm-evaluation-harness/blob/HEAD/lm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}},{"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":"opengptx/lm-evaluation-harness","path":"lm_eval/evaluator_utils.py","file_url":"https://github.com/opengptx/lm-evaluation-harness/blob/HEAD/lm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b315604fb608f3b","code_sha256_prefix":"5b315604fb608f3b","mcp_get_code":{"code_sha256":"5b315604fb608f3b"}},{"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":"neuralmagic/lm-evaluation-harness","path":"lm_eval/evaluator_utils.py","file_url":"https://github.com/neuralmagic/lm-evaluation-harness/blob/HEAD/lm_eval/evaluator_utils.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":"0db35c379a280bd8","code_sha256_prefix":"0db35c379a280bd8","mcp_get_code":{"code_sha256":"0db35c379a280bd8"}},{"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":"juletx/lm-evaluation-harness","path":"lm_eval/evaluator_utils.py","file_url":"https://github.com/juletx/lm-evaluation-harness/blob/HEAD/lm_eval/evaluator_utils.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":"0fb487fd2495f33f","code_sha256_prefix":"0fb487fd2495f33f","mcp_get_code":{"code_sha256":"0fb487fd2495f33f"}},{"arxiv_id":"1504.01227","arxiv_id_is_arxiv":true,"paper":"/paper/chebyshev-polynomials-moment-matching-and","title":"Chebyshev polynomials, moment matching, and optimal estimation of the unseen","date":null,"month_inferred_from_arxiv_id":"2015-04","title_source":"archive","repo":"Albuso0/support","path":"support.py","file_url":"https://github.com/Albuso0/support/blob/HEAD/support.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Albuso0/support when it was checked","code_sha256":"3c21a2aea30fbfce","code_sha256_prefix":"3c21a2aea30fbfce","mcp_get_code":{"code_sha256":"3c21a2aea30fbfce"}},{"arxiv_id":"1407.0381","arxiv_id_is_arxiv":true,"paper":"/paper/minimax-rates-of-entropy-estimation-on-large","title":"Minimax rates of entropy estimation on large alphabets via best polynomial approximation","date":null,"month_inferred_from_arxiv_id":"2014-07","title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"3c21a2aea30fbfce","code_sha256_prefix":"3c21a2aea30fbfce","mcp_get_code":{"code_sha256":"3c21a2aea30fbfce"}},{"arxiv_id":"2025.findings-acl.744","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.744","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"szu-tera/RankedVotingSC","path":"lm-evaluation-harness/lm_eval/evaluator_utils.py","file_url":"https://github.com/szu-tera/RankedVotingSC/blob/HEAD/lm-evaluation-harness/lm_eval/evaluator_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00f5e7d9ee6636ba","code_sha256_prefix":"00f5e7d9ee6636ba","mcp_get_code":{"code_sha256":"00f5e7d9ee6636ba"}}],"record_sha256":"0dac854082298daeb954296e48357b1e9b0024797fa9f540cef664ef03961c6c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}