Peer Revenue Returns subject to peer review

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

All of arXiv

Monday 31 August

Instrumentation and Methods for Astrophysics

The Auger Radio Infill SKALA Extension (ARISE): Science Case and Instrumentation (ARENA 2026)

The Auger Radio Infill SKALA Extension (ARISE) at the Pierre Auger Observatory in Argentina was deployed in 2025 and measures cosmic-ray air showers in the energy region of the Galactic-to-extragalactic transition. ARISE is comprised of 18 SKALA-2 antennas featuring two polarization channels each, deployed within $100\,$m of a surface detector station in the enhancement area of the Pierre Auger Observatory. This area of the surface array features a denser spacing of $433\,$m between surface stations, each equipped with underground muon detectors. One of these surface detector stations provides a trigger for simultaneous readout of all ARISE antenna channels. The wide frequency range of ARISE, from $50$ to $350\,$MHz, includes the sub-band of optimum signal-to-noise ratio for air-shower radio emission against the Galactic radio background. In combination with the dense antenna spacing, this enables a relatively low detection threshold, and ARISE aims at demonstrating full detection efficiency for near-vertical air showers above $100\,$ PeV. As an advantage over the current radio detectors at Auger, which are more efficient for inclined air showers, this would enable low systematic uncertainties for physics analysis combining ARISE radio measurements with coincident measurements of the underground muon detectors in the same area. In this presentation, we will provide an overview over the ARISE instrumentation operating at the Pierre Auger Observatory and will outline the science goals.
Read the full abstract

Systems and Control

Damping Oscillations in a Spherical Pendulum Inclinometer Using Vector-Based Control

This paper addresses disturbance-induced oscillations in high-precision pendulum-based inclinometers, which reduce measurement availability despite the long-term stability of gravity-referenced sensing. To actively suppress these oscillations, a contactless six-coil electromagnetic actuation system is developed, together with a control framework that generates, in real time, the planar damping force required by the controller despite the nonlinear, unilateral, and bounded nature of magnetic actuation. The proposed approach combines a control-oriented nonlinear model of the spherical pendulum, observer-based feedback control, and a constrained force-allocation scheme that maps the desired vector force into feasible coil currents. Experimental validation on a prototype demonstrates attenuation of the dominant oscillatory mode up to 31.11 dB and a marked reduction in transient duration, with the 50% decay time decreasing from 11.10 s without control to 1.01 s at the most favorable operating point. The results also highlight a trade-off between transient speed and residual oscillation, demonstrating both the effectiveness of the proposed damping strategy and its value as a practical design framework for high-precision inclinometer systems.
Read the full abstract

All authors Fernando Capes, Mikael Andreas Bianchi, Roberto Gardenghi, Manuel Alò

Computer Vision

Driving on Memory

End-to-end autonomous driving models plan future trajectories from raw sensor input. While earlier driving benchmarks often measured deviation from the human trajectory, current benchmarks such as NAVSIM and Bench2Drive evaluate models with richer simulation-based metrics intended to capture safe and compliant driving. A high benchmark score should reflect that a model can understand the scene in front of it and act accordingly. But how much of that score specifically comes from reacting to the dynamic part of that scene? To probe this, we remove a model's camera input and replace it with memories from prior drives at the same location. The retrieved memories can provide persistent scene information, including road layout and location-conditioned regularities, but not the current traffic state. Surprisingly, memory is nearly sufficient on NAVSIM, reaching or even exceeding the performance of leading end-to-end methods without actually observing the evaluated scene. Our results suggest that a high NAVSIM score does not require a planner to react to the current traffic scene and should be treated with caution. This effect is benchmark-dependent: driving from memory causes substantially larger performance drops on Bench2Drive and RealEngine. We provide our code at https://github.com/boschresearch/MemoryDrivoR .
Read the full abstract

Machine Learning (Statistics)

Learning the Geometry of Admissible Hypotheses through Inductive Bias in Training Distributions

Scientific discovery often requires reasoning over competing hypotheses that are consistent with experimental observations. For mixed-variable and combinatorial hypothesis spaces, however, constructing probabilistic representations remains challenging because both the active model components and their associated parameters are unknown. In this work, we present a framework for learning continuous latent representations of admissible partial differential equations (PDEs) by embedding a scientific inductive bias directly into the training distribution. Progressively richer structural principles (e.g., sparsity, logical dependencies, common PDE families, and physical admissibility) are used to generate a structured distribution of hypotheses from which a gated variational autoencoder learns a continuous latent manifold. Experimental results show that the resulting 11-dimensional representation accurately reconstructs a broad collection of representative PDEs, while exhibiting smooth geometric transitions both within and across equation families. Through an ablation study we further demonstrate that introducing scientific principles reduces both structural misclassifications of equation forms and parameter estimation errors when reconstructing a representative benchmark set of admissible partial differential equations. These results show that embedding a scientific inductive bias in the training distribution enables the learning of compact and geometrically meaningful hypothesis manifolds, providing a principled foundation for future inference over competing governing equations.
Read the full abstract

