arXiv subjects

Chao Chen

Publications and source records attributed to Chao Chen.

At least 217 records · Page 12Linked to original sources

arXiv2026

Search for a hypothetical gauge boson and dark photons in charmonium transitions

We report a direct search for a new gauge boson, $X$, with a mass of $17~\text{MeV}/c^2$, which could explain the anomalous excess of $e^+e^-$ pairs observed in the $^8\text{Be}$ nuclear transitions. The search is conducted in the charmonium decays $χ_{cJ}\to X J/ψ~(J=0,1,2)$ via the radiative transition $ψ(3686)\toγχ_{cJ}$ using $\left(2712.4\pm 14.3 \right)\times 10^6$ $ψ(3686)$ events collected with the BESIII detector at the BEPCII collider. No significant signal is observed, and the updated upper limit on the coupling strength of charm quark and the new gauge boson, $ε_c$, is set to be $|ε_c|<1.2\times 10^{-2}$ at $90\%$ confidence level. We also report new constraints on the mixing strength $ε$ between the Standard Model photon and dark photon $γ^\prime$ in the mass range from $5~\text{MeV}/c^2$ to $300~\text{MeV}/c^2$. The upper limits at $90\%$ confidence level vary within $(2.5-17.5)\times 10^{-3}$ depending on the $γ^\prime $ mass.

hep-ex↗

arXiv2026

GenMRP: A Generative Multi-Route Planning Framework for Efficient and Personalized Real-Time Industrial Navigation

Existing industrial-scale navigation applications contend with massive road networks, typically employing two main categories of approaches for route planning. The first relies on precomputed road costs for optimal routing and heuristic algorithms for generating alternatives, while the second, generative methods, has recently gained significant attention. However, the former struggles with personalization and route diversity, while the latter fails to meet the efficiency requirements of large-scale real-time scenarios. To address these limitations, we propose GenMRP, a generative framework for multi-route planning. To ensure generation efficiency, GenMRP first introduces a skeleton-to-capillary approach that dynamically constructs a relevant sub-network significantly smaller than the full road network. Within this sub-network, routes are generated iteratively. The first iteration identifies the optimal route, while the subsequent ones generate alternatives that balance quality and diversity using the newly proposed correctional boosting approach. Each iteration incorporates road features, user historical sequences, and previously generated routes into a Link Cost Model to update road costs, followed by route generation using the Dijkstra algorithm. Extensive experiments show that GenMRP achieves state-of-the-art performance with high efficiency in both offline and online environments. To facilitate further research, we have publicly released the training and evaluation dataset. GenMRP has been fully deployed in a real-world navigation app, demonstrating its effectiveness and benefits.

cs.RO↗

arXiv2026

Study of $\barΛ$-$p$ Annihilation into Light Mesons

The annihilation of $\barΛ$-$p$ into light mesons is studied using $(10.087\pm0.044)\times10^{9}$ $J/ψ$ events collected with the BESIII detector at the BEPCII storage ring. The $\barΛ$ baryons are produced in the process $J/ψ\rightarrowΛ\barΛ$ and interact with the protons in the hydrogen nuclei in the cooling oil of the beam pipe. The reactions $\barΛp\rightarrow K^+π^+π^-$ and $K^+2π^+2π^-$ are observed for the first time, evidence for the reaction $\barΛp\rightarrow K^0_S2π^+π^-$ is found, and no significant signals are seen for the reactions $\barΛp\rightarrow K^0_Sπ^+$, $K^+3π^+3π^-$ and $2K^+K^-$. The cross sections of these reactions are also measured at $P_{\barΛ}\approx 1.074$ GeV/$c$. Furthermore, no significant structures are observed in the combinations of the final state particles for these reactions. The annihilation of $\barΛ$-$p$ into light mesons presents the similar behavior as $\bar{n}$-$p$ reactions in this energy region. These new measurements will serve as important inputs for the theoretical understanding of the antihyperon-nucleon interaction, and further contribute to understanding antibaryon-baryon interaction in a unified perspective.

hep-ex↗

arXiv2026

Evaluating Scoring Bias in LLM-as-a-Judge

