Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning

Dengji Zhao; Haoyu Zhang; Miao Li; Tao Feng; Wentao Zhang; Xinke Jiang; Yuhan Pan; Yuxuan Cheng; Zhen Tao; Zhipeng Qiao

REVIEW 3 major objections 5 minor 291 references

Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning

T0 review · 3 major / 5 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Parallel Shapley replaces uniform outcome rewards with per-path Shapley values, sharply improving multi-path math reasoning and cutting training steps.

desk verdict A sensible Shapley-based credit-assignment recipe for parallel-reasoning RL, with suggestive but statistically fragile results and a load-bearing GRM that is never validated against the summary. read the letter →

arxiv 2607.18979 v1 pith:MH7VRS4N submitted 2026-07-21 cs.AI

Wentao Zhang , Haoyu Zhang , Xinke Jiang , Yuxuan Cheng , Yuhan Pan , Miao Li , Zhipeng Qiao , Tao Feng

show 2 more authors

Zhen Tao Dengji Zhao

This is my paper · ORCID

classification cs.AI

keywords ShapleyvalueparallelreasoningrewardattributionreinforcementlearninggenerativemodelcreditassignmentGRPOmathematical

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to show that the free-rider problem in parallel reasoning—where redundant or misleading paths collect the same reward as truly helpful ones—is measurable and fixable at training time. Its proposed fix, Parallel Shapley, assigns each reasoning path a process reward equal to its average marginal contribution to the utility of all path subsets, where that utility is scored by a generative reward model. The authors argue this dense, attribution-based signal lets a model learn from 40 reinforcement-learning steps what a uniform-reward baseline cannot learn in 200, and that it raises the upper bound of multi-path correctness (Pass@16) by 42.3% on average across competition-math benchmarks. The central consequence, if true, is that outcome-level reward is not a necessary bottleneck for learning to reason in parallel.

What carries the argument

The load-bearing object is the Monte Carlo Shapley value of a reasoning path: the path's expected marginal contribution to the utility of every coalition of other paths, U(S)=GRM(S), averaged over sampled path permutations. The generative reward model supplies the utility of each path subset from a five-dimension rubric (method soundness, formula completeness, computational accuracy, result correctness, and information purity); the Shapley average turns those subset scores into a per-path credit signal. Its role is to disambiguate learning: paths that add no information or actively mislead receive low or negative rewards even when the final summary is correct, which is exactly what uniform o

What would settle it

Using the authors' stored rollouts, compare GRM subset utilities against an outcome-derived ground truth: for each subset of paths, force the summarizer to write the summary from only those paths and check whether the mean GRM score orders the resulting correctness (Pass@1) monotonically. If a higher-GRM subset is not more likely to yield the correct answer, the process reward is not tracking marginal contribution to correctness, and the reported Pass@16 gains would be expected to survive even with random permutation of path rewards.

Watch

Extended reading notes

Core claim

The central claim is that replacing the single outcome-level reward shared by all reasoning paths with a Shapley-based process reward eliminates free-riding and yields better, cheaper training. Each path is a player in a cooperative game; the utility of any subset of paths is scored in [0,5] by a generative reward model prompted against the ground-truth answer, and each path's Shapley value—its average marginal utility contribution over all subset sizes and permutations—becomes its token-level reward, injected at the path's closing tag and normalized before GRPO advantage estimation. The paper reports that on four mathematics benchmarks, a 4-billion-parameter model trained this way for 40 st

Load-bearing premise

The method's correctness hinges entirely on the generative reward model's subset scores being a faithful measure of how much a set of reasoning paths helps produce the right final answer; if those scores are miscalibrated, the Shapley rewards are precise attributions of the wrong quantity.

Editorial extensions

If this is right

Redundant and misleading paths no longer receive positive gradient when the summary happens to be correct; the policy is pushed toward paths with positive marginal contribution.
Training efficiency improves: 40 GRPO steps suffice to match or beat a 200-step parallel-thinking baseline, with stable convergence around step 30.
The induced policy produces more complementary, specialized paths; masking a fraction of paths degrades Parallel Shapley-trained rollouts more sharply than uniform-reward rollouts.
Pass@16, a proxy for the upper bound of multi-path capability, rises by an average of 42.3% on three competition-math benchmarks, while Mean@16 improves modestly.
The benefit is not tied to one evaluator: the method beats the uniform-reward baseline even when the generative reward model is replaced by weaker open-source models, and preliminary multi-hop QA results show the pattern generalizes beyond mathematics.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The same Shapley-over-a-proxy-utility recipe could be applied to any generation problem where a final output is assembled from multiple components (code modules, retrieved evidence, tool-call chains); the paper's mechanism is agnostic to the component content as long as a subset scorer exists.
A cheap discriminating test: swap the GRM for a non-generative, outcome-derived utility (e.g., majority-vote correctness), and keep everything else fixed; if gains persist, the credit comes from the Shapley weighting rather than from the richer rubric.
The Mean@16 vs Pass@16 gap suggests the policy may be over-specializing individual paths; a distillation or summary-reward term that rewards synthesizing across paths could convert upper-bound gains into single-generation accuracy, a next step the paper itself flags.
Because the GRM never reads the summary, the paper's measure of 'contribution' is indirect; feeding the GRM the full response (paths plus summary) would test whether the current utility is actually aligned with the final output quality that the outcome reward measures.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The paper is worth reading: it takes a real weakness in Parallel-R1's uniform outcome rewards and replaces them with Monte-Carlo Shapley values over a generative-reward-model utility. The combination is the genuinely new part; Shapley values themselves are standard. The empirical work is honest—they report the Pass@16/Mean@16 trade-off, run ablations for LOO, independent-path evaluation, GRM strength, and path count, and they use a fixed base model and training recipe.

What holds it back is statistical fragility. All comparisons are single runs with no error bars. The headline 42.3% Pass@16 improvement is inflated by AIME24 (+90.7%), where n=30 makes the binomial noise about ±9 points. AIME25's +32.3% is about 1.3 SE. The direction of the effect is consistent across four benchmarks and three GRM strengths, and that consistency is reassuring, but the strength of the claim exceeds the evidence.

The bigger conceptual soft spot is the GRM. The Shapley values decompose U(S)=GRM(S), but the GRM never conditions on the

; it scores bare path subsets against ground truth. The paper never shows that GRM(P) tracks the outcome reward r_out, nor that the Shapley values correlate with actual path contributions. Appendix A proves free-riding under Σφ_j=r_out with factorized log-probabilities, but the implementation uses normalized Shapley values summing to GRM(P) and autoregressive paths. So the theoretical justification does not cover the implemented reward. That mismatch doesn't kill the empirical result—training toward a differentiated proxy could still be better than uniform rewards—but it means the "free-rider" story is not established.

Also minor: λ_o and λ_p are fixed untested at 0.5/0.5, M=5 permutation samples is small, and K=4 is selected from a subjectively chosen sweep.

Bottom line: this deserves a serious referee. The idea is timely, the experiments are the right ones, and the limitations are acknowledged. But acceptance should require repeated-seed CIs, a GRM-vs-outcome correlation check, and reconciliation of the appendix with the implemented reward tensor. I would bring it to reading group as a case study in how credit-assignment ideas enter LLM RL.

Referee Report

3 major / 5 minor

Summary. The paper proposes Parallel Shapley, a reinforcement learning framework for multi-path ('parallel thinking') LLM reasoning. Each reasoning path is treated as a player in a cooperative game; a generative reward model (GRM) scores subsets of paths, and Monte Carlo Shapley values are used as token-level path rewards in GRPO, combined with a final outcome reward. Experiments on AIME24/25, AMC23, and MATH with a Qwen3-4B base report an average 42.3% relative improvement in Pass@16 over the Parallel-R1-Unseen baseline while using 40 rather than 200 RL steps, together with ablations (leave-one-out, independent evaluation, GRM strength, path count) and an appendix on multi-hop QA.

Significance. The idea of using Shapley-based credit assignment for parallel reasoning paths is timely and relevant to RL training for LLMs. The implementation is concrete (built on VERL, with an external GRM), and the GRM-strength ablation and multi-hop QA extension are useful sanity checks. If the attribution mechanism were properly validated, the work could influence reward design for multi-path generation. However, the central evidence is single-run benchmark numbers, and the path-level reward is computed from an unvalidated GRM proxy rather than from the actual summary-generation process, so the significance is conditional on additional validation.

major comments (3)