Databases

GRBench: A Comprehensive Benchmark Evaluation for Graph-relational Data Management

Modern data-intensive applications increasingly require database systems to manage structured records and graph data. This demand gives rise to graph-relational data management, spanning storage, query processing, and optimization across relational and graph data. In response, relational database extensions, multi-model databases, and dedicated graph-relational systems have emerged with diverse architectures. However, evaluation methodologies have not kept pace. Existing relational and graph benchmarks assess the two models largely in isolation, while multi-model benchmarks provide limited coverage of graph-relational workloads. Available graph-relational workloads mainly support functional validation and end-to-end latency measurement, revealing little about how storage, operator, and optimization designs affect performance. To evaluate system capabilities in graph-relational data management, we present GRBench. First, GRBench constructs a linked graph-relational schema from the real-world SciSciNet-v2 dataset and derives scalable instances through consistency-preserving subset extraction. Second, it organizes purpose-built query series for controlled evaluation of query processing and system components. Third, GRBench provides semantically equivalent native query formulations and evaluates representative system architectures through a unified, multidimensional methodology. Based on this evaluation, we analyze design trade-offs and identify open challenges to guide future system design and optimization.
Read the full abstract

All authors Zepeng Liu, Xinxin Huang, Xuanming Liu, Sheng Wang, Zhiyong Peng

Symplectic Geometry

Toric Constructions via Integral Transversality

In the Delzant world, symplectic toric manifolds correspond to unimodular polytopes, and unimodularity-preserving polytope constructions correspond to geometric constructions on the manifold side. We treat, in a unified framework, constructions such as taking a face, taking a slice, and polytope intersections, identifying each with its geometric counterpart, namely invariant submanifolds, symplectic reduction, and reduction of a product (a full list appears in Table 1). The key tool is "integral transversality", a lattice-refined transversality condition that provides a uniform criterion for preserving unimodularity, ensuring smoothness on the manifold side. To keep every construction within a single ambient vector space – the dual of the Lie algebra of a fixed torus – we allow the torus actions involved to have nontrivial, but connected kernels.
Read the full abstract

Computer Vision

Analytic Dynamics: Learning Physics-Grounded Representation for Fast Intrinsic Dynamics Inference from Monocular Videos

Inferring object dynamics from visual observations is essential for intelligent agents to reason about and interact with the physical world, yet remains challenging due to the fundamental gap between visual evidence and intrinsic dynamics. Existing methods either rely on costly per-scene optimization, limiting efficiency and scalability, or directly map visual evidence to intrinsic dynamics without intermediate physical abstractions, making them prone to appearance and geometry shortcuts. To bridge this gap, we propose Analytic Dynamics, a feed-forward dynamics inference framework that introduces an intermediate physics-grounded dynamics representation between visual observations and intrinsic dynamics. Specifically, we leverage privileged physical states, including position, displacement, and deformation gradient fields, which are available in simulation, to learn a structured dynamics representation that is difficult to discover from visual observations alone. By aligning visual representations with this space, we equip visual models with a physics-grounded inductive bias, guiding them to capture dynamics-relevant patterns for material model classification and parameter regression. To facilitate this research, we develop a dynamics data generation pipeline and benchmark containing paired physical state trajectories, rendered videos, and ground-truth material models and parameters. Extensive experiments demonstrate that Analytic Dynamics achieves efficient, accurate, and generalizable dynamics inference from monocular videos.
Read the full abstract

Lattice Field Theory

First-principles determination of anomaly-induced pion decay beyond the chiral limit

The two-photon decay of the neutral pion is fixed in the chiral limit by the Adler-Bell-Jackiw anomaly, while nonzero quark masses induce few-percent corrections that must be determined for precision tests of QCD beyond the chiral limit. Using the anomalous PCAC relation, we compute them in lattice QCD as deviations from the exact anomaly condition at $q^2=0$, thereby avoiding both four-point functions and the cancellation of chiral logarithms that limits conventional approaches. Because the correction is proportional to the light-quark masses, both statistical and systematic uncertainties are correspondingly suppressed, making a precision calculation feasible. On two nearly-physical domain-wall ensembles we achieve $\sim1\%$ statistical precision each for the decay width, obtaining $\Gamma(\pi^0\to\gamma\gamma)=8.09(22) eV$ after continuum extrapolation. The $2.3(1.4)\%$ mass correction to the decay amplitude, positive and isospin-breaking dominated, provides the first ab initio confirmation of the $\pi^0$-$\eta$-$\eta'$ mixing enhancement.
Read the full abstract

All authors Tian Lin, Xu Feng, Lu-Chang Jin, Chuan Liu, Qi-Yuan Luo

Computer Vision

SMG: Semantic Motion Graph for Monocular Dynamic Gaussian Splatting

