{"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/make-table","entry":"make_table","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":15,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":12,"n_places_pointer_only_link_open":5,"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":4,"unverified":4},"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.04980","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-04980","title":"AlphaQ: Calibration-Free Bit Allocation for Mixture-of-Experts Quantization","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Superone77/AlphaQ","path":"eval_utils.py","file_url":"https://github.com/Superone77/AlphaQ/blob/HEAD/eval_utils.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, Superone77/AlphaQ when it was checked","code_sha256":"f5f924ce5962ca8f","code_sha256_prefix":"f5f924ce5962ca8f","mcp_get_code":{"code_sha256":"f5f924ce5962ca8f"}},{"arxiv_id":"2504.08165","arxiv_id_is_arxiv":true,"paper":"/paper/findings-of-the-babylm-challenge-sample","title":"Findings of the BabyLM Challenge: Sample-Efficient Pretraining on Developmentally Plausible Corpora","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"babylm/evaluation-pipeline","path":"lm_eval/evaluator.py","file_url":"https://github.com/babylm/evaluation-pipeline/blob/HEAD/lm_eval/evaluator.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":"910a58b3f0fe9967","code_sha256_prefix":"910a58b3f0fe9967","mcp_get_code":{"code_sha256":"910a58b3f0fe9967"}},{"arxiv_id":"2409.03856","arxiv_id_is_arxiv":true,"paper":"/paper/sirius-contextual-sparsity-with-correction","title":"Sirius: Contextual Sparsity with Correction for Efficient LLMs","date":"2024-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"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":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"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/evaluator.py","file_url":"https://github.com/hdong920/griffin/blob/HEAD/src/lm_eval/evaluator.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, hdong920/griffin when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"arxiv_id":"2402.16775","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-quantization","title":"A Comprehensive Evaluation of Quantization Strategies for Large Language Models","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cordercorder/quant_eval","path":"quant/SpQR/lm-evaluation-harness/lm_eval/evaluator.py","file_url":"https://github.com/cordercorder/quant_eval/blob/HEAD/quant/SpQR/lm-evaluation-harness/lm_eval/evaluator.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, cordercorder/quant_eval when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"arxiv_id":"2402.12659","arxiv_id_is_arxiv":true,"paper":"/paper/the-finben-an-holistic-financial-benchmark","title":"FinBen: A Holistic Financial Benchmark for Large Language Models","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chancefocus/pixiu","path":"src/evaluator.py","file_url":"https://github.com/chancefocus/pixiu/blob/HEAD/src/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from princeton-nlp/QuRating, and GitHub detected no licence in that repository when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"arxiv_id":"2402.09739","arxiv_id_is_arxiv":true,"paper":"/paper/qurating-selecting-high-quality-data-for","title":"QuRating: Selecting High-Quality Data for Training Language Models","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/QuRating","path":"eval/lm-evaluation-harness/lm_eval/evaluator.py","file_url":"https://github.com/princeton-nlp/QuRating/blob/HEAD/eval/lm-evaluation-harness/lm_eval/evaluator.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, princeton-nlp/QuRating when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"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/evaluator.py","file_url":"https://github.com/hdong920/less/blob/HEAD/src/lm_eval/evaluator.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, hdong920/less when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"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/evaluator.py","file_url":"https://github.com/dai-shen/laiw/blob/HEAD/src/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from princeton-nlp/QuRating, and GitHub detected no licence in that repository when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"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/evaluator.py","file_url":"https://github.com/nlp-uoregon/mlmm-evaluation/blob/HEAD/lm_eval/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from princeton-nlp/QuRating, and GitHub detected no licence in that repository when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"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/evaluator.py","file_url":"https://github.com/milliemaoo/prompt-position/blob/HEAD/lm_eval/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from princeton-nlp/QuRating, and GitHub detected no licence in that repository when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"arxiv_id":"2303.17003","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-gpt-3-5-and-gpt-4-models-on","title":"Evaluating GPT-3.5 and GPT-4 Models on Brazilian University Admission Exams","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piresramon/gpt-4-enem","path":"lm_eval/evaluator.py","file_url":"https://github.com/piresramon/gpt-4-enem/blob/HEAD/lm_eval/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from princeton-nlp/QuRating, and GitHub detected no licence in that repository when it was checked","code_sha256":"9d95c14130837ee4","code_sha256_prefix":"9d95c14130837ee4","mcp_get_code":{"code_sha256":"9d95c14130837ee4"}},{"arxiv_id":"2009.14193","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-sets-for-image-classifiers-using","title":"Uncertainty Sets for Image Classifiers using Conformal Prediction","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aangelopoulos/conformal_classification","path":"experiments/table1.py","file_url":"https://github.com/aangelopoulos/conformal_classification/blob/HEAD/experiments/table1.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":"8ce51944e3958c60","code_sha256_prefix":"8ce51944e3958c60","mcp_get_code":{"code_sha256":"8ce51944e3958c60"}},{"arxiv_id":"2009.14193","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-sets-for-image-classifiers-using","title":"Uncertainty Sets for Image Classifiers using Conformal Prediction","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aangelopoulos/conformal_classification","path":"experiments/table11.py","file_url":"https://github.com/aangelopoulos/conformal_classification/blob/HEAD/experiments/table11.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":"837d496b65e5409a","code_sha256_prefix":"837d496b65e5409a","mcp_get_code":{"code_sha256":"837d496b65e5409a"}},{"arxiv_id":"2009.14193","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-sets-for-image-classifiers-using","title":"Uncertainty Sets for Image Classifiers using Conformal Prediction","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aangelopoulos/conformal_classification","path":"experiments/table2.py","file_url":"https://github.com/aangelopoulos/conformal_classification/blob/HEAD/experiments/table2.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":"3e5323ecb83f4191","code_sha256_prefix":"3e5323ecb83f4191","mcp_get_code":{"code_sha256":"3e5323ecb83f4191"}},{"arxiv_id":"2009.14193","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-sets-for-image-classifiers-using","title":"Uncertainty Sets for Image Classifiers using Conformal Prediction","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aangelopoulos/conformal_classification","path":"experiments/table5.py","file_url":"https://github.com/aangelopoulos/conformal_classification/blob/HEAD/experiments/table5.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":"153f3eb42aa57f6e","code_sha256_prefix":"153f3eb42aa57f6e","mcp_get_code":{"code_sha256":"153f3eb42aa57f6e"}},{"arxiv_id":"2005.01831","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-explainable-ai-which-algorithmic","title":"Evaluating Explainable AI: Which Algorithmic Explanations Help Users Predict Model Behavior?","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterbhase/InterpretableNLP-ACL2020","path":"tabular/anchor/make_graphs_and_table.py","file_url":"https://github.com/peterbhase/InterpretableNLP-ACL2020/blob/HEAD/tabular/anchor/make_graphs_and_table.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":"1db3f658ae6ec3e0","code_sha256_prefix":"1db3f658ae6ec3e0","mcp_get_code":{"code_sha256":"1db3f658ae6ec3e0"}},{"arxiv_id":"2003.07082","arxiv_id_is_arxiv":true,"paper":"/paper/stanza-a-python-natural-language-processing","title":"Stanza: A Python Natural Language Processing Toolkit for Many Human Languages","date":"2020-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rasoolims/stanza","path":"stanza/pipeline/core.py","file_url":"https://github.com/rasoolims/stanza/blob/HEAD/stanza/pipeline/core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, rasoolims/stanza (NOASSERTION)","code_sha256":"99a85098b6a5141d","code_sha256_prefix":"99a85098b6a5141d","mcp_get_code":{"code_sha256":"99a85098b6a5141d"}}],"record_sha256":"762a0a87e96b492d0ff20b0a20360df3712f90ef7696f9709b1e77e2b31231ba","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}