{"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/prepare-xlm-input","entry":"prepare_xlm_input","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":12,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":8,"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":1,"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":"2604.13556","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-13556","title":"YOCO++: Enhancing YOCO with KV Residual Connections for Efficient LLM Inference","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"wuyou2002/YOCO-plus","path":"run_generation.py","file_url":"https://github.com/wuyou2002/YOCO-plus/blob/HEAD/run_generation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wuyou2002/YOCO-plus when it was checked","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2410.14442","arxiv_id_is_arxiv":true,"paper":"/paper/a-systematic-study-of-cross-layer-kv-sharing","title":"A Systematic Study of Cross-Layer KV Sharing for Efficient LLM Inference","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whyNLP/LCKV","path":"run_generation.py","file_url":"https://github.com/whyNLP/LCKV/blob/HEAD/run_generation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, whyNLP/LCKV when it was checked","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2404.10297","arxiv_id_is_arxiv":true,"paper":"/paper/future-language-modeling-from-temporal","title":"Future Language Modeling from Temporal Document History","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jlab-nlp/future-language-modeling","path":"generator.py","file_url":"https://github.com/jlab-nlp/future-language-modeling/blob/HEAD/generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2403.18421","arxiv_id_is_arxiv":true,"paper":"/paper/biomedlm-a-2-7b-parameter-language-model","title":"BioMedLM: A 2.7B Parameter Language Model Trained On Biomedical Text","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-crfm/biomedlm","path":"finetune/textgen/gpt2/run_generation_batch.py","file_url":"https://github.com/stanford-crfm/biomedlm/blob/HEAD/finetune/textgen/gpt2/run_generation_batch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, stanford-crfm/biomedlm when it was checked","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2402.05827","arxiv_id_is_arxiv":true,"paper":"/paper/is-it-possible-to-edit-large-language-models","title":"On the Robustness of Editing Large Language Models","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xbmxb/edit_analysis","path":"code/post_test_fastchat.py","file_url":"https://github.com/xbmxb/edit_analysis/blob/HEAD/code/post_test_fastchat.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xbmxb/edit_analysis when it was checked","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2305.01625","arxiv_id_is_arxiv":true,"paper":"/paper/unlimiformer-long-range-transformers-with","title":"Unlimiformer: Long-Range Transformers with Unlimited Length Input","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abertsch72/unlimiformer","path":"src/run_generation.py","file_url":"https://github.com/abertsch72/unlimiformer/blob/HEAD/src/run_generation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2210.15097","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-decoding-open-ended-text","title":"Contrastive Decoding: Open-ended Text Generation as Optimization","date":"2022-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2112.13834","arxiv_id_is_arxiv":true,"paper":"/paper/what-do-large-language-models-learn-about","title":"What do Large Language Models Learn about Scripts?","date":"2021-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2106.06168","arxiv_id_is_arxiv":true,"paper":"/paper/generate-annotate-and-learn-generative-models","title":"Generate, Annotate, and Learn: NLP with Synthetic Text","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"2009.14259","arxiv_id_is_arxiv":true,"paper":"/paper/visually-grounded-planning-without-vision","title":"Visually-Grounded Planning without Vision: Language Models Infer Detailed Plans from High-level Instructions","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cognitiveailab/alfred-gpt2","path":"code/evaluation/run_evaluation1.py","file_url":"https://github.com/cognitiveailab/alfred-gpt2/blob/HEAD/code/evaluation/run_evaluation1.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cognitiveailab/alfred-gpt2 when it was checked","code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"1910.03771","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-state-of-the-art-natural","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","date":"2019-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/transformers","path":"examples/pytorch/text-generation/run_generation.py","file_url":"https://github.com/huggingface/transformers/blob/HEAD/examples/pytorch/text-generation/run_generation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}},{"arxiv_id":"aaai_34776","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_34776","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"e0397123/FLR","path":"generate.py","file_url":"https://github.com/e0397123/FLR/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b7bf53f6b6b11a4b","code_sha256_prefix":"b7bf53f6b6b11a4b","mcp_get_code":{"code_sha256":"b7bf53f6b6b11a4b"}}],"record_sha256":"2956be54fbd2f629c592668b1289f3d54fb350fc3797b12c7eae65ec06ce009c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}