We study dynamic Gaussian Splatting from monocular videos. While recent advancements in dynamic Gaussian splatting offer a promising foundation for modeling dynamic scenes, they often overfit to the training views and fail under occlusion or complex scene motion due to the lack of reliable regularization signals in under-constrained regions. We propose Semantic Motion Graph (SMG), a novel approach models the Gaussian motion as the low-rank semantic motion. Our key insight is that the real-world scene motion is often structured by semantic coherence: regions that are spatially close and semantically related tend to exhibit consistent dynamics. To leverage this prior, we construct SMG to model structured motion of the scene. The Gaussian motion is driven by the motion of SMG nodes. We further observe that the uncertainty of Gaussian motion arises from both unreliable off-the-shelf priors and weakly constrained regions during optimization. SMG addresses this by using reliable graph nodes to guide the motion of nearby unreliable nodes. To evaluate dynamic Gaussian splatting under challenging real-world scenarios, we introduce a new multiview dataset collected under an ego-exo setup. Extensive experiments demonstrate that SMG achieves state-of-the-art performance on monocular dynamic Gaussian splatting across challenging real-world benchmarks. Project page: https://smg-gaussian.github.io/.
Read the full abstract

All authors Haozheng Yu, Xinyu Yang, Rundong Luo, Jennifer J. Sun, Bharath Hariharan

Artificial Intelligence

MNIST-PRO: MNIST is Back as a Partially Observable World for AI Agents

AI agents in partially observable environments need to coordinate active sensing with working memory to maintain an evolving perceptual state. However, existing benchmarks struggle to isolate this perceptual-state construction and interpretation capability because they introduce physical and control complexities. We address this with MNIST-PRO, a benchmark that isolates agentic perception by converting MNIST digit recognition into a sequential, glimpse-based search task with lookback constraints. We evaluate ten multimodal models across four memory representations, including raw visual history, textual states, structured metric grid maps, and a consolidated visual canvas. While models excel under full observability, partial observability exposes a clear performance gap. We identify three distinct bottlenecks. First, perceptual-state construction and interpretation present a challenge, as agents struggle to integrate fragmented glimpses. Second, agents often stop exploring before they see the full sequence. Third, models often fail to revise early, incorrect beliefs even when faced with subsequent contradictory evidence. These results show that simply acquiring visual evidence is not enough. Agents must also be able to build and update a reliable perceptual state.
Read the full abstract

All authors Vernon Toh, Navonil Majumder, Zhengyuan Liu, Nancy F. Chen, Soujanya Poria

Systems and Control

Semi-Autonomous Prosthesis Control Empowered by 5G and Mobile Edge Computing

Prosthetic hands equipped with cameras can use computer vision to plan grasps automatically, reducing cognitive effort. However, running modern vision models on wearable devices is impractical due to power and processing constraints. We present the first prototype of a 5G-connected mobile edge computing (MEC)-enabled semi-autonomous prosthetic hand, which streams RGB-D images to an edge server for real-time grasp planning. Thirteen able-bodied participants performed pick-and-place tasks under six conditions: manual EMG control, on-device inference, wired Ethernet connectivity, and three 5G connectivity configurations (private 20 MHz network, private 100 MHz network, and a commercial 5G link) to the server. All network-based conditions performed similarly, achieving task times around 8.6 s (34% faster than manual control), failure rates of 20-38%, and 62% lower overall workload. On-device processing performed the worst with 10.3 s task time and a 76% failure rate due to slow embedded inference (3 fps vs. 6-20 fps over the network). Network latencies remained below 180 ms for private 5G and 270 ms for commercial 5G. All 5G configurations, including bandwidth-constrained and commercially variable networks, matched wired Ethernet performance while significantly outperforming both manual control and local processing, establishing 5G edge-offloading as a practical path to deploying compute-intensive prosthesis control.
Read the full abstract

All authors Ozan Karaali, Hossam Farag, Strahinja Dosen, Cedomir Stefanovic

Algebraic Geometry

Semiorthogonal decompositions of stable $\infty$-categories

We define semiorthogonal decompositions of stable $\infty$-categories of length $n$, extending the theory of semiorthogonal decompositions presented in arXiv:2106.02873. Prior to this, we explicitly construct an equivalence of $\infty$-categories relating Waldhausen diagrams to coherent complexes in stable $\infty$-categories. This allows us to view semiorthogonal decompositions from two different perspectives, each of which has its unique advantages and disadvantages. Under mild conditions, we prove a reconstruction theorem for semiorthogonal decompositions, recovering a stable $\infty$-category as the (op)lax limit of a diagram formed by the subcategories constituting its decomposition. We apply this reconstruction in the case of Beilinson's exceptional collection, to obtain a reconstruction of $D^b(\text{Coh}(\mathbb{P}^n))$.
Read the full abstract

Materials Science

A MOF-reinforced self-foaming sponge for mechanically robust triboelectric membranes with improved resistance to humidity