The "LLM-as-a-Judge" paradigm, using Large Language Models (LLMs) as automated evaluators, is pivotal to LLM development, offering scalable feedback for complex tasks. However, the reliability of these judges is compromised by various biases. Existing research has heavily concentrated on biases in comparative evaluations. In contrast, scoring-based evaluations-which assign an absolute score and are often more practical in industrial applications-remain under-investigated. To address this gap, we undertake the first dedicated examination of scoring bias in LLM judges. We shift the focus from biases tied to the evaluation targets to those originating from the scoring prompt itself. We formally define scoring bias and identify three novel, previously unstudied types: rubric order bias, score ID bias, and reference answer score bias. We propose a comprehensive framework to quantify these biases, featuring a suite of multi-faceted metrics and an automatic data synthesis pipeline to create a tailored evaluation corpus. Our experiments empirically demonstrate that even the most advanced LLMs suffer from these substantial scoring biases. Our analysis yields actionable insights for designing more robust scoring prompts and mitigating these newly identified biases.

cs.CL↗

arXiv2026

Observation of $ψ(3686) \to Ξ^- K^0_S \barΩ^+ $+c.c

Using a sample of $(2.712\pm0.014) \times 10^{9}$ $ψ(3686)$ events collected with the BESIII detector at the electron positron collider BEPCII, the decay $ψ(3686) \to Ξ^- K^0_S \barΩ^+ +c.c.$ is observed for the first time, which has a significance of 5.9 standard deviations. The branching fraction of this decay is measured to be $(2.91\pm0.47\pm0.33)\times 10^{-6}$, where the first and second uncertainties are statistical and systematic, respectively. The ratio between $\mathcal{B}_{ψ(3686) \to Ξ^- K^0_S \barΩ^+ +c.c.}$ and $\mathcal{B}_{ψ(3686) \to Ω^- K^+ \barΞ^0 +c.c.}$ is determined to be $1.05\pm0.23\pm0.14 $, which deviates with the isospin symmetry conservation predicted value of 0.5 by $2.1σ$.

hep-ex↗

arXiv2026

Study of $η\rightarrowπ^+π^-l^+l^-$

Using a sample of $(10087\pm44)\times10^{6}$ $J/ψ$ events accumulated with the BESIII detector, we analyze the decays $η\rightarrowπ^+π^-l^+l^-$ ($l=e$ or $μ$) via the process $J/ψ\rightarrowγη$. The branching fraction of $η\rightarrowπ^+π^-e^+e^-$ is measured to be $\mathcal{B}(η\rightarrowπ^+π^-e^+e^-)=(3.07\pm0.12_{\rm{stat.}}\pm0.19_{\rm{syst.}}) \times10^{-4}$. No signal events are observed for the $η\rightarrowπ^{+}π^{-}μ^{+}μ^{-}$ decay, leading to an upper limit on the branching fraction of $\mathcal{B}(η\rightarrowπ^{+}π^{-}μ^{+}μ^{-})<4.0\times10^{-7}$ at the 90\% confidence level. Furthermore, the $CP$-violation asymmetry parameter is found to be $\mathcal{A}_{CP}(η\rightarrowπ^{+}π^{-}e^{+}e^{-})=(-4.04\pm4.69_{\rm{stat.}}\pm0.14_{\rm{syst.}})\%$, showing no evidence of $CP$-violation with current statistics. Additionally, we extract the transition form factor from the decay amplitude of $η\rightarrowπ^+π^-e^+e^-$. Finally, axion-like particles are searched for via the decay $η\rightarrowπ^+π^-a, a\rightarrow e^+e^-$, and upper limits on this branching fraction relative to that of $η\rightarrowπ^+π^-e^+e^-$ are presented as a function of the axion-like particle mass in the range $5-200\ \mathrm{MeV}/c^{2}$.

hep-ex↗

arXiv2026

Trajectory Data Management and Mining: A Survey from Deep Learning to the LLM Era

Trajectory computing is a pivotal domain encompassing trajectory data management and mining, garnering widespread attention due to its crucial role in various practical applications such as location services, urban traffic, and public safety. Traditional methods, focusing on simplistic spatio-temporal features, face challenges of complex calculations, limited scalability, and inadequate adaptability to real-world complexities. In this paper, we present a comprehensive review of the development and recent advances in trajectory computing, from deep learning to the more recent large language models. We first define trajectory data and provide a brief overview of widely-used deep learning models. Systematically, we explore deep learning applications in trajectory management (pre-processing, storage, analysis, and visualization) and mining (trajectory-related forecasting, trajectory-related recommendation, trajectory classification, travel time estimation, anomaly detection, and mobility generation). Furthermore, we discuss emerging research directions and recent advancements in large models (represented by foundation models and large language models) for trajectory computing, which promise to reshape the next generation of trajectory computing. Additionally, we summarize application scenarios, public datasets, and toolkits. Finally, we outline current challenges in trajectory computing research and propose future directions. Relevant papers and open-source resources have been collated and are continuously updated at: https://github.com/yoshall/Awesome-Trajectory-Computing.

