❌

Normal view

Received — 27 May 2026 ⏭

JT-SAFE-V2: Safety-by-Design Foundation Model with World-Context Data

✇cs.AI, q-bio.NC updates on arXiv.org
By: Junlan Feng · Fanyu Meng · Chong Long · Pengyu Cong · Duqing Wang · Yan Zheng · Yuyao Zhang · Xuanchang Gao · Ye Yuan · Yunfei Ma · Zhijie Ren · Fan Yang · Na Wu · Di Jin · Chao Deng
26 May 2026 at 12:00
arXiv:2605.24414v1 Announce Type: new Abstract: We introduce JT-Safe-V2, a large language model designed to advance the safety and trustworthiness of foundation models, extending our previous JT-Safe model toward a more comprehensive safety-by-design paradigm. JT-Safe-V2 emphasizes the joint optimization of general intelligence and safety-by-design through several key innovations: enriching pre-training data with contextual world knowledge, high-certainty pre-training procedures, and safety strengthening post-training mechanisms for enterprise-oriented agentic capabilities. Building on these safety-enhanced foundation models, we propose Safe-MoMA (Safe Mixture of Models and Agents), a framework that enables traceable and efficient inference through the orchestrated deployment of multiple models and agents. Extensive evaluations demonstrate that JT-Safe-V2 achieves state-of-the-art performance across both general intelligence and safety benchmarks. Moreover, Safe-MoMA reduces inference costs by more than 30\% compared to using the largest standalone model baseline while maintaining comparable performance. To facilitate future research on safety-by-design foundation models, we publicly release the post-trained JT-Safe-V2-35B model checkpoint.

SkillOpt: Executive Strategy for Self-Evolving Agent Skills

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yifan Yang · Ziyang Gong · Weiquan Huang · Qihao Yang · Ziwei Zhou · Zisu Huang · Yan Li · Xuemei Gao · Qi Dai · Bei Liu · Kai Qiu · Yuqing Yang · Dongdong Chen · Xue Yang · Chong Luo
26 May 2026 at 12:00
arXiv:2605.23904v2 Announce Type: replace Abstract: Agent skills today are hand-crafted, generated one-shot, or evolved through loosely controlled self-revision, none of which behaves like a deep-learning optimizer for the skill, and none of which reliably improves over its starting point under feedback. We argue the skill should instead be trained as the external state of a frozen agent, with the same discipline that makes weight-space optimization reproducible. SkillOpt is, to our knowledge, the first systematic controllable text-space optimizer for agent skills: a separate optimizer model turns scored rollouts into bounded add/delete/replace edits on a single skill document, and an edit is accepted only when it strictly improves a held-out validation score. A textual learning-rate budget, rejected-edit buffer, and epoch-wise slow/meta update make skill training stable while adding zero inference-time model calls at deployment. Across six benchmarks, seven target models, and three execution harnesses (direct chat, Codex, Claude Code), SkillOpt is best or tied on all 52 evaluated (model, benchmark, harness) cells and beats every per-cell competitor among human, one-shot LLM, Trace2Skill, TextGrad, GEPA, and EvoSkill skills. On GPT-5.5 it lifts the average no-skill accuracy by +23.5 points in direct chat, by +24.8 inside the Codex agentic loop, and by +19.1 inside Claude Code. Transfer experiments further show that optimized skill artifacts retain value when moved across model scales, between Codex and Claude Code execution environments, and to a nearby math benchmark without further optimization. Code: https://aka.ms/skillopt

Multi-omics integration identifies ribosome biogenesis-active macrophage subpopulation and its key gene GNL2 in driving liver hepatocellular carcinoma progression and mechanisms

✇Omics in Hepatocellular
By: Yajie Qi · Kun Li · Pincheng Li · Jianyu Yan · Shuyue Feng · Dan Wan · Ke Du · Xiao Liang · Fan Yang · Erzheng Zhou · Na Huang · Qian Wang · Nanbin Liu
14 May 2026 at 18:00

Cancer Cell Int. 2026 May 14. doi: 10.1186/s12935-026-04330-2. Online ahead of print.