Porous triboelectric materials offer significant potential for enhancing the performance of triboelectric nanogenerators, yet their practical application is limited by structural instability and humidity-induced performance degradation. In this work, a bio-derived, sustainable polyamide containing disulfide linkages was developed to enable spontaneous formation of a porous dielectric without external templating. Hydrophilic MOF fillers comprising HKUST-1 crystals are incorporated within the porous matrix to reinforce the membrane structure and regulate moisture effects. Mechanical characterization demonstrates that HKUST-1 suppresses pore collapse and improves structural robustness under repeated deformation, while analysis of stress-strain behaviour reveals the critical role of pore stability in achieving stable triboelectric output. In addition, HKUST-1 mitigates humidity-induced charge dissipation by confining water molecules within its framework, giving enhanced triboelectric output stability and reduced performance degradation under increasing relative humidity compared to the neat porous system. This work demonstrates a strategy that integrates self-foamed porous structures, sustainable polymer design, and functional filler reinforcement to engineer mechanically robust and environmentally stable triboelectric systems.
Read the full abstract

All authors Tianhuai Xu, Pavel Kulyabin, Fatih Uzun, Alejandra Sophia Lozano-Pérez, Ketan Pancholi, Amit Kumar, Jin-Chong Tan

Computers and Society

Law of Large Numbers: Accuracy as Statistical Measure for AI Compliance and Competition

The machine learning community progresses (in part) by improving the "accuracy" of its systems. The EU AI Act explicitly refers to "accuracy" as part of its compliance measures for high-risk AI systems. Are we talking about the same thing? This work presents "accuracy" as a case-study for differing requirements of social worlds, the technological machine learning community and the legal community. While competition on accuracy contributes to technological development, machine learning scholars simultaneously recognize accuracy's shortcomings regarding the usefulness and effectiveness of machine learning systems. The legal counterpart embraces the vagueness of "accuracy," leaving interpretative flexibility for technological and societal changes. At the same time, accuracy is a core element of compliance within the EU AI Act. We elaborate on five main tensions, (a) nature of accuracy, (b) notion of performance, (c) scope of validity, (d) ends, and (e) statisticalness, to show that the two communities project disparate, and sometimes contradictory, expectations on accuracy. Both legal and technical communities lack precise understanding of "accuracy" beyond the contextual boundaries of their community. The resulting frictions, \eg, based on the empirical or normative understanding of accuracy, are symptoms of an unresolved (and unresolvable) debate on what accuracy is. We constructively use the frictions to recommend baselines and interventional studies in standardization, and demand for tools to extend the validity of accuracy measurements.
Read the full abstract

Computation and Language

One note in three: a verified census of three deployed AI scribes, and the instrument that counted it

Ambient AI scribes draft clinical notes under the reassurance that a clinician signs every note. We audited three commercial AI scribes on the same 142 consultations: 565 notes from recorded UK primary-care and US ambulatory encounters plus authored scenarios. Twelve discovery passes proposed 13,678 candidate errors; the 5,898 clearing an importance filter went to an adversarial panel of two models from different families, each told to refute what it could, and 618 survived. One note in three (31.3% [27.0, 35.6]) carries a verified failure, concentrated in allergy and medication information, invented patient identity, and history written up as examination on telephone consultations that can contain none. No product was given a patient record; setting aside the two classes a record would have prefilled, invented identity and dates, the rate is 24.8% [20.8, 29.0]. One failure mode did not fit our scheme, drawn from published scribe-error taxonomies: a treatment the clinician retracts, recorded as delivered care. Two clinicians adjudicated blind, disjoint samples: a physician author upheld 20 of 21 findings (95.2% [77.3, 99.2]) and an independent clinician, not an author, 12 of 12 ([75.8, 100]); both judged every sampled refusal genuine. A failure rate depends on the instrument as much as the scribes. With model, evidence and settings fixed, the review instruction alone moves the share of candidates verified from 9.3% to 79.0%, and the reviewing family moves it too: alone at that instruction the gentler flags 54.8% of notes against 27.8%. Between 28% and 97% of sampled notes carry a failure depending on the standard. Published audits disagree among themselves by a margin instrument differences alone can produce: omission is 54-86% of their errors against our 23.1%. We release all 618 findings with transcript-side evidence, every prompt and model version, and the re-runnable pipeline.
Read the full abstract

All authors Sebastian Fox, Luke Markham, Ryan Lail, Michael Karotsieris

Computation and Language

LLM Judges Verify Presence, Not Absence: Omission Blindness in AI Clinical Notes and What Recovers It