[§3.2, Appendix B] The process reward is the Monte Carlo Shapley value of U(S)=GRM(S), where the GRM is prompted (Appendix B) to score a bare subset of paths against the ground-truth answer. The GRM never sees the policy's <Summary>, yet a path's true marginal contribution in parallel reasoning is defined by how the summarizer uses it. The paper provides no evidence that GRM subset utilities track the summary's use of paths, nor that GRM(P) is consistent with the outcome reward r_out. Appendix A's motivating theorem assumes Σ_j φ_j = r_out (Eqs. 18–20), but the implemented reward tensor (§3.3) sums the Shapley rewards to GRM(P) and injects r_out separately at the final token. The claimed 'less biased, free-rider-free' signal is therefore unsupported as stated. Please add a direct validation, e.g., measure the correlation between GRM(P) and r_out over rollouts, or compare Shapley path rewards against human/
[Table 1, Table 2] All reported results are single-run, with no confidence intervals or repeated seeds. On the 30-problem AIME sets, the AIME25 Pass@16 difference (50.0 vs. 37.8, +12.2 points) is about 1.0 binomial standard error, and the AIME24 difference (63.3 vs. 33.2, +30.1 points) is about 2.4 standard errors. The 'consistently outperforms' claim is not statistically established. Moreover, K=4 is selected from the sensitivity sweep in Table 2 using the same test benchmarks, so the reported K=4 numbers are the best case over the path count, further inflating apparent gains. Please report multiple seeds, bootstrap confidence intervals, and either a validation split for hyperparameter selection or an appropriate multiple-comparison correction.
[Appendix A, Eqs. (2), (13), (16), (18)–(20)] The theoretical justification for the harm of uniform rewards contains derivational gaps. Eq. (16) converts a triangle-inequality bound into an approximate equality; Eq. (2) does not follow from Eq. (13) without an additional assumption about the sum of cosine-similarity terms; and Eq. (18)'s decomposition U(P)=Σ_j φ_j(P−j) is not the Shapley decomposition used in the implementation (which averages over all coalitions, not just P−j). Since this theorem is the paper's stated motivation for needing path-level rewards, it should be corrected or explicitly labeled as heuristic motivation rather than a formal result.

minor comments (5)

[§4.3, Table 1] The text says 'Independent path evaluation achieves the lowest performance (Avg. 46.5)' and 'LOO performs slightly worse (Avg. 46.2)', but Table 1 shows LOO at 46.2 and Independent at 46.5. The text and table contradict each other; LOO is lower.
[§3.3] The normalization of the two reward signals is not specified. It is unclear whether the Shapley rewards are normalized per rollout, per group, or globally, and how λ_o=0.5, λ_p=0.5 interact with that normalization. Please define 'normalized Shapley reward' explicitly.
[Appendix B] The evaluation prompt says it assesses 'the solution-path summary for {query}', but it then refers to '{path}' in the singular and does not specify how a subset of multiple paths is serialized into the prompt. This makes the GRM's exact input for a coalition S ambiguous.
[§4.2] The abstract and Section 4.2 claim 'consistently outperforms' strong baselines, but Table 1 shows AIME25 Mean@16 for Parallel Shapley (17.2) is below Parallel-R1-Unseen (17.7). Please qualify the claim to Pass@16 or overall average.
[Appendix D.1] Monte Carlo sampling uses M=5 for K=3,4,5. With such a small number of permutations, the Shapley estimates are likely to be noisy, yet no variance diagnostics or sensitivity to M are reported. Please report the variance of φ across permutations or increase M.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central empirical claim is validated against held-out exact-match benchmarks and the path rewards come from an external, ablated generative reward model.

full rationale

The paper's main claim—that Shapley-based path-level rewards improve parallel reasoning—is not circular. The path-level reward is the Monte Carlo Shapley value of U(S)=GRM(S), where GRM is an external generative reward model scoring subsets of paths against ground truth; it is not fitted to the evaluation metric. Evaluation is exact-match accuracy on held-out benchmarks (AIME, AMC, MATH, multi-hop QA), which is independent of the reward model's internal scores. The GRM-sensitivity ablation (Qwen2.5-3B through Qwen2.5-7B) shows the result does not depend on a particular evaluator. The Shapley efficiency identity (sum of Shapley values equals U(P)) is a mathematical theorem, not a circular loading of the conclusion. The Appendix A assumption that Σφ_j=r_out is a theoretical motivation, and the gap between GRM(P) and r_out is a validity limitation, not a circularity: no derived quantity is identical by construction to an input. The cited Parallel-R1 tags and cold-start dataset are not self-citations by the present authors and are used as external building blocks, not as the sole justification of the central claim. Therefore no step satisfies the quoted-reduction standard for circularity.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

The central claim rests on (i) the unvalidated identification U(S)=GRM(S) as the utility whose Shapley values constitute process rewards; (ii) hand-set hyperparameters λo=λp=0.5, K=4 (best of a sweep), M=5; and (iii) an appendix theorem whose assumptions (Σφ=rout; factorized path log-probs) are not satisfied by the implementation. Shapley-value mathematics and MC convergence are standard background. No new entities are invented — GRM is an existing model class used as a component. Net contribution: a new application of textbook Shapley attribution, with the scientific load carried by whether GRM subset scores are a valid proxy for outcome contribution and whether single-run benchmark deltas survive statistical scrutiny.

free parameters (4)

reward combination weights λ_o, λ_p = 0.5 / 0.5 (all experiments)
Hand-set in §3.3 and App. D.1 ('set to λo=0.5 and λp=0.5 throughout'); never ablated, so the balance between outcome and process signals is a free choice that shapes the reward tensor.
path count K = 4 (best of sweep {2,3,4,5})
K=4 chosen from the parameter sensitivity sweep (§4.3, Table 2); all main results and the GRM-sensitivity block use the best-scoring K, and K=5 degrades uniformly — the headline configuration is a selection over K.
Monte Carlo permutation count M = 5 for K=3,4,5 (full enumeration at K=2)
Hand-chosen in App. D.1; no convergence check is reported for the O(1/√M) error bound, so the process-reward noise floor is unknown.
GRM utility rubric = 0-5 scale; five 1-point dimensions (Table 3)
The utility U(S) whose Shapley values become process rewards is defined by a hand-authored rubric (Method Reliability, Formula Completeness, Computational Accuracy, Result Correctness, Information Purity). The scale and dimension weights are ad hoc design choices that define every Shapley value in the paper.

assumptions (6)

standard math Shapley-value axioms and Monte Carlo convergence O(1/√M)
§3.2 uses the standard permutation formulation of Shapley values and its MC estimator; these are textbook results, not the paper's contribution.
domain assumption U(S)=GRM(S) is a valid proxy for a path subset's contribution to the final outcome
§3.2: 'the utility function U(·) cannot be reliably estimated using verified reward signals such as RLVR. Therefore, we instantiate U(·) using Generative Reward Model.' The GRM is never validated against outcome correctness, and it never reads the <Summary>, so the proxy link is assumed.
ad hoc to paper Path log-probabilities factorize as log π(paths) = Σ_j log π(path_j)
Appendix A, Eqs. (4)-(5): the free-rider theorem treats paths as independently sampled terms in a REINFORCE gradient. Autoregressive generation of nested <Parallel>/<Path> blocks produces a single coupled sequence, so the factorization is not satisfied by the system being analyzed.
ad hoc to paper Σ_j φ_j = rout: Shapley values exhaust the outcome reward
Appendix A, Eqs. (18)-(20) assert the true utility decomposes with Σφ_j = rout. In the implementation, Shapley values are computed for U = GRM, so Σφ_j = GRM(P), a separate unvalidated quantity — the theorem's premise does not match the system.
domain assumption GRPO group-relative normalization is valid for a mixed outcome+process reward tensor
§3.3: both reward signals are normalized and combined into one token-level tensor, then group-normalized for advantage. No analysis is given for how the two heterogeneous signals interact under mean/std normalization.
standard math First-order Taylor expansion of the policy probability at small learning rate
Appendix A, Eqs. (6)-(9): the conclusion that misleading paths get positive updates relies on a first-order expansion in μ; standard but unproven here, and it ignores the KL and clip terms in the actual GRPO objective.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning." pith.science (2026). https://pith.science/paper/MH7VRS4N

@misc{pith2026260718979,
  author       = {Pith},
  title        = {Pith review of: Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MH7VRS4N}},
  note         = {Machine review of arXiv:2607.18979}
}

read the original abstract

Large Language Models (LLMs) excel at multi-step reasoning, yet current parallel reasoning approaches often fail to distinguish the contributions of individual reasoning paths. Many paths may be redundant, misleading, or even detrimental, but outcome-level rewards assign uniform reward, leading to ambiguous learning signals and unstable training. We propose Parallel Shapley, a reinforcement learning framework that attributes fine-grained, path-level contributions in multi-path reasoning. Treating each path as a player in a cooperative game, we leverage Shapley values to quantify marginal contributions, using a generative reward model to evaluate path utilities and Monte Carlo sampling for efficient approximation. Experiments on mathematical reasoning benchmarks show that Parallel Shapley outperforms existing baselines while providing more stable and interpretable training. Our framework effectively "fishes out the free riders," assigning reward proportionally and improving multi-path reasoning in LLMs.

Figures

Figures reproduced from arXiv: 2607.18979 by the authors.

**Figure 2.** Overview of Parallel Shapley Pipeline. Left: Comparison of training frameworks. Parallel-R1 assigns uniform outcome rewards to all paths, while Parallel Shapley computes individualized marginal contributions for each reasoning path. Right: The Shapley-based reward attribution mechanism. We sample M path permutations via Monte Carlo, compute marginal contributions ∆ πm j under each ordering, and aggregate them to obt… view at source ↗