ABSTRACT

BACKGROUND: Liver hepatocellular carcinoma (LIHC) is a common malignancy, yet the core genes driving its progression and potential therapeutic targets remain insufficiently explored. Ribosome biogenesis (RB) is a critical biological process linked to various cancers; however, its systematic role in LIHC remains unclear.

METHODS: This study integrated LIHC single-cell RNA-Seq, bulk RNA-Seq, and spatial transcriptomic data with ribosome biogenesis-related gene sets to construct a single-cell atlas of LIHC. Weighted Gene Co-expression Network Analysis (WGCNA) was employed to characterize myeloid cell subsets. Furthermore, an LIHC prognostic risk model based on RB-related genes was developed using 117 machine-learning algorithm combinations. Key findings were subsequently corroborated through experimental validation and clinical sample analysis.

RESULTS: We identified a distinct macrophage subpopulation with high ribosome biogenesis activity, termed ribosome biogenesis-active macrophages (RAMs). These cells exhibited strong communication with inflammatory macrophages, potentially mediated by MIF-related receptor-ligand interactions. We further constructed an 8-gene prognostic model (PA2G4, GNL2, PWP1, DDX49, NOC4L, GDI2, CST7, and RCL1), which showed good predictive performance. Drug sensitivity analysis suggested that the high-risk group may be more responsive to several agents, including docetaxel. Among these genes, GNL2 was selected for further investigation. Elevated GNL2 expression was associated with increased stemness features in myeloid cells. Molecular docking analysis identified several candidate compounds with potential binding affinity to GNL2. Functionally, GNL2 knockdown in macrophages reduced TGF-β and TNF-α expression and was associated with decreased proliferation, migration, and invasion of LIHC cells.

CONCLUSION: We identified a highly active ribosome biogenesis-macrophage subpopulation (RAM), and constructed a robust risk model to aid in the diagnosis, prognosis, and treatment of LIHC. GNL2 is associated with increased expression of TGF-β and TNF-α and may contribute to LIHC progression.

PMID:42135716 | DOI:10.1186/s12935-026-04330-2

Received — 8 April 2026 ⏭

Preserving Forgery Artifacts: AI-Generated Video Detection at Native Scale

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhengcen Li · Chenyang Jiang · Hang Zhao · Shiyang Zhou · Yunyang Mo · Feng Gao · Fan Yang · Qiben Shan · Shaocong Wu · Jingyong Su
7 April 2026 at 12:00
arXiv:2604.04634v1 Announce Type: cross Abstract: The rapid advancement of video generation models has enabled the creation of highly realistic synthetic media, raising significant societal concerns regarding the spread of misinformation. However, current detection methods suffer from critical limitations. They rely on preprocessing operations like fixed-resolution resizing and cropping. These operations not only discard subtle, high-frequency forgery traces but also cause spatial distortion and significant information loss. Furthermore, existing methods are often trained and evaluated on outdated datasets that fail to capture the sophistication of modern generative models. To address these challenges, we introduce a comprehensive dataset and a novel detection framework. First, we curate a large-scale dataset of over 140K videos from 15 state-of-the-art open-source and commercial generators, along with Magic Videos benchmark designed specifically for evaluating ultra-realistic synthetic content. In addition, we propose a novel detection framework built on the Qwen2.5-VL Vision Transformer, which operates natively at variable spatial resolutions and temporal durations. This native-scale approach effectively preserves the high-frequency artifacts and spatiotemporal inconsistencies typically lost during conventional preprocessing. Extensive experiments demonstrate that our method achieves superior performance across multiple benchmarks, underscoring the critical importance of native-scale processing and establishing a robust new baseline for AI-generated video detection.
Received — 4 April 2026 ⏭

When Should a Robot Think? Resource-Aware Reasoning via Reinforcement Learning for Embodied Robotic Decision-Making