Ambient AI scribes draft clinical notes, and published audits find their dominant error is omission: information the encounter established that the note fails to record. The standard check is an LLM judge: a second model reads the note against the transcript and flags problems. We ask whether judges detect omissions. Public corpora cannot supply the answer key: their clinician reference notes and transcripts are materially discrepant. Our benchmark has 500 single-error note pairs from audited fact sheets, 298 with a named fact certainly absent and 202 added-or-altered controls. Across eight judge designs, paired discrimination (the flawed note below its clean twin, 0.5 a coin flip) reads 0.79-0.94 on added or altered content and 0.50-0.63 on omissions. On single notes, no design flags omissions reliably more often than perfect notes. Wording changes, voting and GEPA prompt optimisation move the operating point without creating usable detection. Restructuring the task recovers it: list the facts the transcript establishes, then check the note for each. Two methods reach it independently and trade off: a per-fact pipeline, and a GEPA-evolved prompt doing the same in one call. The pipeline's flags name the missing fact and its severity at 2.7% false alarms. The single call detects more (36.9% against 24.6%, p=0.002) at 6.2% false alarms and a tenth of the cost per note. A physician author validated 70 items and, where the two routes disagree, sided with the pipeline on 10 of 10 (p=0.002). A second clinician, not an author, graded the severity rubric blind and agrees to within a grade. On real vendor notes from a companion census no benchmark threshold transfers, but the re-calibrated single call detects more than the best of the eight at half its false-alarm rate. Omissions whose fact is restated elsewhere defeat both routes. We release the benchmark, prompts and judgements.
Read the full abstract

All authors Sebastian Fox, Luke Markham, Ryan Lail, Michael Karotsieris

Astrophysics of Galaxies

ALMA CO(2-1) Gas Dynamics in NGC 315: A Multi-Method Benchmark for Supermassive Black Hole Mass Measurement

We present ALMA Cycle~7 \cotwo\ observations of the circumnuclear disk in NGC~315 at an angular resolution of $0\farcs230\times0\farcs175$, improving on past measurements and resolving the sphere of influence (SOI) of the supermassive black hole (SMBH), whose mass has previously been estimated of $M_{\rm BH}= \left(2.08^{+0.33}_{-0.15}\right) \times 10^9$~M$_\odot$ The high spatial resolution and sensitivity enable robust full-cube forward modeling of the molecular gas kinematics and a direct comparison of multiple independent gas-based dynamical modeling techniques. We apply standard Bayesian codes using both MCMC and nested sampling approaches, as well as a frequentist code to the same dataset, exploring systematic uncertainties associated with the stellar mass distribution, gas surface-brightness parameterization, and disk geometry. All methods yield consistent black hole masses, indicating that the inferred $M_{\rm BH}$ is not strongly method-dependent. Combining the ensemble of independent molecular-gas-based models, we derive an ensemble median black hole mass of $M_{\rm BH}/10^9\,\mathrm{M_\odot} = 2.02^{+0.04}_{-0.05}$(stat)$^{+0.05}_{-0.04}$(sys), where the comparable contributions to the full error budget arise from modeling systematics rather than formal fitting uncertainties. Our $M_{\rm BH}$ is consistent with the empirical $M_{\rm BH}$–$\sigma_\star$ and $M_{\rm BH}$–$L_{\rm bulge}$ scaling relations, and lies 32% below an independent stellar-dynamical measurement, a discrepancy we discuss in the context of systematic differences between gas- and stellar-based methods. NGC~315 serves as a benchmark for quantifying molecular gas-dynamical $M_{\rm BH}$ systematic uncertainties and for future cross-comparisons of gaseous and stellar dynamical approaches.
Read the full abstract

All authors Dieu D. Nguyen, Benjamin D. Boizelle, Hai N. Ngo, Elena Gallo, Tuan N. Le, Sabine Thater, Tien H. T. Ho, Tinh Q. T. Le, Que T. Le, Sam Norcross, Xueyi Li, Huy G. Tong, Nghi K. N. Le, Huy M. B. Tran

Computation and Language

Evidence-Bounded Mental Health Reasoning from Heterogeneous Speech Protocols

Computational mental health screening using multimodal speech and text has shown great promise. However, existing models often assume all clinical speech protocols carry equivalent evidentiary validity. In reality, heterogeneous protocols, from free interviews to fixed reading tasks, support fundamentally different evidence. Forcing uniform reasoning flattens these boundaries, causing models to hallucinate symptoms from irrelevant text or overclaim support. Even advanced long chain-of-thought LLMs fail to resolve this issue, as free-form reasoning can exacerbate boundary violations. To address this, we reformulate multimodal screening as an evidence-bounded reasoning problem. We introduce the Evidence Package Benchmark, integrating 1,870 packages across six heterogeneous sources with explicit modality masks and evidence permissions. We further propose EviBound, a protocol-aware evidence control framework. Unlike direct LLM prompting, EviBound uses a profile-aware planner to restrict reasoning scope, orchestrates evidence tools via five-way acoustic consensus, and enforces a boundary critic to suppress unsupported claims. Empirical results show EviBound achieves a held-out test Depression AUROC of 0.8658, exceeding the strongest direct omni-modal baseline by +0.0811 AUROC while maintaining zero claim violations. Our work moves beyond unconstrained accuracy toward evidence-consistent, protocol-aware systems for safer clinical NLP research.
Read the full abstract

All authors Chengyuan Gao, Jiang Wu, Tao Lu, Jiayan Guo, Mingkun Xu, Tianyi Zang, Shangyang Li