cs.LG↗

arXiv2026

Search for $ψ_0(4360)\rightarrow ηψ(2S)$ through the process $e^+e^- \rightarrow ηηψ(2S)$

Using data samples corresponding to an integrated luminosity of 0.9~fb$^{-1}$ collected with the BESIII detector operating at the BEPCII storage ring at the center-of-mass energies of 4.84, 4.92, and 4.95~GeV, we search for the exotic charmonium-like state with quantum numbers $J^{PC}=0^{--}$, $ψ_0(4360)$, in the process $e^+e^-\rightarrowηψ_0(4360)$ with $ψ_0(4360)\rightarrowηψ(2S)$. No significant signal of the $ψ_0(4360)$ resonance state is observed. Upper limits on $σ(e^+e^-\rightarrowηψ_0(4360))\cdot {B}(ψ_0(4360)\rightarrowηψ(2S))$ and $σ(e^+e^-\rightarrowηηψ(2S))$ at the 90\% confidence level are determined for each energy point.

hep-ex↗

arXiv2026

Reasoning in the Dark: Interleaved Vision-Text Reasoning in Latent Space

Multimodal reasoning aims to enhance the capabilities of MLLMs by incorporating intermediate reasoning steps before reaching the final answer. It has evolved from text-only reasoning to the integration of visual information, enabling the thought process to be conveyed through both images and text. Despite its effectiveness, current multimodal reasoning methods depend on explicit reasoning steps that require labor-intensive vision-text annotations and inherently introduce significant inference latency. To address these issues, we introduce multimodal latent reasoning with the advantages of multimodal representation, reduced annotation, and inference efficiency. To facilitate it, we propose Interleaved Vision-Text Latent Reasoning (IVT-LR), which injects both visual and textual information in the reasoning process within the latent space. Specifically, IVT-LR represents each reasoning step by combining two implicit parts: latent text (the hidden states from the previous step) and latent vision (a set of selected image embeddings). We further introduce a progressive multi-stage training strategy to enable MLLMs to perform the above multimodal latent reasoning steps. Experiments on M$^3$CoT and ScienceQA demonstrate that our IVT-LR method achieves an average performance increase of 5.45\% in accuracy, while simultaneously achieving a speed increase of over 5 times compared to existing approaches.

cs.CV↗

arXiv2026

First evidence for $D_s^+ \to f_1(1420) e^+ν_e$ and search for $D_s^+ \to f_1(1285) e^+ν_e$

Using $e^+e^-$ collision data corresponding to an integrated luminosity of 7.33~${\rm fb^{-1}}$ recorded by the BESIII detector at center-of-mass energies between 4.128 and 4.226~${\rm GeV}$, we present the first search for the semileptonic decays $D^+_s\to\ f_1(1420)e^+ν_e$ and $D^+_s\to\ f_1(1285)e^+ν_e$. The first evidence for the decay $D^+_s\to\ f_1(1420)e^+ν_e$ is found with a statistical significance of 3.4$σ$, and its product branching fraction $\mathcal{B}(D^+_s\to\ f_1(1420)e^+ν_e)\cdot\mathcal{B}(f_1(1420)\to\ K^+K^-π^0)$ is determined to be $\rm (4.5^{+2.0}_{-1.7}(stat) \pm0.4(syst)) \times 10^{-4} $, corresponding to an upper limit of $7.6 \times10^{-4}$ at the 90% confidence level. No significant signal of the decay $D^+_s\to\ f_1(1285)e^+ν_e$ is observed and the upper limit on the product branching fraction is set to be $\mathcal{B}(D^+_s\to\ f_1(1285)e^+ν_e)\cdot\mathcal{B}(f_1(1285)\to\ π^+π^-η) < 1.7\times10^{-4}$ at the 90% confidence level.

hep-ex↗

arXiv2026

Design, waterproofing, and mass production of the 3-inch PMT frontend system of JUNO

Over 25,600 3-inch photomultiplier tubes (PMTs) have been instrumented for the central detector of the Jiangmen Underground Neutrino Observatory. Each PMT is equipped with a high-voltage divider and a frontend cable with waterproof sealing. Groups of sixteen PMTs are connected to the underwater frontend readout electronics via specialized multi-channel waterproof connectors. This paper outlines the design and mass production processes for the high-voltage divider, the cable and connector, as well as the waterproof potting of the PMT bases. The results of the acceptance tests of all the integrated PMTs are also presented.