✇cs.AI, q-bio.NC updates on arXiv.org
By: Jun Liu · Pu Zhao · Zhenglun Kong · Xuan Shen · Peiyan Dong · Fan Yang · Lin Cui · Hao Tang · Geng Yuan · Wei Niu · Wenbin Zhang · Xue Lin · Gaowen Liu · Yanzhi Wang · Dong Huang
3 April 2026 at 12:00
arXiv:2603.16673v3 Announce Type: replace-cross Abstract: Embodied robotic systems increasingly rely on large language model (LLM)-based agents to support high-level reasoning, planning, and decision-making during interactions with the environment. However, invoking LLM reasoning introduces substantial computational latency and resource overhead, which can interrupt action execution and reduce system reliability. Excessive reasoning may delay actions, while insufficient reasoning often leads to incorrect decisions and task failures. This raises a fundamental question for embodied agents: when should the agent reason, and when should it act? In this work, we propose RARRL (Resource-Aware Reasoning via Reinforcement Learning), a hierarchical framework for resource-aware orchestration of embodied agents. Rather than learning low-level control policies, RARRL learns a high-level orchestration policy that operates at the agent's decision-making layer. This policy enables the agent to adaptively determine whether to invoke reasoning, which reasoning role to employ, and how much computational budget to allocate based on current observations, execution history, and remaining resources. Extensive experiments, including evaluations with empirical latency profiles derived from the ALFRED benchmark, show that RARRL consistently improves task success rates while reducing execution latency and enhancing robustness compared with fixed or heuristic reasoning strategies. These results demonstrate that adaptive reasoning control is essential for building reliable and efficient embodied robotic agents.

Metabolite-gated vascular contractility switch: OXGR1 activation mechanism enables agonist therapy for rosacea erythema

✇Cell
By: Wenqin Xiao · Yan Zhu · Xinjie Tang · Kongkai Zhu · Weifeng Zhang · Mengting Chen · Kui Cai · San Xu · Zheng Wu · Mei Wang · Jiayi Liu · Linglong Long · Zixin Tan · Aike Wu · Songqi Zhou · Zhixiang Zhao · Yan Tang · Yingxue Huang · Ben Wang · Fangfen Liu · Qian Wang · Fan Yang · Dan Jian · Wei Shi · Hongfu Xie · Xiang Chen · Lulu Guo · Zhili Deng · Jinpeng Sun · Ji Li
5 March 2026 at 08:00
Xiao et al. identify α-KG as a rosacea-associated metabolite that activates the OXGR1-Gq-MYL9 axis in the vascular smooth muscle cells to boost contractility and suppress pathological vasodilation underlying erythema. Cryo-EM reveals a bipartite-acid pocket of OXGR1 that enables structure-guided development of A-1, a selective agonist that alleviates erythema in rosacea-like models.
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.
Received — 26 March 2026 ⏭

OmniDiT: Extending Diffusion Transformer to Omni-VTON Framework

✇cs.AI, q-bio.NC updates on arXiv.org
By: Weixuan Zeng · Pengcheng Wei · Huaiqing Wang · Boheng Zhang · Jia Sun · Dewen Fan · Lin HE · Long Chen · Qianqian Gan · Fan Yang · Tingting Gao
25 March 2026 at 12:00
arXiv:2603.19643v2 Announce Type: replace-cross Abstract: Despite the rapid advancement of Virtual Try-On (VTON) and Try-Off (VTOFF) technologies, existing VTON methods face challenges with fine-grained detail preservation, generalization to complex scenes, complicated pipeline, and efficient inference. To tackle these problems, we propose OmniDiT, an omni Virtual Try-On framework based on the Diffusion Transformer, which combines try-on and try-off tasks into one unified model. Specifically, we first establish a self-evolving data curation pipeline to continuously produce data, and construct a large VTON dataset Omni-TryOn, which contains over 380k diverse and high-quality garment-model-tryon image pairs and detailed text prompts. Then, we employ the token concatenation and design an adaptive position encoding to effectively incorporate multiple reference conditions. To relieve the bottleneck of long sequence computation, we are the first to introduce Shifted Window Attention into the diffusion model, thus achieving a linear complexity. To remedy the performance degradation caused by local window attention, we utilize multiple timestep prediction and an alignment loss to improve generation fidelity. Experiments reveal that, under various complex scenes, our method achieves the best performance in both the model-free VTON and VTOFF tasks and a performance comparable to current SOTA methods in the model-based VTON task.
Received — 17 March 2026 ⏭