Machine Learning

TSPFN: A Temporal Tabular Foundation Model for Physiological Time Series Classification

Designing models that generalize effectively in low- to medium-data regimes remains a primary challenge in medical machine learning, particularly for physiological time-series classification. While tabular foundation models such as TabPFN offer an attractive alternative to conventional fine-tuning through in-context learning, they are not designed to capture the temporal dependencies inherent to physiological signals. ~In this paper, we introduce TSPFN, a foundation model that redesigns TabPFN's architecture for time series data. TSPFN integrates structured temporal representations and positional embeddings to capture intra-sample temporal and channel dependencies. To fully leverage its spatio-temporal design, the model is pretrained on 140,000 real-world physiological time series across multiple medical domains. This yields a unified, generalizable framework capable of learning the specificities of medical time series. Experiments across diverse physiological benchmarks demonstrate that TSPFN consistently outperforms standard tabular baselines and TabPFN, and achieves superior cross-domain generalization compared to specialized deep time-series models. All our experiments, ablation studies, and pre-processing scheme are publicly available at https://github.com/Jeremstym/TSPFN
Read the full abstract

All authors Jérémie Stym-Popper, Clément Rambour, Federica Granese, Nicolas Thome, Olivier Bernard

Rings and Algebras

Prime ideals and representations of the bosonization of the super Jordan plane

We study the Hopf algebra $A$ given by the bosonization of the super Jordan plane over a field of characteristic not 2. We determine its centre, classical quotient ring, prime and primitive ideals. Over an algebraically closed base field, we classify all simple $A$-modules. In characteristic zero, simple modules are either finite-dimensional, of dimension 1 or 2, or infinite-dimensional, arising from a localization of the first Weyl algebra. Over an algebraically closed field of characteristic $p>2$, every simple module is finite-dimensional, of dimension 1, 2, or $2p$, and we give explicit representatives for all isomorphism classes. Our approach relies on realizing a suitable localization of $A$ as a matrix algebra.
Read the full abstract

Quantum Physics

Protected Logical Qudits in Kitaev Quantum Double Models via Stable Representations

Fault-tolerant quantum computation requires robust protection of encoded quantum information. In this work, we develop a representation-theoretic framework for constructing protected logical qudits in finite-group Kitaev quantum double models. By introducing $\varepsilon$-stable irreducible representations, we establish a necessary and sufficient existence criterion and derive ribbon–projector commutation relations that yield a $d$-dimensional protected logical subspace. We apply this construction to symmetric and alternating groups, obtaining logical qubits for $S_n$ ($n\ge 3$) and a logical qutrit for $A_4$. Moreover, the family $(\mathbb Z_2)^d\rtimes\mathbb Z_d$ realizes protected logical qudits of arbitrary dimension $d\ge 2$. Finally, for $D(A_4)$, we describe a scheme for universal logical qutrit computation using ribbon-based logical operations.
Read the full abstract

Fluid Dynamics

Growth of helicity in salt-finger convection in the two-dimensional three-component limit

We present an analytical investigation of the global helicity budget associated with the salt-fingering instability within the two-dimensional, three-component framework. Our analysis shows that in the region of parameter space corresponding to salt-fingering, helicity amplification occurs when the Rayleigh ratio–quantifying the relative strength of salinity to temperature gradients–exceeds a critical threshold. This finding provides a possible theoretical explanation for the spontaneous emergence of helicity, observed in recent numerical simulations.
Read the full abstract

Machine Learning

Language-Informed Flow Matching for Trend-Guided Structure-Based 3D Molecular Generation

Structure-based drug design (SBDD) requires ligands that satisfy both 3D target affinity and 1D chemical validity. Existing controllable generation methods often rely on task-specific fine-tuning or externally imposed sampling-time guidance, adding cost and potentially conflicting with evolving 3D geometric constraints. We propose LiFT, a language-informed cross-modal framework built on Flow Matching for trend-guided 3D molecular generation across both de novo design and scaffold hopping. LiFT uses a "Sense-Evolve-Assemble" agent to generate target-aware SMILES as intermediate chemical conditions, from which a pre-trained chemical foundation model extracts continuous semantic priors. These priors are integrated into geometric generation through a lightweight semantic projector with zero-initialized adaptive normalization for stable cross-modal conditioning. We further introduce a Self-Conditioned Decoupled Router (SCDR), which modulates the velocity field according to intermediate structural states during ODE integration. Experiments on Cross-Docked2020 show that LiFT achieves competitive distribution matching while improving medicinal chemistry metrics and maintaining competitive structural validity under task-steering settings without additional generator fine-tuning. Our results suggest that language-derived chemical priors provide effective trend-level guidance for 3D molecular generation. Code and released artifacts are available at https://github.com/kasurl/LiFT.
Read the full abstract

All authors Tianyu Gao, Zhikai Su, Jiashu Li, Wenjun Gao, Zichuan Ying, Zhe Zhao, Fei Zhang, Ye Wei

