{"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/prepare-prompts","entry":"prepare_prompts","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":11,"n_papers_ran":6,"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":9,"n_samples_ran":6,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":5,"unverified":3},"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.27998","paper":"/paper/arxiv-2604-27998","title":"Latent-GRPO: Group Relative Policy Optimization for Latent Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"DJC-GO-SOLO/Latent-SFT","path":"sglang_latent_reasoning_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","file_url":"https://github.com/DJC-GO-SOLO/Latent-SFT/blob/HEAD/sglang_latent_reasoning_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e5914c7114b177c6","mcp_get_code":{"code_sha256":"e5914c7114b177c6"}},{"arxiv_id":"2602.11683","paper":"/paper/arxiv-2602-11683","title":"THINKROUTER: Efficient Reasoning via Routing Thinking between Latent and Discrete Spaces","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"eric-ai-lab/Soft-Thinking","path":"sglang_soft_thinking_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","file_url":"https://github.com/eric-ai-lab/Soft-Thinking/blob/HEAD/sglang_soft_thinking_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e5914c7114b177c6","mcp_get_code":{"code_sha256":"e5914c7114b177c6"}},{"arxiv_id":"2601.18999","paper":"/paper/arxiv-2601-18999","title":"Randomization Boosts KV Caching, Learning Balances Query Load: A Joint Perspective","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"fzwark/KVRouting","path":"sglang-0.4.6/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","file_url":"https://github.com/fzwark/KVRouting/blob/HEAD/sglang-0.4.6/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e5914c7114b177c6","mcp_get_code":{"code_sha256":"e5914c7114b177c6"}},{"arxiv_id":"2601.04537","paper":"/paper/arxiv-2601-04537","title":"Linear Dynamics in the RLVR Training of Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Miaow-Lab/RLVR-Linearity","path":"evaluation/inference_vllm_offline.py","file_url":"https://github.com/Miaow-Lab/RLVR-Linearity/blob/HEAD/evaluation/inference_vllm_offline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6404f02a3872c91e","mcp_get_code":{"code_sha256":"6404f02a3872c91e"}},{"arxiv_id":"2412.07618","paper":"/paper/adapting-to-non-stationary-environments-multi","title":"Adapting to Non-Stationary Environments: Multi-Armed Bandit Enhanced Retrieval-Augmented Generation on Knowledge Graphs","date":"2024-12-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"futureeeeee/dynamic-rag","path":"utils.py","file_url":"https://github.com/futureeeeee/dynamic-rag/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"884fefcc0d37c80e","mcp_get_code":{"code_sha256":"884fefcc0d37c80e"}},{"arxiv_id":"2410.10093","paper":"/paper/how-to-leverage-demonstration-data-in","title":"How to Leverage Demonstration Data in Alignment for Large Language Model? A Self-Imitation Learning Perspective","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tengxiao1/GSIL","path":"gsil/generate.py","file_url":"https://github.com/tengxiao1/GSIL/blob/HEAD/gsil/generate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65ab2e38274df088","mcp_get_code":{"code_sha256":"65ab2e38274df088"}},{"arxiv_id":"2410.02760","paper":"/paper/erasing-conceptual-knowledge-from-language","title":"Erasing Conceptual Knowledge from Language Models","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohitgandikota/erasing-llm","path":"trainscripts/erase.py","file_url":"https://github.com/rohitgandikota/erasing-llm/blob/HEAD/trainscripts/erase.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"822e559e4fe066e8","mcp_get_code":{"code_sha256":"822e559e4fe066e8"}},{"arxiv_id":"2406.02888","paper":"/paper/hydra-model-factorization-framework-for-black","title":"HYDRA: Model Factorization Framework for Black-Box LLM Personalization","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"night-chen/HYDRA","path":"adapter/generate/generate.py","file_url":"https://github.com/night-chen/HYDRA/blob/HEAD/adapter/generate/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a5c4afa103aa6d76","mcp_get_code":{"code_sha256":"a5c4afa103aa6d76"}},{"arxiv_id":"2405.17888","paper":"/paper/getting-more-juice-out-of-the-sft-data-reward","title":"Getting More Juice Out of the SFT Data: Reward Learning from Human Demonstration Improves SFT for LLM Alignment","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonjiaxiangli/reward_learning_sft","path":"src/evaluate.py","file_url":"https://github.com/jasonjiaxiangli/reward_learning_sft/blob/HEAD/src/evaluate.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":"6c6b96dbc3ac9f5a","mcp_get_code":{"code_sha256":"6c6b96dbc3ac9f5a"}},{"arxiv_id":"2405.17888","paper":"/paper/getting-more-juice-out-of-the-sft-data-reward","title":"Getting More Juice Out of the SFT Data: Reward Learning from Human Demonstration Improves SFT for LLM Alignment","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonjiaxiangli/reward_learning_sft","path":"src/generate.py","file_url":"https://github.com/jasonjiaxiangli/reward_learning_sft/blob/HEAD/src/generate.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":"1eb55970dd4151b3","mcp_get_code":{"code_sha256":"1eb55970dd4151b3"}},{"arxiv_id":"2405.03000","paper":"/paper/medadapter-efficient-test-time-adaptation-of","title":"MedAdapter: Efficient Test-Time Adaptation of Large Language Models towards Medical Reasoning","date":"2024-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wshi83/MedAdapter","path":"reward_model/orm/orm_guide.py","file_url":"https://github.com/wshi83/MedAdapter/blob/HEAD/reward_model/orm/orm_guide.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a5c4afa103aa6d76","mcp_get_code":{"code_sha256":"a5c4afa103aa6d76"}},{"arxiv_id":"2401.06853","paper":"/paper/large-language-models-can-learn-temporal","title":"Large Language Models Can Learn Temporal Reasoning","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiongsiheng/tg-llm","path":"src/Example_accelerate_inference.py","file_url":"https://github.com/xiongsiheng/tg-llm/blob/HEAD/src/Example_accelerate_inference.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"67e14cf8263186c1","mcp_get_code":{"code_sha256":"67e14cf8263186c1"}}]}