VideoTemp-o3: Harmonizing Temporal Grounding and Video Understanding in Agentic Thinking-with-Videos

✇cs.AI, q-bio.NC updates on arXiv.org
By: Wenqi Liu · Yunxiao Wang · Shijie Ma · Meng Liu · Qile Su · Tianke Zhang · Haonan Fan · Changyi Liu · Kaiyu Jiang · Jiankang Chen · Kaiyu Tang · Bin Wen · Fan Yang · Tingting Gao · Han Li · Yinwei Wei · Xuemeng Song
16 March 2026 at 12:00
arXiv:2602.07801v3 Announce Type: replace-cross Abstract: In long-video understanding, conventional uniform frame sampling often fails to capture key visual evidence, leading to degraded performance and increased hallucinations. To address this, recent agentic thinking-with-videos paradigms have emerged, adopting a localize-clip-answer pipeline in which the model actively identifies relevant video segments, performs dense sampling within those clips, and then produces answers. However, existing methods remain inefficient, suffer from weak localization, and adhere to rigid workflows. To solve these issues, we propose VideoTemp-o3, a unified agentic thinking-with-videos framework that jointly models video grounding and question answering. VideoTemp-o3 exhibits strong localization capability, supports on-demand clipping, and can refine inaccurate localizations. Specifically, in the supervised fine-tuning stage, we design a unified masking mechanism that encourages exploration while preventing noise. For reinforcement learning, we introduce dedicated rewards to mitigate reward hacking. Besides, from the data perspective, we develop an effective pipeline to construct high-quality long video grounded QA data, along with a corresponding benchmark for systematic evaluation across various video durations. Experimental results demonstrate that our method achieves remarkable performance on both long video understanding and grounding.
Received — 5 March 2026 ⏭

Agent Data Protocol: Unifying Datasets for Diverse, Effective Fine-tuning of LLM Agents

✇cs.AI, q-bio.NC updates on arXiv.org
By: Yueqi Song · Ketan Ramaneti · Zaid Sheikh · Ziru Chen · Boyu Gou · Tianbao Xie · Yiheng Xu · Danyang Zhang · Apurva Gandhi · Fan Yang · Joseph Liu · Tianyue Ou · Zhihao Yuan · Frank Xu · Shuyan Zhou · Xingyao Wang · Xiang Yue · Tao Yu · Huan Sun · Yu Su · Graham Neubig
5 March 2026 at 13:00
arXiv:2510.24702v2 Announce Type: replace-cross Abstract: Public research results on large-scale supervised finetuning of AI agents remain relatively rare, since the collection of agent training data presents unique challenges. In this work, we argue that the bottleneck is not a lack of underlying data sources, but that a large variety of data is fragmented across heterogeneous formats, tools, and interfaces. To this end, we introduce the agent data protocol (ADP), a light-weight representation language that serves as an "interlingua" between agent datasets in diverse formats and unified agent training pipelines downstream. The design of ADP is expressive enough to capture a large variety of tasks, including API/tool use, browsing, coding, software engineering, and general agentic workflows, while remaining simple to parse and train on without engineering at a per-dataset level. In experiments, we unified a broad collection of 13 existing agent training datasets into ADP format, and converted the standardized ADP data into training-ready formats for multiple agent frameworks. We performed SFT on these data, and demonstrated an average performance gain of ~20% over corresponding base models, and delivers state-of-the-art or near-SOTA performance on standard coding, browsing, tool use, and research benchmarks, without domain-specific tuning. All code and data are released publicly, in the hope that ADP could help lower the barrier to standardized, scalable, and reproducible agent training.

