{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/is-lora-model","entry":"is_lora_model","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":2,"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":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2608.18096","paper":"/paper/arxiv-2608-18096","title":"MAVEN: A Macro-Societal Value Evaluation Framework of Multimodal Content with Compact Aligned Evaluators","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"zzzzzzzzjj/MAVEN","path":"src/utils.py","file_url":"https://github.com/zzzzzzzzjj/MAVEN/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"92f0254a3c688120","mcp_get_code":{"code_sha256":"92f0254a3c688120"}},{"arxiv_id":"2607.04364","paper":"/paper/arxiv-2607-04364","title":"RL Forgets! Towards Continual Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"MaolinLuo/CPO","path":"src/utils.py","file_url":"https://github.com/MaolinLuo/CPO/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d8fd759aa8357c1e","mcp_get_code":{"code_sha256":"d8fd759aa8357c1e"}},{"arxiv_id":"2512.23461","paper":"/paper/arxiv-2512-23461","title":"Eliminating Inductive Bias in Reward Models with Information-Theoretic Guidance","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Qwen-Applications/DIR","path":"reward_models/utils.py","file_url":"https://github.com/Qwen-Applications/DIR/blob/HEAD/reward_models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f8e7d855924e7e64","mcp_get_code":{"code_sha256":"f8e7d855924e7e64"}},{"arxiv_id":"2510.10963","paper":"/paper/arxiv-2510-10963","title":"APLOT: Robust Reward Modeling via Adaptive Preference Learning with Optimal Transport","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"BIRlz/APLOT","path":"reward_models/utils.py","file_url":"https://github.com/BIRlz/APLOT/blob/HEAD/reward_models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f8e7d855924e7e64","mcp_get_code":{"code_sha256":"f8e7d855924e7e64"}},{"arxiv_id":"2406.10216","paper":"/paper/regularizing-hidden-states-enables-learning","title":"Regularizing Hidden States Enables Learning Generalizable Reward Model for LLMs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangrui2015/generalizable-reward-model","path":"reward_models/utils.py","file_url":"https://github.com/yangrui2015/generalizable-reward-model/blob/HEAD/reward_models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f8e7d855924e7e64","mcp_get_code":{"code_sha256":"f8e7d855924e7e64"}}]}