{"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/process-example","entry":"process_example","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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":2,"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":6,"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.26386","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-26386","title":"Co-Evolving Structured Knowledge and Reasoning in Language Models","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"kilian-group/KBevo","path":"src/grpo_train.py","file_url":"https://github.com/kilian-group/KBevo/blob/HEAD/src/grpo_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e24282c69ce2e598","code_sha256_prefix":"e24282c69ce2e598","mcp_get_code":{"code_sha256":"e24282c69ce2e598"}},{"arxiv_id":"2601.05167","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05167","title":"RelayLLM: Efficient Reasoning via Collaborative Decoding","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Chengsong-Huang/RelayLLM","path":"eval/results_recheck.py","file_url":"https://github.com/Chengsong-Huang/RelayLLM/blob/HEAD/eval/results_recheck.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, Chengsong-Huang/RelayLLM when it was checked","code_sha256":"76700adff75fb92c","code_sha256_prefix":"76700adff75fb92c","mcp_get_code":{"code_sha256":"76700adff75fb92c"}},{"arxiv_id":"2410.14826","arxiv_id_is_arxiv":true,"paper":"/paper/sprig-improving-large-language-model","title":"SPRIG: Improving Large Language Model Performance by System Prompt Optimization","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orange0629/prompting","path":"related_work/protegi/tasks.py","file_url":"https://github.com/orange0629/prompting/blob/HEAD/related_work/protegi/tasks.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, orange0629/prompting when it was checked","code_sha256":"aab213b0895dc732","code_sha256_prefix":"aab213b0895dc732","mcp_get_code":{"code_sha256":"aab213b0895dc732"}},{"arxiv_id":"2305.11938","arxiv_id_is_arxiv":true,"paper":"/paper/xtreme-up-a-user-centric-scarce-data","title":"XTREME-UP: A User-Centric Scarce-Data Benchmark for Under-Represented Languages","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/xtreme-up","path":"baseline/jsonl_to_seqio_tsv_lib.py","file_url":"https://github.com/google-research/xtreme-up/blob/HEAD/baseline/jsonl_to_seqio_tsv_lib.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":"11b74ed4666eca82","code_sha256_prefix":"11b74ed4666eca82","mcp_get_code":{"code_sha256":"11b74ed4666eca82"}},{"arxiv_id":"1902.07669","arxiv_id_is_arxiv":true,"paper":"/paper/scispacy-fast-and-robust-models-for","title":"ScispaCy: Fast and Robust Models for Biomedical Natural Language Processing","date":"2019-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/scispacy","path":"scispacy/data_util.py","file_url":"https://github.com/allenai/scispacy/blob/HEAD/scispacy/data_util.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":"21657ab6fe37fcec","code_sha256_prefix":"21657ab6fe37fcec","mcp_get_code":{"code_sha256":"21657ab6fe37fcec"}},{"arxiv_id":"1808.08745","arxiv_id_is_arxiv":true,"paper":"/paper/dont-give-me-the-details-just-the-summary","title":"Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarization","date":"2018-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pltrdy/extoracle_summarization","path":"extoracle/extoracle.py","file_url":"https://github.com/pltrdy/extoracle_summarization/blob/HEAD/extoracle/extoracle.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":"55732ffb0494d417","code_sha256_prefix":"55732ffb0494d417","mcp_get_code":{"code_sha256":"55732ffb0494d417"}},{"arxiv_id":"2021.emnlp-main.366","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.emnlp-main.366","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/CodRED","path":"baseline/codred-path/codred-path.py","file_url":"https://github.com/thunlp/CodRED/blob/HEAD/baseline/codred-path/codred-path.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"08c654384cbc9de2","code_sha256_prefix":"08c654384cbc9de2","mcp_get_code":{"code_sha256":"08c654384cbc9de2"}}],"record_sha256":"d4362393bec17591d0d46d7e2bc86bee0103314697f6265d6ba9d67646be29c3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}