{"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/jsonify","entry":"jsonify","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":32,"n_papers_ran":32,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":31,"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":1,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":32,"n_places_pointer_only":5,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":1,"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":"2606.02001","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-02001","title":"Scaling Agentic Capabilities via Grounded Interaction Synthesis","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Eric8932/GAIS","path":"src/llamafactory/api/common.py","file_url":"https://github.com/Eric8932/GAIS/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2605.28822","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-28822","title":"Lightweight Multimodal LLM-Enabled Cost-Effective Defect Grading of Power Transmission Equipment","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hiyouga/LlamaFactory","path":"src/llamafactory/api/common.py","file_url":"https://github.com/hiyouga/LlamaFactory/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2605.20722","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20722","title":"AGPO: Adaptive Group Policy Optimization with Dual Statistical Feedback","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"wandugu/paper_agpo","path":"src/llamafactory/api/common.py","file_url":"https://github.com/wandugu/paper_agpo/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2604.12321","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-12321","title":"ToxiTrace: Gradient-Aligned Training for Explainable Chinese Toxicity Detection","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"hiyouga/LLaMA-Factory","path":"src/llamafactory/api/common.py","file_url":"https://github.com/hiyouga/LLaMA-Factory/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2602.14451","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-14451","title":"Precedent-Informed Reasoning: Mitigating Overthinking in Large Reasoning Models via Test-Time Precedent Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Fhujinwu/TLM","path":"src/llamafactory/api/common.py","file_url":"https://github.com/Fhujinwu/TLM/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2601.21796","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21796","title":"KID: Knowledge-Injected Dual-Head Learning for Knowledge-Grounded Harmful Meme Detection","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"PotatoDog1669/KID","path":"src/llamafactory/api/common.py","file_url":"https://github.com/PotatoDog1669/KID/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2510.21473","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-21473","title":"MRO: Enhancing Reasoning in Diffusion Language Models via Multi-Reward Optimization","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"wangclnlp/MRO","path":"src/llamafactory/api/common.py","file_url":"https://github.com/wangclnlp/MRO/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2510.09358","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-09358","title":"Boosting Multi-modal Keyphrase Prediction with Dynamic Chain-of-Thought in Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"bytedance/DynamicCoT","path":"src/llamafactory/api/common.py","file_url":"https://github.com/bytedance/DynamicCoT/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2510.07739","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07739","title":"MeSH: Memory-as-State-Highways for Recursive Transformers","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"LivingFutureLab/MeSH","path":"src/llamafactory/api/common.py","file_url":"https://github.com/LivingFutureLab/MeSH/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2506.14574","arxiv_id_is_arxiv":true,"paper":"/paper/tgdpo-harnessing-token-level-reward-guidance","title":"TGDPO: Harnessing Token-Level Reward Guidance for Enhancing Direct Preference Optimization","date":"2025-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dvlab-research/TGDPO","path":"src/llamafactory/api/common.py","file_url":"https://github.com/dvlab-research/TGDPO/blob/HEAD/src/llamafactory/api/common.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, dvlab-research/TGDPO when it was checked","code_sha256":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2506.13796","arxiv_id_is_arxiv":true,"paper":"/paper/climatechat-designing-data-and-methods-for","title":"ClimateChat: Designing Data and Methods for Instruction Tuning LLMs to Answer Climate Change Queries","date":"2025-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-esis/jiuzhou","path":"src/llamafactory/api/common.py","file_url":"https://github.com/thu-esis/jiuzhou/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2505.20674","arxiv_id_is_arxiv":true,"paper":"/paper/pretraining-language-models-to-ponder-in","title":"Pretraining Language Models to Ponder in Continuous Space","date":"2025-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lumia-group/ponderinglm","path":"src/llamafactory/api/common.py","file_url":"https://github.com/lumia-group/ponderinglm/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2505.18672","arxiv_id_is_arxiv":true,"paper":"/paper/does-representation-intervention-really","title":"Does Representation Intervention Really Identify Desired Concepts and Elicit Alignment?","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/COCA","path":"src/llamafactory/api/common.py","file_url":"https://github.com/tmlr-group/COCA/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2505.16869","arxiv_id_is_arxiv":true,"paper":"/paper/mpo-multilingual-safety-alignment-via-reward","title":"MPO: Multilingual Safety Alignment via Reward Gap Optimization","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"circle-hit/MPO","path":"src/llamafactory/api/common.py","file_url":"https://github.com/circle-hit/MPO/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2503.10615","arxiv_id_is_arxiv":true,"paper":"/paper/r1-onevision-advancing-generalized-multimodal","title":"R1-Onevision: Advancing Generalized Multimodal Reasoning through Cross-Modal Formalization","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Fancy-MLLM/R1-onevision","path":"LLaMA-Factory/src/llamafactory/api/common.py","file_url":"https://github.com/Fancy-MLLM/R1-onevision/blob/HEAD/LLaMA-Factory/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2502.14340","arxiv_id_is_arxiv":true,"paper":"/paper/earlier-tokens-contribute-more-learning","title":"Earlier Tokens Contribute More: Learning Direct Preference Optimization From Temporal Decay Perspective","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LotuSrc/D2PO","path":"src/llamafactory/api/common.py","file_url":"https://github.com/LotuSrc/D2PO/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2501.17703","arxiv_id_is_arxiv":true,"paper":"/paper/critique-fine-tuning-learning-to-critique-is","title":"Critique Fine-Tuning: Learning to Critique is More Effective than Learning to Imitate","date":"2025-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TIGER-AI-Lab/CritiqueFineTuning","path":"train/LLaMA-Factory/src/llamafactory/api/common.py","file_url":"https://github.com/TIGER-AI-Lab/CritiqueFineTuning/blob/HEAD/train/LLaMA-Factory/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2411.06839","arxiv_id_is_arxiv":true,"paper":"/paper/llm-neo-parameter-efficient-knowledge","title":"LLM-Neo: Parameter Efficient Knowledge Distillation for Large Language Models","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wutaiqiang/shadow-ft","path":"src/llamafactory/api/common.py","file_url":"https://github.com/wutaiqiang/shadow-ft/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2410.18640","arxiv_id_is_arxiv":true,"paper":"/paper/weak-to-strong-preference-optimization","title":"Weak-to-Strong Preference Optimization: Stealing Reward from Weak Aligned Model","date":"2024-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zwhong714/weak-to-strong-preference-optimization","path":"src/llamafactory/api/common.py","file_url":"https://github.com/zwhong714/weak-to-strong-preference-optimization/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2410.10209","arxiv_id_is_arxiv":true,"paper":"/paper/effi-code-unleashing-code-efficiency-in","title":"EffiCoder: Enhancing Code Generation in Large Language Models through Efficiency-Aware Fine-tuning","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangd1999/EffiCoder","path":"LLaMA-Factory/src/llamafactory/api/common.py","file_url":"https://github.com/huangd1999/EffiCoder/blob/HEAD/LLaMA-Factory/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2410.08081","arxiv_id_is_arxiv":true,"paper":"/paper/packing-analysis-packing-is-more-appropriate","title":"Packing Analysis: Packing Is More Appropriate for Large Models or Datasets in Supervised Fine-tuning","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shuhewang1998/packing-analysis","path":"src/llmtuner/api/common.py","file_url":"https://github.com/shuhewang1998/packing-analysis/blob/HEAD/src/llmtuner/api/common.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, shuhewang1998/packing-analysis when it was checked","code_sha256":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2409.13203","arxiv_id_is_arxiv":true,"paper":"/paper/neural-symbolic-collaborative-distillation","title":"Neural-Symbolic Collaborative Distillation: Advancing Small Language Models for Complex Reasoning Tasks","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xnhyacinth/nesycd","path":"src/llamafactory/api/common.py","file_url":"https://github.com/xnhyacinth/nesycd/blob/HEAD/src/llamafactory/api/common.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, xnhyacinth/nesycd when it was checked","code_sha256":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2409.13183","arxiv_id_is_arxiv":true,"paper":"/paper/textit-skintern-internalizing-symbolic","title":"$\\textit{SKIntern}$: Internalizing Symbolic Knowledge for Distilling Better CoT Capabilities into Small Language Models","date":"2024-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xnhyacinth/skintern","path":"src/llamafactory/api/common.py","file_url":"https://github.com/xnhyacinth/skintern/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2407.17770","arxiv_id_is_arxiv":true,"paper":"/paper/boteval-facilitating-interactive-human","title":"BotEval: Facilitating Interactive Human Evaluation","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isi-nlp/boteval","path":"boteval/utils.py","file_url":"https://github.com/isi-nlp/boteval/blob/HEAD/boteval/utils.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":"ed39231425f287ab","code_sha256_prefix":"ed39231425f287ab","mcp_get_code":{"code_sha256":"ed39231425f287ab"}},{"arxiv_id":"2407.08044","arxiv_id_is_arxiv":true,"paper":"/paper/rolora-fine-tuning-rotated-outlier-free-llms","title":"RoLoRA: Fine-tuning Rotated Outlier-free LLMs for Effective Weight-Activation Quantization","date":"2024-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangowen/rolora","path":"src/llamafactory/api/common.py","file_url":"https://github.com/huangowen/rolora/blob/HEAD/src/llamafactory/api/common.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, huangowen/rolora when it was checked","code_sha256":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2406.04496","arxiv_id_is_arxiv":true,"paper":"/paper/time-sensitive-knowledge-editing-through","title":"Time Sensitive Knowledge Editing through Efficient Finetuning","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiyouga/llama-factory","path":"src/llamafactory/api/common.py","file_url":"https://github.com/hiyouga/llama-factory/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2405.04760","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-for-cyber-security-a","title":"Large Language Models for Cyber Security: A Systematic Literature Review","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiyouga/llama-efficient-tuning","path":"src/llamafactory/api/common.py","file_url":"https://github.com/hiyouga/llama-efficient-tuning/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2403.13372","arxiv_id_is_arxiv":true,"paper":"/paper/llamafactory-unified-efficient-fine-tuning-of","title":"LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Models","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BachOzean/TadE","path":"src/llamafactory/api/common.py","file_url":"https://github.com/BachOzean/TadE/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2312.03612","arxiv_id_is_arxiv":true,"paper":"/paper/physical-symbolic-optimization","title":"Physical Symbolic Optimization","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cavalab/srbench","path":"experiment/utils.py","file_url":"https://github.com/cavalab/srbench/blob/HEAD/experiment/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, cavalab/srbench, is not in the permissive set Syntology serves inline","code_sha256":"a39ece6979136a35","code_sha256_prefix":"a39ece6979136a35","mcp_get_code":{"code_sha256":"a39ece6979136a35"}},{"arxiv_id":"2303.18223","arxiv_id_is_arxiv":true,"paper":"/paper/a-survey-of-large-language-models","title":"A Survey of Large Language Models","date":"2023-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xusenlinzy/api-for-open-llm","path":"api/common.py","file_url":"https://github.com/xusenlinzy/api-for-open-llm/blob/HEAD/api/common.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":"e6f6857273f4b6df","code_sha256_prefix":"e6f6857273f4b6df","mcp_get_code":{"code_sha256":"e6f6857273f4b6df"}},{"arxiv_id":"2025.findings-acl.462","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.462","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Javkonline/AMoPO","path":"src/llamafactory/api/common.py","file_url":"https://github.com/Javkonline/AMoPO/blob/HEAD/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}},{"arxiv_id":"2025.emnlp-main.900","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.900","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Ayon128/BANMIME","path":"Misogyny_Code/Fine-Tuning/src/llamafactory/api/common.py","file_url":"https://github.com/Ayon128/BANMIME/blob/HEAD/Misogyny_Code/Fine-Tuning/src/llamafactory/api/common.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":"57583cf880d95444","code_sha256_prefix":"57583cf880d95444","mcp_get_code":{"code_sha256":"57583cf880d95444"}}],"record_sha256":"1c10fc67a2d8792515cffbbd998c423a966a7cf53760bd7c49a1ca5e4295854c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}