{"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/gen-prompt","entry":"gen_prompt","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":35,"n_papers_ran":31,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":19,"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":32,"n_samples_ran":28,"n_samples_constructed":0,"n_samples_ran_checked":17,"n_samples_instrument":11,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":46,"n_places_pointer_only":23,"n_places_pointer_only_link_open":1,"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":11,"ran_fixture":0,"ran":17,"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":"2605.15491","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15491","title":"Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"chenxinrui-tsinghua/LinearPatch","path":"eval/mmlu_eval.py","file_url":"https://github.com/chenxinrui-tsinghua/LinearPatch/blob/HEAD/eval/mmlu_eval.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2604.14463","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14463","title":"Psychological Steering of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"kaistAI/FLASK","path":"gpt_review/gpt4_eval.py","file_url":"https://github.com/kaistAI/FLASK/blob/HEAD/gpt_review/gpt4_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaistAI/FLASK when it was checked","code_sha256":"71866adce400868a","code_sha256_prefix":"71866adce400868a","mcp_get_code":{"code_sha256":"71866adce400868a"}},{"arxiv_id":"2604.14463","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14463","title":"Psychological Steering of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"kaistAI/FLASK","path":"metadata_annotation/skillset/skillset_annotation.py","file_url":"https://github.com/kaistAI/FLASK/blob/HEAD/metadata_annotation/skillset/skillset_annotation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaistAI/FLASK when it was checked","code_sha256":"1c33539256f10e59","code_sha256_prefix":"1c33539256f10e59","mcp_get_code":{"code_sha256":"1c33539256f10e59"}},{"arxiv_id":"2604.14463","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14463","title":"Psychological Steering of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"kaistAI/FLASK","path":"metadata_annotation/difficulty/difficulty_annotation.py","file_url":"https://github.com/kaistAI/FLASK/blob/HEAD/metadata_annotation/difficulty/difficulty_annotation.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, kaistAI/FLASK when it was checked","code_sha256":"d9f1b4538ee3c0dd","code_sha256_prefix":"d9f1b4538ee3c0dd","mcp_get_code":{"code_sha256":"d9f1b4538ee3c0dd"}},{"arxiv_id":"2604.14463","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-14463","title":"Psychological Steering of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"kaistAI/FLASK","path":"metadata_annotation/domain/domain_annotation.py","file_url":"https://github.com/kaistAI/FLASK/blob/HEAD/metadata_annotation/domain/domain_annotation.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, kaistAI/FLASK when it was checked","code_sha256":"ca86191a67ce7cdb","code_sha256_prefix":"ca86191a67ce7cdb","mcp_get_code":{"code_sha256":"ca86191a67ce7cdb"}},{"arxiv_id":"2602.10718","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-10718","title":"SnapMLA: Efficient Long-Context MLA Decoding via Hardware-Aware FP8 Quantized Pipelining","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"meituan-longcat/SGLang-FluentLLM","path":"benchmark/mmlu/bench_sglang.py","file_url":"https://github.com/meituan-longcat/SGLang-FluentLLM/blob/HEAD/benchmark/mmlu/bench_sglang.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":"c7131fbea2cbdc2d","code_sha256_prefix":"c7131fbea2cbdc2d","mcp_get_code":{"code_sha256":"c7131fbea2cbdc2d"}},{"arxiv_id":"2601.16503","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16503","title":"MRAG: Benchmarking Retrieval-Augmented Generation for Bio-medicine","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"hendrycks/test","path":"evaluate_flan.py","file_url":"https://github.com/hendrycks/test/blob/HEAD/evaluate_flan.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2410.21352","arxiv_id_is_arxiv":true,"paper":"/paper/llmcbench-benchmarking-large-language-model","title":"LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AboveParadise/LLMCBench","path":"evaluate_mmlu.py","file_url":"https://github.com/AboveParadise/LLMCBench/blob/HEAD/evaluate_mmlu.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2410.21352","arxiv_id_is_arxiv":true,"paper":"/paper/llmcbench-benchmarking-large-language-model","title":"LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AboveParadise/LLMCBench","path":"evaluate_advglue.py","file_url":"https://github.com/AboveParadise/LLMCBench/blob/HEAD/evaluate_advglue.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":"00e220ac67451517","code_sha256_prefix":"00e220ac67451517","mcp_get_code":{"code_sha256":"00e220ac67451517"}},{"arxiv_id":"2410.21352","arxiv_id_is_arxiv":true,"paper":"/paper/llmcbench-benchmarking-large-language-model","title":"LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AboveParadise/LLMCBench","path":"evaluate_mnli.py","file_url":"https://github.com/AboveParadise/LLMCBench/blob/HEAD/evaluate_mnli.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":"b8a3329c6d548881","code_sha256_prefix":"b8a3329c6d548881","mcp_get_code":{"code_sha256":"b8a3329c6d548881"}},{"arxiv_id":"2410.21352","arxiv_id_is_arxiv":true,"paper":"/paper/llmcbench-benchmarking-large-language-model","title":"LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AboveParadise/LLMCBench","path":"evaluate_qnli.py","file_url":"https://github.com/AboveParadise/LLMCBench/blob/HEAD/evaluate_qnli.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":"65cc2c5bebc786da","code_sha256_prefix":"65cc2c5bebc786da","mcp_get_code":{"code_sha256":"65cc2c5bebc786da"}},{"arxiv_id":"2409.12740","arxiv_id_is_arxiv":true,"paper":"/paper/hllm-enhancing-sequential-recommendations-via","title":"HLLM: Enhancing Sequential Recommendations via Hierarchical Large Language Models for Item and User Modeling","date":"2024-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/hllm","path":"code/HLLM_Creator_eval_scripts/gpt_eval_open.py","file_url":"https://github.com/bytedance/hllm/blob/HEAD/code/HLLM_Creator_eval_scripts/gpt_eval_open.py","status":"unverified","verification_level":0,"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":"a7f4c057cdcda01d","code_sha256_prefix":"a7f4c057cdcda01d","mcp_get_code":{"code_sha256":"a7f4c057cdcda01d"}},{"arxiv_id":"2408.11815","arxiv_id_is_arxiv":true,"paper":"/paper/great-memory-shallow-reasoning-limits-of-k-nn","title":"Great Memory, Shallow Reasoning: Limits of $k$NN-LMs","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsyfate/knnlm-limits","path":"eval_bbh.py","file_url":"https://github.com/gsyfate/knnlm-limits/blob/HEAD/eval_bbh.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, gsyfate/knnlm-limits when it was checked","code_sha256":"d42ce8e145a19d21","code_sha256_prefix":"d42ce8e145a19d21","mcp_get_code":{"code_sha256":"d42ce8e145a19d21"}},{"arxiv_id":"2407.16286","arxiv_id_is_arxiv":true,"paper":"/paper/a-deeper-look-at-depth-pruning-of-llms","title":"A deeper look at depth pruning of LLMs","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shoaibahmed/llm_depth_pruning","path":"evals/mmlu.py","file_url":"https://github.com/shoaibahmed/llm_depth_pruning/blob/HEAD/evals/mmlu.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, shoaibahmed/llm_depth_pruning when it was checked","code_sha256":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2406.08527","arxiv_id_is_arxiv":true,"paper":"/paper/optimized-feature-generation-for-tabular-data","title":"Optimized Feature Generation for Tabular Data via LLMs with Decision Tree Reasoning","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jaehyun513/octree","path":"ours/utils_xg.py","file_url":"https://github.com/jaehyun513/octree/blob/HEAD/ours/utils_xg.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jaehyun513/octree when it was checked","code_sha256":"2d9f70d8150b77f3","code_sha256_prefix":"2d9f70d8150b77f3","mcp_get_code":{"code_sha256":"2d9f70d8150b77f3"}},{"arxiv_id":"2406.05918","arxiv_id_is_arxiv":true,"paper":"/paper/why-don-t-prompt-based-fairness-metrics","title":"Why Don't Prompt-Based Fairness Metrics Correlate?","date":"2024-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/CAIRO","path":"model/generation.py","file_url":"https://github.com/chandar-lab/CAIRO/blob/HEAD/model/generation.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":"4f8c1cf6dee484a6","code_sha256_prefix":"4f8c1cf6dee484a6","mcp_get_code":{"code_sha256":"4f8c1cf6dee484a6"}},{"arxiv_id":"2406.01721","arxiv_id_is_arxiv":true,"paper":"/paper/rotation-and-permutation-for-advanced-outlier","title":"DuQuant: Distributing Outliers via Dual Transformation Makes Stronger Quantized LLMs","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Hsu1023/DuQuant","path":"mmlu_eval.py","file_url":"https://github.com/Hsu1023/DuQuant/blob/HEAD/mmlu_eval.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2405.11966","arxiv_id_is_arxiv":true,"paper":"/paper/multiple-choice-questions-are-efficient-and","title":"Multiple-Choice Questions are Efficient and Robust LLM Evaluators","date":"2024-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geralt-targaryen/mc-evaluation","path":"dataset_mc.py","file_url":"https://github.com/geralt-targaryen/mc-evaluation/blob/HEAD/dataset_mc.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":"df462d439e738510","code_sha256_prefix":"df462d439e738510","mcp_get_code":{"code_sha256":"df462d439e738510"}},{"arxiv_id":"2405.09055","arxiv_id_is_arxiv":true,"paper":"/paper/a-safety-realignment-framework-via-subspace","title":"A safety realignment framework via subspace-oriented model fusion for large language models","date":"2024-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinykou/safety_realignment","path":"evaluate/safety_datasets.py","file_url":"https://github.com/xinykou/safety_realignment/blob/HEAD/evaluate/safety_datasets.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, xinykou/safety_realignment when it was checked","code_sha256":"728c60994ca0f8f0","code_sha256_prefix":"728c60994ca0f8f0","mcp_get_code":{"code_sha256":"728c60994ca0f8f0"}},{"arxiv_id":"2404.09492","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-the-gap-between-different","title":"Bridging the Gap between Different Vocabularies for LLM Ensemble","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xydaytoy/eva","path":"ensemble/eva_multi.py","file_url":"https://github.com/xydaytoy/eva/blob/HEAD/ensemble/eva_multi.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, xydaytoy/eva when it was checked","code_sha256":"5b3d9ad8287c5ece","code_sha256_prefix":"5b3d9ad8287c5ece","mcp_get_code":{"code_sha256":"5b3d9ad8287c5ece"}},{"arxiv_id":"2403.01244","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-catastrophic-forgetting-in-large","title":"Mitigating Catastrophic Forgetting in Large Language Models with Self-Synthesized Rehearsal","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepLearnXMU/SSR","path":"mmlu_test/evaluate_flan.py","file_url":"https://github.com/DeepLearnXMU/SSR/blob/HEAD/mmlu_test/evaluate_flan.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2403.01244","arxiv_id_is_arxiv":true,"paper":"/paper/mitigating-catastrophic-forgetting-in-large","title":"Mitigating Catastrophic Forgetting in Large Language Models with Self-Synthesized Rehearsal","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DeepLearnXMU/SSR","path":"mmlu_test/evaluate_causal.py","file_url":"https://github.com/DeepLearnXMU/SSR/blob/HEAD/mmlu_test/evaluate_causal.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":"37d029794d683c68","code_sha256_prefix":"37d029794d683c68","mcp_get_code":{"code_sha256":"37d029794d683c68"}},{"arxiv_id":"2402.18243","arxiv_id_is_arxiv":true,"paper":"/paper/learning-or-self-aligning-rethinking","title":"Learning or Self-aligning? Rethinking Instruction Fine-tuning","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmengjie7/self-aligning","path":"eval/my_benchmark_eval.py","file_url":"https://github.com/renmengjie7/self-aligning/blob/HEAD/eval/my_benchmark_eval.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, renmengjie7/self-aligning when it was checked","code_sha256":"400468b4ab8c64df","code_sha256_prefix":"400468b4ab8c64df","mcp_get_code":{"code_sha256":"400468b4ab8c64df"}},{"arxiv_id":"2402.18243","arxiv_id_is_arxiv":true,"paper":"/paper/learning-or-self-aligning-rethinking","title":"Learning or Self-aligning? Rethinking Instruction Fine-tuning","date":"2024-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"renmengjie7/self-aligning","path":"eval/my_domain_eval.py","file_url":"https://github.com/renmengjie7/self-aligning/blob/HEAD/eval/my_domain_eval.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, renmengjie7/self-aligning when it was checked","code_sha256":"d46a3cff5e2c4b42","code_sha256_prefix":"d46a3cff5e2c4b42","mcp_get_code":{"code_sha256":"d46a3cff5e2c4b42"}},{"arxiv_id":"2402.11746","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-are-homer-simpson-safety-re","title":"Language Models are Homer Simpson! Safety Re-Alignment of Fine-tuned Language Models through Task Arithmetic","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/red-instruct","path":"starling_training/inference.py","file_url":"https://github.com/declare-lab/red-instruct/blob/HEAD/starling_training/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9a7ad6a646ae62e","code_sha256_prefix":"f9a7ad6a646ae62e","mcp_get_code":{"code_sha256":"f9a7ad6a646ae62e"}},{"arxiv_id":"2402.04833","arxiv_id_is_arxiv":true,"paper":"/paper/long-is-more-for-alignment-a-simple-but-tough","title":"Long Is More for Alignment: A Simple but Tough-to-Beat Baseline for Instruction Fine-Tuning","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tml-epfl/long-is-more-for-alignment","path":"evaluation/evaluation_gpt4.py","file_url":"https://github.com/tml-epfl/long-is-more-for-alignment/blob/HEAD/evaluation/evaluation_gpt4.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tml-epfl/long-is-more-for-alignment when it was checked","code_sha256":"36c101b773eb28ed","code_sha256_prefix":"36c101b773eb28ed","mcp_get_code":{"code_sha256":"36c101b773eb28ed"}},{"arxiv_id":"2312.15398","arxiv_id_is_arxiv":true,"paper":"/paper/fairness-aware-structured-pruning-in","title":"Fairness-Aware Structured Pruning in Transformers","date":"2023-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chandar-lab/fasp","path":"model/generation.py","file_url":"https://github.com/chandar-lab/fasp/blob/HEAD/model/generation.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":"e0a15e5b01ac0d34","code_sha256_prefix":"e0a15e5b01ac0d34","mcp_get_code":{"code_sha256":"e0a15e5b01ac0d34"}},{"arxiv_id":"2312.11875","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-is-enough-in-fine-tuning-pre-trained","title":"Sparse is Enough in Fine-tuning Pre-trained Large Language Models","date":"2023-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"song-wx/SIFT","path":"exp/mmlu/eval_mmlu.py","file_url":"https://github.com/song-wx/SIFT/blob/HEAD/exp/mmlu/eval_mmlu.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, song-wx/SIFT when it was checked","code_sha256":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2312.09366","arxiv_id_is_arxiv":true,"paper":"/paper/arabic-mini-climategpt-a-climate-change-and","title":"Arabic Mini-ClimateGPT : A Climate Change and Sustainability Tailored Arabic LLM","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-oryx/climategpt","path":"fastchat/eval/eval_gpt_review.py","file_url":"https://github.com/mbzuai-oryx/climategpt/blob/HEAD/fastchat/eval/eval_gpt_review.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mbzuai-oryx/climategpt when it was checked","code_sha256":"a6a3ac30bf6e7bcf","code_sha256_prefix":"a6a3ac30bf6e7bcf","mcp_get_code":{"code_sha256":"a6a3ac30bf6e7bcf"}},{"arxiv_id":"2312.07104","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-programming-large-language-models","title":"SGLang: Efficient Execution of Structured Language Model Programs","date":"2023-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tginart/sglang","path":"benchmark/mmlu/bench_sglang.py","file_url":"https://github.com/tginart/sglang/blob/HEAD/benchmark/mmlu/bench_sglang.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":"c7131fbea2cbdc2d","code_sha256_prefix":"c7131fbea2cbdc2d","mcp_get_code":{"code_sha256":"c7131fbea2cbdc2d"}},{"arxiv_id":"2312.00700","arxiv_id_is_arxiv":true,"paper":"/paper/gift-generative-interpretable-fine-tuning","title":"Generative Parameter-Efficient Fine-Tuning","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"savadikarc/gift","path":"language_modeling/math_code_instruct/eval_mmlu.py","file_url":"https://github.com/savadikarc/gift/blob/HEAD/language_modeling/math_code_instruct/eval_mmlu.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":"04fd5045fce0c33a","code_sha256_prefix":"04fd5045fce0c33a","mcp_get_code":{"code_sha256":"04fd5045fce0c33a"}},{"arxiv_id":"2310.09550","arxiv_id_is_arxiv":true,"paper":"/paper/can-large-language-model-comprehend-ancient","title":"Can Large Language Model Comprehend Ancient Chinese? A Preliminary Test on ACLUE","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isen-zhang/aclue","path":"src/utils.py","file_url":"https://github.com/isen-zhang/aclue/blob/HEAD/src/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":"9cbcb7e3d68900c3","code_sha256_prefix":"9cbcb7e3d68900c3","mcp_get_code":{"code_sha256":"9cbcb7e3d68900c3"}},{"arxiv_id":"2310.05736","arxiv_id_is_arxiv":true,"paper":"/paper/llmlingua-compressing-prompts-for-accelerated","title":"LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FranxYao/chain-of-thought-hub","path":"MMLU/run_mmlu_llama.py","file_url":"https://github.com/FranxYao/chain-of-thought-hub/blob/HEAD/MMLU/run_mmlu_llama.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2310.01651","arxiv_id_is_arxiv":true,"paper":"/paper/fool-your-vision-and-language-model-with","title":"Fool Your (Vision and) Language Model With Embarrassingly Simple Permutations","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ys-zong/foolyourvllms","path":"VLLMs_attack.py","file_url":"https://github.com/ys-zong/foolyourvllms/blob/HEAD/VLLMs_attack.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, ys-zong/foolyourvllms when it was checked","code_sha256":"271092220057d5e7","code_sha256_prefix":"271092220057d5e7","mcp_get_code":{"code_sha256":"271092220057d5e7"}},{"arxiv_id":"2308.04948","arxiv_id_is_arxiv":true,"paper":"/paper/extrapolating-large-language-models-to-non","title":"Extrapolating Large Language Models to Non-English by Aligning Languages","date":"2023-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NJUNLP/x-LLM","path":"eval/mieval.eval.py","file_url":"https://github.com/NJUNLP/x-LLM/blob/HEAD/eval/mieval.eval.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":"b934977219a4b0ec","code_sha256_prefix":"b934977219a4b0ec","mcp_get_code":{"code_sha256":"b934977219a4b0ec"}},{"arxiv_id":"2308.03279","arxiv_id_is_arxiv":true,"paper":"/paper/universalner-targeted-distillation-from-large","title":"UniversalNER: Targeted Distillation from Large Language Models for Open Named Entity Recognition","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"universal-ner/universal-ner","path":"src/train/fastchat/eval/eval_gpt_review.py","file_url":"https://github.com/universal-ner/universal-ner/blob/HEAD/src/train/fastchat/eval/eval_gpt_review.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 mbzuai-oryx/climategpt, and GitHub detected no licence in that repository when it was checked","code_sha256":"a6a3ac30bf6e7bcf","code_sha256_prefix":"a6a3ac30bf6e7bcf","mcp_get_code":{"code_sha256":"a6a3ac30bf6e7bcf"}},{"arxiv_id":"2307.10928","arxiv_id_is_arxiv":true,"paper":"/paper/flask-fine-grained-language-model-evaluation","title":"FLASK: Fine-grained Language Model Evaluation based on Alignment Skill Sets","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaistai/flask","path":"gpt_review/gpt4_eval.py","file_url":"https://github.com/kaistai/flask/blob/HEAD/gpt_review/gpt4_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaistai/flask when it was checked","code_sha256":"71866adce400868a","code_sha256_prefix":"71866adce400868a","mcp_get_code":{"code_sha256":"71866adce400868a"}},{"arxiv_id":"2307.10928","arxiv_id_is_arxiv":true,"paper":"/paper/flask-fine-grained-language-model-evaluation","title":"FLASK: Fine-grained Language Model Evaluation based on Alignment Skill Sets","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaistai/flask","path":"metadata_annotation/skillset/skillset_annotation.py","file_url":"https://github.com/kaistai/flask/blob/HEAD/metadata_annotation/skillset/skillset_annotation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kaistai/flask when it was checked","code_sha256":"1c33539256f10e59","code_sha256_prefix":"1c33539256f10e59","mcp_get_code":{"code_sha256":"1c33539256f10e59"}},{"arxiv_id":"2307.07705","arxiv_id_is_arxiv":true,"paper":"/paper/cpet-effective-parameter-efficient-tuning-for","title":"CA-LoRA: Adapting Existing LoRA for Compressed LLMs to Enable Efficient Multi-Tasking on Personal Devices","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/ca-lora","path":"src/section-4.2.1/instruct-eval/bbh.py","file_url":"https://github.com/thunlp/ca-lora/blob/HEAD/src/section-4.2.1/instruct-eval/bbh.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, thunlp/ca-lora when it was checked","code_sha256":"d4004fed05d494ec","code_sha256_prefix":"d4004fed05d494ec","mcp_get_code":{"code_sha256":"d4004fed05d494ec"}},{"arxiv_id":"2307.07705","arxiv_id_is_arxiv":true,"paper":"/paper/cpet-effective-parameter-efficient-tuning-for","title":"CA-LoRA: Adapting Existing LoRA for Compressed LLMs to Enable Efficient Multi-Tasking on Personal Devices","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/ca-lora","path":"src/section-4.2.1/instruct-eval/crass.py","file_url":"https://github.com/thunlp/ca-lora/blob/HEAD/src/section-4.2.1/instruct-eval/crass.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, thunlp/ca-lora when it was checked","code_sha256":"f85537d953a50f7a","code_sha256_prefix":"f85537d953a50f7a","mcp_get_code":{"code_sha256":"f85537d953a50f7a"}},{"arxiv_id":"2307.07705","arxiv_id_is_arxiv":true,"paper":"/paper/cpet-effective-parameter-efficient-tuning-for","title":"CA-LoRA: Adapting Existing LoRA for Compressed LLMs to Enable Efficient Multi-Tasking on Personal Devices","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/ca-lora","path":"src/section-4.2.1/instruct-eval/drop.py","file_url":"https://github.com/thunlp/ca-lora/blob/HEAD/src/section-4.2.1/instruct-eval/drop.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, thunlp/ca-lora when it was checked","code_sha256":"20d15978d45a2320","code_sha256_prefix":"20d15978d45a2320","mcp_get_code":{"code_sha256":"20d15978d45a2320"}},{"arxiv_id":"2305.17926","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-are-not-fair-evaluators","title":"Large Language Models are not Fair Evaluators","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"i-eval/faireval","path":"FairEval.py","file_url":"https://github.com/i-eval/faireval/blob/HEAD/FairEval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, i-eval/faireval when it was checked","code_sha256":"f6629e230f783ee7","code_sha256_prefix":"f6629e230f783ee7","mcp_get_code":{"code_sha256":"f6629e230f783ee7"}},{"arxiv_id":"2305.17306","arxiv_id_is_arxiv":true,"paper":"/paper/chain-of-thought-hub-a-continuous-effort-to","title":"Chain-of-Thought Hub: A Continuous Effort to Measure Large Language Models' Reasoning Performance","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"franxyao/chain-of-thought-hub","path":"MMLU/run_mmlu_llama.py","file_url":"https://github.com/franxyao/chain-of-thought-hub/blob/HEAD/MMLU/run_mmlu_llama.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}},{"arxiv_id":"2305.12870","arxiv_id_is_arxiv":true,"paper":"/paper/lion-adversarial-distillation-of-closed","title":"Lion: Adversarial Distillation of Proprietary Large Language Models","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjiangcm/lion","path":"src/chatgpt_referee.py","file_url":"https://github.com/yjiangcm/lion/blob/HEAD/src/chatgpt_referee.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d9884b05d0bfa25","code_sha256_prefix":"2d9884b05d0bfa25","mcp_get_code":{"code_sha256":"2d9884b05d0bfa25"}},{"arxiv_id":"2305.12031","arxiv_id_is_arxiv":true,"paper":"/paper/clinical-camel-an-open-source-expert-level","title":"Clinical Camel: An Open Expert-Level Medical Language Model with Dialogue-Based Knowledge Encoding","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bowang-lab/clinical-camel","path":"evaluation/eval_gpt_review.py","file_url":"https://github.com/bowang-lab/clinical-camel/blob/HEAD/evaluation/eval_gpt_review.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, bowang-lab/clinical-camel, is not in the permissive set Syntology serves inline","code_sha256":"a6a3ac30bf6e7bcf","code_sha256_prefix":"a6a3ac30bf6e7bcf","mcp_get_code":{"code_sha256":"a6a3ac30bf6e7bcf"}},{"arxiv_id":"2009.03300","arxiv_id_is_arxiv":true,"paper":"/paper/measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ollmer/mmlu","path":"evaluate_flan.py","file_url":"https://github.com/ollmer/mmlu/blob/HEAD/evaluate_flan.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":"3383488ea82b6c15","code_sha256_prefix":"3383488ea82b6c15","mcp_get_code":{"code_sha256":"3383488ea82b6c15"}}],"record_sha256":"005b026bb5a5a264cf889805bfbaf1ad57302650733c58ca3eac05b619128c88","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}