Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Qi Duan

Qi Duan

3 indexed papers

Recent (6 mo)
3
With code
0
Influential cites
0
Benchmarked
0

Publications per year

3
26

Top categories

AI×1Multiagent×1NLP×1Algorithms×1Complexity×1

Frequent co-authors

Qiqi Duan1×
Changlun Li1×
Chen Wang1×
Fan Zhang1×
Mengxiang Wang1×
Dayi Miao1×

Research Timeline

2026
Directed Reachability-Preserving Minimum Edge Cut: Approximation and Planar Hardness

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

UniClawBench: A Universal Benchmark for Proactive Agents on Real-World Tasks

The paper introduces UniClawBench, a capability-driven benchmark for evaluating proactive agents in real-world settings, using five foundational capabilities and live Docker containers.

Can Agentic Trading Systems Pay for Their Own Intelligence?

The paper introduces TradeLens, a toolkit for evaluating the agentic viability of large language model agents in trading systems by reconstructing trading trajectories and diagnosing intelligence-to-profit conversion.

Highlighted terms show continued research focus across papers

Papers

cs.AIcs.MAEmpiricalRecentJul 11, 2026

Can Agentic Trading Systems Pay for Their Own Intelligence?

Qiqi Duan, Changlun Li, Chen Wang, Fan Zhang +9 more

The paper introduces TradeLens, a toolkit for evaluating the agentic viability of large language model agents in trading systems by reconstructing trading trajectories and diagnosing intelligence-to-p…

View →
cs.CLEmpirical
Recent
Jul 9, 2026

UniClawBench: A Universal Benchmark for Proactive Agents on Real-World Tasks

Zhekai Chen, Chengqi Duan, Kaiyue Sun, Bohao Li +3 more

The paper introduces UniClawBench, a capability-driven benchmark for evaluating proactive agents in real-world settings, using five foundational capabilities and live Docker containers.

View →
cs.DScs.CCTheoreticalRecentJun 16, 2026

Directed Reachability-Preserving Minimum Edge Cut: Approximation and Planar Hardness

Qi Duan

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

View →