**Figure 3.** Training-curve comparison among Parallel [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗

Figures from the paper (1 more)

**Figure 4.** Figure 4: Path dependency analysis (K = 4). Solid lines denote full-path baselines; dashed lines denote the corresponding masking conditions. meration, or boundary verification. Parallel-R1’s uniform rewards, by contrast, produce redundant paths that rehearse the same logic, so …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

291 extracted references · 51 linked inside Pith

[1]

Bradley Brown, Jordan Juravsky, Ryan Ehrlich, Ronald Clark, Quoc V Le, Christopher R \'e , and Azalia Mirhoseini. 2024. Large language monkeys: Scaling inference compute with repeated sampling. arXiv preprint arXiv:2407.21787

arXiv 2024
[2]

Keyu Chen, Zhifeng Shen, Daohai Yu, Haoqian Wu, Wei Wen, Jianfeng He, Ruizhi Qiao, and Xing Sun. 2025. Aspd: Unlocking adaptive serial-parallel decoding by exploring intrinsic parallelism in llms. arXiv preprint arXiv:2508.08895

arXiv 2025
[3]

Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, and 1 others. 2025. Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities. arXiv preprint arXiv:2507.06261

arXiv 2025
[6]

Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Peiyi Wang, Qihao Zhu, Runxin Xu, Ruoyu Zhang, Shirong Ma, Xiao Bi, Xiaokang Zhang, Xingkai Yu, Yu Wu, Z. F. Wu, Zhibin Gou, Zhihong Shao, Zhuoshu Li, Ziyi Gao, Aixin Liu, and 175 others. 2025. https://doi.org/10.1038/s41586-025-09422-z Deepseek-r1 incentivizes reasoning in llms through reinforcement lear...

doi:10.1038/s41586-025-09422-z 2025
[8]

Dan Hendrycks, Collin Burns, Saurav Kadavath, Akul Arora, Steven Basart, Eric Tang, Dawn Song, and Jacob Steinhardt. 2021 b . https://arxiv.org/abs/2103.03874 Measuring mathematical problem solving with the math dataset . Preprint, arXiv:2103.03874

arXiv 2021
[9]

Xanh Ho, Anh-Khoa Duong, Quoc-Huy Nguyen, and Suong Nguyen. 2020. Constructing a multi-hop qa dataset for comprehensive evaluation of reasoning steps. In COLING

2020
[10]

Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, and Dario Amodei

Jared Kaplan, Sam McCandlish, Tom Henighan, Tom B. Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, and Dario Amodei. 2020. https://arxiv.org/abs/2001.08361 Scaling laws for neural language models . Preprint, arXiv:2001.08361

arXiv 2020
[11]

David Scott Lewis. 2025. From brute force to brain power: How stanford's s1 surpasses deepseek-r1

2025

Show all 291 references

[12]

Dakota Mahan, Duy Van Phung, Rafael Rafailov, Chase Blagden, Nathan Lile, Louis Castricato, Jan-Philipp Fränken, Chelsea Finn, and Alon Albalak. 2024. https://arxiv.org/abs/2410.12832 Generative reward models . Preprint, arXiv:2410.12832

2024 arXiv
[13]

Mathematical Association of America . 2023. American mathematics competitions ( AMC ). https://maa.org/student-programs/amc/. Problems from the 2023 AMC 10 and AMC 12 examinations

2023
[14]

Mathematical Association of America . 2024. American invitational mathematics examination ( AIME ). https://maa.org/maa-invitational-competitions/. Problems from AIME 2024 and AIME 2025 editions

2024
[15]

OpenAI. 2025. https://openai.com/o1/ Openai-o1 . Accessed: 2025-05-16

2025
[16]

Manning, and Chelsea Finn

Rafael Rafailov, Archit Sharma, Eric Mitchell, Stefano Ermon, Christopher D. Manning, and Chelsea Finn. 2024. https://arxiv.org/abs/2305.18290 Direct preference optimization: Your language model is secretly a reward model . Preprint, arXiv:2305.18290

2024 arXiv
[18]

Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, YK Li, Y Wu, and 1 others. 2024. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. arXiv preprint arXiv:2402.03300

2024 arXiv
[19]

Guangming Sheng, Chi Zhang, Zilingfeng Ye, Xibin Wu, Wang Zhang, Ru Zhang, Yanghua Peng, Haibin Lin, and Chuan Wu. 2024. Hybridflow: A flexible and efficient rlhf framework. arXiv preprint arXiv: 2409.19256

2024 arXiv
[20]

Ibne Farabi Shihab, Sanjeda Akter, and Anuj Sharma. 2025. Detecting and mitigating reward hacking in reinforcement learning systems: A comprehensive empirical study. arXiv preprint arXiv:2507.05619

2025
[21]

Jiankai Sun, Chuanyang Zheng, Enze Xie, Zhengying Liu, Ruihang Chu, Jianing Qiu, Jiaqi Xu, Mingyu Ding, Hongyang Li, Mengzhe Geng, Yue Wu, Wenhai Wang, Junsong Chen, Zhangyue Yin, Xiaozhe Ren, Jie Fu, Junxian He, Wu Yuan, Qi Liu, and 15 others. 2024. https://arxiv.org/abs/2312...

2024 arXiv
[22]

Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, and Ashish Sabharwal. 2022. Musique: Multihop reasoning dataset with explanation. arXiv preprint arXiv:2108.00573

2022 arXiv
[23]

Minh Duc Vu, Han Wang, Zhuang Li, Jieshan Chen, Shengdong Zhao, Zhenchang Xing, and Chunyang Chen. 2024. https://arxiv.org/abs/2401.14268 Gptvoicetasker: Llm-powered virtual assistant for smartphone . Preprint, arXiv:2401.14268

2024 arXiv
[25]

Xuezhi Wang, Jason Wei, Dale Schuurmans, Quoc Le, Ed Chi, Sharan Narang, Aakanksha Chowdhery, and Denny Zhou. 2022. Self-consistency improves chain of thought reasoning in language models. arXiv preprint arXiv:2203.11171

2022 arXiv
[26]

Hao Wen, Yifan Su, Feifei Zhang, Yunxin Liu, Yunhao Liu, Ya-Qin Zhang, and Yuanchun Li. 2025. Parathinker: Native parallel thinking as a new paradigm to scale llm test-time compute. arXiv preprint arXiv:2509.04475

2025 arXiv
[27]

Fang Wu, Weihao Xuan, Heli Qi, Aaron Tu, Ximing Lu, Li Erran Li, and Yejin Choi. 2026. https://openreview.net/forum?id=Kx0G6v2c2S Deepsearch: Overcome the bottleneck of reinforcement learning with verifiable rewards via tree-based search . In The Fourteenth International Confe...

2026
[28]

Tong Wu, Yang Liu, Jun Bai, Zixia Jia, Shuyi Zhang, Ziyong Lin, Yanting Wang, Song-Chun Zhu, and Zilong Zheng. 2025. Native parallel reasoner: Reasoning in parallelism via self-distilled reinforcement learning. arXiv preprint arXiv:2512.07461

2025 arXiv
[29]

An Yang, Anfeng Li, Baosong Yang, Beichen Zhang, Binyuan Hui, Bo Zheng, Bowen Yu, Chang Gao, Chengen Huang, Chenxu Lv, Chujie Zheng, Dayiheng Liu, Fan Zhou, Fei Huang, Feng Hu, Hao Ge, Haoran Wei, Huan Lin, Jialong Tang, and 41 others. 2025 a . Qwen3 technical report

2025
[30]

An Yang, Baosong Yang, Beichen Zhang, Binyuan Hui, Bo Zheng, Bowen Yu, Chengyuan Li, Dayiheng Liu, Fei Huang, Haoran Wei, and 1 others. 2024. Qwen2. 5 technical report. arXiv preprint arXiv:2412.15115

2024 arXiv
[31]

Xinyu Yang, Yuwei An, Hongyi Liu, Tianqi Chen, and Beidi Chen. 2025 b . Multiverse: Your language models secretly decide how to parallelize and merge generation

2025
[32]

Zhilin Yang, Peng Qi, Saizheng Zhang, and 1 others. 2018. Hotpotqa: A dataset for diverse, explainable multi-hop question answering. In EMNLP

2018
[33]

Griffiths, Yuan Cao, and Karthik Narasimhan

Shunyu Yao, Dian Yu, Jeffrey Zhao, Izhak Shafran, Thomas L. Griffiths, Yuan Cao, and Karthik Narasimhan. 2023. https://arxiv.org/abs/2305.10601 Tree of thoughts: Deliberate problem solving with large language models . Preprint, arXiv:2305.10601

2023 arXiv
[34]

Qiying Yu, Zheng Zhang, Ruofei Zhu, Yufeng Yuan, Xiaochen Zuo, Yu Yue, Weinan Dai, Tiantian Fan, Gaohong Liu, Lingjun Liu, Xin Liu, Haibin Lin, Zhiqi Lin, Bole Ma, Guangming Sheng, Yuxuan Tong, Chi Zhang, Mofan Zhang, Wang Zhang, and 16 others. 2025. DAPO : An open-source LLM ...

2025
[35]

Di Zhang, Xiaoshui Huang, Dongzhan Zhou, Yuqiang Li, and Wanli Ouyang. 2024. Accessing gpt-4 level mathematical olympiad solutions via monte carlo tree self-refine with llama-3 8b. arXiv preprint arXiv:2406.07394

2024 arXiv
[36]

Qiyuan Zhang, Fuyuan Lyu, Zexu Sun, Lei Wang, Weixu Zhang, Wenyue Hua, Haolun Wu, Zhihan Guo, Yufei Wang, Niklas Muennighoff, Irwin King, Xue Liu, and Chen Ma. 2025. https://arxiv.org/abs/2503.24235 A survey on test-time scaling in large language models: What, how, where, and ...

2025 arXiv
[37]

Tong Zheng, Hongming Zhang, Wenhao Yu, Xiaoyang Wang, Xinyu Yang, Runpeng Dai, Rui Liu, Huiwen Bao, Chengsong Huang, Heng Huang, and Dong Yu. 2025. Parallel-r1: Towards parallel thinking via reinforcement learning

2025
[38]

Zijian Zhou, Ao Qu, Zhaoxuan Wu, Sunghwan Kim, Alok Prakash, Daniela Rus, Jinhua Zhao, Bryan Kian Hsiang Low, and Paul Pu Liang. 2025. MEM1 : Learning to synergize memory and reasoning for efficient long-horizon agents. arXiv preprint arXiv:2506.15841

2025 arXiv
[39]

Guo, Daya and Yang, Dejian and Zhang, Haowei and Song, Junxiao and Wang, Peiyi and Zhu, Qihao and Xu, Runxin and Zhang, Ruoyu and Ma, Shirong and Bi, Xiao and Zhang, Xiaokang and Yu, Xingkai and Wu, Yu and Wu, Z. F. and Gou, Zhibin and Shao, Zhihong and Li, Zhuoshu and Gao, Zi...
[40]

Aho and Jeffrey D

Alfred V. Aho and Jeffrey D. Ullman , title =. 1972

1972
[41]

Publications Manual , year = "1983", publisher =

1983
[42]

2021 , eprint=

Measuring Mathematical Problem Solving With the MATH Dataset , author=. 2021 , eprint=

2021
[43]

2024 , journal =

HybridFlow: A Flexible and Efficient RLHF Framework , author =. 2024 , journal =

2024
[44]

Chandra and Dexter C

Ashok K. Chandra and Dexter C. Kozen and Larry J. Stockmeyer , year = "1981", title =. doi:10.1145/322234.322243

1981
[45]

arXiv preprint arXiv:2506.01939 , year=

Beyond the 80/20 rule: High-entropy minority tokens drive effective reinforcement learning for llm reasoning , author=. arXiv preprint arXiv:2506.01939 , year=

arXiv
[46]

Scalable training of

Andrew, Galen and Gao, Jianfeng , booktitle=. Scalable training of
[47]

Dan Gusfield , title =. 1997

1997
[48]

Tetreault , title =

Mohammad Sadegh Rasooli and Joel R. Tetreault , title =. Computing Research Repository , volume =. 2015 , url =

2015
[49]

A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data , Volume =

Ando, Rie Kubota and Zhang, Tong , Issn =. A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data , Volume =. Journal of Machine Learning Research , Month = dec, Numpages =
[50]

Xinyu Yang and Yuwei An and Hongyi Liu and Tianqi Chen and Beidi Chen , title =
[51]

Tong Zheng and Hongming Zhang and Wenhao Yu and Xiaoyang Wang and Xinyu Yang and Runpeng Dai and Rui Liu and Huiwen Bao and Chengsong Huang and Heng Huang and Dong Yu , title =
[52]

Hao Wen and Yifan Su and Feifei Zhang and Yunxin Liu and Yunhao Liu and Ya-Qin Zhang and Yuanchun Li , title =
[53]

Advances in Neural Information Processing Systems , volume=

Rest-mcts*: Llm self-training via process reward guided tree search , author=. Advances in Neural Information Processing Systems , volume=
[54]

2025 , eprint=

Beyond Ten Turns: Unlocking Long-Horizon Agentic Search with Large-Scale Asynchronous RL , author=. 2025 , eprint=

2025
[55]

2024 , eprint=

Direct Preference Optimization: Your Language Model is Secretly a Reward Model , author=. 2024 , eprint=

2024
[56]

arXiv preprint arXiv:2305.14992 , year=

Reasoning with language model is planning with world model , author=. arXiv preprint arXiv:2305.14992 , year=

arXiv
[57]

arXiv preprint arXiv:2406.11176 , year=

Watch every step! llm agent learning via iterative step-level process refinement , author=. arXiv preprint arXiv:2406.11176 , year=

arXiv
[58]

arXiv preprint arXiv:2210.03629 , year=

ReAct: Synergizing Reasoning and Acting in Language Models , author=. arXiv preprint arXiv:2210.03629 , year=

arXiv
[59]

arXiv preprint arXiv:1707.06347 , year=

Proximal policy optimization algorithms , author=. arXiv preprint arXiv:1707.06347 , year=

arXiv
[60]

Journal of artificial intelligence research , volume=

Reinforcement learning: A survey , author=. Journal of artificial intelligence research , volume=
[61]

Journal of Cognitive Neuroscience , volume=

Reinforcement learning , author=. Journal of Cognitive Neuroscience , volume=
[62]

P lan RAG : A Plan-then-Retrieval Augmented Generation for Generative Large Language Models as Decision Makers

Lee, Myeonghwa and An, Seonho and Kim, Min-Soo. P lan RAG : A Plan-then-Retrieval Augmented Generation for Generative Large Language Models as Decision Makers. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Hu...

2024 doi
[63]

arXiv preprint arXiv:2501.17161 , year=

Sft memorizes, rl generalizes: A comparative study of foundation model post-training , author=. arXiv preprint arXiv:2501.17161 , year=

arXiv
[64]

arXiv preprint arXiv:2408.09199 , year=

TC-RAG: Turing-Complete RAG's Case study on Medical LLM Systems , author=. arXiv preprint arXiv:2408.09199 , year=

arXiv
[65]

arXiv preprint arXiv:2412.12881 , year=

RAG-Star: Enhancing Deliberative Reasoning with Retrieval Augmented Verification and Refinement , author=. arXiv preprint arXiv:2412.12881 , year=

arXiv
[66]

Inference Scaling for Long-Context Retrieval Augmented Generation , author=
[67]

arXiv preprint arXiv:2410.20753 , year=

Plan times RAG: Planning-guided Retrieval Augmented Generation , author=. arXiv preprint arXiv:2410.20753 , year=

arXiv
[68]

arXiv preprint arXiv:2504.10198 , year=

DioR: Adaptive Cognitive Detection and Contextual Retrieval Optimization for Dynamic Retrieval-Augmented Generation , author=. arXiv preprint arXiv:2504.10198 , year=

arXiv
[69]

IEEE Transactions on Computational Intelligence and AI in games , volume=

A survey of monte carlo tree search methods , author=. IEEE Transactions on Computational Intelligence and AI in games , volume=. 2012 , publisher=

2012
[70]

arXiv preprint arXiv:2502.01142 , year=

DeepRAG: Thinking to Retrieval Step by Step for Large Language Models , author=. arXiv preprint arXiv:2502.01142 , year=

arXiv
[71]

Statistical Rejection Sampling Improves Preference Optimization , author=
[72]

arXiv preprint arXiv:2504.11343 , year=

A minimalist approach to llm reasoning: from rejection sampling to reinforce , author=. arXiv preprint arXiv:2504.11343 , year=

arXiv
[73]

arXiv preprint arXiv:2501.05366 , year=

Search-o1: Agentic search-enhanced large reasoning models , author=. arXiv preprint arXiv:2501.05366 , year=

arXiv
[74]

arXiv preprint arXiv:2503.09516 , year=

Search-r1: Training llms to reason and leverage search engines with reinforcement learning , author=. arXiv preprint arXiv:2503.09516 , year=

arXiv
[75]

arXiv preprint arXiv:2510.14545 , year=

Agentic entropy-balanced policy optimization , author=. arXiv preprint arXiv:2510.14545 , year=
[76]

arXiv preprint arXiv:2507.19849 , year=

Agentic reinforced policy optimization , author=. arXiv preprint arXiv:2507.19849 , year=

arXiv
[77]

arXiv preprint arXiv:2506.04185 , year=

R-Search: Empowering LLM Reasoning with Search via Multi-Reward Reinforcement Learning , author=. arXiv preprint arXiv:2506.04185 , year=

arXiv
[78]

arXiv preprint arXiv:2503.20201 , year=

Open deep search: Democratizing search with open-source reasoning agents , author=. arXiv preprint arXiv:2503.20201 , year=

arXiv
[79]

arXiv preprint arXiv:2411.00744 , year=

CORAG: A Cost-Constrained Retrieval Optimization System for Retrieval-Augmented Generation , author=. arXiv preprint arXiv:2411.00744 , year=
[80]

arXiv preprint arXiv:2501.10053 , year=

Airrag: Activating intrinsic reasoning for retrieval augmented generation via tree-based search , author=. arXiv preprint arXiv:2501.10053 , year=

arXiv
[81]

CoRR , year=

SeaKR: Self-aware Knowledge Retrieval for Adaptive Retrieval Augmented Generation , author=. CoRR , year=
[82]

Proceedings of the 31st International Conference on Computational Linguistics , pages=

LLMs Know What They Need: Leveraging a Missing Information Guided Framework to Empower Retrieval-Augmented Generation , author=. Proceedings of the 31st International Conference on Computational Linguistics , pages=
[83]

Findings of the Association for Computational Linguistics: EMNLP 2023 , pages=

Self-Knowledge Guided Retrieval Augmentation for Large Language Models , author=. Findings of the Association for Computational Linguistics: EMNLP 2023 , pages=

2023
[84]

Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval , pages=

Im-rag: Multi-round retrieval-augmented generation through learning inner monologues , author=. Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval , pages=
[85]

arXiv preprint arXiv:2410.01428 , year=

Can We Further Elicit Reasoning in LLMs? Critic-Guided Planning with Retrieval-Augmentation for Solving Challenging Tasks , author=. arXiv preprint arXiv:2410.01428 , year=

arXiv
[86]

arXiv preprint arXiv:2501.14342 , year=

Chain-of-Retrieval Augmented Generation , author=. arXiv preprint arXiv:2501.14342 , year=
[87]

Advances in neural information processing systems , volume=

Chain-of-thought prompting elicits reasoning in large language models , author=. Advances in neural information processing systems , volume=
[88]

Advances in Neural Information Processing Systems , volume=

Star: Bootstrapping reasoning with reasoning , author=. Advances in Neural Information Processing Systems , volume=
[89]

arXiv preprint arXiv:2501.12948 , year=

Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning , author=. arXiv preprint arXiv:2501.12948 , year=

arXiv
[90]

arXiv preprint arXiv:2501.19393 , year=

s1: Simple test-time scaling , author=. arXiv preprint arXiv:2501.19393 , year=

arXiv
[91]

arXiv preprint arXiv:2408.03314 , year=

Scaling llm test-time compute optimally can be more effective than scaling model parameters , author=. arXiv preprint arXiv:2408.03314 , year=

arXiv
[92]

arXiv preprint arXiv:2503.01307 , year=

Cognitive behaviors that enable self-improving reasoners, or, four habits of highly effective stars , author=. arXiv preprint arXiv:2503.01307 , year=

arXiv
[93]

arXiv preprint arXiv:2210.03350 , year=

Measuring and narrowing the compositionality gap in language models , author=. arXiv preprint arXiv:2210.03350 , year=

arXiv
[94]

arXiv preprint arXiv:2305.15294 , year=

Enhancing retrieval-augmented large language models with iterative retrieval-generation synergy , author=. arXiv preprint arXiv:2305.15294 , year=

arXiv
[95]

Advances in Neural Information Processing Systems , volume=

Toolformer: Language models can teach themselves to use tools , author=. Advances in Neural Information Processing Systems , volume=
[96]

International Conference on Learning Representations (ICLR) , year=

React: Synergizing reasoning and acting in language models , author=. International Conference on Learning Representations (ICLR) , year=
[97]

Family practice , volume=

Diagnostic uncertainty in primary care: what is known about its communication, and what are the associated ethical issues? , author=. Family practice , volume=. 2021 , publisher=

2021
[98]

2023 , eprint=

Fast Inference from Transformers via Speculative Decoding , author=. 2023 , eprint=

2023
[99]

2023 , eprint=

Accelerating Large Language Model Decoding with Speculative Sampling , author=. 2023 , eprint=

2023
[100]

2024 , eprint=

From RAG to RICHES: Retrieval Interlaced with Sequence Generation , author=. 2024 , eprint=

2024
[101]

2024 , eprint=

Deciphering the Interplay of Parametric and Non-parametric Memory in Retrieval-augmented Language Models , author=. 2024 , eprint=

2024
[102]

2021 , eprint=

Did Aristotle Use a Laptop? A Question Answering Benchmark with Implicit Reasoning Strategies , author=. 2021 , eprint=

2021
[103]

2024 , eprint=

The Llama 3 Herd of Models , author=. 2024 , eprint=

2024
[104]

IIRC : A Dataset of Incomplete Information Reading Comprehension Questions

Ferguson, James and Gardner, Matt and Hajishirzi, Hannaneh and Khot, Tushar and Dasigi, Pradeep. IIRC : A Dataset of Incomplete Information Reading Comprehension Questions. Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). 2020. do...