Differential Geometry

Stability of gravitational instantons with a bounded Killing vector field

We prove that a complete ALF Ricci-flat 4-manifold carrying a bounded Killing vector field is linearly stable if and only if it is locally hyperkähler. This applies uniformly to all known examples and in particular proves the instability of all of the metrics recently found by Li-Sun. The argument is based on infinitesimal Einstein-Maxwell deformations of the Ricci-flat metric associated with the Killing field. A separate simpler identity proves the instability of nonflat static Ricci-flat 4-metrics which include the static axisymmetric smooth Riemannian Myers/Korotkin-Nicolai metrics. To our knowledge, this proves the equivalence between linear stability and special holonomy and (anti-)selfduality for all known families of Ricci-flat 4-manifolds. In higher dimensions, for generalizations of AF manifolds, we show that stability forces the universal cover to split a line. This gives explicit destabilizing tensors on the Riemannian Myers-Perry instantons and the Riemannian Schwarzschild-Tangherlini metrics in all dimensions.
Read the full abstract

Human-Computer Interaction

Augmenting Interviewer Judgments of Patient Experience with Automatic Language Analysis

Understanding how psychiatric patients subjectively experienced a clinical conversation is important for feedback and alliance-related process monitoring. While interviewers form post-session judgments about patient experience, these judgments do not always match patients' self-reports. Automatic approaches for predicting perceived interaction quality from conversation have been proposed, but it remains unclear whether such approaches can complement human judgment rather than simply replicate it. To address this gap, we evaluate a clinician-support framework in which post-session interviewer ratings are combined with automatic language-based predictions to estimate patient-reported interaction quality in free clinical interviews. We assess this integration across multiple standard model types, including Ridge, SVR, MLP, GRU, and BiLSTM, all trained on sentence embeddings extracted from dyadic transcripts of 107 free conversations between psychiatric patients and interviewers. Our results show that combining interviewer judgments with model predictions through simple averaging yields the strongest overall performance. The interviewer-only baseline reached a Pearson correlation of 0.365. Among fully automatic models, Ridge achieved the strongest Pearson correlation (r = 0.286), while BiLSTM achieved r = 0.270. The strongest result was obtained by BiLSTM interviewer integration (r = 0.403). Our findings suggest that automatic language analysis and interviewer judgment capture complementary aspects of patient experience and that their combination provides a more accurate approximation of the patient's own report than either source alone.
Read the full abstract

All authors Aowen Shi, Michal Balazia, Danilo Postin, René Hurlemann, Jan Alexandersson, François Brémond, Philipp Müller

Systems and Control

From Prompt to Prototype: Towards a Frontier LLM Driven RF Engineering Workflow

Agentic coding environments give a frontier large language model (LLM) direct access to a workstation's terminal, file system, and software. This work demonstrates they extend to professional RF hardware design: an active GNSS L1-band antenna - a circularly polarized patch, surface acoustic wave (SAW) prefilter, and two-stage low-noise amplifier (LNA) on one printed circuit board (PCB) - was designed, optimized, and made manufacturing-ready. The LLM agent autonomously operated CST Studio Suite, Keysight ADS, and KiCad via scripting interfaces. Engineer input was limited to the specification, trade-off decisions, and design reviews. Workflow, results, and the RF engineer's evolving role are discussed.
Read the full abstract

All authors Markus Heinrichs, Oscar Moschner, Simon Tewes, Volker Wienstroer, Aydin Sezgin, Rainer Kronberger

Computer Vision

From Intent to Evidence: Policy-Steered Multi-Strategy Retrieval for Long-Video Agents

Existing long-video agents acquire evidence through one uniform behavior, ignoring whether the required evidence is concentrated, requires broad occurrence coverage, or must discriminate competing hypotheses—which can cause failure before substantive reasoning begins. Prescribing a fine-grained solution procedure for every question is not a satisfactory remedy, as it restricts autonomous exploration. We propose VESTA, a training-free long-video agent organized as a route-conditioned acquire–verify–consolidate loop. Before exploration, an intent router infers an evidence-acquisition policy—focused, recall, or contrastive retrieval over a shared visual–speech scene index—together with an evidence-accounting policy that configures the evidence view maintained during exploration. Policy-steered retrieval yields provisional references that multimodal evidence operations convert into observations, while the Reasoner remains free to verify them, re-query using intermediate findings, or inspect regions outside the retrieved set. A temporal evidence ledger consolidates observations into an adaptive, compressed view of temporal location, provenance, coverage, conflicts, verification outcomes, and hypothesis support, exposing missing and unresolved evidence to guide subsequent acquisition; finalization prioritizes verified observations. On Video-MME-v2, VESTA improves average accuracy by 2.7 points over VideoARM and gains across all six reported metrics. On LongVideoBench, EgoSchema, and LVBench under shared query-time models, it improves by 6.9 points on the LongVideoBench long subset and 1.5 on LVBench, and matches VideoARM on EgoSchema.
Read the full abstract

