❌

Normal view

Fibronectin 1 mediated histone lactylation promotes malignant progression of GIST regulated by m<sup>6</sup>A modification

Cell Death Discovery, Published online: 11 September 2026; doi:10.1038/s41420-026-03338-x

Fibronectin 1 mediated histone lactylation promotes malignant progression of GIST regulated by m6A modification

Inhaled nanosilica orchestrates a pulmonary macrophage-NK cell axis for memory-like NK programming toward synergistic cancer immunotherapy

Yuan and colleagues demonstrate that inhaled biodegradable nanosilica activates an alveolar macrophage–NK axis, triggering an IL-12/15/18 triad that programs memory-like NK cells. This non-fibrotic, cell-free strategy suppresses melanoma growth, prevents postsurgical recurrence, and synergizes with anti-PD-1, establishing a robust framework for in vivo NK cell immunotherapy.

Viral gene replication enhances AAV vector quality and reduces manufacturing costs

Liu and colleagues developed a robust in cellulo plasmid DNA replication system in human cells for replicating plasmid-borne adeno-associated virus (AAV) Rep/Cap genes during recombinant AAV (rAAV) production. This new approach not only enables a 10- to 20-fold plasmid reduction to significantly lower manufacturing costs but also substantially enhances rAAV potency, titer, and purity.

CD44v5 promotes triple-negative breast cancer cisplatin resistance by enhancing IL-4/IL-4Rα/STAT3 pathway and stabilizing membranous SLC7A11

Oncogenesis, Published online: 21 August 2026; doi:10.1038/s41389-026-00650-0

CD44v5 promotes triple-negative breast cancer cisplatin resistance by enhancing IL-4/IL-4Rα/STAT3 pathway and stabilizing membranous SLC7A11

SAM: State-Adaptive Memory for Long-Horizon Reasoning Agent

arXiv:2605.24468v1 Announce Type: new Abstract: Long-horizon agentic reasoning requires large language models to act over long interaction histories containing thoughts, tool calls, observations, and partial conclusions. The challenge is not merely that these histories grow long, but that information needed for the current decision may be scattered across distant steps and only become relevant later. Existing approaches address this difficulty by truncating the interaction history, compressing it into shorter surrogates, or retrieving selected parts of it for reuse, but they do not explicitly model how access to past interaction should adapt to the agent's evolving state. We instead cast long-horizon reasoning as a problem of state-adaptive memory. To this end, we propose State-Adaptive Memory~(SAM), a standalone framework that consolidates ongoing interaction into compact memory cues while preserving raw trajectory pages for intent-driven recall. These cues are not treated as replacements for history; rather, they serve as lightweight handles that allow the agent to reconstruct temporally distant information according to its current needs, without retraining the underlying backbone. We further optimize the memory module through expert-guided supervision and reinforcement learning, aligning it with trajectory-level utility. Across BrowseComp, BrowseComp-ZH, WideSearch, and HLE, SAM consistently outperforms strong baselines over diverse agent backbones. Our results suggest that explicit memory modeling provides a simple and effective foundation for long-horizon agentic reasoning.

AgentFugue: Agent Scaling for Long-Horizon Tasks through Collective Reasoning

arXiv:2605.24486v1 Announce Type: new Abstract: Recent progress on long-horizon agentic tasks has been driven largely by scaling up individual agents through stronger models, better tools, and more effective scaffolding. In contrast, much less is understood about scaling out: whether multiple peer agents, all targeting the same task, can become an additional source of capability without relying on explicit role specialization or workflow orchestration. We study this question and propose AgentFugue, a collective reasoning framework built around a shared reasoning hub. As peer agents explore the same task in parallel, the hub records concise notes on what each agent has established, attempted, or ruled out, and enables each agent to selectively access what other agents have discovered in a form useful for its current search. This design turns otherwise isolated trajectories into a connected ecology of reusable intermediate reasoning without requiring centralized planning. We instantiate the hub as a plug-in communication layer, trained with supervised fine-tuning and end-to-end reinforcement learning. Across the challenging long-horizon settings we study, AgentFugue improves over strong baselines. Our results suggest that collective reasoning can turn scaling out peer agent systems into a distinct source of capability gains, rather than merely a way of spending more compute.

Reasoning as an Attack Surface: Adaptive Evolutionary CoT Jailbreaks for LLMs

arXiv:2605.24497v1 Announce Type: new Abstract: Large Reasoning Models (LRMs) have demonstrated remarkable capabilities in reasoning and generation tasks and are increasingly deployed in real-world applications. However, their explicit chain-of-thought (CoT) mechanism introduces new security risks, making them particularly vulnerable to jailbreak attacks. Existing approaches often rely on static CoT templates to elicit harmful outputs, but such fixed designs suffer from limited diversity, adaptability, and effectiveness. To overcome these limitations, we propose an adaptive evolutionary CoT jailbreak framework, called AE-CoT. Specifically, the method first rewrites harmful goals into mild prompts with teacher role-play and decomposes them into semantically coherent reasoning fragments to construct a pool of CoT jailbreak candidates. Then, within a structured representation space, we perform multi-generation evolutionary search, where candidate diversity is expanded through fragment-level crossover and a mutation strategy with an adaptive mutation-rate control mechanism. An independent scoring model provides graded harmfulness evaluations, and high-scoring candidates are further enhanced with a harmful CoT template to induce more destructive generations. Extensive experiments across multiple models and datasets demonstrate the effectiveness of the proposed AE-CoT, consistently outperforming state-of-the-art jailbreak methods.

