957,942+ open-access research outputs.
We propose C-MTAD-GAT, an \emph{unsupervised}, \emph{context-aware} graph-attention model for anomaly detection in multivariate time series from mobile networks. C-MTAD-GAT combines graph attention wiโฆ
Trotterization is a standard approach for simulating quantum time evolution on quantum computers, where the Hamiltonian is split into local terms and each term is applied in sequence. The order of theโฆ
We present the Field of Safe Motion (FSM), a quantitative safety model for determining whether a driver maintains a collision-free escape route, or "out," at any given moment by accounting for that drโฆ
LLM agents are known to deviate from Nash equilibria in strategic interactions, but nobody has looked inside the model to understand why, or asked whether the deviation can be reversed. We do both. โฆ
We focus on the problem of \emph{Answer-Level Fine-Tuning} (ALFT), where the goal is to optimize a language model based on the correctness or properties of its final answers, rather than the specific โฆ
We compute exact finite-rank BPS generating functions for the fermionic matrix model with single-trace supercharge $Q_p=\operatorname{tr}(\Psi^p)$ at $(p,N)=(5,3),(5,4),(5,5),(7,4)$, together with parโฆ
Let $G = \mathrm{SL}(n,\mathbb{C})$, let $B$ be a fixed Borel subgroup, and let $P \supset B$ be a parabolic subgroup determined by a composition $(c_1,\dots,c_k)$ of $n$. Write $P'$ for the derived gโฆ
Reinforcement Learning (RL) algorithms exhibit high sample complexity, particularly when applied to Decentralized Partially Observable Markov Decision Processes (Dec-POMDPs). As a response, projects sโฆ
Rational belief revision is commonly viewed as being based on a preference order between possible worlds, with the resulting new belief set being those sentences true in all the most preferred models โฆ
Model merging aims to combine multiple models into one without additional training. Na\"ive parameter-space averaging can be fragile under architectural symmetries, as their geometry does not take theโฆ
Computer-use agents provide a promising path toward general software automation because they can interact directly with arbitrary graphical user interfaces instead of relying on brittle, application-sโฆ
Autonomous crypto trading systems often spend most of their design effort on finding entries, while exits are left to fixed rules that are rarely tested in a systematic way. This paper examines whetheโฆ
Continuous Integration (CI) enforces repository-level correctness through multi-stage workflows and is central to modern software development, yet diagnosing and repairing CI failures remains challengโฆ
In generative modeling, we often wish to produce samples that maximize a user-specified reward such as aesthetic quality or alignment with human preferences, a problem known as guidance. Despite theirโฆ
Isotopic fission-fragment distributions of $^{240}$Pu have been measured, for the first time, as a function of the initial excitation energy, and the prompt neutron multiplicity has been derived from โฆ
We present quantitative evidence that high-quality internucleon forces derived from $\chi$EFT exhibit a striking dominance of Wigner's supermultiplet symmetry, without invoking the large-$N_c$ limit oโฆ
Recent research has demonstrated the potential of Large Language Models (LLMs) for autonomous penetration testing, particularly when using cloud-based restricted-weight models. However, reliance on suโฆ
Computing the diameter of a graph is a problem of great interest both in general algorithms research and specifically within fine-grained complexity, where it is a cornerstone hard problem. Recent worโฆ
We study the Maximum Balanced Biclique (MBB) problem: Given a bipartite graph $G$ with $n$ vertices on each side, find a balanced biclique in $G$ with maximum size. We give a polynomial-time $\left(\fโฆ
Several recent methods have shown that it is possible to compute rate constants of very slow biomolecular processes using simulations where a time-dependent bias is added along one or several collectiโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