{"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/load-hf-lm-and-tokenizer","entry":"load_hf_lm_and_tokenizer","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":21,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":0,"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":3,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":19,"n_places_pointer_only_link_open":11,"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":0,"ran_fixture":0,"ran":1,"unverified":2},"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.10528","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-10528","title":"Representation-Aware Advantage Estimation: Your Reward Model Provides More Than A Scalar Output","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"fanqiwan/FuseAI","path":"FuseO1-Preview/math_evaluation/model_utils.py","file_url":"https://github.com/fanqiwan/FuseAI/blob/HEAD/FuseO1-Preview/math_evaluation/model_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, fanqiwan/FuseAI when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2604.11056","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11056","title":"Where Hindsight Credit Can Reside: A Signed-Capacity View of Token Updates in RLVR","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"QwenLM/Qwen2.5-Math","path":"evaluation/model_utils.py","file_url":"https://github.com/QwenLM/Qwen2.5-Math/blob/HEAD/evaluation/model_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, QwenLM/Qwen2.5-Math when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2604.08281","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-08281","title":"When to Trust Tools? Adaptive Tool Trust Calibration For Tool-Integrated Math Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"00Dreamer00/ATTC","path":"model_utils.py","file_url":"https://github.com/00Dreamer00/ATTC/blob/HEAD/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2604.00698","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-00698","title":"Learning to Hint for Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Andree-9/HiLL","path":"eval/qwen_evaluation/model_utils.py","file_url":"https://github.com/Andree-9/HiLL/blob/HEAD/eval/qwen_evaluation/model_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, Andree-9/HiLL when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2603.19470","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-19470","title":"Adaptive Layerwise Perturbation: Unifying Off-Policy Corrections for LLM RL","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"amazon-science/adaptive-layerwise-perturbation","path":"multi-turn/eval/qwen_evaluation/model_utils.py","file_url":"https://github.com/amazon-science/adaptive-layerwise-perturbation/blob/HEAD/multi-turn/eval/qwen_evaluation/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2602.13773","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-13773","title":"On Representation Redundancy in Large-Scale Instruction Tuning Data Selection","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"tdano1/CRDS","path":"main/eval/eval_utils.py","file_url":"https://github.com/tdano1/CRDS/blob/HEAD/main/eval/eval_utils.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":"5128feaec154eb63","code_sha256_prefix":"5128feaec154eb63","mcp_get_code":{"code_sha256":"5128feaec154eb63"}},{"arxiv_id":"2602.03143","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03143","title":"Self-Hinting Language Models Enhance Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"BaohaoLiao/SAGE","path":"eval/qwen_evaluation/model_utils.py","file_url":"https://github.com/BaohaoLiao/SAGE/blob/HEAD/eval/qwen_evaluation/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2601.03895","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03895","title":"All-Quadrant Bounded Clipping GRPO: Closing the Unbounded Blind Spot for Stable and Generalizable Training","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"chi2liu/ABC-GRPO","path":"eval_math/model_utils.py","file_url":"https://github.com/chi2liu/ABC-GRPO/blob/HEAD/eval_math/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2507.13266","arxiv_id_is_arxiv":true,"paper":"/paper/questa-expanding-reasoning-capacity-in-llms","title":"QuestA: Expanding Reasoning Capacity in LLMs via Question Augmentation","date":"2025-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"foreverlasting1202/QuestA","path":"AReaL/evaluation/model_utils.py","file_url":"https://github.com/foreverlasting1202/QuestA/blob/HEAD/AReaL/evaluation/model_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, foreverlasting1202/QuestA when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2505.19716","arxiv_id_is_arxiv":true,"paper":"/paper/concise-reasoning-big-gains-pruning-long","title":"Concise Reasoning, Big Gains: Pruning Long Reasoning Trace with Difficulty-Aware Prompting","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evanwu1125/litecot","path":"eval/Qwen2.5-Math/evaluation/model_utils.py","file_url":"https://github.com/evanwu1125/litecot/blob/HEAD/eval/Qwen2.5-Math/evaluation/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2504.20571","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-for-reasoning-in-large","title":"Reinforcement Learning for Reasoning in Large Language Models with One Training Example","date":"2025-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ypwang61/one-shot-rlvr","path":"Qwen2.5-Eval/evaluation/model_utils.py","file_url":"https://github.com/ypwang61/one-shot-rlvr/blob/HEAD/Qwen2.5-Eval/evaluation/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2504.16828","arxiv_id_is_arxiv":true,"paper":"/paper/process-reward-models-that-think","title":"Process Reward Models That Think","date":"2025-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mukhal/thinkprm","path":"search-and-learn/evaluation/model_utils.py","file_url":"https://github.com/mukhal/thinkprm/blob/HEAD/search-and-learn/evaluation/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2504.05185","arxiv_id_is_arxiv":true,"paper":"/paper/concise-reasoning-via-reinforcement-learning","title":"Concise Reasoning via Reinforcement Learning","date":"2025-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-wand/concise-reasoning","path":"eval/model_utils.py","file_url":"https://github.com/ai-wand/concise-reasoning/blob/HEAD/eval/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2502.12853","arxiv_id_is_arxiv":true,"paper":"/paper/s-2-r-teaching-llms-to-self-verify-and-self","title":"S$^2$R: Teaching LLMs to Self-verify and Self-correct via Reinforcement Learning","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nineabyss/s2r","path":"sample/model_utils.py","file_url":"https://github.com/nineabyss/s2r/blob/HEAD/sample/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2502.06773","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-emergence-of-thinking-in-llms-i","title":"On the Emergence of Thinking in LLMs I: Searching for the Right Intuition","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuanghaoYe/Emergence-of-Thinking","path":"evaluation/model_utils.py","file_url":"https://github.com/GuanghaoYe/Emergence-of-Thinking/blob/HEAD/evaluation/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2412.03187","arxiv_id_is_arxiv":true,"paper":"/paper/weighted-reward-preference-optimization-for","title":"Weighted-Reward Preference Optimization for Implicit Model Fusion","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fanqiwan/fuseai","path":"FuseO1-Preview/math_evaluation/model_utils.py","file_url":"https://github.com/fanqiwan/fuseai/blob/HEAD/FuseO1-Preview/math_evaluation/model_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, fanqiwan/fuseai when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2410.09008","arxiv_id_is_arxiv":true,"paper":"/paper/supercorrect-supervising-and-correcting","title":"SuperCorrect: Supervising and Correcting Language Models with Error-Driven Insights","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangLing0818/SuperCorrect-llm","path":"model_utils.py","file_url":"https://github.com/YangLing0818/SuperCorrect-llm/blob/HEAD/model_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, YangLing0818/SuperCorrect-llm when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2410.07985","arxiv_id_is_arxiv":true,"paper":"/paper/omni-math-a-universal-olympiad-level","title":"Omni-MATH: A Universal Olympiad Level Mathematic Benchmark For Large Language Models","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kbsdjames/omni-math-rule","path":"evaluation/model_utils.py","file_url":"https://github.com/kbsdjames/omni-math-rule/blob/HEAD/evaluation/model_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, kbsdjames/omni-math-rule when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2408.07471","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-and-modeling-correlations-in","title":"Bridging and Modeling Correlations in Pairwise Data for Direct Preference Optimization","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YJiangcm/BMC","path":"eval/math/eval/model_utils.py","file_url":"https://github.com/YJiangcm/BMC/blob/HEAD/eval/math/eval/model_utils.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 YangLing0818/SuperCorrect-llm, and GitHub detected no licence in that repository when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2405.14365","arxiv_id_is_arxiv":true,"paper":"/paper/jiuzhang3-0-efficiently-improving","title":"JiuZhang3.0: Efficiently Improving Mathematical Reasoning by Training Small Data Synthesis Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/jiuzhang3.0","path":"eval/model_utils.py","file_url":"https://github.com/rucaibox/jiuzhang3.0/blob/HEAD/eval/model_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, rucaibox/jiuzhang3.0 when it was checked","code_sha256":"ee71a94d9dd1b8e9","code_sha256_prefix":"ee71a94d9dd1b8e9","mcp_get_code":{"code_sha256":"ee71a94d9dd1b8e9"}},{"arxiv_id":"2310.06830","arxiv_id_is_arxiv":true,"paper":"/paper/lemur-harmonizing-natural-language-and-code","title":"Lemur: Harmonizing Natural Language and Code for Language Agents","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenLemur/Lemur","path":"xchat/eval/utils.py","file_url":"https://github.com/OpenLemur/Lemur/blob/HEAD/xchat/eval/utils.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":"be8165ca7e91d372","code_sha256_prefix":"be8165ca7e91d372","mcp_get_code":{"code_sha256":"be8165ca7e91d372"}}],"record_sha256":"6194c5ced18cf7a5f6ee180ec076a2214450045659b7413a5a74bb22c8b8fa42","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}