UniG2U-Bench: Do Unified Models Advance Multimodal Understanding?

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zimo Wen · Boxiu Li · Wanbo Zhang · Junxiang Lei · Xiaoyu Chen · Yijia Fan · Qi Zhang · Yujiang Wang · Lili Qiu · Bo Li · Ziwei Liu · Caihua Shan · Yifan Yang · Yifei Shen
4 March 2026 at 13:00
arXiv:2603.03241v1 Announce Type: cross Abstract: Unified multimodal models have recently demonstrated strong generative capabilities, yet whether and when generation improves understanding remains unclear. Existing benchmarks lack a systematic exploration of the specific tasks where generation facilitates understanding. To this end, we introduce UniG2U-Bench, a comprehensive benchmark categorizing generation-to-understanding (G2U) evaluation into 7 regimes and 30 subtasks, requiring varying degrees of implicit or explicit visual transformations. Extensive evaluation of over 30 models reveals three core findings: 1) Unified models generally underperform their base Vision-Language Models (VLMs), and Generate-then-Answer (GtA) inference typically degrades performance relative to direct inference. 2) Consistent enhancements emerge in spatial intelligence, visual illusions, or multi-round reasoning subtasks, where enhanced spatial and shape perception, as well as multi-step intermediate image states, prove beneficial. 3) Tasks with similar reasoning structures and models sharing architectures exhibit correlated behaviors, suggesting that generation-understanding coupling induces class-consistent inductive biases over tasks, pretraining data, and model architectures. These findings highlight the necessity for more diverse training data and novel paradigms to fully unlock the potential of unified multimodal modeling.

VideoTemp-o3: Harmonizing Temporal Grounding and Video Understanding in Agentic Thinking-with-Videos

✇cs.AI, q-bio.NC updates on arXiv.org
By: Wenqi Liu · Yunxiao Wang · Shijie Ma · Meng Liu · Qile Su · Tianke Zhang · Haonan Fan · Changyi Liu · Kaiyu Jiang · Jiankang Chen · Kaiyu Tang · Bin Wen · Fan Yang · Tingting Gao · Han Li · Yinwei Wei · Xuemeng Song
4 March 2026 at 13:00
arXiv:2602.07801v2 Announce Type: replace-cross Abstract: In long-video understanding, conventional uniform frame sampling often fails to capture key visual evidence, leading to degraded performance and increased hallucinations. To address this, recent agentic thinking-with-videos paradigms have emerged, adopting a localize-clip-answer pipeline in which the model actively identifies relevant video segments, performs dense sampling within those clips, and then produces answers. However, existing methods remain inefficient, suffer from weak localization, and adhere to rigid workflows. To solve these issues, we propose VideoTemp-o3, a unified agentic thinking-with-videos framework that jointly models video grounding and question answering. VideoTemp-o3 exhibits strong localization capability, supports on-demand clipping, and can refine inaccurate localizations. Specifically, in the supervised fine-tuning stage, we design a unified masking mechanism that encourages exploration while preventing noise. For reinforcement learning, we introduce dedicated rewards to mitigate reward hacking. Besides, from the data perspective, we develop an effective pipeline to construct high-quality long video grounded QA data, along with a corresponding benchmark for systematic evaluation across various video durations. Experimental results demonstrate that our method achieves remarkable performance on both long video understanding and grounding.
Received — 25 February 2026 ⏭

BioLM-Score: Language-Prior Conditioned Probabilistic Geometric Potentials for Protein-Ligand Scoring

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhangfan Yang · Baoyun Chen · Dong Xu · Jia Wang · Ruibin Bai · Junkai Ji · Zexuan Zhu
24 February 2026 at 13:00
arXiv:2602.18476v1 Announce Type: cross Abstract: Protein-ligand scoring is a central component of structure-based drug design, underpinning molecular docking, virtual screening, and pose optimization. Conventional physics-based energy functions are often computationally expensive, limiting their utility in large-scale screening. In contrast, deep learning-based scoring models offer improved computational efficiency but frequently suffer from limited cross-target generalization and poor interpretability, which restrict their practical applicability. Here we present BioLM-Score, a simple yet generalizable protein-ligand scoring model that couples geometric modeling with representation learning. Specifically, it employs modality-specific and structure-aware encoders for proteins and ligands, each augmented with biomolecular language models to enrich structural and chemical representations. Subsequently, these representations are integrated through a mixture density network to predict multimodal interatomic distance distributions, from which statistically grounded likelihood-based scores are derived. Evaluations on the CASF-2016 benchmark demonstrate that BioLM-Score achieves significant improvements across docking, scoring, ranking, and screening tasks. Moreover, the proposed scoring function serves as an effective optimization objective for guiding docking protocols and conformational search. In summary, BioLM-Score provides a principled and practical alternative to existing scoring functions, combining efficiency, generalization, and interpretability for structure-based drug discovery.
Received — 17 February 2026 ⏭

