{"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/beyondx","name":"BeyondX","full_name":null,"description_markdown":"# Dataset Card for BeyondX\r\n\r\n- [Dataset Description](https://huggingface.co/datasets/Johnson0213/BeyondX#dataset-description)\r\n- [Paper Information](https://huggingface.co/datasets/Johnson0213/BeyondX#paper-information)\r\n- [Dataset Usage](https://huggingface.co/datasets/Johnson0213/BeyondX#dataset-usage)\r\n  - [Data Construction](https://huggingface.co/datasets/Johnson0213/BeyondX#data-construction)\r\n  - [Formulate-and-Solve](https://huggingface.co/datasets/Johnson0213/BeyondX#formulate-and-solve)\r\n- [License](https://huggingface.co/datasets/Johnson0213/BeyondX#license)\r\n- [Citation](https://huggingface.co/datasets/Johnson0213/BeyondX#citation)\r\n\r\n## Dataset Description\r\n\r\n**BeyondX** is a novel algebra reasoning benchmark within multi-unknown, which addresses the limitation that problems with at most two unknowns dominate existing math datasets. In total, **BeyondX** includes 464 examples generated from **2 different source datasets**.\r\n\r\n## Paper Information\r\n- Project Page: https://johnsonkao0213.github.io/Formulate_and_Solve/\r\n- Paper: https://arxiv.org/abs/2407.05134\r\n- Code: https://github.com/johnsonkao0213/Formulate_and_Solve\r\n- Visualization: https://johnsonkao0213.github.io/Formulate_and_Solve/#visualization\r\n- Leaderboard: https://johnsonkao0213.github.io/Formulate_and_Solve/#leaderboard\r\n\r\n## Dataset Usage\r\n\r\n### Data Construction\r\n\r\nThe **BeyondX** dataset is derived from two collected datasets: [ALG514](https://paperswithcode.com/dataset/alg514) and [DRAW-1K](https://paperswithcode.com/dataset/draw-1k). To efficiently generate a large corpus of multi-unknown problems, we developed a novel pipeline that automatically expands existing problems to *N* unknowns, please refer to our GitHub repository and Paper for details [here](https://github.com/johnsonkao0213/Formulate_and_Solve).\r\n\r\n### Formulate-and-Solve\r\n\r\n🔔 To evaluate our proposed SoTA prompting method **Formulate-and-Solve** on **BeyondX**, please refer to our GitHub repository and Paper for details [here](https://github.com/johnsonkao0213/Formulate_and_Solve).\r\n\r\n## License\r\n\r\nThe new contributions to our dataset are distributed under the [CC BY-SA 4.0](https://creativecommons.org/licenses/by-sa/4.0/) license.\r\n\r\nThe copyright of the questions belongs to the original authors, and the source of every original question can be found in the `source` field. Alongside this license, the following conditions apply:\r\n\r\n- **Purpose:** The dataset was primarily designed as a test set.\r\n- **Commercial Use:** The dataset can be used commercially as a test set, but using it as a training set is prohibited. By accessing or using this dataset, you acknowledge and agree to abide by these terms in conjunction with the [CC BY-SA 4.0](https://creativecommons.org/licenses/by-sa/4.0/) license.\r\n\r\n## Citation\r\n\r\n```latex\r\n@misc{kao2024solvingxbeyondlarge,\r\n      title={Solving for X and Beyond: Can Large Language Models Solve Complex Math Problems with More-Than-Two Unknowns?}, \r\n      author={Kuei-Chun Kao and Ruochen Wang and Cho-Jui Hsieh},\r\n      year={2024},\r\n      eprint={2407.05134},\r\n      archivePrefix={arXiv},\r\n      primaryClass={cs.AI},\r\n      url={https://arxiv.org/abs/2407.05134}, \r\n}\r\n```","description_withheld":null,"homepage":"https://huggingface.co/datasets/Johnson0213/BeyondX","introduced_date":"2024-07-06","introduced_date_note":null,"introduced_by":{"paper":"/paper/solving-for-x-and-beyond-can-large-language","title":"Solving for X and Beyond: Can Large Language Models Solve Complex Math Problems with More-Than-Two Unknowns?","first_author":"Kuei-Chun Kao","url":null},"license":null,"modalities":[],"tasks":[],"languages":[],"variants":["BeyondX"],"data_loaders":[],"num_papers_in_archive":1,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[],"papers":{"order":"date (newest first), then slug","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,"shown":0,"of":0,"counts":{"papers_with_a_benchmark_row":0,"with_a_code_link":0,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":0,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"items":[],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[],"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_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.","pages":[],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":0,"samples_harvested":0,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":0,"papers_with_a_run_with_no_instrument_failure":0,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"9be33602fa6cda7773c247294ef77088c84db00cc4c1111d629b0564d348b8f7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}