3 citations · 3 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Cop number of -free graphs without a claw or a fork
Uttam K. Gupta, Dinabandhu Pradhan, Rashmi Rekha Swain
In 2019, Liu proved that the cop number of any -free graph is at most . In 2026, Clow and Meger improved and generalized the result of Liu by showing that every c…
cs.AI2026
Verifiable Process Rewards for Agentic Reasoning
Huining Yuan, Zelai Xu, Huaijie Wang +6
Reinforcement learning from verifiable rewards (RLVR) has improved the reasoning capabilities of large language models (LLMs), yet existing approaches predominantly rely on sparse…