CT-Bench: A Benchmark for Multimodal Lesion Understanding in Computed Tomography

✇cs.AI, q-bio.NC updates on arXiv.org
By: Qingqing Zhu · Qiao Jin · Tejas S. Mathai · Yin Fang · Zhizheng Wang · Yifan Yang · Maame Sarfo-Gyamfi · Benjamin Hou · Ran Gu · Praveen T. S. Balamuralikrishna · Kenneth C. Wang · Ronald M. Summers · Zhiyong Lu
17 February 2026 at 13:00
arXiv:2602.14879v1 Announce Type: cross Abstract: Artificial intelligence (AI) can automatically delineate lesions on computed tomography (CT) and generate radiology report content, yet progress is limited by the scarcity of publicly available CT datasets with lesion-level annotations. To bridge this gap, we introduce CT-Bench, a first-of-its-kind benchmark dataset comprising two components: a Lesion Image and Metadata Set containing 20,335 lesions from 7,795 CT studies with bounding boxes, descriptions, and size information, and a multitask visual question answering benchmark with 2,850 QA pairs covering lesion localization, description, size estimation, and attribute categorization. Hard negative examples are included to reflect real-world diagnostic challenges. We evaluate multiple state-of-the-art multimodal models, including vision-language and medical CLIP variants, by comparing their performance to radiologist assessments, demonstrating the value of CT-Bench as a comprehensive benchmark for lesion analysis. Moreover, fine-tuning models on the Lesion Image and Metadata Set yields significant performance gains across both components, underscoring the clinical utility of CT-Bench.

Automated Proof Generation for Rust Code via Self-Evolution

✇cs.AI, q-bio.NC updates on arXiv.org
By: Tianyu Chen · Shuai Lu · Shan Lu · Yeyun Gong · Chenyuan Yang · Xuheng Li · Md Rakib Hossain Misu · Hao Yu · Nan Duan · Peng Cheng · Fan Yang · Shuvendu K Lahiri · Tao Xie · Lidong Zhou
17 February 2026 at 13:00
arXiv:2410.15756v3 Announce Type: replace-cross Abstract: Ensuring correctness is crucial for code generation. Formal verification offers a definitive assurance of correctness, but demands substantial human effort in proof construction and hence raises a pressing need for automation. The primary obstacle lies in the severe lack of data-there is much fewer proofs than code snippets for Large Language Models (LLMs) to train upon. In this paper, we introduce SAFE, a framework that overcomes the lack of human-written proofs to enable automated proof generation of Rust code. SAFE establishes a self-evolving cycle where data synthesis and fine-tuning collaborate to enhance the model capability, leveraging the definitive power of a symbolic verifier in telling correct proofs from incorrect ones. SAFE also re-purposes the large number of synthesized incorrect proofs to train the self-debugging capability of the fine-tuned models, empowering them to fix incorrect proofs based on the verifier's feedback. SAFE demonstrates superior efficiency and precision compared to GPT-4o. Through tens of thousands of synthesized proofs and the self-debugging mechanism, we improve the capability of open-source models, initially unacquainted with formal verification, to automatically write proofs for Rust code. This advancement leads to a significant improvement in performance, achieving a 52.52% accuracy rate in a benchmark crafted by human experts, a significant leap over GPT-4o's performance of 14.39%.
There are no more articles
❌