{"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/extract-numeric","entry":"extract_numeric","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":3,"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":"2609.14857","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-14857","title":"MODULARRSI: MODULAR AND GENERALIZABLE RE-CURSIVE HARNESS SELF-IMPROVEMENT","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"IQuestLab/ModularRSI","path":"adapters/dabstep/scorer.py","file_url":"https://github.com/IQuestLab/ModularRSI/blob/HEAD/adapters/dabstep/scorer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b8eb1533af10264","code_sha256_prefix":"5b8eb1533af10264","mcp_get_code":{"code_sha256":"5b8eb1533af10264"}},{"arxiv_id":"2606.11854","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-11854","title":"Fine-tuning Multi-modal LLMs with ART: Art-based Reinforcement Training","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"jinymusim/ART","path":"src/reasoning_with_art/datasets/evaluation/exact_match.py","file_url":"https://github.com/jinymusim/ART/blob/HEAD/src/reasoning_with_art/datasets/evaluation/exact_match.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ad5bf662315530bc","code_sha256_prefix":"ad5bf662315530bc","mcp_get_code":{"code_sha256":"ad5bf662315530bc"}},{"arxiv_id":"2605.26457","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-26457","title":"Verus-SpecGym: An Agentic Environment for Evaluating Specification Autoformalization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"formal-verif-is-cool/verus-spec-gym","path":"adapters/dabstep/scorer.py","file_url":"https://github.com/formal-verif-is-cool/verus-spec-gym/blob/HEAD/adapters/dabstep/scorer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b8eb1533af10264","code_sha256_prefix":"5b8eb1533af10264","mcp_get_code":{"code_sha256":"5b8eb1533af10264"}},{"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/gsm_evaluation.py","file_url":"https://github.com/axxx129-ops/DLLM-Compression/blob/HEAD/evaluation/gsm_evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, axxx129-ops/DLLM-Compression when it was checked","code_sha256":"435c82878848e0f5","code_sha256_prefix":"435c82878848e0f5","mcp_get_code":{"code_sha256":"435c82878848e0f5"}},{"arxiv_id":"2604.19572","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-19572","title":"A Self-Evolving Framework for Efficient Terminal Agents via Observational Context Compression","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"multimodal-art-projection/TACO","path":"adapters/dabstep/scorer.py","file_url":"https://github.com/multimodal-art-projection/TACO/blob/HEAD/adapters/dabstep/scorer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5b8eb1533af10264","code_sha256_prefix":"5b8eb1533af10264","mcp_get_code":{"code_sha256":"5b8eb1533af10264"}},{"arxiv_id":"2409.17515","arxiv_id_is_arxiv":true,"paper":"/paper/from-news-to-forecast-integrating-event","title":"From News to Forecast: Integrating Event Analysis in LLM-Based Time Series Forecasting with Reflection","date":"2024-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ameliawong1996/From_News_to_Forecast","path":"accuracy-ts.py","file_url":"https://github.com/ameliawong1996/From_News_to_Forecast/blob/HEAD/accuracy-ts.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ffdca11a645038ed","code_sha256_prefix":"ffdca11a645038ed","mcp_get_code":{"code_sha256":"ffdca11a645038ed"}}],"record_sha256":"b605752b11ecca1aca30abe6ee554bfc88a76da16b7fb7812c1d013c58752f08","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}