{"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/llama-compute-query-states","entry":"llama_compute_query_states","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":7,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":7,"n_places_pointer_only_link_open":4,"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":2,"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":"2606.01967","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-01967","title":"Training Prompt Matters: State-Adaptive Optimization for Robust Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Eric8932/SAPO","path":"src/peft_custom/tuners/adaption_prompt.py","file_url":"https://github.com/Eric8932/SAPO/blob/HEAD/src/peft_custom/tuners/adaption_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Eric8932/SAPO when it was checked","code_sha256":"69890b767e2d4847","code_sha256_prefix":"69890b767e2d4847","mcp_get_code":{"code_sha256":"69890b767e2d4847"}},{"arxiv_id":"2604.11841","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-11841","title":"Polynomial Expansion Rank Adaptation: Enhancing Low-Rank Fine-Tuning with High-Order Interactions","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zhangwenhao6/PERA","path":"hira/tuners/adaption_prompt.py","file_url":"https://github.com/zhangwenhao6/PERA/blob/HEAD/hira/tuners/adaption_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, zhangwenhao6/PERA (NOASSERTION)","code_sha256":"84584d174a70b559","code_sha256_prefix":"84584d174a70b559","mcp_get_code":{"code_sha256":"84584d174a70b559"}},{"arxiv_id":"2403.08350","arxiv_id_is_arxiv":true,"paper":"/paper/coin-a-benchmark-of-continual-instruction","title":"CoIN: A Benchmark of Continual Instruction tuNing for Multimodel Large Language Model","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zackschen/coin","path":"CoIN/peft/tuners/adaption_prompt.py","file_url":"https://github.com/zackschen/coin/blob/HEAD/CoIN/peft/tuners/adaption_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 zhangwenhao6/PERA, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"84584d174a70b559","code_sha256_prefix":"84584d174a70b559","mcp_get_code":{"code_sha256":"84584d174a70b559"}},{"arxiv_id":"2310.18339","arxiv_id_is_arxiv":true,"paper":"/paper/moelora-an-moe-based-parameter-efficient-fine","title":"When MOE Meets LLMs: Parameter Efficient Fine-tuning for Multi-task Medical Applications","date":"2023-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"applied-machine-learning-lab/moelora-peft","path":"src/MLoRA/peft/tuners/adaption_prompt.py","file_url":"https://github.com/applied-machine-learning-lab/moelora-peft/blob/HEAD/src/MLoRA/peft/tuners/adaption_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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 zhangwenhao6/PERA, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"84584d174a70b559","code_sha256_prefix":"84584d174a70b559","mcp_get_code":{"code_sha256":"84584d174a70b559"}},{"arxiv_id":"2307.02053","arxiv_id_is_arxiv":true,"paper":"/paper/flacuna-unleashing-the-problem-solving-power","title":"Flacuna: Unleashing the Problem Solving Power of Vicuna using FLAN Fine-Tuning","date":"2023-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"declare-lab/flacuna","path":"peft_flacuna/tuners/adaption_prompt.py","file_url":"https://github.com/declare-lab/flacuna/blob/HEAD/peft_flacuna/tuners/adaption_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, declare-lab/flacuna when it was checked","code_sha256":"84584d174a70b559","code_sha256_prefix":"84584d174a70b559","mcp_get_code":{"code_sha256":"84584d174a70b559"}},{"arxiv_id":"Wang_SMoLoRA_Exploring_and_Defying_Dual_Catastrophic_Forgetting_in_Continual_Visual_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_SMoLoRA_Exploring_and_Defying_Dual_Catastrophic_Forgetting_in_Continual_Visual_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Minato-Zackie/SMoLoRA","path":"PEFT_SMoLoRA/peft/tuners/adaption_prompt.py","file_url":"https://github.com/Minato-Zackie/SMoLoRA/blob/HEAD/PEFT_SMoLoRA/peft/tuners/adaption_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 zhangwenhao6/PERA, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"84584d174a70b559","code_sha256_prefix":"84584d174a70b559","mcp_get_code":{"code_sha256":"84584d174a70b559"}},{"arxiv_id":"2025.emnlp-main.609","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.609","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zackschen/CoIN","path":"CoIN/peft/tuners/adaption_prompt.py","file_url":"https://github.com/zackschen/CoIN/blob/HEAD/CoIN/peft/tuners/adaption_prompt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 zhangwenhao6/PERA, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"84584d174a70b559","code_sha256_prefix":"84584d174a70b559","mcp_get_code":{"code_sha256":"84584d174a70b559"}}],"record_sha256":"0ce9441247db98a38e668b4462c9005c57a9c7ab30d5aa9e21ea504921af8cd7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}