{"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/last-boxed-only","entry":"last_boxed_only","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":8,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":6,"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":4,"ran_fixture":0,"ran":0,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2604.18124","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18124","title":"TLoRA: Task-aware Low Rank Adaptation of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Rambo-Yi/TLora","path":"evaluate/math/util.py","file_url":"https://github.com/Rambo-Yi/TLora/blob/HEAD/evaluate/math/util.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, Rambo-Yi/TLora when it was checked","code_sha256":"8720975b15d076e8","code_sha256_prefix":"8720975b15d076e8","mcp_get_code":{"code_sha256":"8720975b15d076e8"}},{"arxiv_id":"2511.08043","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-08043","title":"DYNAACT: Large Language Model Reasoning with Dynamic Action Spaces","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"zhaoxlpku/DynaAct","path":"math_utils.py","file_url":"https://github.com/zhaoxlpku/DynaAct/blob/HEAD/math_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhaoxlpku/DynaAct when it was checked","code_sha256":"286295fcce7c339c","code_sha256_prefix":"286295fcce7c339c","mcp_get_code":{"code_sha256":"286295fcce7c339c"}},{"arxiv_id":"2505.10518","arxiv_id_is_arxiv":true,"paper":"/paper/multi-token-prediction-needs-registers","title":"Multi-Token Prediction Needs Registers","date":"2025-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nasosger/mutor","path":"language_modeling/src/eval/math_utils.py","file_url":"https://github.com/nasosger/mutor/blob/HEAD/language_modeling/src/eval/math_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"855a4d8c22777aac","code_sha256_prefix":"855a4d8c22777aac","mcp_get_code":{"code_sha256":"855a4d8c22777aac"}},{"arxiv_id":"2408.04556","arxiv_id_is_arxiv":true,"paper":"/paper/bias-aware-low-rank-adaptation-mitigating","title":"BA-LoRA: Bias-Alleviating Low-Rank Adaptation to Mitigate Catastrophic Inheritance in Large Language Models","date":"2024-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyp-jlu-ai/ba-lora","path":"inference/util.py","file_url":"https://github.com/cyp-jlu-ai/ba-lora/blob/HEAD/inference/util.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, cyp-jlu-ai/ba-lora when it was checked","code_sha256":"8720975b15d076e8","code_sha256_prefix":"8720975b15d076e8","mcp_get_code":{"code_sha256":"8720975b15d076e8"}},{"arxiv_id":"2406.14024","arxiv_id_is_arxiv":true,"paper":"/paper/the-reason-behind-good-or-bad-towards-a","title":"LLM Critics Help Catch Bugs in Mathematics: Towards a Better Mathematical Verifier with Natural Language Feedback","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kbsdjames/math-minos","path":"evaluation/util.py","file_url":"https://github.com/kbsdjames/math-minos/blob/HEAD/evaluation/util.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, kbsdjames/math-minos when it was checked","code_sha256":"8720975b15d076e8","code_sha256_prefix":"8720975b15d076e8","mcp_get_code":{"code_sha256":"8720975b15d076e8"}},{"arxiv_id":"2405.15179","arxiv_id_is_arxiv":true,"paper":"/paper/vb-lora-extreme-parameter-efficient-fine","title":"VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Banks","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leo-yangli/VB-LoRA","path":"math_instruction_tuning/instruction_tuning_eval/utils.py","file_url":"https://github.com/leo-yangli/VB-LoRA/blob/HEAD/math_instruction_tuning/instruction_tuning_eval/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, leo-yangli/VB-LoRA when it was checked","code_sha256":"e9a9686489ca49a9","code_sha256_prefix":"e9a9686489ca49a9","mcp_get_code":{"code_sha256":"e9a9686489ca49a9"}},{"arxiv_id":"2405.06680","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-compositional-deficiency-of","title":"Exploring the Compositional Deficiency of Large Language Models in Mathematical Reasoning","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tongjingqi/MathTrap","path":"eval/util.py","file_url":"https://github.com/tongjingqi/MathTrap/blob/HEAD/eval/util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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 Rambo-Yi/TLora, and GitHub detected no licence in that repository when it was checked","code_sha256":"8720975b15d076e8","code_sha256_prefix":"8720975b15d076e8","mcp_get_code":{"code_sha256":"8720975b15d076e8"}},{"arxiv_id":"2404.02078","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-llm-reasoning-generalists-with","title":"Advancing LLM Reasoning Generalists with Preference Trees","date":"2024-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openbmb/eurus","path":"eval/utils/util.py","file_url":"https://github.com/openbmb/eurus/blob/HEAD/eval/utils/util.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":"855a4d8c22777aac","code_sha256_prefix":"855a4d8c22777aac","mcp_get_code":{"code_sha256":"855a4d8c22777aac"}}],"record_sha256":"e2dde2e03b3d8844749638b4bff7bddcde07394a9de8d0b9e55afa5b14273fea","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}