2020 doi
[105]

2018 , eprint=

HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering , author=. 2018 , eprint=

2018
[106]

Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps

Ho, Xanh and Duong Nguyen, Anh-Khoa and Sugawara, Saku and Aizawa, Akiko. Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps. Proceedings of the 28th International Conference on Computational Linguistics. 2020

2020
[107]

Chain-of-History Reasoning for Temporal Knowledge Graph Forecasting

Xia, Yuwei and Wang, Ding and Liu, Qiang and Wang, Liang and Wu, Shu and Zhang, Xiao-Yu. Chain-of-History Reasoning for Temporal Knowledge Graph Forecasting. Findings of the Association for Computational Linguistics: ACL 2024. 2024. doi:10.18653/v1/2024.findings-acl.955

2024 doi
[108]

Understanding Chain-of-Thought in

Jean-Francois Ton and Muhammad Faaiz Taufiq and Yang Liu , year=. Understanding Chain-of-Thought in
[109]

Journal of Engineering and Applied Science , volume=

Building an enhanced case-based reasoning and rule-based systems for medical diagnosis , author=. Journal of Engineering and Applied Science , volume=. 2023 , publisher=

2023
[110]

Meena, P. L. and Sarmah, S. P. , title =. Transportation Research Part E: Logistics and Transportation Review , year =
[111]

