{"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":"/dataset/svamp/papers/ran/1","list_of":"/dataset/svamp","dataset":"SVAMP","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"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'","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,9],"of":9,"counts":{"papers_with_a_benchmark_row":16,"with_a_code_link":16,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":3,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/svamp/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/teaching-inspired-integrated-prompting","slug":"teaching-inspired-integrated-prompting","title":"Teaching-Inspired Integrated Prompting Framework: A Novel Approach for Enhancing Reasoning in Large Language Models","date":"2024-10-10","arxiv_id":"2410.08068","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":8,"official":{"repos":["sallytan13/teaching-inspired-prompting"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/teaching-inspired-integrated-prompting#ran","syntology_url":"https://syntology.ai/paper/2410.08068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08068"}}}},{"paper":"/paper/an-empirical-study-of-data-ability-boundary","slug":"an-empirical-study-of-data-ability-boundary","title":"An Empirical Study of Data Ability Boundary in LLMs' Math Reasoning","date":"2024-02-23","arxiv_id":"2403.00799","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":11,"official":{"repos":["cyzhh/MMOS"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/an-empirical-study-of-data-ability-boundary#ran","syntology_url":"https://syntology.ai/paper/2403.00799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00799"}}}},{"paper":"/paper/frugal-lms-trained-to-invoke-symbolic-solvers","slug":"frugal-lms-trained-to-invoke-symbolic-solvers","title":"Frugal LMs Trained to Invoke Symbolic Solvers Achieve Parameter-Efficient Arithmetic Reasoning","date":"2023-12-09","arxiv_id":"2312.05571","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["joykirat18/syrelm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/frugal-lms-trained-to-invoke-symbolic-solvers#ran","syntology_url":"https://syntology.ai/paper/2312.05571","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.05571"}}}},{"paper":"/paper/mathcoder-seamless-code-integration-in-llms","slug":"mathcoder-seamless-code-integration-in-llms","title":"MathCoder: Seamless Code Integration in LLMs for Enhanced Mathematical Reasoning","date":"2023-10-05","arxiv_id":"2310.03731","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["mathllm/mathcoder"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mathcoder-seamless-code-integration-in-llms#ran","syntology_url":"https://syntology.ai/paper/2310.03731","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03731"}}}},{"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","slug":"llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","arxiv_id":"2307.09288","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":52,"samples_ran":33,"samples_constructed":7,"samples_ran_checked":22,"samples_ran_instrument_failed":11,"samples_unverified":19,"pointer_only_for_licence":20,"official":{"repos":["facebookresearch/llama"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"paper":"/paper/automatic-model-selection-with-large-language","slug":"automatic-model-selection-with-large-language","title":"Automatic Model Selection with Large Language Models for Reasoning","date":"2023-05-23","arxiv_id":"2305.14333","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["xuzhao0/model-selection-reasoning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/automatic-model-selection-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2305.14333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14333"}}}},{"paper":"/paper/progressive-hint-prompting-improves-reasoning","slug":"progressive-hint-prompting-improves-reasoning","title":"Progressive-Hint Prompting Improves Reasoning in Large Language Models","date":"2023-04-19","arxiv_id":"2304.09797","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":1,"pointer_only_for_licence":4,"official":{"repos":["chuanyang-Zheng/Progressive-Hint"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/progressive-hint-prompting-improves-reasoning#ran","syntology_url":"https://syntology.ai/paper/2304.09797","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09797"}}}},{"paper":"/paper/large-language-models-are-zero-shot-reasoners","slug":"large-language-models-are-zero-shot-reasoners","title":"Large Language Models are Zero-Shot Reasoners","date":"2022-05-24","arxiv_id":"2205.11916","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["kojima-takeshi188/zero_shot_cot"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/large-language-models-are-zero-shot-reasoners#ran","syntology_url":"https://syntology.ai/paper/2205.11916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11916"}}}},{"paper":"/paper/learning-to-reason-deductively-math-word","slug":"learning-to-reason-deductively-math-word","title":"Learning to Reason Deductively: Math Word Problem Solving as Complex Relation Extraction","date":"2022-03-19","arxiv_id":"2203.10316","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["allanj/deductive-mwp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-to-reason-deductively-math-word#ran","syntology_url":"https://syntology.ai/paper/2203.10316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10316"}}}}],"record_sha256":"e0ee22d726585cc8fb73a46d328f023e122cc58af9723a035855d04067d2467a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}