{"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/syntax-check","entry":"syntax_check","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":7,"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":1,"ran_draft_wrong":0,"ran_fixture":1,"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.18995","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18995","title":"R 2 -dLLM: Accelerating Diffusion Large Language Models via Spatio-Temporal Redundancy Reduction","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"GATECH-EIC/R2-dLLM","path":"dream/sanitize.py","file_url":"https://github.com/GATECH-EIC/R2-dLLM/blob/HEAD/dream/sanitize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, GATECH-EIC/R2-dLLM when it was checked","code_sha256":"d7d30a99e0029e36","code_sha256_prefix":"d7d30a99e0029e36","mcp_get_code":{"code_sha256":"d7d30a99e0029e36"}},{"arxiv_id":"2604.15750","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15750","title":"DepCap: Adaptive Block-Wise Parallel Decoding for Efficient Diffusion LM Inference","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"X-Xia0828/DepCap","path":"dream/sanitize.py","file_url":"https://github.com/X-Xia0828/DepCap/blob/HEAD/dream/sanitize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, X-Xia0828/DepCap when it was checked","code_sha256":"d7d30a99e0029e36","code_sha256_prefix":"d7d30a99e0029e36","mcp_get_code":{"code_sha256":"d7d30a99e0029e36"}},{"arxiv_id":"2602.06953","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-06953","title":"DAWN: Dependency-Aware Fast Inference for Diffusion LLMs","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"lizhuo-luo/DAWN","path":"dream/sanitize.py","file_url":"https://github.com/lizhuo-luo/DAWN/blob/HEAD/dream/sanitize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 GATECH-EIC/R2-dLLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"d7d30a99e0029e36","code_sha256_prefix":"d7d30a99e0029e36","mcp_get_code":{"code_sha256":"d7d30a99e0029e36"}},{"arxiv_id":"2502.02827","arxiv_id_is_arxiv":true,"paper":"/paper/coffe-a-code-efficiency-benchmark-for-code","title":"COFFE: A Code Efficiency Benchmark for Code Generation","date":null,"month_inferred_from_arxiv_id":"2025-02","title_source":"archive","repo":"JohnnyPeng18/Coffe","path":"coffe/sanitize.py","file_url":"https://github.com/JohnnyPeng18/Coffe/blob/HEAD/coffe/sanitize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from GATECH-EIC/R2-dLLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"d7d30a99e0029e36","code_sha256_prefix":"d7d30a99e0029e36","mcp_get_code":{"code_sha256":"d7d30a99e0029e36"}},{"arxiv_id":"2412.03578","arxiv_id_is_arxiv":true,"paper":"/paper/perfcodegen-improving-performance-of-llm","title":"PerfCodeGen: Improving Performance of LLM Generated Code with Execution Feedback","date":"2024-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SalesforceAIResearch/perfcodegen","path":"src/sanitize.py","file_url":"https://github.com/SalesforceAIResearch/perfcodegen/blob/HEAD/src/sanitize.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from GATECH-EIC/R2-dLLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"d7d30a99e0029e36","code_sha256_prefix":"d7d30a99e0029e36","mcp_get_code":{"code_sha256":"d7d30a99e0029e36"}},{"arxiv_id":"2406.15877","arxiv_id_is_arxiv":true,"paper":"/paper/bigcodebench-benchmarking-code-generation","title":"BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructions","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bigcode-project/bigcodebench","path":"bigcodebench/syncheck.py","file_url":"https://github.com/bigcode-project/bigcodebench/blob/HEAD/bigcodebench/syncheck.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from GATECH-EIC/R2-dLLM, and GitHub detected no licence in that repository when it was checked","code_sha256":"d7d30a99e0029e36","code_sha256_prefix":"d7d30a99e0029e36","mcp_get_code":{"code_sha256":"d7d30a99e0029e36"}},{"arxiv_id":"1901.10879","arxiv_id_is_arxiv":true,"paper":"/paper/span-based-open-information-extraction","title":"Span Model for Open Information Extraction on Accurate Corpus","date":"2019-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhanjunlang/Span_OIE","path":"main_span.py","file_url":"https://github.com/zhanjunlang/Span_OIE/blob/HEAD/main_span.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhanjunlang/Span_OIE when it was checked","code_sha256":"804444d775fe7a34","code_sha256_prefix":"804444d775fe7a34","mcp_get_code":{"code_sha256":"804444d775fe7a34"}}],"record_sha256":"a323f4382f3ab350cb97fc255385606b30e86cb3792d32a12b9cddf4ff72b930","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}