Abril and Robert Plant

Patricia S. Abril and Robert Plant. The patent holder's dilemma: Buy, sell, or troll?. Communications of the ACM. 2007. doi:10.1145/1188913.1188915

2007
[112]

Deciding equivalances among conjunctive aggregate queries

Sarah Cohen and Werner Nutt and Yehoshua Sagic. Deciding equivalances among conjunctive aggregate queries. doi:10.1145/1219092.1219093
[113]

Special issue: Digital Libraries. 1996

1996
[114]

Understanding Policy-Based Networking

David Kosiur. Understanding Policy-Based Networking. 2001

2001
[117]

The title of book two. 2008. doi:10.1007/3-540-09237-4

2008 doi
[118]

Asad Z. Spector. Achieving application requirements. Distributed Systems. 1990. doi:10.1145/90417.90738

1990
[119]

Douglass and David Harel and Mark B

Bruce P. Douglass and David Harel and Mark B. Trakhtenbrot. Statecarts in use: structured analysis and object-orientation. Lectures on Embedded Systems. 1998. doi:10.1007/3-540-65193-4_29

1998 doi
[120]

Donald E. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms (3rd. ed.). 1997

1997
[121]

Donald E. Knuth. The Art of Computer Programming. 1998

1998
[122]

Structured Variational Inference Procedures and their Realizations (as incol)

Dan Geiger and Christopher Meek. Structured Variational Inference Procedures and their Realizations (as incol). Proceedings of Tenth International Workshop on Artificial Intelligence and Statistics, The Barbados
[123]

Stan W. Smith. An experiment in bibliographic mark-up: Parsing metadata for XML export. Proceedings of the 3rd. annual workshop on Librarians and Computers. 2010. doi:99.9999/woot07-S422

2010
[124]

Catch me, if you can: Evading network signatures with web-based polymorphic worms

Matthew Van Gundy and Davide Balzarotti and Giovanni Vigna. Catch me, if you can: Evading network signatures with web-based polymorphic worms. Proceedings of the first USENIX workshop on Offensive Technologies
[125]

Predicate Path expressions

Sten Andler. Predicate Path expressions. Proceedings of the 6th. ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages. 1979. doi:10.1145/567752.567774

1979
[126]

LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER

David Harel. LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER. 1978

1978
[127]

Anisi , title =

David A. Anisi , title =
[128]

Clarkson

Kenneth L. Clarkson. Algorithms for Closest-Point Problems (Computational Geometry). 1985

1985
[129]

Introduction to Bayesian Statistics

Harry Thornburg. Introduction to Bayesian Statistics. 2001

2001
[130]

CLIFFORD: a Maple 11 Package for Clifford Algebra Computations, version 11

Rafal Ablamowicz and Bertfried Fauser. CLIFFORD: a Maple 11 Package for Clifford Algebra Computations, version 11. 2007

2007
[131]

Stats and Analysis

Poker-Edge.Com. Stats and Analysis. 2006

2006
[132]

A more perfect union

Barack Obama. A more perfect union. 2008

2008
[133]

The fountain of youth

Joseph Scientist. The fountain of youth. 2009

2009
[134]

Solder man

Dave Novak. Solder man. ACM SIGGRAPH 2003 Video Review on Animation theater Program: Part I - Vol. 145 (July 27--27, 2003). 2003. doi:99.9999/woot07-S422

2003
[135]

Interview with Bill Kinder: January 13, 2005