All authors Can Zhang, Baofeng Zhang, Xiaotian Han, Junyuan Shang, Yuchen Ding, Shuohuan Wang, Dianhai Yu, Ruirui Li

Hardware Architecture

Storage-Centric System Designs for Enabling Fast, Efficient, and Low-Cost Genomic and Metagenomic Analyses

Genomic and metagenomic analyses play critical roles in many fields, such as precision medicine, urgent clinical settings, discovering early warnings of communicable diseases, ensuring food safety through pathogen monitoring, agriculture, and scientific discovery. Due to the challenges of analyzing and storing massive volumes of genomic and metagenomic sequence data, significant efforts have been made to accelerate (meta)genomic analyses and store sequence data compressed. Despite the benefits of these techniques, we identify two major outstanding problems in accessing stored sequence data and supplying it to the analysis units: (i) the data movement bottleneck due to moving large amounts of low-reuse data from storage and the unnecessary burden on the rest of the system, and (ii) the data preparation bottleneck, where compressed sequence data needs to be first decompressed and formatted before analysis. In this dissertation, we present customized storage-centric systems, which efficiently (i) analyze (meta)genomic data inside the storage system, and (ii) enable highly-compressed storage and high-performance access of large-scale sequence data, thereby alleviating the overheads of data movement, computation, and data preparation. We demonstrate that the proposed systems significantly improve system performance, energy efficiency, and system cost-efficiency of (meta)genomic analysis. We hope that the storage-centric systems proposed in this dissertation facilitate the broader adoption of (meta)genomic analyses and inspire future research to fundamentally improve the performance, energy efficiency, and cost-effectiveness of other data-intensive application domains related to health and life sciences.
Read the full abstract

Graphics

Domain-Varying 2D Green' s Functions for Cage-based Deformation

In this work, we propose a novel theoretical view of cage-based deformation based on domain-varying Green' s functions and treat this domain as a new control space for the deformation effects. Harmonic Coordinates (HC) and Green Coordinates (GC) are classic methods in cage-based deformation and serve as the theoretical foundation for shape editing in a range of practical deformation tools. Our method revisits these two classical approaches. Specifically, we propose a framework based on Green' s functions across diverse domains (independent of the cage-enclosed domain) to unify these two techniques. To our knowledge, this represents the first such attempt in nearly two decades. Based on this perspective, we propose a novel cage-based deformation technique that introduces a new control space and utilizes domain-varying Green' s functions to yield varying deformation effects. Our method also establishes a continuous transition of effects from HC to GC as the Green' s function domain $\Theta$ expands from the cage region $\Omega$ to the entire $\mathbb{R}^2$. We call our method Domain-Varying Green Coordinates (DVGC). When $\Theta$ is a disk or a rectangle, the Green' s function possesses analytic or semi-analytic expressions, respectively, enabling the DVGC to be computed without finite element discretization. Furthermore, when $\Theta$ is a disk, the DVGC admit a closed-form expression for 2D simplicial cages, thereby eliminating the need for numerical integration. Experiments demonstrate that our method provides a novel control space ranging from more consistent with the cage to more shape-preserving, generating diverse deformation effects by varying the Green' s function domains.
Read the full abstract

Robotics

DARP: A Calibrated Dual-Arm RGB-D-IR Dataset for Multi-View Robotic Perception

Robotic perception from a single viewpoint is often limited by self-occlusion and incomplete surface visibility. This paper presents DARP(Dual-Arm Robotic Perception) https://doi.org/10.21227/rmv3-be47, a calibrated dual-arm RGB-D-IR dataset for object-centered robotic perception using two independently moving eye-in-hand manipulators positioned on opposite sides of a shared tabletop workspace. Each arm carries an Intel RealSense sensor that continuously records RGB, depth, and stereo infrared data while synchronized robot joint states are logged for pose recovery. Objects are placed without fixed poses or marked locations, and the acquisition procedure performs automatic localization, cross-arm confirmation, adaptive viewpoint generation, and continuous multimodal recording. DARP contains ten unique tabletop objects and preserves the original sensor recordings, robot-state logs, object-level metadata, and calibration information required to reconstruct camera trajectories in a shared metric frame. To evaluate the geometric consistency of the acquisition, we implement a deterministic multi-view fusion pipeline that converts calibrated RGB-D observations into complementary partial point clouds and measured surface meshes without using learned or generative completion methods. Evaluation on 224 held-out RGB-D keyframes comprising 1,563,466 three-dimensional query points yields a median point-to-mesh distance of 2.13~mm and an RMSE of 4.04~mm, with 96.56% of points within 10~mm of the measured-surface mesh. DARP is intended as a reusable resource for multi-view reconstruction, collaborative robotic perception, multimodal fusion, active perception, and future learning-based reasoning over partial object observations.
Read the full abstract

All authors Manish Kansana, Mohammed Yusuf Mujawar, Sudip Mittal, Shahram Rahimi, Noorbakhsh Amiri Golilarz