{"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/bleu-score","entry":"bleu_score","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":10,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":4,"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":4,"unverified":2},"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":"2605.17932","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17932","title":"Prompt Compression for Diffusion Large Language Models: An Empirical Evaluation of LLMLingua-2 and LLaDA","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"axxx129-ops/DLLM-Compression","path":"evaluation/evaluate.py","file_url":"https://github.com/axxx129-ops/DLLM-Compression/blob/HEAD/evaluation/evaluate.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, axxx129-ops/DLLM-Compression when it was checked","code_sha256":"432d5314a4ebadbd","code_sha256_prefix":"432d5314a4ebadbd","mcp_get_code":{"code_sha256":"432d5314a4ebadbd"}},{"arxiv_id":"2404.16789","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-of-large-language-models-a","title":"Continual Learning of Large Language Models: A Comprehensive Survey","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beyonderxx/trace","path":"metrics.py","file_url":"https://github.com/beyonderxx/trace/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab795c060d39c540","code_sha256_prefix":"ab795c060d39c540","mcp_get_code":{"code_sha256":"ab795c060d39c540"}},{"arxiv_id":"2403.11322","arxiv_id_is_arxiv":true,"paper":"/paper/stateflow-enhancing-llm-task-solving-through","title":"StateFlow: Enhancing LLM Task-Solving through State-Driven Workflows","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevin666aa/stateflow","path":"ALFWorld/src/chat_utils.py","file_url":"https://github.com/kevin666aa/stateflow/blob/HEAD/ALFWorld/src/chat_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kevin666aa/stateflow when it was checked","code_sha256":"88c3f0a98558ec2f","code_sha256_prefix":"88c3f0a98558ec2f","mcp_get_code":{"code_sha256":"88c3f0a98558ec2f"}},{"arxiv_id":"2311.09816","arxiv_id_is_arxiv":true,"paper":"/paper/performance-trade-offs-of-watermarking-large","title":"Downstream Trade-offs of a Family of Text Watermarks","date":"2023-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flair-iisc/watermark_tradeoffs","path":"evaluation/utils.py","file_url":"https://github.com/flair-iisc/watermark_tradeoffs/blob/HEAD/evaluation/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, flair-iisc/watermark_tradeoffs when it was checked","code_sha256":"08cb85fd2c4518cc","code_sha256_prefix":"08cb85fd2c4518cc","mcp_get_code":{"code_sha256":"08cb85fd2c4518cc"}},{"arxiv_id":"2308.12241","arxiv_id_is_arxiv":true,"paper":"/paper/llmrec-benchmarking-large-language-models-on","title":"LLMRec: Benchmarking Large Language Models on Recommendation Task","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"williamliujl/llmrec","path":"utils/evaluate/utils.py","file_url":"https://github.com/williamliujl/llmrec/blob/HEAD/utils/evaluate/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c212cb768b5261af","code_sha256_prefix":"c212cb768b5261af","mcp_get_code":{"code_sha256":"c212cb768b5261af"}},{"arxiv_id":"2307.12626","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-human-like-multi-modal-reasoning-a","title":"Enhancing Human-like Multi-Modal Reasoning: A New Challenging Dataset and Comprehensive Framework","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weijingxuan/COCO-MMR","path":"evaluations.py","file_url":"https://github.com/weijingxuan/COCO-MMR/blob/HEAD/evaluations.py","status":"ran","verification_level":1,"contract_check":null,"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, weijingxuan/COCO-MMR when it was checked","code_sha256":"ab795c060d39c540","code_sha256_prefix":"ab795c060d39c540","mcp_get_code":{"code_sha256":"ab795c060d39c540"}},{"arxiv_id":"2302.00923","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-chain-of-thought-reasoning-in","title":"Multimodal Chain-of-Thought Reasoning in Language Models","date":"2023-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/mm-cot","path":"evaluations.py","file_url":"https://github.com/amazon-science/mm-cot/blob/HEAD/evaluations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab795c060d39c540","code_sha256_prefix":"ab795c060d39c540","mcp_get_code":{"code_sha256":"ab795c060d39c540"}},{"arxiv_id":"2003.04807","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-intent-detection-with-dual-sentence","title":"Efficient Intent Detection with Dual Sentence Encoders","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/intent-aware-encoder","path":"downstream/protaugment/paraphrase/modeling.py","file_url":"https://github.com/amazon-science/intent-aware-encoder/blob/HEAD/downstream/protaugment/paraphrase/modeling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26105291c088d807","code_sha256_prefix":"26105291c088d807","mcp_get_code":{"code_sha256":"26105291c088d807"}},{"arxiv_id":"1911.12986","arxiv_id_is_arxiv":true,"paper":"/paper/merging-weak-and-active-supervision-for","title":"Merging Weak and Active Supervision for Semantic Parsing","date":"2019-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niansong1996/wassp","path":"nsm/nlp_utils.py","file_url":"https://github.com/niansong1996/wassp/blob/HEAD/nsm/nlp_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9073ba6a227f3a75","code_sha256_prefix":"9073ba6a227f3a75","mcp_get_code":{"code_sha256":"9073ba6a227f3a75"}},{"arxiv_id":"1807.02322","arxiv_id_is_arxiv":true,"paper":"/paper/memory-augmented-policy-optimization-for","title":"Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing","date":"2018-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crazydonkey200/neural-symbolic-machines","path":"nsm/nlp_utils.py","file_url":"https://github.com/crazydonkey200/neural-symbolic-machines/blob/HEAD/nsm/nlp_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9073ba6a227f3a75","code_sha256_prefix":"9073ba6a227f3a75","mcp_get_code":{"code_sha256":"9073ba6a227f3a75"}}],"record_sha256":"45fbf607a70712e8c664138262e6bd4be0c6ec13c722bb46f34c2b02fe9c9a8d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}