Newton Lee. Interview with Bill Kinder: January 13, 2005. Comput. Entertain. 2005. doi:10.1145/1057270.1057278

2005
[136]

The Enabling of Digital Libraries

Bernard Rous. The Enabling of Digital Libraries. Digital Libraries. 2008

2008
[138]

(new) Finding minimum congestion spanning trees , journal =

Werneck, Renato and Setubal, Jo\. (new) Finding minimum congestion spanning trees , journal =. doi:10.1145/351827.384253 , acmid = 384253, publisher =
[140]

and Mei, Alessandro , title =

Conti, Mauro and Di Pietro, Roberto and Mancini, Luigi V. and Mei, Alessandro , title =. Inf. Fusion , volume =. 2009 , issn =. doi:10.1016/j.inffus.2009.01.002 , acmid =

2009 doi
[141]

and Hutchful, David K

Li, Cheng-Lun and Buyuktur, Ayse G. and Hutchful, David K. and Sant, Natasha B. and Nainwal, Satyendra K. , title =. CHI '08 extended abstracts on Human factors in computing systems , year =. doi:10.1145/1358628.1358946 , acmid =
[142]

, title =

Hollis, Billy S. , title =. 1999 , isbn =

1999
[143]

Goossens, Michel and Rahtz, S. P. and Moore, Ross and Sutor, Robert S. , title =. 1999 , isbn =

1999
[144]

and Rosenberg, Arnold L

Buss, Jonathan F. and Rosenberg, Arnold L. and Knott, Judson D. , title =. 1987 , source =

1987
[145]

CHI '08: CHI '08 extended abstracts on Human factors in computing systems , year =

, note =. CHI '08: CHI '08 extended abstracts on Human factors in computing systems , year =
[146]

Algorithms for Closest-Point Problems (Computational Geometry) , year =

Clarkson, Kenneth Lee , advisor =. Algorithms for Closest-Point Problems (Computational Geometry) , year =
[147]

SIGCOMM Comput. Commun. Rev. , year =
[148]

2004 , isbn =

IEEE TCSC Executive Committee , booktitle =. 2004 , isbn =. doi:http://dx.doi.org/10.1109/ICWS.2004.64 , acmid =

2004 doi
[149]

Distributed systems (2nd Ed.) , year =
[150]

, title =

Petrie, Charles J. , title =. 1986 , source =

1986
[151]

Donald E. Knuth. Seminumerical Algorithms. 1981

1981
[152]

E-commerce and cultural values , year =

Kong, Wei-Chang , Title =. E-commerce and cultural values , year =
[153]

E-commerce and cultural values , year =

Kong, Wei-Chang , type =. E-commerce and cultural values , year =
[154]

Chapter 9 , booktitle =

Kong, Wei-Chang , editor =. Chapter 9 , booktitle =. 2002 , address =

2002
[155]

E-commerce and cultural values , editor =

Kong, Wei-Chang , title =. E-commerce and cultural values , editor =. 2003 , isbn =

2003
[156]

E-commerce and cultural values - (InBook-num-in-chap) , chapter =

Kong, Wei-Chang , editor =. E-commerce and cultural values - (InBook-num-in-chap) , chapter =. 2004 , address =

2004
[157]

E-commerce and cultural values (Inbook-text-in-chap) , chapter =

Kong, Wei-Chang , editor =. E-commerce and cultural values (Inbook-text-in-chap) , chapter =. 2005 , address =

2005
[158]

E-commerce and cultural values (Inbook-num chap) , chapter =

Kong, Wei-Chang , editor =. E-commerce and cultural values (Inbook-num chap) , chapter =. 2006 , address =

2006
[159]

Microelectron

Mehdi Saeedi and Morteza Saheb Zamani and Mehdi Sedighi , title =. Microelectron. J. , volume =. 2010 , pages =

2010
[160]

Mehdi Saeedi and Morteza Saheb Zamani and Mehdi Sedighi and Zahra Sasanian , title =. J. Emerg. Technol. Comput. Syst. , volume =
[161]

Kirschmer, Markus and Voight, John , title =. SIAM J. Comput. , issue_date =. 2010 , issn =. doi:https://doi.org/10.1137/080734467 , acmid =

2010 doi
[162]

Hoare, C. A. R. , title =. Structured programming (incoll) , editor =. 1972 , isbn =

1972
[163]

History of programming languages I (incoll) , editor =

Lee, Jan , title =. History of programming languages I (incoll) , editor =. 1981 , isbn =. doi:http://doi.acm.org/10.1145/800025.1198348 , acmid =

1981
[164]

, title =

Dijkstra, E. , title =. Classics in software engineering (incoll) , year =
[165]

, title =

Wenzel, Elizabeth M. , title =. Multimedia interface design (incoll) , year =. doi:10.1145/146022.146089 , acmid =
[166]

, title =

Mumford, E. , title =. Critical issues in information systems research (incoll) , year =
[167]

and Golden, Donald G

McCracken, Daniel D. and Golden, Donald G. , title =. 1990 , isbn =

1990
[168]

The analysis of linear partial differential operators

H. The analysis of linear partial differential operators. 1985 , PAGES =

1985
[169]

IEEE", address =