physics.ins-det↗

arXiv2026

Helicity amplitude and branching fraction measurement of $χ_{cJ} \rightarrow Λ\barΛ $

Utilizing $2712.4 \pm 14.3$ million $ψ(3686)$ events accumulated by the BESIII experiment, we perform a partial wave analysis of $ψ(3686)\rightarrowγχ_{cJ}\rightarrowγΛ\barΛ$ decay ($J=0,1,2$). The ratio of the helicity amplitudes with same (++) and opposite (+-) helicity for $χ_{c2}\rightarrowΛ\barΛ$ decay is determined for the first time to be $R_{χ_{c2}}=0.575 \pm 0.048 \pm 0.018 $, with a relative phase angle $ΔΦ_{χ_{c2}} = 0.37 \pm 0.15 \pm 0.05 $~rad. The parameters of the angular distribution of $χ_{c2}$ are determined to be $α_{χ_{c2}} = -0.211 \pm 0.100 \pm 0.050 $ and $β_{χ_{c2}} = -0.039 \pm 0.089 \pm 0.033 $, based on the distribution $dN / d\cosθ= 1 + α_{χ_{c2}} \cos^2θ+ β_{χ_{c2}} \cos^4θ$. The width of $χ_{c0}$ is determined to be $12.31 \pm 0.26 \pm 0.12 $~MeV. Additionally, the branching fractions for $χ_{cJ} \rightarrow Λ\barΛ$ are measured to be $(3.662 \pm 0.048 \pm 0.111) \times 10^{-4}$, $(1.182 \pm 0.026 \pm 0.042) \times 10^{-4}$, and $(1.704 \pm 0.035 \pm 0.057) \times 10^{-4}$ for $χ_{c0}$, $χ_{c1}$ and $χ_{c2}$, respectively, where the first uncertainty is statistical and the second systematic.

hep-ex↗

arXiv2026

Approximation Algorithm for Constrained $k$-Center Clustering: A Local Search Approach

Clustering is a long-standing research problem and a fundamental tool in AI and data analysis. The traditional k-center problem, a fundamental theoretical challenge in clustering, has a best possible approximation ratio of 2, and any improvement to a ratio of 2 - ε would imply P = NP. In this work, we study the constrained k-center clustering problem, where instance-level cannot-link (CL) and must-link (ML) constraints are incorporated as background knowledge. Although general CL constraints significantly increase the hardness of approximation, previous work has shown that disjoint CL sets permit constant-factor approximations. However, whether local search can achieve such a guarantee in this setting remains an open question. To this end, we propose a novel local search framework based on a transformation to a dominating matching set problem, achieving the best possible approximation ratio of 2. The experimental results on both real-world and synthetic datasets demonstrate that our algorithm outperforms baselines in solution quality.

cs.LG↗

arXiv2026

Improved Streaming Algorithm for Fair $k$-Center Clustering

Many real-world applications pose challenges in incorporating fairness constraints into the $k$-center clustering problem, where the dataset consists of $m$ demographic groups, each with a specified upper bound on the number of centers to ensure fairness. Focusing on big data scenarios, this paper addresses the problem in a streaming setting, where data points arrive one by one sequentially in a continuous stream. Leveraging a structure called the $λ$-independent center set, we propose a one-pass streaming algorithm that first computes a reserved set of points during the streaming process. Then, for the post-streaming process, we propose an approach for selecting centers from the reserved point set by analyzing all three possible cases, transforming the most complicated one into a specially constrained vertex cover problem in an auxiliary graph. Our algorithm achieves a tight approximation ratio of 5 while consuming $O(k\log n)$ memory. It can also be readily adapted to solve the offline fair $k$-center problem, achieving a 3-approximation ratio that matches the current state of the art. Furthermore, we extend our approach to a semi-structured data stream, where data points from each group arrive in batches. In this setting, we present a 3-approximation algorithm for $m = 2$ and a 4-approximation algorithm for general $m$. Lastly, we conduct extensive experiments to evaluate the performance of our approaches, demonstrating that they outperform existing baselines in both clustering cost and runtime efficiency.

cs.DS↗

arXiv2026

Optimized Algorithms for Text Clustering with LLM-Generated Constraints

