{"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/run-and-read-all","entry":"run_and_read_all","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":15,"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":15,"n_places_pointer_only":8,"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":"2608.19920","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-19920","title":"Learning how to Forget: Fine-tuning for Long-Context Sparse Attention","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"vllm-project/vllm","path":"vllm/collect_env.py","file_url":"https://github.com/vllm-project/vllm/blob/HEAD/vllm/collect_env.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":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2606.00516","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00516","title":"Threshold-Based Exclusive Batching for LLM Inference","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"weifang231/eb-vllm","path":"vllm/collect_env.py","file_url":"https://github.com/weifang231/eb-vllm/blob/HEAD/vllm/collect_env.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":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2601.20309","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-20309","title":"SuperInfer: SLO-Aware Rotary Scheduling and Memory Management for LLM Inference on Superchips","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Supercomputing-System-AI-Lab/SuperInfer","path":"collect_env.py","file_url":"https://github.com/Supercomputing-System-AI-Lab/SuperInfer/blob/HEAD/collect_env.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":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2512.09472","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-09472","title":"WarmServe: Enabling One-for-Many GPU Prewarming for Multi-LLM Serving","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"LLMServe/WarmServe","path":"vllm-0.6.3.post1/collect_env.py","file_url":"https://github.com/LLMServe/WarmServe/blob/HEAD/vllm-0.6.3.post1/collect_env.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":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2411.04750","arxiv_id_is_arxiv":true,"paper":"/paper/spectrafm-tuning-into-stellar-foundation","title":"SpectraFM: Tuning into Stellar Foundation Models","date":null,"month_inferred_from_arxiv_id":"2024-11","title_source":"archive","repo":"NolanKoblischke/SpectraFM_NeurIPS_FM4Science","path":"model_core/stellarperceptron/torch_utils_collect_env.py","file_url":"https://github.com/NolanKoblischke/SpectraFM_NeurIPS_FM4Science/blob/HEAD/model_core/stellarperceptron/torch_utils_collect_env.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, NolanKoblischke/SpectraFM_NeurIPS_FM4Science when it was checked","code_sha256":"84905132fbc263e3","code_sha256_prefix":"84905132fbc263e3","mcp_get_code":{"code_sha256":"84905132fbc263e3"}},{"arxiv_id":"2410.00428","arxiv_id_is_arxiv":true,"paper":"/paper/layerkv-optimizing-large-language-model","title":"LayerKV: Optimizing Large Language Model Serving with Layer-wise KV Cache Management","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intelligent-machine-learning/glake","path":"GLakeServe/collect_env.py","file_url":"https://github.com/intelligent-machine-learning/glake/blob/HEAD/GLakeServe/collect_env.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":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2408.08295","arxiv_id_is_arxiv":true,"paper":"/paper/slca-unleash-the-power-of-sequential-fine","title":"SLCA++: Unleash the Power of Sequential Fine-tuning for Continual Learning with Pre-training","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gengdavid/slca","path":"collect_env.py","file_url":"https://github.com/gengdavid/slca/blob/HEAD/collect_env.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 NolanKoblischke/SpectraFM_NeurIPS_FM4Science, and GitHub detected no licence in that repository when it was checked","code_sha256":"84905132fbc263e3","code_sha256_prefix":"84905132fbc263e3","mcp_get_code":{"code_sha256":"84905132fbc263e3"}},{"arxiv_id":"2406.19215","arxiv_id_is_arxiv":true,"paper":"/paper/seakr-self-aware-knowledge-retrieval-for","title":"SeaKR: Self-aware Knowledge Retrieval for Adaptive Retrieval Augmented Generation","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-keg/seakr","path":"vllm_uncertainty/collect_env.py","file_url":"https://github.com/thu-keg/seakr/blob/HEAD/vllm_uncertainty/collect_env.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, thu-keg/seakr, is not in the permissive set Syntology serves inline","code_sha256":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2405.16444","arxiv_id_is_arxiv":true,"paper":"/paper/cacheblend-fast-large-language-model-serving","title":"CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YaoJiayi/CacheBlend","path":"vllm_blend/collect_env.py","file_url":"https://github.com/YaoJiayi/CacheBlend/blob/HEAD/vllm_blend/collect_env.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, YaoJiayi/CacheBlend when it was checked","code_sha256":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2312.08977","arxiv_id_is_arxiv":true,"paper":"/paper/weighted-ensemble-models-are-strong-continual","title":"Weighted Ensemble Models Are Strong Continual Learners","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iemprog/cofima","path":"collect_env.py","file_url":"https://github.com/iemprog/cofima/blob/HEAD/collect_env.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, iemprog/cofima when it was checked","code_sha256":"84905132fbc263e3","code_sha256_prefix":"84905132fbc263e3","mcp_get_code":{"code_sha256":"84905132fbc263e3"}},{"arxiv_id":"2309.06180","arxiv_id_is_arxiv":true,"paper":"/paper/2309-06180","title":"Efficient Memory Management for Large Language Model Serving with PagedAttention","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rasmith/vllm","path":"vllm/collect_env.py","file_url":"https://github.com/rasmith/vllm/blob/HEAD/vllm/collect_env.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":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}},{"arxiv_id":"2202.04053","arxiv_id_is_arxiv":true,"paper":"/paper/dall-eval-probing-the-reasoning-skills-and","title":"DALL-Eval: Probing the Reasoning Skills and Social Biases of Text-to-Image Generation Models","date":"2022-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"j-min/dalleval","path":"models/dalle_small/DALLE-pytorch/collect_env.py","file_url":"https://github.com/j-min/dalleval/blob/HEAD/models/dalle_small/DALLE-pytorch/collect_env.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 NolanKoblischke/SpectraFM_NeurIPS_FM4Science, and GitHub detected no licence in that repository when it was checked","code_sha256":"84905132fbc263e3","code_sha256_prefix":"84905132fbc263e3","mcp_get_code":{"code_sha256":"84905132fbc263e3"}},{"arxiv_id":"2109.08267","arxiv_id_is_arxiv":true,"paper":"/paper/compilergym-robust-performant-compiler","title":"CompilerGym: Robust, Performant Compiler Optimization Environments for AI Research","date":"2021-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/CompilerGym","path":"build_tools/collect_env.py","file_url":"https://github.com/facebookresearch/CompilerGym/blob/HEAD/build_tools/collect_env.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 NolanKoblischke/SpectraFM_NeurIPS_FM4Science, and GitHub detected no licence in that repository when it was checked","code_sha256":"84905132fbc263e3","code_sha256_prefix":"84905132fbc263e3","mcp_get_code":{"code_sha256":"84905132fbc263e3"}},{"arxiv_id":"2109.04003","arxiv_id_is_arxiv":true,"paper":"/paper/improving-deep-metric-learning-by-divide-and","title":"Improving Deep Metric Learning by Divide and Conquer","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"compvis/metric-learning-divide-and-conquer-improved","path":"collect_env_info.py","file_url":"https://github.com/compvis/metric-learning-divide-and-conquer-improved/blob/HEAD/collect_env_info.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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 NolanKoblischke/SpectraFM_NeurIPS_FM4Science, and GitHub detected no licence in that repository when it was checked","code_sha256":"84905132fbc263e3","code_sha256_prefix":"84905132fbc263e3","mcp_get_code":{"code_sha256":"84905132fbc263e3"}},{"arxiv_id":"2025.emnlp-main.240","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.240","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hku-netexplo-lab/QSpec","path":"collect_env.py","file_url":"https://github.com/hku-netexplo-lab/QSpec/blob/HEAD/collect_env.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":"5ae630bfc3821b6e","code_sha256_prefix":"5ae630bfc3821b6e","mcp_get_code":{"code_sha256":"5ae630bfc3821b6e"}}],"record_sha256":"bc051140a76133a27f60489e1bca21a2c901a6bc8c51aaed79abcf336951ceca","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}