A. Adya and P. Bahl and J. Padhye and A.Wolman and L. Zhou , title =. Proceedings of the IEEE 1st International Conference on Broadnets Networks (BroadNets'04) , publisher = "IEEE", address = "Los Alamitos, CA", year =
[170]

I. F. Akyildiz and W. Su and Y. Sankarasubramaniam and E. Cayirci , title =. Comm. ACM , volume = 38, number = "4", year =
[171]

I. F. Akyildiz and T. Melodia and K. R. Chowdhury , title =. Computer Netw. , volume = 51, number = "4", year =
[172]

ACM", address =

P. Bahl and R. Chancre and J. Dungeon , title =. Proceeding of the 10th International Conference on Mobile Computing and Networking (MobiCom'04) , publisher = "ACM", address = "New York, NY", year =
[173]

8 (Special Issue on Sensor Networks)

D. Culler and D. Estrin and M. Srivastava , title =. IEEE Comput. , volume = 37, number = "8 (Special Issue on Sensor Networks)", publisher = "IEEE", address = "Los Alamitos, CA", year =
[174]

Natarajan and M

A. Natarajan and M. Motani and B. de Silva and K. Yap and K. C. Chua , title =. Network Architectures , editor =. 960935712
[175]

Tzamaloukas and J

A. Tzamaloukas and J. J. Garcia-Luna-Aceves , title =
[176]

Zhou and J

G. Zhou and J. Lu and C.-Y. Wan and M. D. Yarvis and J. A. Stankovic , title =
[177]

Mapping Powerlists onto Hypercubes

Jacob Kornerup. Mapping Powerlists onto Hypercubes. 1994

1994
[178]

Automatic Parallelization for Distributed-Memory Multiprocessing Systems

Michael Gerndt. Automatic Parallelization for Distributed-Memory Multiprocessing Systems
[179]

J. E. Archer, Jr. and R. Conway and F. B. Schneider. User recovery and reversal in interactive systems. ACM Trans. Program. Lang. Syst
[180]

D. D. Dunlop and V. R. Basili. Generalizing specifications for uniformly implemented loops. ACM Trans. Program. Lang. Syst
[181]

Heering and P

J. Heering and P. Klint. Towards monolingual programming environments. ACM Trans. Program. Lang. Syst
[182]

Donald E. Knuth. The book
[183]

Korach and D

E. Korach and D. Rotem and N. Santoro. Distributed algorithms for finding centers and medians in networks. ACM Trans. Program. Lang. Syst
[184]

: A Document Preparation System

Leslie Lamport. : A Document Preparation System
[185]

F. Nielson. Program transformations in a denotational setting. ACM Trans. Program. Lang. Syst
[186]

Brian K. Reid. A high-level approach to computer document formatting. Proceedings of the 7th Annual Symposium on Principles of Programming Languages
[187]

and Abdelzaher, Tarek F

Zhou, Gang and Wu, Yafeng and Yan, Ting and He, Tian and Huang, Chengdu and Stankovic, John A. and Abdelzaher, Tarek F. , title =. ACM Trans. Embed. Comput. Syst. , issue_date =. doi:10.1145/1721695.1721705 , acmid = 1721705, publisher =
[188]

Institutional members of the Users Group
[189]

Boris Veytsman , title =
[190]

and Peterson, Larry L

Bowman, Mic and Debray, Saumya K. and Peterson, Larry L. , title =. ACM Trans. Program. Lang. Syst. , volume =. 1993 , doi =

1993
[191]

TUGboat , volume =

Braams, Johannes , title =. TUGboat , volume =
[192]

Post Congress Tristesse

Malcolm Clark. Post Congress Tristesse. TeX90 Conference Proceedings
[193]

ACM Trans

Herlihy, Maurice , title =. ACM Trans. Program. Lang. Syst. , volume =. 1993 , doi =

1993
[194]

Salas and Einar Hille

S.L. Salas and Einar Hille. Calculus: One and Several Variable. 1978

1978
[195]

Publication quality tables in

Simon Fear , month =. Publication quality tables in
[196]

Using the amsthm Package , organization =
[197]

2019 , url =

R: A Language and Environment for Statistical Computing , author =. 2019 , url =

2019
[198]

Sam Anzaroot and Andrew McCallum , title =
[199]

Brad and Haunschild, Robin , title =

Bornmann, Lutz and Wray, K. Brad and Haunschild, Robin , title =
[200]

2014 , archivePrefix =

Sam Anzaroot and Alexandre Passos and David Belanger and Andrew McCallum , title =. 2014 , archivePrefix =

2014
[201]

Proceedings of the 20th International Colloquium on Automata, Languages and Programming , series =

Maintaining Discrete Probability Distributions Optimally , author =. Proceedings of the 20th International Colloquium on Automata, Languages and Programming , series =. 1993 , publisher =

1993
[202]

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015 , pages=

Overcoming data scarcity of Twitter: using tweets as bootstrap with application to autism-related topic content analysis , author=. Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015 , pages=

2015
[203]

Current Opinion in Chemical Engineering , volume=

Audacity of huge: overcoming challenges of data scarcity and data quality for machine learning in computational materials discovery , author=. Current Opinion in Chemical Engineering , volume=. 2022 , publisher=

2022
[204]

Advances in Artificial Intelligence--IBERAMIA 2014: 14th Ibero-American Conference on AI, Santiago de Chile, Chile, November 24-27, 2014, Proceedings 14 , pages=

An evolutionary methodology for handling data scarcity and noise in monitoring real events from social media data , author=. Advances in Artificial Intelligence--IBERAMIA 2014: 14th Ibero-American Conference on AI, Santiago de Chile, Chile, November 24-27, 2014, Proceedings 14...

2014
[205]

AAAI , volume=

Concare: Personalized clinical feature embedding via capturing the healthcare context , author=. AAAI , volume=
[206]

SIGKDD , pages=

Hitanet: Hierarchical time-aware attention networks for risk prediction on electronic health records , author=. SIGKDD , pages=
[207]

NeurIPS , volume=

Retain: An interpretable predictive model for healthcare using reverse time attention mechanism , author=. NeurIPS , volume=
[208]

JBHI , year=

Deepr: a convolutional net for medical records (2016) , author=. JBHI , year=

2016
[209]

CIKM , pages=

Kame: Knowledge-based attention model for diagnosis prediction in healthcare , author=. CIKM , pages=
[210]

NeurIPS , volume=

Twins: Revisiting the design of spatial attention in vision transformers , author=. NeurIPS , volume=
[211]

NeuroImage , volume=

BrainNetCNN: Convolutional neural networks for brain networks; towards predicting neurodevelopment , author=. NeuroImage , volume=. 2017 , publisher=

2017
[212]

ICML , pages=

On calibration of modern neural networks , author=. ICML , pages=. 2017 , organization=

2017
[213]

ICML , pages=

Regularization of neural networks using dropconnect , author=. ICML , pages=. 2013 , organization=

2013
[214]

JMLR , volume=

Dropout: a simple way to prevent neural networks from overfitting , author=. JMLR , volume=. 2014 , publisher=

2014
[215]

NeurIPS , volume=

Imagenet classification with deep convolutional neural networks , author=. NeurIPS , volume=
[216]

2017 , eprint=

Improved Regularization of Convolutional Neural Networks with Cutout , author=. 2017 , eprint=

2017
[217]

ICDM , pages=

Boosting deep learning risk prediction with generative adversarial networks for electronic health records , author=. ICDM , pages=. 2017 , organization=

2017
[218]

MLHC , pages=

Generating multi-label discrete patient records using generative adversarial networks , author=. MLHC , pages=. 2017 , organization=

2017
[219]

J AM MED INFORM ASSN , volume=

Synthesizing electronic health records using improved generative adversarial networks , author=. J AM MED INFORM ASSN , volume=. 2019 , publisher=

2019
[220]

SIGKDD , pages=

Generative Adversarial Networks Enhanced Pre-training for Insufficient Electronic Health Records Modeling , author=. SIGKDD , pages=
[221]

ICML , pages=

Which training methods for GANs do actually converge? , author=. ICML , pages=. 2018 , organization=

2018
[222]

1705.07215 , year=

On convergence and stability of gans , author=. 1705.07215 , year=

arXiv
[223]

IEEE Transactions on Multimedia , volume=

Annealing genetic GAN for imbalanced web data learning , author=. IEEE Transactions on Multimedia , volume=. 2021 , publisher=

2021
[224]

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=

Why label when you can search? Alternatives to active learning for applying human resources to build classification models under extreme class imbalance , author=. Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining , pages=
[225]

IEEE Transactions on Industrial Informatics , volume=

Distribution bias aware collaborative generative adversarial network for imbalanced deep learning in industrial IoT , author=. IEEE Transactions on Industrial Informatics , volume=. 2022 , publisher=

2022
[226]

ICLR , year=

mixup: Beyond empirical risk minimization , author=. ICLR , year=
[227]

ICLR , year=

How does mixup help with robustness and generalization? , author=. ICLR , year=
[228]

Bioinform , volume=

Robust clustering of noisy high-dimensional gene expression data for patients subtyping , author=. Bioinform , volume=. 2018 , publisher=

2018
[229]

SIGKDD , pages=

Patient subtyping via time-aware LSTM networks , author=. SIGKDD , pages=
[230]

AAAI , volume=

GRASP: generic framework for health status representation learning based on incorporating knowledge from similar patients , author=. AAAI , volume=
[231]

WWW , pages=

Stagenet: Stage-aware neural networks for health risk prediction , author=. WWW , pages=
[232]

AAAI , volume=

Mixup as locally linear out-of-manifold regularization , author=. AAAI , volume=
[233]

ICML , pages=

Manifold mixup: Better representations by interpolating hidden states , author=. ICML , pages=. 2019 , organization=

2019
[234]

NeurIPS , volume=

Denoising diffusion probabilistic models , author=. NeurIPS , volume=
[235]

NeurIPS , volume=

Generative adversarial nets , author=. NeurIPS , volume=
[236]

2303.05656 , year=

EHRDiff: Exploring Realistic EHR Synthesis with Diffusion Models , author=. 2303.05656 , year=

arXiv
[237]

ICLR , volume=

Denoising diffusion implicit models , author=. ICLR , volume=
[238]

ACM COMPUT SURV , year=

Diffusion models: A comprehensive survey of methods and applications , author=. ACM COMPUT SURV , year=
[239]

CVPR , pages=

Robust classification with convolutional prototype learning , author=. CVPR , pages=
[240]

NeurIPS , volume=

Prototypical networks for few-shot learning , author=. NeurIPS , volume=
[241]

arXiv preprint arXiv:1611.01734 , year=

Deep biaffine attention for neural dependency parsing , author=. arXiv preprint arXiv:1611.01734 , year=

arXiv
[242]

Data-driven subtyping of Parkinson’s disease using longitudinal clinical records: a cohort study , author=. Sci. Rep. , volume=. 2019 , publisher=

2019
[243]

Cerebrovasc

Classification of stroke subtypes , author=. Cerebrovasc. Dis. , volume=. 2009 , publisher=

2009
[244]

CIKM , pages=

Dipole: Diagnosis prediction in healthcare via attention-based bidirectional recurrent neural networks , author=. CIKM , pages=
[245]

SIGKDD , pages=

Interpretable representation learning for healthcare via capturing disease progression through time , author=. SIGKDD , pages=
[246]

SIGKDD , pages=

GRAM: graph-based attention model for healthcare representation learning , author=. SIGKDD , pages=
[247]

arXiv preprint arXiv:1906.00346 , year=

Pre-training of graph augmented transformers for medication recommendation , author=. arXiv preprint arXiv:1906.00346 , year=

1906 arXiv
[248]

WWW , pages=

Medpath: Augmenting health risk prediction via medical knowledge paths , author=. WWW , pages=
[249]

WWW , pages=

SeqCare: Sequential Training with External Medical Knowledge Graph for Diagnosis Prediction in Healthcare Data , author=. WWW , pages=
[250]

JMLR , volume=

On mixup regularization , author=. JMLR , volume=. 2022 , publisher=

2022
[251]

ICCV , pages=

Cutmix: Regularization strategy to train strong classifiers with localizable features , author=. ICCV , pages=
[252]

ICASSP , year=

Attentive cutmix: An enhanced data augmentation approach for deep learning based image classification , author=. ICASSP , year=
[253]

ICLR , year=

Saliencymix: A saliency guided data augmentation strategy for better regularization , author=. ICLR , year=
[254]

Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part X 16 , pages=

Automix: Mixup networks for sample interpolation via cooperative barycenter learning , author=. Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part X 16 , pages=. 2020 , organization=

2020
[255]

ECCV , pages=

Tokenmix: Rethinking image mixing for data augmentation in vision transformers , author=. ECCV , pages=. 2022 , organization=

2022
[256]

ICML , pages=

Puzzle mix: Exploiting saliency and local statistics for optimal mixup , author=. ICML , pages=. 2020 , organization=

2020
[257]

ICLR , year=

Co-mixup: Saliency guided joint mixup with supermodular diversity , author=. ICLR , year=
[258]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

Alignmixup: Improving representations by interpolating aligned features , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=
[259]

AAAI , volume=

GuidedMixup: An Efficient Mixup Strategy Guided by Saliency Maps , author=. AAAI , volume=
[260]

Pattern Recognit Lett , volume=

Data clustering: 50 years beyond K-means , author=. Pattern Recognit Lett , volume=. 2010 , publisher=

2010
[261]

CVPR , pages=

Momentum contrast for unsupervised visual representation learning , author=. CVPR , pages=
[262]

ICBEIA , pages=

A knowledge discovery using decision tree by Gini coefficient , author=. ICBEIA , pages=. 2011 , organization=

2011
[263]

Theoretical comparison between the gini index and information gain criteria , author=. Ann. Math. Artif , volume=. 2004 , publisher=

2004
[264]

MIMIC-III, a freely accessible critical care database , author=. Sci. Data , volume=. 2016 , publisher=

2016
[265]

PhysioNet

Mimic-iv , author=. PhysioNet. Available online at: https://physionet. org/content/mimiciv/1.0/(accessed August 23, 2021) , year=

2021
[266]

MIMIC-IV, a freely accessible electronic health record dataset , author=. Sci. Data , volume=. 2023 , publisher=

2023
[267]

AAAI , volume=

Context-aware health event prediction via transition functions on dynamic disease graphs , author=. AAAI , volume=
[268]

EMNLP , year=

Learning phrase representations using RNN encoder-decoder for statistical machine translation , author=. EMNLP , year=
[269]

NeurIPS , volume=

Attention is all you need , author=. NeurIPS , volume=
[270]

Agent: Clinical predictive model via mimicked second opinions , author=

Dr. Agent: Clinical predictive model via mimicked second opinions , author=. JAMIA , volume=. 2020 , publisher=

2020
[271]

TKDE , year=

Time-aware context-gated graph attention network for clinical risk prediction , author=. TKDE , year=
[272]

ICLR , year=

Adam: A method for stochastic optimization , author=. ICLR , year=
[273]

, author=

Visualizing data using t-SNE. , author=. JMLR , volume=
[274]

COMMUN STAT-THEOR M , volume=

A dendrite method for cluster analysis , author=. COMMUN STAT-THEOR M , volume=. 1974 , publisher=

1974
[275]

AM J CARDIOL , volume=

Risk factors for sudden death after acute myocardial infarction: two-year follow-up , author=. AM J CARDIOL , volume=. 1984 , publisher=

1984
[276]

Sudden death in patients with myocardial infarction and left ventricular dysfunction, heart failure, or both , author=. N. Engl. J. Med. , volume=. 2005 , publisher=

2005
[277]

Chest , volume=

Thirty-year cumulative incidence of chronic bronchitis and COPD in relation to 30-year pulmonary function and 40-year mortality: a follow-up in middle-aged rural men , author=. Chest , volume=. 2006 , publisher=

2006
[278]

2306.17413 , year=

DeepTagger: Knowledge Enhanced Named Entity Recognition for Web-Based Ads Queries , author=. 2306.17413 , year=

arXiv
[279]

AAAI , volume=

Robust classification of crisis-related data on social networks using convolutional neural networks , author=. AAAI , volume=
[280]

Neural Netw , volume=

GHNN: Graph Harmonic Neural Networks for semi-supervised graph-level classification , author=. Neural Netw , volume=. 2022 , publisher=

2022
[281]

2307.01514 , year=

SelfFed: Self-supervised Federated Learning for Data Heterogeneity and Label Scarcity in IoMT , author=. 2307.01514 , year=

arXiv
[282]

2013 , journal=

Imbalanced learning: foundations, algorithms, and applications , author=. 2013 , journal=

2013
[283]

Arab J Sci Eng , volume=

HCAB-SMOTE: A hybrid clustered affinitive borderline SMOTE approach for imbalanced data binary classification , author=. Arab J Sci Eng , volume=. 2020 , publisher=

2020
[284]

NeurIPS , volume=

Rethinking the value of labels for improving class-imbalanced learning , author=. NeurIPS , volume=
[285]

WWW , pages=

Modeling heart rate and activity data for personalized fitness recommendation , author=. WWW , pages=
[286]

WWW , pages=

Aid: Active distillation machine to leverage pre-trained black-box models in private data settings , author=. WWW , pages=
[287]

NeurIPS , volume=

Tighter pac-bayes bounds , author=. NeurIPS , volume=
[288]

JMLR , volume=

PAC-Bayes bounds with data dependent priors , author=. JMLR , volume=. 2012 , publisher=

2012
[289]

Artificial Intelligence and Statistics , pages=

PAC-Bayesian generalization bound for density estimation with application to co-clustering , author=. Artificial Intelligence and Statistics , pages=. 2009 , organization=

2009
[290]

The eICU Collaborative Research Database, a freely available multi-center database for critical care research , author=. Sci. Data , volume=. 2018 , publisher=

2018
[291]

Communications in Statistics-theory and Methods , volume=

A dendrite method for cluster analysis , author=. Communications in Statistics-theory and Methods , volume=. 1974 , publisher=

1974
[292]

npj Parkinson's Disease , volume=

MRI data-driven clustering reveals different subtypes of Dementia with Lewy bodies , author=. npj Parkinson's Disease , volume=. 2023 , publisher=

2023
[293]

CEC , pages=

Clustering using flower pollination algorithm and Calinski-Harabasz index , author=. CEC , pages=. 2016 , organization=

2016
[294]

Clin Res Cardiol , volume=

Electronic health records to facilitate clinical research , author=. Clin Res Cardiol , volume=. 2017 , publisher=

2017
[295]

Mis Quarterly , volume=

Electronic health records , author=. Mis Quarterly , volume=. 2016 , publisher=

2016
[296]

SIGIR , pages=

Metacare++: Meta-learning with hierarchical subtyping for cold-start diagnosis prediction in healthcare data , author=. SIGIR , pages=
[297]

BMJ open , volume=

Training machine learning models to predict 30-day mortality in patients discharged from the emergency department: a retrospective, population-based registry study , author=. BMJ open , volume=. 2019 , publisher=

2019
[298]

JAMIA , volume=

Real-time prediction of mortality, readmission, and length of stay using electronic health record data , author=. JAMIA , volume=. 2016 , publisher=

2016
[299]

2023 , month=

EHRDiff: Exploring Realistic EHR Synthesis with Diffusion Models , author=. 2023 , month=

2023
[300]

Transportation Research Part C: Emerging Technologies , volume=

Predicting origin-destination ride-sourcing demand with a spatio-temporal encoder-decoder residual multi-graph convolutional network , author=. Transportation Research Part C: Emerging Technologies , volume=. 2021 , publisher=

2021

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.

[1] [1]

Bradley Brown, Jordan Juravsky, Ryan Ehrlich, Ronald Clark, Quoc V Le, Christopher R \'e , and Azalia Mirhoseini. 2024. Large language monkeys: Scaling inference compute with repeated sampling. arXiv preprint arXiv:2407.21787

arXiv 2024

[2] [2]

Keyu Chen, Zhifeng Shen, Daohai Yu, Haoqian Wu, Wei Wen, Jianfeng He, Ruizhi Qiao, and Xing Sun. 2025. Aspd: Unlocking adaptive serial-parallel decoding by exploring intrinsic parallelism in llms. arXiv preprint arXiv:2508.08895

arXiv 2025

[3] [3]

Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, and 1 others. 2025. Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities. arXiv preprint arXiv:2507.06261

arXiv 2025

[4] [6]

Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Peiyi Wang, Qihao Zhu, Runxin Xu, Ruoyu Zhang, Shirong Ma, Xiao Bi, Xiaokang Zhang, Xingkai Yu, Yu Wu, Z. F. Wu, Zhibin Gou, Zhihong Shao, Zhuoshu Li, Ziyi Gao, Aixin Liu, and 175 others. 2025. https://doi.org/10.1038/s41586-025-09422-z Deepseek-r1 incentivizes reasoning in llms through reinforcement lear...

doi:10.1038/s41586-025-09422-z 2025

[5] [8]

Dan Hendrycks, Collin Burns, Saurav Kadavath, Akul Arora, Steven Basart, Eric Tang, Dawn Song, and Jacob Steinhardt. 2021 b . https://arxiv.org/abs/2103.03874 Measuring mathematical problem solving with the math dataset . Preprint, arXiv:2103.03874

arXiv 2021

[6] [9]

Xanh Ho, Anh-Khoa Duong, Quoc-Huy Nguyen, and Suong Nguyen. 2020. Constructing a multi-hop qa dataset for comprehensive evaluation of reasoning steps. In COLING

2020

[7] [10]

Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, and Dario Amodei

Jared Kaplan, Sam McCandlish, Tom Henighan, Tom B. Brown, Benjamin Chess, Rewon Child, Scott Gray, Alec Radford, Jeffrey Wu, and Dario Amodei. 2020. https://arxiv.org/abs/2001.08361 Scaling laws for neural language models . Preprint, arXiv:2001.08361

arXiv 2020

[8] [11]

David Scott Lewis. 2025. From brute force to brain power: How stanford's s1 surpasses deepseek-r1

2025