Clustering is a fundamental tool that has garnered significant interest across a wide range of applications including text analysis. To improve clustering accuracy, many researchers have incorporated background knowledge, typically in the form of must-link and cannot-link constraints, to guide the clustering process. With the recent advent of large language models (LLMs), there is growing interest in improving clustering quality through LLM-based automatic constraint generation. In this paper, we propose a novel constraint-generation approach that reduces resource consumption by generating constraint sets rather than using traditional pairwise constraints. This approach improves both query efficiency and constraint accuracy compared to state-of-the-art methods. We further introduce a constrained clustering algorithm tailored to the characteristics of LLM-generated constraints. Our method incorporates a confidence threshold and a penalty mechanism to address potentially inaccurate constraints. We evaluate our approach on five text datasets, considering both the cost of constraint generation and the overall clustering performance. The results show that our method achieves clustering accuracy comparable to the state-of-the-art algorithms while reducing the number of LLM queries by more than 20 times.

cs.LG↗

arXiv2026

First Measurement of the Absolute Branching Fraction of $η_c \to γγ$

We apply a tag-and-probe method to precisely measure the absolute branching fraction of the decay $η_c \to γγ$ with the BESIII experiment at BEPCII. Starting with a large initial sample of $2712.4\pm 14.3$ million $ψ(3686)$ events, a sample of 0.16 million $η_c$ events are tagged via the golden channel $ψ(3686)\to π^0 h_c$, $h_c\to γη_c$, effectively avoiding interference effects. The absolute branching fraction of $η_c \to γγ$ is measured for the first time to be $\mathcal{B}(η_c \to γγ) = (2.45 \pm 0.48_{\rm stat.} \pm 0.09_{\rm syst.}) \times 10^{-4}$. Using the world average value of the total width of the $η_c$, the partial decay width of $η_c \to γγ$ is calculated to be $Γ(η_c \to γγ) = (7.48 \pm 1.48_{\rm stat.} \pm 0.30_{\rm syst.})~{\rm keV}$.

hep-ex↗

arXiv2026

Search for a dark baryon in the $Ξ^-\rightarrowπ^-+{\rm invisible}$ decay

A search for a dark baryon is performed for the first time in the two-body decay $Ξ^-\rightarrowπ^-+{\rm invisible}$ using $(10.087\pm0.044)\times10^{9}$ $J/ψ$ events collected at a center-of-mass energy of $\sqrt{s}=3.097\,\mbox{GeV}$ with the BESIII detector at the BEPCII collider. No significant signal is observed, and the 90% (95%) confidence level upper limits on the branching fraction $B(Ξ^-\rightarrowπ^-+{\rm invisible})$ are determined to be $4.2\times10^{-5}$ ($5.2\times10^{-5}$), $6.9\times10^{-5}$ ($8.4\times10^{-5}$), $6.5\times10^{-4}$ ($7.6\times10^{-4}$), $1.1\times10^{-4}$ ($1.3\times10^{-4}$) and $4.5\times10^{-5}$ ($5.5\times10^{-5}$), under the dark baryon mass hypotheses of 1.07$\,\mbox{GeV}/c^2$, 1.10$\,\mbox{GeV}/c^2$, $m_Λ$ (1.116$\,\mbox{GeV}/c^2$), 1.13$\,\mbox{GeV}/c^2$, and 1.16$\,\mbox{GeV}/c^2$, respectively. The constraints obtained on the Wilson coefficients $C_{u s, s}^L$ and $C_{u s, s}^R$ are more stringent than the previous limits derived from the LHC searches for the colored mediators.

hep-ex↗

arXiv2026

Amplitude analysis and branching fraction measurement of $J/ψ\to Λ\barΣ^0η+\mathrm{c.c}$

Based on a sample of $(10087\pm44)\times10^{6}$ $J/ψ$ events collected with the BESIII detector, a partial-wave analysis of $ J/ψ\to Λ\bar{ Σ}^0η+\mathrm{c.c} $ is performed for the first time. The dominant contributions are found to be excited $Λ$ states with $J^P=1/2^-$ and $J^P=1/2^+$ in the $ηΛ$ mass spectra. The measured masses and widths are $M=1668.8\pm3.1\pm21.2$ MeV/$c^2$ and $Γ=52.7\pm4.2\pm17.8$ MeV for the $Λ(1670)$, and $M=1881.5\pm16.5\pm20.3$ MeV/$c^2$ and $Γ=82.4\pm18.2\pm8.9$ MeV for the $Λ(1810)$, respectively. The branching fraction is determined to be $ \mathcal{B}(J/ψ\to Λ\bar{ Σ}^0η+\mathrm{c.c}) $ = $(3.44 \pm 0.11 \pm 0.13) \times 10^{-5}$. The first uncertainties are statistical and the second systematic.

hep-ex↗