{"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":"/method/dart","slug":"dart","name":"DART","full_name":null,"full_name_withheld":false,"description_markdown":"# 🎯 DART-Math\r\n\r\n> Difficulty-Aware Rejection Tuning for Mathematical Problem-Solving\r\n\r\n📝 [Paper@arXiv](https://arxiv.org/abs/2407.13690) | 🤗 [Datasets&Models@HF](https://huggingface.co/collections/hkust-nlp/dart-math-665704599b35de59f8fdf6c1) | 🐱 [Code@GitHub](https://github.com/hkust-nlp/dart-math)\r\n\r\n🐦 [Thread@X(Twitter)](https://x.com/tongyx361/status/1811413243350454455) | 🐶 [中文博客@知乎](https://zhuanlan.zhihu.com/p/708371895) | 📊 [Leaderboard@PapersWithCode](https://paperswithcode.com/paper/dart-math-difficulty-aware-rejection-tuning#results) | 📑 [BibTeX](https://github.com/hkust-nlp/dart-math?tab=readme-ov-file#citation)\r\n\r\n## Datasets: `DART-Math`\r\n\r\n`DART-Math` datasets are the **state-of-the-art** and **data-efficient** **open-source** instruction tuning datasets for mathematical reasoning.\r\n\r\n`DART-Math-Hard` contains \\~585k mathematical QA pair samples constructed by applying `DARS-Prop2Diff` to the query set from MATH and GSK8K training sets, achieves **SOTA** on many challenging mathematical reasoning benchmarks. It introduces a **deliberate bias towards hard queries**, opposite to vanilla rejection sampling.\r\n\r\nPerformance produced by  `DART-Math-Hard` is usually but not necessarily **slightly better (\\~1% absolutely)** than `DART-Math-Uniform`, which contains \\~591k samples constructed by applying `DARS-Uniform`.\r\n\r\n### Comparison between Mathematical Instruction Tuning Datasets\r\n\r\nMost of previous datasets are **constructed with ChatGPT**, and many of them are **not open-source**, especially for ones of the best performance.\r\n\r\n| Math SFT Dataset                                                                   | # of Samples | [MATH](https://huggingface.co/datasets/hendrycks/competition_math) | [GSM8K](https://huggingface.co/datasets/gsm8k) | [College](https://github.com/hkust-nlp/dart-math/tree/main/data/eval-dsets/mwpbench/college-math-test.jsonl) | Synthesis Agent(s)      |                                 Open-Source                                 |\r\n| :--------------------------------------------------------------------------------- | -----------: | -----------------------------------------------------------------: | ---------------------------------------------: | -----------------------------------------------------------------------------------------------------------: | :---------------------- | :-------------------------------------------------------------------------: |\r\n| [WizardMath](https://arxiv.org/abs/2308.09583)                                     |          96k |                                                               32.3 |                                           80.4 |                                                                                                         23.1 | GPT-4                   |                                      ✗                                      |\r\n| [MetaMathQA](https://arxiv.org/abs/2309.12284)                                     |         395k |                                                               29.8 |                                           76.5 |                                                                                                         19.3 | GPT-3.5                 |          [✓](https://huggingface.co/datasets/meta-math/MetaMathQA)          |\r\n| [MMIQC](https://arxiv.org/abs/2401.09003)                                          |    **2294k** |                                                               37.4 |                                           75.4 |                                                                                                       _28.5_ | **GPT-4+GPT-3.5+Human** |           [**✓**](https://huggingface.co/datasets/Vivacem/MMIQC)            |\r\n| [Orca-Math](https://arxiv.org/abs/2402.14830)                                      |         200k |                                                                 -- |                                             -- |                                                                                                           -- | GPT-4                   | [✓](https://huggingface.co/datasets/microsoft/orca-math-word-problems-200k) |\r\n| [Xwin-Math-V1.1](https://arxiv.org/abs/2403.04706)                                 |    **1440k** |                                                             _45.5_ |                                       **84.9** |                                                                                                         27.6 | **GPT-4**               |                                    **✗**                                    |\r\n| [KPMath-Plus](https://arxiv.org/abs/2403.02333)                                    |    **1576k** |                                                           **46.8** |                                           82.1 |                                                                                                           -– | **GPT-4**               |                                    **✗**                                    |\r\n| [MathScaleQA](https://arxiv.org/abs/2403.02884)                                    |        2021k |                                                               35.2 |                                           74.8 |                                                                                                         21.8 | GPT-3.5+Human           |                                      ✗                                      |\r\n| [`DART-Math-Uniform`](https://huggingface.co/datasets/hkust-nlp/dart-math-uniform) |     **591k** |                                                               43.5 |                                         _82.6_ |                                                                                                         26.9 | **DeepSeekMath-7B-RL**  |    [**✓**](https://huggingface.co/datasets/hkust-nlp/dart-math-uniform)     |\r\n| [`DART-Math-Hard`](https://huggingface.co/datasets/hkust-nlp/dart-math-hard)       |     **585k** |                                                             _45.5_ |                                           81.1 |                                                                                                     **29.4** | **DeepSeekMath-7B-RL**  |      [**✓**](https://huggingface.co/datasets/hkust-nlp/dart-math-hard)      |\r\n\r\n<sup>MATH and GSM8K are **in-domain**, while College(Math) is **out-of-domain**. Performance here are of models fine-tuned from [Mistral-7B](https://huggingface.co/mistralai/Mistral-7B-v0.1), except for Xwin-Math-V1.1 based on [Llama2-7B](https://huggingface.co/meta-llama/Llama-2-7b-hf). **Bold**/_Italic_ means the best/second best score here.</sup>\r\n\r\n## Dataset Construction: `DARS` - Difficulty-Aware Rejection Sampling\r\n\r\nPrevious works usually synthesize data from proprietary models to augment existing datasets, followed by instruction tuning to achieve top-tier results.\r\nHowever, our analysis of these datasets reveals **severe biases towards easy queries, with frequent failures to generate any correct response for the most challenging queries**.\r\n\r\nMotivated by the observation above, we propose to *Difficulty-Aware Rejection Sampling* (`DARS`), to collect more responses for more difficult queries.\r\nSpecifically, we introduce two strategies to increase the number of correct responses for difficult queries:\r\n\r\n1) **Uniform**, which involves sampling responses for each query until **each query accumulates $k_u$ correct\r\nresponses**, where $k_u$ is a preset hyperparameter determined by the desired size of the synthetic dataset;\r\n2) **Prop2Diff**, where we continue sampling responses until the number of correct responses for each\r\nquery is **proportional to its difficulty score**. The most challenging queries will receive $k_p$ responses\r\nand kp is a hyperparameter. This method introduces a deliberate bias in the opposite direction to\r\nvanilla rejection sampling, towards more difficult queries, inspired by previous works\r\nthat demonstrate **difficult samples can be more effective to enhance model capabilities** ([Sorscher et al.,\r\n2022](https://proceedings.neurips.cc/paper_files/paper/2022/hash/7b75da9b61eda40fa35453ee5d077df6-Abstract-Conference.html); [Liu et al., 2024b](https://openreview.net/forum?id=BTKAeLqLMw)).\r\n\r\nSee [Figure 1 (Right)](https://tongyx361.github.io/assets/dart-math/main-nresp-vs-query.png) for examples of `DART-Math-Uniform` by `DARS-Uniform` and `DART-Math-Hard` by `DARS-Prop2Diff`.\r\n\r\n## Citation\r\n\r\nIf you find our data, model or code useful for your work, please kindly cite [our paper](https://arxiv.org/abs/2407.13690):\r\n\r\n```latex\r\n@article{tong2024dartmath,\r\n  title={DART-Math: Difficulty-Aware Rejection Tuning for Mathematical Problem-Solving},\r\n  author={Yuxuan Tong and Xiwen Zhang and Rui Wang and Ruidong Wu and Junxian He},\r\n  year={2024},\r\n  eprint={2407.13690},\r\n  archivePrefix={arXiv},\r\n  primaryClass={cs.CL},\r\n  url={https://arxiv.org/abs/2407.13690},\r\n}\r\n```","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":"https://github.com/hkust-nlp/dart-math?tab=readme-ov-file#-data-synthesis","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Text Data Augmentation","url":"/methods/category/text-data-augmentation","pwc_aliases":[]}],"n_papers_tagged":32,"archive_num_papers":32,"papers_newest_first":[{"paper":null,"slug":"dart-distilling-autoregressive-reasoning-to","title":"DART: Distilling Autoregressive Reasoning to Silent Thought","date":"2025-06-13","arxiv_id":"2506.11752","n_code_links":0,"syntology":null},{"paper":"/paper/dart-differentiable-dynamic-adaptive-region","slug":"dart-differentiable-dynamic-adaptive-region","title":"DART: Differentiable Dynamic Adaptive Region Tokenizer for Vision Transformer and Mamba","date":"2025-06-12","arxiv_id":"2506.10390","n_code_links":1,"syntology":null},{"paper":null,"slug":"tablepilot-recommending-human-preferred","title":"TablePilot: Recommending Human-Preferred Tabular Data Analysis with Large Language Models","date":"2025-03-17","arxiv_id":"2503.13262","n_code_links":0,"syntology":null},{"paper":null,"slug":"dart-vinci-egocentric-data-collection-for","title":"dARt Vinci: Egocentric Data Collection for Surgical Robot Learning at Scale","date":"2025-03-07","arxiv_id":"2503.05646","n_code_links":0,"syntology":null},{"paper":"/paper/stop-looking-for-important-tokens-in","slug":"stop-looking-for-important-tokens-in","title":"Stop Looking for Important Tokens in Multimodal Language Models: Duplication Matters More","date":"2025-02-17","arxiv_id":"2502.11494","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":2,"n_instrument":5,"unverified":1,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","official":{"repos":["zichenwen1/dart"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"text-diffusion-red-teaming-of-large-language","title":"Text-Diffusion Red-Teaming of Large Language Models: Unveiling Harmful Behaviors with Proximity Constraints","date":"2025-01-14","arxiv_id":"2501.08246","n_code_links":0,"syntology":null},{"paper":null,"slug":"iterative-encoding-decoding-vaes-anomaly","title":"Iterative Encoding-Decoding VAEs Anomaly Detection in NOAA's DART Time Series: A Machine Learning Approach for Enhancing Data Integrity for NASA's GRACE-FO Verification and Validation","date":"2024-12-20","arxiv_id":"2412.16375","n_code_links":0,"syntology":null},{"paper":null,"slug":"from-point-to-probabilistic-gradient-boosting","title":"From Point to probabilistic gradient boosting for claim frequency and severity prediction","date":"2024-12-19","arxiv_id":"2412.14916","n_code_links":0,"syntology":null},{"paper":null,"slug":"dart-an-aigt-detector-using-amr-of-rephrased","title":"DART: An AIGT Detector using AMR of Rephrased Text","date":"2024-12-16","arxiv_id":"2412.11517","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-extensive-evaluation-of-factual","title":"An Extensive Evaluation of Factual Consistency in Large Language Models for Data-to-Text Generation","date":"2024-11-28","arxiv_id":"2411.19203","n_code_links":0,"syntology":null},{"paper":null,"slug":"label-distribution-shift-aware-prediction","title":"Label Distribution Shift-Aware Prediction Refinement for Test-Time Adaptation","date":"2024-11-20","arxiv_id":"2411.15204","n_code_links":0,"syntology":null},{"paper":null,"slug":"jal-anveshak-prediction-of-fishing-zones","title":"Jal Anveshak: Prediction of fishing zones using fine-tuned LlaMa 2","date":"2024-11-15","arxiv_id":"2411.10050","n_code_links":0,"syntology":null},{"paper":null,"slug":"dart-denoising-autoregressive-transformer-for","title":"DART: Denoising Autoregressive Transformer for Scalable Text-to-Image Generation","date":"2024-10-10","arxiv_id":"2410.08159","n_code_links":0,"syntology":null},{"paper":null,"slug":"dart-a-diffusion-based-autoregressive-motion","title":"DartControl: A Diffusion-Based Autoregressive Motion Model for Real-Time Text-Driven Motion Control","date":"2024-10-07","arxiv_id":"2410.05260","n_code_links":0,"syntology":null},{"paper":null,"slug":"disk-differentially-private-optimizer-with","title":"DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reduction","date":"2024-10-04","arxiv_id":"2410.03883","n_code_links":0,"syntology":null},{"paper":null,"slug":"impact-of-model-size-on-fine-tuned-llm","title":"Impact of Model Size on Fine-tuned LLM Performance in Data-to-Text Generation: A State-of-the-Art Investigation","date":"2024-07-19","arxiv_id":"2407.14088","n_code_links":0,"syntology":null},{"paper":"/paper/dart-an-automated-end-to-end-object-detection","slug":"dart-an-automated-end-to-end-object-detection","title":"DART: An Automated End-to-End Object Detection Pipeline with Data Diversification, Open-Vocabulary Bounding Box Annotation, Pseudo-Label Review, and Model Training","date":"2024-07-12","arxiv_id":"2407.09174","n_code_links":1,"syntology":null},{"paper":"/paper/dart-deep-adversarial-automated-red-teaming","slug":"dart-deep-adversarial-automated-red-teaming","title":"Automated Progressive Red Teaming","date":"2024-07-04","arxiv_id":"2407.03876","n_code_links":1,"syntology":null},{"paper":"/paper/dart-math-difficulty-aware-rejection-tuning-1","slug":"dart-math-difficulty-aware-rejection-tuning-1","title":"DART-Math: Difficulty-Aware Rejection Tuning for Mathematical Problem-Solving","date":"2024-06-18","arxiv_id":"2407.13690","n_code_links":1,"syntology":{"ran":10,"of":12,"n_ran_checked":2,"n_instrument":8,"unverified":2,"pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","official":{"repos":["hkust-nlp/dart-math"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"learning-to-play-atari-in-a-world-of-tokens","title":"Learning to Play Atari in a World of Tokens","date":"2024-06-03","arxiv_id":"2406.01361","n_code_links":0,"syntology":null},{"paper":null,"slug":"wash-train-your-ensemble-with-communication","title":"WASH: Train your Ensemble with Communication-Efficient Weight Shuffling, then Average","date":"2024-05-27","arxiv_id":"2405.17517","n_code_links":0,"syntology":null},{"paper":"/paper/control-dag-constrained-decoding-for-non","slug":"control-dag-constrained-decoding-for-non","title":"Control-DAG: Constrained Decoding for Non-Autoregressive Directed Acyclic T5 using Weighted Finite State Automata","date":"2024-04-10","arxiv_id":"2404.06854","n_code_links":1,"syntology":null},{"paper":null,"slug":"empowering-image-recovery-a-multi-attention","title":"Empowering Image Recovery_ A Multi-Attention Approach","date":"2024-04-06","arxiv_id":"2404.04617","n_code_links":0,"syntology":null},{"paper":null,"slug":"matrix-transformation-based-low-rank","title":"Matrix-Transformation Based Low-Rank Adaptation (MTLoRA): A Brain-Inspired Method for Parameter-Efficient Fine-Tuning","date":"2024-03-12","arxiv_id":"2403.07440","n_code_links":0,"syntology":null},{"paper":null,"slug":"applicability-of-oculomics-for-individual","title":"Applicability of oculomics for individual risk prediction: Repeatability and robustness of retinal Fractal Dimension using DART and AutoMorph","date":"2024-03-11","arxiv_id":"2403.06950","n_code_links":0,"syntology":null},{"paper":null,"slug":"dart-implicit-doppler-tomography-for-radar","title":"DART: Implicit Doppler Tomography for Radar Novel View Synthesis","date":"2024-03-06","arxiv_id":"2403.03896","n_code_links":0,"syntology":null},{"paper":null,"slug":"dart-depth-enhanced-accurate-and-real-time","title":"DART: Depth-Enhanced Accurate and Real-Time Background Matting","date":"2024-02-24","arxiv_id":"2402.15820","n_code_links":0,"syntology":null},{"paper":null,"slug":"dart-a-principled-approach-to-adversarially","title":"DART: A Principled Approach to Adversarially Robust Unsupervised Domain Adaptation","date":"2024-02-16","arxiv_id":"2402.11120","n_code_links":0,"syntology":null},{"paper":null,"slug":"gazebo-plants-simulating-plant-robot","title":"Gazebo Plants: Simulating Plant-Robot Interaction with Cosserat Rods","date":"2024-02-04","arxiv_id":"2402.02570","n_code_links":0,"syntology":null},{"paper":"/paper/self-training-from-self-memory-in-data-to","slug":"self-training-from-self-memory-in-data-to","title":"Self-training from Self-memory in Data-to-text Generation","date":"2024-01-19","arxiv_id":"2401.10567","n_code_links":1,"syntology":null},{"paper":null,"slug":"attention-distillation-and-tabularization","title":"Attention, Distillation, and Tabularization: Towards Practical Neural Network-Based Prefetching","date":"2023-12-23","arxiv_id":"2401.06362","n_code_links":0,"syntology":null},{"paper":"/paper/aspiro-any-shot-structured-parsing-error","slug":"aspiro-any-shot-structured-parsing-error","title":"ASPIRO: Any-shot Structured Parsing-error-Induced ReprOmpting for Consistent Data-to-Text Generation","date":"2023-10-27","arxiv_id":"2310.17877","n_code_links":1,"syntology":null}],"papers_shown":32,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":32,"with_a_code_link":8,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":32,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/dart/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/dart/papers/ran/1","json":"/method/dart/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/text-generation","name":"Text Generation","papers":6},{"task":"/task/data-to-text-generation","name":"Data-to-Text Generation","papers":4},{"task":"/task/image-generation","name":"Image Generation","papers":2},{"task":"/task/large-language-model","name":"Large Language Model","papers":2},{"task":"/task/object-detection","name":"Object Detection","papers":2},{"task":"/task/pseudo-label","name":"Pseudo Label","papers":2},{"task":"/task/red-teaming","name":"Red Teaming","papers":2},{"task":"/task/object-detection-1","name":"object-detection","papers":2},{"task":"/task/active-learning","name":"Active Learning","papers":1},{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":1},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":1},{"task":"/task/arithmetic-reasoning","name":"Arithmetic Reasoning","papers":1},{"task":"/task/bayesian-inference","name":"Bayesian Inference","papers":1},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/continual-learning","name":"Continual Learning","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":1},{"task":"/task/edge-computing","name":"Edge-computing","papers":1},{"task":"/task/image-classification","name":"Image Classification","papers":1}],"tasks_shown":20,"n_tasks":55,"usage_by_year":[{"year":"2023","papers":2},{"year":"2024","papers":24},{"year":"2025","papers":6}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/dart"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=DART","read_at":"2026-10-05T00:54:28+00:00","query":"DART","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"DART","origin_arxiv_id":"2108.13161"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":5,"in_graph":8,"list_truncated":true,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":false,"bearers_found":8,"served":{"arxiv_id":"2108.13161","citations":210},"leading_other_bearer":{"arxiv_id":"1703.09327","title":"DART: Noise Injection for Robust Imitation Learning","citations":337,"named_by":["title_prefix"],"bearer_name":"DART: Noise Injection for Robust Imitation Learning","ask_with":"have('1703.09327')"},"n_other_bearers_listed":5,"note":"'DART' is ALSO the name of the paper 'DART: Noise Injection for Robust Imitation Learning' (arXiv:1703.09327, 337 citations), which is cited more than the paper this answer is about (210). The margin is narrow, so this is not a claim that the other one is what you meant -- check `served.arxiv_id` against the paper you had in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"DARTCONTROL (DART)","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":2,"retrieve_with":"get_reference_implementation(name='DARTCONTROL (DART)')","origin_arxiv_id":"2410.05260"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2108.13161","page":"/paper/differentiable-prompt-makes-pre-trained","syntology_url":"https://syntology.ai/paper/2108.13161","in_graph_layer":true,"samples":4,"ran":3,"n_ran_checked":3,"n_instrument":0,"unverified":1,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 5 listed of 8 in the graph, strongest link: official). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2108.13161) is about this method is not checked.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"a7c1e6df37a7c1a7a7bdf0e34ec08be06e2172484285068a8e6121d7d5059b2a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}