Logic
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Monday 7 September
We show that, relative to the existence of an inaccessible cardinal, it is consistent that for an inaccessible cardinal $\kappa$, there is a non-trivial automorphism of $\mathcal{P}(\kappa)/\mathrm{fin}$ whose restriction to $\mathcal{P}(\beta)/\mathrm{fin}$ is induced by a bijection on $\beta$ for every $\beta<\kappa$. This answers questions posed by Larson–McKenney, Shelah–Steprāns, and Veličković.
Statistics Applications
Pre-game paired-comparison modeling of professional League of Legends map outcomes
We build and evaluate a pre-game win-probability forecaster for individual maps (“games”) in professional League of Legends (LoL). The proposed model is a one-stage logistic regression fit end-to-end on the win/loss log-loss: each team's exponentially-weighted moving average of past same-side results, a ridge-shrunk stable strength that is the maximum-a-posteriori estimate of a logistic mixed model, and a first-pick draft covariate, natively calibrated out of sample (walk-forward slope $0.995$). It augments a purely dynamic Bradley–Terry specification with stable team strengths. A second, independently built two-stage composite mixed model under restricted maximum likelihood (REML) and best linear unbiased prediction (BLUP) shrinkage, with Platt calibration, serves as the strongest rival the authors could build. On $5{,}135$ games across six regional leagues and three international events (2024–2026), under paired per-game Diebold–Mariano inference, the two architectures are statistically indistinguishable on every protocol and window (global holdout $0.2230$ vs.\ $0.2257$; walk-forward $0.2207$ vs.\ $0.2215$), so the simpler model is preferred on parsimony, not accuracy; both improve on the classical dynamic benchmark ($0.2351$) by a clear margin and on the static fits ($0.2301$/$0.2268$) more modestly. Against Polymarket on $928$ matched maps, the forecasts are statistically indistinguishable from the market on its own per-game contracts, with a modest market edge concentrated on cross-region Worlds and series-decider maps.
Read the full abstract
Quantitative Methods
MI-PEFT: Mixture-of-Experts Integrated Parameter-Efficient Fine-Tuning Protein Language Models Improves Acidophilic Proteins Classification
Acidophilic proteins that remain stable and functional under highly acidic conditions, are important for industrial biocatalysis, acid-related bioprocessing, and the discovery of acid-stable enzymes. However, their identification relies heavily on time-consuming experimental screening methods. With the rapid growth of protein sequence databases, the need for computational identification methods that are both accurate and efficient has become stronger. The emergence of protein language models (PLMs) has significantly improved the sequence representation of downstream biological prediction tasks. This paper proposes MI-PEFT, a mixture-of-experts integrated parameter-efficient fine-tuning framework. Built on the ESM C-600M backbone, the framework incorporates LoRA-based PEFT methods and a DeepSeekMoE-based classification head to resolve the limitations of PEFT and significantly improve computational efficiency. Notably, this task is characterized by a significant class imbalance in the dataset, making high specificity particularly challenging. The experimental results demonstrate that MI-PEFT on PLMs, especially {\text{C}}^{\text{3}}\text{A}, serves as an efficient tool for identifying acidophilic proteins and a constrained pathway that helps resolve class-imbalance by preserving the pretrained representations.
Read the full abstract
Quantum Physics
From Bits to Qubits: The Theory and Practice of Quantum Data Encoding
Encoding classical data into quantum systems is a foundational step in the execution of nearly all quantum algorithms, and a critical bottleneck in realizing practical quantum advantage. This review provides a comprehensive account of the concepts, algorithms, and practical considerations associated with quantum data encoding. We trace the development from its early conceptual foundations to recent advances, considering commonly used access models, such as quantum state preparation, unitary synthesis, QRAM and block encoding. We survey the circuit size, depth, space-time tradeoffs, as well as non-Clifford resources required for fault-tolerant implementation. We also discuss the roles of different access models in quantum algorithms. Special attention is given to structured data, such as sparse data, Boolean functions and data represented by tensor networks. This review bridges theory and applications, serving both as a pedagogical guide for newcomers and as a reference for active researchers. We also highlight the pivotal role of quantum data encoding in quantum computing and provide insights into future directions that will enable quantum advantage.
Read the full abstract
Combinatorics
Chains and unique transitive orientations of prime graphs
We give a short, conceptual proof that prime graphs have at most two transitive orientations, a much-quoted result of Gallai. Our proof uses chains, introduced by Chudnovsky, Kim, Oum, and Seymour, which provide a transparent characterization of primality. Transitivity induces a forcing relation on edges; using chains, we show that any two edges of a prime graph are equivalent under this relation, and thus any transitive orientation is unique up to reversal.
Read the full abstract
Combinatorics
Energy Estimation of the Hamming Slice and its Applications
Let $R=\mathbb{Z}/(2^n-1)\mathbb{Z}$, where $n\geq 3$, and let $S_w\subseteq R$ be the residues whose canonical $n$-digit binary expansion has Hamming weight $w$. We obtain, in particular, an asymptotic formula for the additive energy of $S_w$ \[ E(S_w)=\frac{\left|S_w\right|^4}{|R|}+ \mathcal{O}\left(|R|^3 n^{-3} \right), \] which holds uniformly in $w$. The error term is optimal in order, with a matching lower bound for $w=\lfloor n/2+\sqrt{n} \rfloor$. It follows that triple sums of arbitrary unit dilates have asymptotically uniform representation counts when $\prod_{j=1}^{3} \left|S_{w_j} \right| /\left(|R| n^{-3/5}\right)^3\to\infty$, and that double sums have asymptotically full support when $\left|S_{w_1}\right| \left|S_{w_2} \right|/\left(|R| n^{-3/4}\right)^2\to\infty$. In the proof, modular collisions are represented using a cyclic binary carry automaton; this appears to be a novel approach in this area of problems.
Read the full abstract
Statistical Methodology
Bayesian Matrix-Valued Graphs for Context-Dependent Multivariate Relationships
Many scientific graphs attach several variables to each node, so a single scalar edge weight cannot describe direction-dependent interactions. We model each edge by a symmetric positive-definite (SPD) matrix and infer a posterior over matrix-valued graph geometries, which we call the Bayesian matrix-valued graph (BMVG). We ask how these interactions reconfigure across contexts: how large the change is and which multivariate directions strengthen or weaken. The geodesic distance induced by the affine-invariant Riemannian metric (AIRM) quantifies deformation magnitude and generalized eigenvalues resolve its signed directions.Against fused graphical lasso, Bayesian multiple-GGM, and common principal components, BMVG is competitive on global precision recovery while retaining identifiable matrix-valued edge structure and accurately recovering edge-level deformation directions. In controlled known-truth experiments, it resolves structural change with increasing sample size, including orientation changes that leave ordinary eigenvalues unchanged. In one year of Bay Area weather data, the geometry of 12-hour change reconfigures spatial coupling about as much as whole seasons differ. In TCGA-BRCA, estrogen-receptor (ER)-associated reconfiguration concentrates on specific gene-module pairs and persists under graph-scaffold sparsification and removal of subgroup mean differences. These results establish posterior matrix-valued edge geometry as a unified framework for quantifying and interpreting context-dependent multivariate reconfiguration.
Read the full abstract
Statistical Mechanics
Leveraged Learning: entropy cleared per bit received
An expository essay containing some new results. A learner holds a prior belief over Boolean maps that answer a finite set of $Q$ questions, and receives answers one by one. Each answer carries surprisal and can clear predictive uncertainty about both the question asked and questions still unasked. We quantify this effect by the leverage: table entropy cleared per bit of surprisal received. Taking expectations over the truth prior and the question order, define the aggregate leverage as the ratio of expected uncertainty cleared to expected surprisal received. It equals one for independent answers and can exceed one for correlated answers. At finite size, this ratio is determined exactly by a single sequence: the mean entropy $G_\ell$ of the answers to $\ell$ questions. As the number of input bits grows at fixed asked fraction $t=\ell/Q$, a limiting increment profile $\gamma(t)$ determines the macroscopic learning curve. With $\eta_0$ the limiting initial entropy per question, the leverage becomes $L(t)= \frac{\eta_0-(1-t)\gamma(t)} {\int_0^t\gamma(x),dx}$. For exchangeable priors, de Finetti's representation gives a constant bulk profile $\gamma(t)$: deduction is confined to a boundary layer at $t=0$, and the leverage is forced to a hyperbolic form, as surprisal grows linearly. By contrast, we construct a simplicity prior with nontrivial bulk learning by grading Boolean maps by their polynomial degree over $\mathbb{F}_2$ and allocating weight across degree classes through a CDF $F$. Reed-Muller capacity then yields $\gamma(t)=1-F(t)$. This realizes any nonincreasing profile taking values in $[0,1]$, together with the corresponding macroscopic leverage curve.
Read the full abstract
High Energy Physics (Phenomenology)
Revisiting two-body charmed anti-charmed baryonic $B$ decays
The study of two-body charmed anti-charmed baryonic $\overline B\to {\bf B}_c \overline {\bf B}_c$ decays using the topological amplitude approach is revisited. We include the $b\to u\bar u q$ contributions, in addition to the $b\to c\bar c q$ contributions, to these decays. The topological decomposition of $\overline B\to {\bf B}_c(\bf {\bar 3_f}) \overline {\bf B}_c(\bf { 3_f})$, ${\bf B}_c(\bf 6_f) \overline {\bf B}_c(\bf { 3_f})$, ${\bf B}_c(\bf {\bar 3_f}) \overline {\bf B}_c(\bf {\bar 6_f})$ and ${\bf B}_c(\bf 6_f) \overline {\bf B}_c(\bf {\bar 6_f})$ decay amplitudes are updated accordingly. Although the $b\to u\bar u q$ contributions are Cabibbo-Kobayashi-Maskawa (CKM) suppressed in $\Delta S=-1$ transitions, their effects are significantly amplified in $\Delta S=0$ transitions, as the relative size of the CKM factors in $b\to u\bar u q$ and $b\to c\bar c q$ contributions in $\Delta S=0$ transitions is enlarged by $\lambda^{-2}$, roughly a factor of 20, from the one in $\Delta S=-1$ transitions. Present data in $\overline B\to {\bf B}_c(\bf {\bar 3_f}) \overline {\bf B}_c(\bf { 3_f})$ decay rates allow or even slightly prefer non-negligible $b\to u\bar u q$ contributions. These $b\to u\bar u q$ contributions can allow much larger rates for $B^-\to \Xi_c^0 \bar \Xi_c^{-}$, $\overline B{}_s^0\to \Lambda_c^+ \bar \Xi_c^{-}$ and $\overline B{}^0\to \Xi_c^+ \bar \Xi_c^{-}$ decays than those only have $b\to c\bar c d$ contributions. Several modes containing only $b\to u\bar u q$ contributions in $\overline B\to {\bf B}_c(\bf 6_f) \overline {\bf B}_c(\bf { 3_f})$, ${\bf B}_c(\bf {\bar 3_f}) \overline {\bf B}_c(\bf {\bar 6_f})$ decays are also identified. Measuring these decays will be interesting and useful in clarifying the role of $b\to u\bar u q$ contributions in two-body charmed anti-charmed baryonic $\overline B$ decays.
Read the full abstract
High Energy Physics (Theory)
Fortuitous ABJM Operators as Black Holes
Given a superconformal gauge theory at a fixed loop order, BPS states can be studied in two ways — by enumerating cohomology classes of a nilpotent supercharge or by diagonalizing the anomalous dimension matrix. The second one allows for a deeper look at how holographic theories distinguish between operators based on whether they are dual to horizonless geometries or black holes. To this end, we carry out the diagonalization in $\mathrm{U}(N)_k \times \mathrm{U}(N)_{-k}$ ABJM theory with $N$ as a formal parameter. This makes it possible to define trajectories of operators and focus on the fortuitous ones which are characterized by being BPS at only finitely many values of $N$. In contrast to $\mathcal{N} = 4$ Super Yang-Mills, where it has been numerically prohibitive to study more than one of these, ABJM gives us access to 16 such trajectories along with their descendants. We show that they take an especially simple form at large $N$ where they agree with the predictions of integrability. We also show that many of them, as with black holes, can only be dressed by certain types of gravitons and comment on how this exercise in cohomology also has implications for properties of the full operators. Finally, we show that the gap to the first non-BPS state in ABJM theory qualitatively differs from that of $\mathcal{N} = 4$ Super Yang-Mills in the expected way.
Read the full abstract
Plasma Physics
Runaway electron control by self-excited waves
Runaway-electron avalanches in tokamak plasmas can be limited by kinetic instabilities driven by the non-Maxwellian runaway distribution. We formulate a reduced model for the quasi-steady state in which the total plasma current and bulk electron temperature are prescribed, while the inductive electric field is determined self-consistently from the partition between Ohmic bulk current and runaway-electron current. Because the wave growth time is short compared with the current-decay time, we consider a marginal-stability regime, in which whistler-wave drive by the runaway electrons balances collisional damping. The resulting states separate into three regimes: a subcritical Ohmic regime without an avalanche, an avalanche regime in which runaway growth relaxes the inductive field to the avalanche threshold, and an instability-regulated regime in which self-excited whistler waves enhance momentum-space diffusion and limit the runaway current. In the instability-regulated regime, the whistler wave spectrum forms a narrow ridge, and low-energy runaway electrons carry most of the runaway current.
Read the full abstract
Quantum Physics
Quantum magnonics with engineered dissipative and coherent interactions
Cavity magnonics is moving beyond the conventional paradigm of coherent spin–photon hybridization toward the controlled engineering of dissipative and coherent interactions, Floquet dynamics, and quantum fluctuations. This Perspective examines how these ingredients reshape collective dynamics and open new avenues for quantum state engineering, transport, and sensing. We discuss the role of dissipative coupling and anti-$\mathcal{PT}$ symmetry in enabling long-lived collective modes and enhanced spectral response, and highlight Floquet engineering as a means of engineering nonreciprocal transport and phase-controlled interactions. We then review recent progress in quantum magnonics, ranging from squeezed and entangled magnon states, including the squeezing of thermal magnons, to prospective schemes for preparing magnonic Schrödinger-cat states. We also discuss how parametric driving and active gain strongly modify hybrid susceptibilities and amplify magnon–photon response. These advances expand the scope of cavity magnonics beyond conventional polariton physics, establishing it as a versatile platform for sensing, transduction, spin transport, and hybrid quantum technologies.
Read the full abstract
Social and Information Networks
LLMs for Social Network Modeling: From Network Generation to Dynamic Processes
Large language models (LLMs) are rapidly emerging as a new paradigm for modeling social networks by representing users and their relationships and interactions through natural language. Unlike classical network models or deep learning approaches, LLMs can simulate context-aware social behavior and language-driven interactions, enabling more realistic modeling of network formation and dynamic social processes. However, existing studies are scattered across different research communities and lack a unified perspective. This survey presents the first comprehensive review of LLMs for social network modeling by organizing the literature into two broad categories: network generative models and dynamic process models. Network generative models are further classified into selection-based and interaction-based approaches, while dynamic process models are categorized into opinion dynamics, information diffusion, and rumor propagation, each with their underlying modeling mechanisms. LLMs enable rich textual social interactions and decision-making, but they also exhibit many limitations, including inherent social biases and prompt sensitivity. We outline these open research challenges and discuss future directions in LLM-based social network modeling.
Read the full abstract
Classical Analysis and ODEs
An Askey-Type Confluence Scheme for Hahn-Like Multiple Orthogonality
We embed the Jacobi-like and Laguerre-like systems for ordinary type-I/type-II multiple orthogonality introduced by Wolfs into a single Askey-type confluence scheme. Applying the Bernstein transform simultaneously to the $q$ Jacobi-like weights produces a positive finite-lattice Hahn-like ancestor, represented by multiple beta integrals, reducing to the classical Hahn weight for $q=1$, and converging back to the continuous system. Parameter and scaling limits then yield Kravchuk-like, two Meixner-like, two Charlier-like, Jacobi-like, two Laguerre-like, and Hermite-like families. We realize every arrow through explicit hypergeometric orthogonality data. For each near-diagonal multi-index $1\leq |\mathbf m|\leq N$, the Hahn-like type-II polynomial is a terminating ${}_{q+2}F_{q+1}(1)$ series satisfying an exact inverse Bernstein identity. We construct the normalized type-I form and, under explicit separation and nonvanishing assumptions, recover its individual polynomial components by finite sums of terminating hypergeometric functions and prove uniqueness. Finite-pole terms regroup into terminating Kampé de Fériet blocks. Their limits are obtained by coefficient extraction and reconstruction at infinity on the unreflected Kravchuk-like and Meixner-II-like branches, and by finite Lauricella–Horn sector sums on the reflected branches. This yields sectorwise component confluence along the Kravchuk–Charlier, Meixner–Charlier, Meixner–Laguerre, and Charlier–Hermite arrows. For $q=1$ all formulas reduce to the classical families; for $q>1$ the two Meixner-like systems, and likewise the two Charlier-like systems, are inequivalent under permutation of normalized rows.
Read the full abstract
Applied Physics
Capacitance of Undoped Thin-Film Diodes
The capacitance of thin-film diodes based on undoped semiconductors are dominated by injected charge carriers rather than doping-induced carriers. However, an analytical framework of the capacitance in these devices has remained elusive. Here, we derive an analytical description of the capacitance, fully accounting for injected charge carrier and electrode charge effects. Based on these findings, a method to extract the built-in voltage in these devices is presented. The theoretical framework is substantiated numerically by drift-diffusion simulations and experimentally on organic solar cells.
Read the full abstract
Solar and Stellar Astrophysics
Tidally perturbed pulsations in OO Dra
We perform a pulsation analysis of OO Dra using Light Curve data from TESS and present the first identification of six dipole modes as doublets from the primary star in OO Dra. The phases and amplitudes of these pulsation modes were analytically reconstructed. Among the six identified doublets, four are pulsating in $Y_{10x}$ mode with pulsation axis along the tidal axis, and two in $Y_{10y}$ with a pulsation axis orthogonal to tidal axis and the angular momentum axis. Our findings suggest that the primary star in a non-synchronized, post mass-transfer OO Dra could be a tidally tilted $\delta$ Scuti pulsator.
Read the full abstract
Metric Geometry
From the Steiner Inellipse to the John Ellipsoid of a Simplex: A Corner-Volume Characterization
For a triangle of area \(T\), a planar corner-area characterization states that an interior point \(M\) lies on the Steiner inellipse precisely when the three corner triangles cut off by the lines through \(M\) parallel to the sides have areas \(T_1,T_2,T_3\) satisfying $$ T_1+T_2+T_3=\frac12 T. $$ We give the corresponding statement for a simplex in arbitrary dimension. If \(S\) is a nondegenerate \(n\)-simplex of volume \(V\) and \(V_1(M),\ldots,V_{n+1}(M)\) are the volumes of the facet-parallel corner simplices determined by \(M\), then $$ M\in\partial E_J(S) \quad\Longleftrightarrow\quad \sum_{i=1}^{n+1}V_i(M)^{2/n}=\frac1n V^{2/n}, $$ where \(E_J(S)\) is the John ellipsoid of \(S\). We also identify the entire corner-volume functional with the central second-moment quadratic of the uniform simplex. The novelty claimed here is limited to the corner-volume formulations and their connections with the planar Steiner-inellipse result; the underlying barycentric, covariance, and John-ellipsoid facts are classical.
Read the full abstract
Computer Vision
RFS-UNet: Decoder-Conditioned High-Resolution Skip Recalibration for Bone-Selective DRR Synthesis
Bone-selective synthesis from digitally reconstructed radiographs (DRRs) requires separating skeletal signal from overlying tissue while preserving anatomical detail. U-Net skip connections supply fine encoder features, but their transfer is independent of decoder context. We introduce RFS-UNet, which lets the decoder participate in high-resolution channel recalibration. Pooled encoder and decoder features jointly predict a bounded residual scale, initialized to preserve the original skip transfer. The module operates at the two finest resolutions and integrates directly into the backbone. On a rebuilt patient-unique cohort, RFS improves test PSNR over U-Net-64 by 0.10 dB. A three-seed comparison with encoder-only recalibration supports the contribution of decoder context. RFS also offers a lower-latency alternative to CBAM, with 2.25 times faster inference in matched profiling. Decoder-conditioned reuse thus improves bone-selective synthesis through a compact architectural change.
Read the full abstract
Computer Vision
A Quantitative Evaluation Framework for Temporal Explainability in Echocardiographic Video Segmentation
Deep learning has achieved state-of-the-art performance in echocardiographic video segmentation, with an increasing number of models incorporating temporal information. However, quantitative evaluation of temporal explainability remains largely unexplored. We propose a quantitative framework for evaluating Grad-CAM explanations using four complementary metrics measuring temporal consistency, saliency motion, anatomical overlap, and temporal overlap. Using EchoNet-Dynamic, we compare a baseline 2D U-Net with ConvLSTM U-Net models trained across multiple temporal strides. While segmentation performance remained comparable across all models, intermediate ConvLSTM explanations exhibited substantially lower saliency consistency and greater centroid motion than final prediction explanations. Temporal Bottleneck explanations were significantly more stable than Encoder Bottleneck explanations across all strides, while final ConvLSTM Decoder3 explanations were broadly comparable to those of the 2D U-Net. Importantly, conventional frame-wise explanation metrics cannot determine whether variation in intermediate explanations reflects meaningful temporal feature evolution or explanation instability. These findings establish a preliminary quantitative framework for temporal explainability and motivate temporal-aware XAI methods that explicitly account for evolving representations in medical video models.
Read the full abstract
Networking
Movable Antennas Enabled Wireless Powered Networks: Principles and Technologies
As an emerging framework, movable antenna (MA)-enabled wireless powered networks (WPNs) have attracted growing attention. WPNs integrate wireless communication and energy transfer. MA can dynamically adjust the position of antenna units by introducing additional spatial degrees of freedom, so as to make full use of channel gain, optimize the effect of energy beamforming, and further improve the performance of WPNs. In this article, we first classify the implementations of MA by driving architectures, and review the fundamental principles of WPNs. We then highlight the key advantages of MA-enabled WPNs in enhancing wireless power transfer efficiency, realizing flexible and adaptive beamforming, and improving system robustness and interference resilience. Furthermore, four representative application scenarios and three key enabling technologies are discussed. A case study is also presented to show the reduction in transmit power brought by MA for WPNs. Finally, we discuss the challenges and future directions of MA-enabled WPNs, aiming to provide reference for future research and practice.
Read the full abstract
Computer Vision
MamMA: A Mamba-Based Pedestrian Trajectory Prediction Algorithm Considering Occupancy Map and Pedestrian Awareness States
Many pedestrian trajectory prediction algorithms have been proposed to improve the safety of navigation for mobile robots working in human-robot coexistence environments. Some pedestrian trajectory prediction algorithms extract information about obstacles near pedestrians from top-down view images to improve the accuracy of trajectory prediction. However, mobile robots typically create local occupancy maps using LiDAR, rather than top-down view images. Meanwhile, the vision sensors on board robots provide egocentric view images, which contain fine-grained behavioral information about the pedestrians near the robot. To better use the information collected by LiDAR and on-board vision sensors, we propose MamMA, a Mamba-based pedestrian trajectory prediction algorithm considering occupancy maps and pedestrian awareness states. MamMA divides the occupancy map by patches and extracts obstacle features from each patch to create map features. Pedestrian awareness states are divided and considered, as some studies show that awareness states affect the perception and speed of pedestrians. Furthermore, a Mamba-based model is proposed to predict the future trajectories of pedestrians based on different types of features. Experiments on the STCrowd, SiT, JRDB, ETH, and UCY datasets show that MamMA achieves better average displacement error and final displacement error than the state-of-the-art algorithms.
Read the full abstract
Cryptography and Security
VEX-Bench: Benchmarking LLM Agents for Assessing Exploitability of Software Supply Chain Vulnerabilities
The software supply chain has become an increasingly exposed attack surface because of its reliance on intricate yet fragile dependencies. Existing defenses such as GitHub Dependabot often raise many false alerts because their coarse-grained matching cannot determine whether a vulnerable dependency is actually exploitable. Security analysts typically spend substantial time assessing vulnerability exploitability case by case. Recent LLM agents have emerged as promising candidates for this task given their advanced capabilities in coding and cybersecurity, yet no existing benchmark evaluates them on it. Prior benchmarks target zero-day settings, where agents detect and exploit previously unknown vulnerabilities. In contrast, software supply chain security focuses on how known vulnerabilities in upstream dependencies affect downstream projects. This requires agents to reason across repositories and determine whether an upstream vulnerability is exploitable in the downstream project. To address this gap, we introduce VEX-Bench, the first benchmark for evaluating LLM agents' ability to assess the exploitability of software supply chain vulnerabilities. It contains 75 real-world cases mined from GitHub and labeled by security experts, covering Python, Java, and Go. We evaluate nine models across three agent harnesses. While GPT-5.5 and Claude Opus 4.6 reach approximately 80% F1 on binary vulnerability-status classification, only GPT-5.5 surpasses 70% macro-F1 on fine-grained justification classification. This gap highlights the challenge of moving beyond binary exploitability assessment to identifying fine-grained exploitability reasons. Code and data: https://github.com/steven1518/vex-bench
Read the full abstract
General Topology
A solution of the D-space Problem
Settling a central problem in set-theoretic topology, and many related problems, we prove that there is, consistently, a regular Lindelöf space of cardinality $\aleph_1$ that is not a D-space. The existence of such a space is independent of ZFC; we establish its equivalence to a weak form of the Continuum Hypothesis. The proof of the main theorem is adjustable to produce consistent examples with a variety of stronger properties.
Read the full abstract
Computer Vision
SAFER-Activities: A Dataset for Smart Assessment of Fall Events and Routine Activities
Smart healthcare monitoring systems require precise action recognition to ensure well-being and timely intervention in critical situations such as falls, particularly for mobility-challenged individuals. Existing datasets are often clip-based, lacking the frame-level detail needed to recognize actions online, as they unfold. To address this, we introduce SAFER-Activities, a dataset for fall detection and physical activity monitoring, with a dedicated subset for wheelchair use scenarios. It comprises over 66 hours of video data captured by multiple cameras, with 85,310 action instances and frame-level annotations for 30 action classes. We benchmark action recognition on SAFER-Activities with 2D and 3D skeleton models, RGB models with frozen backbones, and multimodal fusion strategies, and evaluate on in-lab, out-of-distribution, and cross-dataset test sets. Skeleton-based models generalize best under domain shift; fusing frozen RGB features with the skeleton stream improves in-domain recognition over the baseline CNN1D, most clearly on the wheelchair subset, but degrades out of distribution. Cross-dataset and qualitative evaluations confirm that models trained on SAFER-Activities transfer well to unseen environments and external fall data. To support research on robust fall detection and activity monitoring, we release the dataset and code at https://safer-activities.github.io/.
Read the full abstract
Human-Computer Interaction
Representational Fidelity in Didactic Visualization: Toward a Multidimensional Design Space
Representational fidelity is routinely treated as a single abstract-realistic continuum, a simplification that limits how it is described and compared across research and design contexts. We introduce a multidimensional design space of representational fidelity for didactic visualization in science & engineering, inductively derived from a 175-item corpus spanning several disciplines, modalities, and instructional aims. The resulting design space specifies five dimensions: Morphological, Dynamic, Cueing, Contextual, and Interactive Fidelity, with seven sub-dimensions. We demonstrate the design space's descriptive power through successive rounds of expansion and refinement and analyze the corpus to reveal relationships among dimensions and implications for design and research. We further validate the design space through a pilot focus group in which participants applied the dimensions in an open-ended design exercise. Resulting sketches and verbal rationales informed a single-designer applied case study, offering preliminary evidence of the design space's generative potential as a structured aid to design exploration. Together, these contributions lay the groundwork for future research and more intentional design practice.
Read the full abstract
Numerical Analysis
GridapGeosciences.jl: A Julia finite element package for partial differential equations on general manifolds
We present GridapGeosciences$.$jl, a new parallel distributed-memory Julia package for the numerical approximation of partial differential equations on general manifolds. Our abstract approach to generating discrete manifold domains relies on mesh refinement in general, and is implemented within the Gridap finite element library, whose high-level interface enables seamless definition of both intrinsic and extrinsic variational formulations. GridapGeosciences$.$jl features the cubed sphere manifold, which is used in this study to showcase the functionality of GridapGeosciences$.$jl in different applications. The first application involves scalar transport where we develop intrinsic formulations of common stabilisation terms, which are shown to be equivalent to well-known extrinsic stabilisation formalisations. Such stabilisation terms are used to develop an intrinsic formulation of the two-dimensional thermal shallow water equations that includes upwinded numerical fluxes. The final application is a linearisation of the Boussinesq equations where we demonstrate the capacity of GridapGeosciences$.$jl to capture both surface and vertical dynamics on a three-dimensional manifold.
Read the full abstract
Quantum Physics
Sklar's Theorem and Quantum State Reconstruction from All-Context Dependence
Sklar's theorem separates the marginals of a joint distribution from its dependence structure. We apply this viewpoint to Born statistics generated by local quantum measurements. For non-product two-qubit states, the dependence nuclei over all local binary projective measurement contexts determine the state up to at most a discrete double-spin-flip ambiguity. The corresponding scalar optimization, combined with the quantum total correlation, reproduces global quantum discord.
Read the full abstract
Machine Learning
Two-Scale Localized PCA-Net: Coarse-Global and Local-Residual Representations for Artifact-Reduced PDE Operator Learning
Localized dimensionality reduction improves the scalability of operator learning for high-dimensional partial differential equations (PDEs), but independently decoded local patches can introduce block offsets, interface mismatches, and spurious high-wavenumber content. We introduce Two-Scale Localized PCA-Net, which decomposes the solution into a coarse-global component and local residual corrections. A compact global PCA basis captures domain-scale structure, while nonoverlapping local PCA bases represent the remaining fine-scale residual. A block-balanced latent objective couples the two representations, and optional interface-aware fine-tuning further promotes continuity through reconstruction and trace losses. On Poisson benchmarks, the two-scale representation substantially reduces reconstruction error and visible block artifacts relative to plain and overlap-based localized PCA-Net while approximately halving PCA fitting cost relative to overlap. On heterogeneous Darcy flow, it strongly reduces interface and discrete-residual errors, with more modest reconstruction gains. Ablations show that the primary improvement arises from the two-scale output representation, while interface-aware fine-tuning provides complementary continuity refinement. Overall, separating globally coherent structure from localized residual detail provides an efficient representation for artifact-reduced PDE operator learning.
Read the full abstract
Multiagent Systems
Scaling Multi-Agent Systems with Prospect-State Propagation
Current LLM-based multi-agent systems (MAS) periodically compress intermediate states to reduce inference-time token consumption, thereby attempting to incorporate more agents. However, naive scaling strategies face challenges. For example, in economic simulations, large-scale MAS typically discard semantically rich economic states, i.e., agent behavioral trajectories, which are key drivers of macroeconomic fluctuations. In this paper, we reveal a phenomenon in which agent heterogeneity gradually decreases during simulation, and propose Prospect-State Propagation for Multi-Agent Systems (PspMAS). Inspired by prospect theory, PspMAS decouples each agent's micro state into a compact Prospect State and an expressive Semantic State. The former records psychological traces through a lightweight, parallelizable propagator and continuously injects heterogeneity into the system. The latter leverages the strong perception, reasoning, planning, and decision-making abilities of LLMs. These two components work complementarily, providing a scalable LLM-based multi-agent simulation solution.
Read the full abstract
Computer Vision
Flexible Motion Generation from Language and Style References
We introduce FlexMoGen, a novel framework for flexible human motion synthesis conditioned on both natural language descriptions and motion style references. Text prompts are effective at defining semantic content, but they are often limited in capturing fine-grained style details such as timing, limb articulation, and expressive dynamics. A style example clip supplements the text by conveying these nuanced motion characteristics directly, enabling the model to preserve high-level intent while reproducing the desired stylistic traits. Given a text prompt and a style example clip, FlexMoGen generates high-quality motions that preserve semantic content while faithfully reflecting the target style, offering users greater control over the animation generation process. Unlike prior methods that rely on discrete style labels and do not generalize to long or multi-style generation, FlexMoGen learns a variational style encoder without style supervision and supports long, time-varying, multi-style synthesis. Our framework jointly pre-trains the style encoder and a text-to-motion latent diffusion model within a unified architecture, modulating motion style through a lightweight adaptation module. It integrates an efficient relative positional encoding scheme and is trained on both stylized and non-stylized datasets, enabling strong generalization to unseen text-style combinations. Experiments show that FlexMoGen achieves the best balance between content fidelity and style reflection.