DarkForest: Less Talk, Higher Accuracy for Multi-Agent LLMs

arXiv:2605.25188v1 Announce Type: new Abstract: Multi-agent LLM systems improve reasoning by combining outputs from multiple agents, but interaction-heavy methods can introduce error propagation and high communication overhead. When agents exchange raw responses or reasoning traces, incorrect intermediate reasoning may be adopted and amplified, leading to confident but wrong consensus; multi-round communication also increases token consumption, latency, and inference cost. In this paper, we propose a controlled-communication coordination framework named DarkForest. DarkForest first keeps agents independent, so each agent produces an answer without seeing the others' outputs. It then parses the raw responses into structured candidate records, groups semantically equivalent candidates into clusters, and estimates a calibrated belief distribution over these clusters using agent reliability, confidence, parse quality, support-pattern reliability, and independence corrections. A coordinator receives only policy-permitted evidence from this belief state with controlled communication. Experiments on six reasoning benchmarks show that DarkForest achieves leading overall quality, improves the strongest baseline by up to 30.7\% on benchmark metrics, and reduces token consumption by up to $6.5\times$ compared with communication-heavy baselines.

Distributionally Robust Transfer Learning with Structurally Missing Covariates, with Application to Cross-National Cardiac Arrest Prediction

arXiv:2605.24212v1 Announce Type: cross Abstract: Deploying clinical prediction models across healthcare systems often fails when key training covariates are unavailable at deployment and labeled outcomes are limited in the target domain. For example, high-performing models for out-of-hospital cardiac arrest (OHCA) rely on detailed prehospital measurements routinely collected in high-resource settings but unavailable in many international registries. Existing methods either discard missing covariates, sacrificing predictive information, or rely on untestable assumptions about their target distribution. We propose DRUM (\underline{D}istributionally \underline{R}obust \underline{U}nsupervised transfer learning with structurally \underline{M}issing covariates), a framework that transfers prediction models to target populations where certain covariates are structurally absent and outcome labels are unavailable. DRUM partitions covariates into shared components ($X$), observed across all settings, and missing components ($A$), observed only in the source. Rather than imputing missing covariates, DRUM optimizes worst-case predictive performance over the unknown target distribution of $A \mid X$ using a neural network generator, with a robustness parameter controlling allowable deviation from the source conditional. We further develop a bias correction procedure that reduces sensitivity to nuisance estimation error. Simulations show substantial improvements in both mean and worst-case prediction error under distribution shift. Applied to cross-national OHCA prediction, transferring models from a US registry to multiple Asian registries where prehospital variables are unrecorded, DRUM yields better-calibrated predictions and improved clinical classification performance across sites.

AI-induced never-skilling in medical education

Nature Medicine, Published online: 22 May 2026; doi:10.1038/s41591-026-04438-y

Will medical trainees who rely on AI fail to develop foundational independent clinical reasoning? This Perspective outlines a precautionary framework to preserve foundational competence while supporting safe and effective AI integration in medical training.

Characterization of dysbiosis patterns in gut microbiota of digestive system cancers: an umbrella review

Front Microbiol. 2026 Apr 28;17:1782471. doi: 10.3389/fmicb.2026.1782471. eCollection 2026.

ABSTRACT

Digestive system cancers (DSCs) represent a substantial global health burden. In recent years, the role of gut microbiota in the DSCs has garnered considerable attention, but its change pattern during tumor progression and the specific mechanisms are still not fully understood. We conducted a comprehensive systematic review to characterize patterns of gut microbiota dysbiosis across different DSC types and assess their clinical significance. We systematically searched four English and three Chinese databases up to January 2025 to identify systematic reviews focused on the dynamic characteristics of the gut microbiota during gastrointestinal tumorigenesis. Microbiota biodiversity and taxonomic composition were extracted to identify specific signatures associated with DSCs. The ROBIS tool was used to evaluate the methodological quality of the included studies. Ultimately, 59 studies involving six distinct DSC types were included. Data synthesis and comparison revealed distinct microbiota profiles across DSCs. At the phylum level, Bacillota was decreased in esophageal cancer (EC) and pancreatic ductal adenocarcinoma (PDAC), Pseudomonadota was augmented in EC but exhibited divergent trajectories in colorectal cancer (CRC) and PDAC. Genus-level analyses revealed Veillonella enrichment in EC and PDAC, and Fusobacterium outgrowth in EC, gastric cancer (GC) and CRC. Parvimonas and Streptococcus showed a concordant ascending trend in GC and CRC. Prevotella was overrepresented in EC and GC. This synthesis delineates a qualitative landscape of gut microbiota imbalances associated with various DSCs, highlighting the potential for these microbial shifts to serve as markers for early detection and targeted therapy. Multiomics integration and prospective cohort studies should be prioritized to accelerate clinical translation.

