Searcharxiv⌕ Search

arXiv · 2610.16346

CellChain: Benchmarking Cross-Scale Evidence Use for Perturbation Reasoning

Abstract

Recent advances in foundation models and large-scale cellular perturbation datasets have driven growing interest in using LLMs to predict and reason about cellular responses. Biological reasoning in this setting involves relating molecular mechanisms, cellular responses, and functional outcomes across scales. Evaluating foundation models therefore requires assessing not only whether their predictions are correct, but also how those predictions depend on the biological evidence provided. We introduce CellChain, an experimentally grounded benchmark comprising 590 biological cases and 2,360 matched evidence-condition instances across gene-dependency prediction, cytokine-axis identification, and drug-sensitivity ranking. CellChain links perturbation experiments and external biological resources through a provenance-aware evidence graph spanning molecular, pathway, transcriptional, and phenotypic information. Task-specific conditions vary evidence coverage, composition, or assignment while preserving questions, candidate answers, reference targets, and scoring rules. Across 18 foundation models, the highest accuracies under prespecified target-evidence conditions are 57.5%, 75.5%, and 70.8%, respectively, and broader evidence coverage does not consistently improve accuracy. On the drug-sensitivity benchmark cohort, matched reference histories outperform swapped histories by an average of 13.0 percentage points in cluster-weighted accuracy. Decision-transition analysis separates corrections, newly introduced errors, and wrong-answer switches, revealing substantial answer changes hidden by small net accuracy differences. CellChain provides controlled comparisons for attributing changes in model predictions to prespecified expansions of biological context, including changes in evidence coverage, composition, and biological assignment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xue Xia, Yue Wang, Shuizhou Chen, Lang Yu, Hao Wu, Wenxuan Huang, Chengkai Yao, Zhangyang Gao, Siqi Sun. 2026-10-12. CellChain: Benchmarking Cross-Scale Evidence Use for Perturbation Reasoning. https://arxiv.org/abs/2610.16346

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Query Repairs

We formalize and study the problem of repairing database queries based on user feedback in the form of a collection of labeled examples. We propose a framework based on the notion of a proximity pre-order, and we investigate and compare query repairs for conjunctive queries (CQs) using different such pre-orders. The proximity pre-orders we consider are based on query containment and on distance metrics for CQs.

cs.DB↗

Towards a B+-tree with Fluctuation-Free Performance

Performance predictability is critical for modern DBMSs. Index maintenance can trigger rare but severe I/O spikes. In a B/B+-tree of Height H, due to node split propagation, the cost of a single insert can vary from (H + 1) I/Os when node split does not happen to (3H + 1) I/Os when split propagation reaches the root, nearly a 3 times degradation. We formalize performance fluctuation as the gap between the best- and worst-case insert behaviors. We show examples of why performance fluctuation is worth investigating. To mitigate the B/B+-tree split propagation, we introduce the FFBtree, a B+-tree with a novel insert and delete algorithms with bounded-fluctuation performance. We prove that the insert operation is guaranteed to encounter at most one node that needs to be split, and hence ensuring that no split propagation can take place. The new insert and delete algorithms guarantee bounded-fluctuation performance for the FFBtree. Experiments with simulated indexes show that the FFBtree caps I/O fluctuation compared to baseline indexes under various workloads.

cs.DB↗

Are Diffusion Language Models Good Database Analysts?

Diffusion Language Models (DLMs) enable iterative global refinement, but their effectiveness in Natural Language to SQL (NL2SQL) remains unclear because heterogeneous architectures and evaluation setups hinder fair comparison with autoregressive (AR) models. Their iterative denoising process permits sequence-wide revision, offering a different way to handle the long-range structural dependencies in SQL. We present a systematic study of DLM-based NL2SQL under a unified framework that standardizes generation and execution across DLM architectures. We further introduce SQL-D1, an agentic inference framework combining database-aware retrieval, multi-trajectory denoising, execution-guided verification, and selection based on execution denotations. Across diverse benchmark settings, strong DLMs are competitive with some open-source AR models and offer flexible trade-offs between efficiency and accuracy, although they still trail the strongest AR systems on difficult queries. Test-time scaling yields substantial gains, whereas standard supervised fine-tuning yields unstable outcomes across the evaluated DLMs. Stronger model variants exhibit fewer schema-grounding errors, but failures involving complex clauses and query nesting persist. These results clarify the capabilities and limitations of DLMs for database analysis and provide a standardized foundation for future work. Our code is available at https://anonymous.4open.science/r/SQL-D1-82DF.

cs.DB↗