❌

Normal view

Received — 10 September 2026 ⏭

Agrimol B induces autophagic death in TP53-mutant pancreatic cancer by targeting the S100A6-HDAC2-mutant p53 acetylation axis

✇(Multiomics OR Omics) AND (Pancreatic)
By: Rui Xu · Liuyuan Xia · Wei Zhou · Xin Chen · Yixin Jiang · Yue Yan · Qingyi Xiong · Dong Lu · Hongzhuan Chen · Tong Wu · Jinmei Jin · Weidong Zhang · Xin Luan
5 September 2026 at 18:00

Phytomedicine. 2026 Aug 26;161:158760. doi: 10.1016/j.phymed.2026.158760. Online ahead of print.

ABSTRACT

BACKGROUND: Pancreatic ductal adenocarcinoma (PDAC) harbors TP53 mutations at high frequency, yet therapeutic strategies that specifically target mutant p53 remain limited.

PURPOSE: This study aimed to identify S100A6, a calcium-binding protein frequently upregulated in TP53-mutant PDAC, as a critical regulator of mutant p53 stability and tumor progression, and to explore potential S100A6-targeting agents for therapeutic intervention.

METHODS: We integrated computer-assisted drug screening with transcriptomics, acetylation omics, and molecular biology techniques to identify Agrimol B (AgrB), a bioactive compound derived from the traditional Chinese herb Agrimonia pilosa Ledeb., as a potential S100A6-targeting agent.

RESULTS: High S100A6 expression was closely associated with poor prognosis in patients with TP53-mutant PDAC, whereas S100A6 depletion markedly suppressed PDAC cell growth and metastatic potential. Mechanistically, AgrB enhanced the interaction between S100A6 and the deacetylase HDAC2, leading to reduced acetylation of mutant p53 at lysine 382. This disruption activated autophagy-dependent cell death and thereby inhibited PDAC progression.

CONCLUSION: Our findings reveal an S100A6-HDAC2-mutant p53 acetylation axis that regulates TP53-mutant pancreatic tumorigenesis, providing mechanistic evidence supporting S100A6 as a therapeutic vulnerability and highlighting AgrB as a promising natural-product-derived candidate for further development against this aggressive malignancy.

PMID:42700714 | DOI:10.1016/j.phymed.2026.158760

Received — 27 May 2026 ⏭

Contextual Rollout Bandits for Reinforcement Learning with Verifiable Rewards

✇cs.AI, q-bio.NC updates on arXiv.org
By: Xiaodong Lu · Xiaohan Wang · Jiajun Chai · Guojun Yin · Wei Lin · Zhijun Chen · Yu Luo · Fuzhen Zhuang · Yikun Ban · Deqing Wang
26 May 2026 at 12:00
arXiv:2602.08499v2 Announce Type: replace-cross Abstract: Reinforcement Learning with Verifiable Rewards (RLVR) is an effective paradigm for improving the reasoning capabilities of large language models. However, existing RLVR methods utilize rollouts in an indiscriminate and short-horizon manner: responses of heterogeneous quality within each prompt are treated uniformly, and historical rollouts are discarded after a single use. This leads to noisy supervision, poor sample efficiency, and suboptimal policy updates. We address these issues by formulating rollout scheduling in RLVR as a contextual bandit problem and proposing a unified neural scheduling framework that adaptively selects high-value rollouts throughout training. Each rollout is treated as an arm whose reward is defined by the induced performance gain between consecutive optimization steps. The resulting scheduler supports both noise-aware intra-group selection and adaptive global reuse of historical rollouts within a single principled framework. We provide theoretical justification by deriving sublinear regret bounds and showing that enlarging the rollout buffer improves the achievable performance upper bound. Experiments on six mathematical reasoning benchmarks demonstrate consistent gains in performance and training efficiency across multiple RLVR optimization methods.
Received — 2 April 2026 ⏭

CREST: Constraint-Release Execution for Multi-Robot Warehouse Shelf Rearrangement

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jiaqi Tan · Yudong Luo · Sophia Huang · Yifan Yang · Hang Ma
1 April 2026 at 12:00
arXiv:2603.28803v1 Announce Type: cross Abstract: Double-Deck Multi-Agent Pickup and Delivery (DD-MAPD) models the multi-robot shelf rearrangement problem in automated warehouses. MAPF-DECOMP is a recent framework that first computes collision-free shelf trajectories with a MAPF solver and then assigns agents to execute them. While efficient, it enforces strict trajectory dependencies, often leading to poor execution quality due to idle agents and unnecessary shelf switching. We introduce CREST, a new execution framework that achieves more continuous shelf carrying by proactively releasing trajectory constraints during execution. Experiments on diverse warehouse layouts show that CREST consistently outperforms MAPF-DECOMP, reducing metrics related to agent travel, makespan, and shelf switching by up to 40.5\%, 33.3\%, and 44.4\%, respectively, with even greater benefits under lift/place overhead. These results underscore the importance of execution-aware constraint release for scalable warehouse rearrangement. Code and data are available at https://github.com/ChristinaTan0704/CREST.

The 1000 Chinese Pangenome empowers medical and population genetics

✇Nature - Issue - nature.com science feeds
By: Yifei Wang · Zhongqu Duan · Dan Chen · Dandan Shi · Yi Ding · Zhibin Wang · Baoqing Li · Zhiyi Wang · Minmin Guo · Wen Yang · Junren Hou · Wenhao Chen · Yazhou Guo · Wenjie Wei · Yujie Cao · Xiwei Sun · Weiyang Bai · Mingdong Lu · Ting Qi · Xian Shen · Jian Yang
1 April 2026 at 08:00

Nature, Published online: 01 April 2026; doi:10.1038/s41586-026-10315-y

Development of the pangenome-informed genome assembly (PIGA) workflow enabled the generation of 1,116 diploid genome assemblies (55 de novo and 1,061 pangenome-informed), representing an extensive resource of medically relevant genic variations.
There are no more articles
❌