PMID:42131199 | PMC:PMC13161176 | DOI:10.3389/fmicb.2026.1782471

ART: Adaptive Relational Transformer for Pedestrian Trajectory Prediction with Temporal-Aware Relations

arXiv:2604.03649v1 Announce Type: cross Abstract: Accurate prediction of real-world pedestrian trajectories is crucial for a wide range of robot-related applications. Recent approaches typically adopt graph-based or transformer-based frameworks to model interactions. Despite their effectiveness, these methods either introduce unnecessary computational overhead or struggle to represent the diverse and time-varying characteristics of human interactions. In this work, we present an Adaptive Relational Transformer (ART), which introduces a Temporal-Aware Relation Graph (TARG) to explicitly capture the evolution of pairwise interactions and an Adaptive Interaction Pruning (AIP) mechanism to reduce redundant computations efficiently. Extensive evaluations on ETH/UCY and NBA benchmarks show that ART delivers state-of-the-art accuracy with high computational efficiency.

FAST-CAD: A Fairness-Aware Framework for Non-Contact Stroke Diagnosis

arXiv:2511.08887v4 Announce Type: replace-cross Abstract: Stroke is an acute cerebrovascular disease, and timely diagnosis significantly improves patient survival. However, existing automated diagnosis methods suffer from fairness issues across demographic groups, potentially exacerbating healthcare disparities. In this work we propose FAST-CAD, a theoretically grounded framework that combines domain-adversarial training (DAT) with group distributionally robust optimization (Group-DRO) for fair and accurate non-contact stroke diagnosis. Our approach is built on domain adaptation and minimax fairness theory and provides convergence guarantees and fairness bounds. We curate a multimodal dataset covering 12 demographic subgroups defined by age, gender, and posture. FAST-CAD employs self-supervised encoders with adversarial domain discrimination to learn demographic-invariant representations, while Group-DRO optimizes worst-group risk to ensure robust performance across all subgroups. Extensive experiments show that our method achieves superior diagnostic performance while maintaining fairness across demographic groups, and our theoretical analysis supports the effectiveness of the unified DAT + Group-DRO framework. This work provides both practical advances and theoretical insights for fair medical AI systems.

GPA: Learning GUI Process Automation from Demonstrations

arXiv:2604.01676v2 Announce Type: replace-cross Abstract: GUI Process Automation (GPA) is a lightweight but general vision-based Robotic Process Automation (RPA), which enables fast and stable process replay with only a single demo. Addressing the fragility of traditional RPA and the non-deterministic risks of current vision language model-based GUI agents, GPA introduces three core benefits: (1) Robustness via Sequential Monte Carlo-based localization to handle rescaling and detection uncertainty; (2) Deterministic and Reliability safeguarded by readiness calibration; and (3) Privacy through fast, fully local execution. This approach delivers the adaptability, robustness, and security required for enterprise workflows. It can also be used as an MCP/CLI tool by other agents with coding capabilities so that the agent only reasons and orchestrates while GPA handles the GUI execution. We conducted a pilot experiment to compare GPA with Gemini 3 Pro (with CUA tools) and found that GPA achieves higher success rate with 10 times faster execution speed in finishing long-horizon GUI tasks.

FGFR1 suppresses ovarian cancer progression by modulating SIRT3-dependent lactylation and metabolic reprogramming

Cell Death Discovery, Published online: 07 April 2026; doi:10.1038/s41420-026-03054-6

FGFR1 suppresses ovarian cancer progression by modulating SIRT3-dependent lactylation and metabolic reprogramming

GPA: Learning GUI Process Automation from Demonstrations

arXiv:2604.01676v1 Announce Type: cross Abstract: GUI Process Automation (GPA) is a lightweight but general vision-based Robotic Process Automation (RPA), which enables fast and stable process replay with only a single demo. Addressing the fragility of traditional RPA and the non-deterministic risks of current vision language model-based GUI agents, GPA introduces three core benefits: (1) Robustness via Sequential Monte Carlo-based localization to handle rescaling and detection uncertainty; (2) Deterministic and Reliability safeguarded by readiness calibration; and (3) Privacy through fast, fully local execution. This approach delivers the adaptability, robustness, and security required for enterprise workflows. It can also be used as an MCP/CLI tool by other agents with coding capabilities so that the agent only reasons and orchestrates while GPA handles the GUI execution. We conducted a pilot experiment to compare GPA with Gemini 3 Pro (with CUA tools) and found that GPA achieves higher success rate with 10 times faster execution speed in finishing long-horizon GUI tasks.
❌